Commit e276dac

authored

book: re-compose words to avoid out of pdf's margin (#229)

1 parent aca2d37 commit e276dacCopy full SHA for e276dac

File tree

-2

lines changed

-2

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -118,7 +118,7 @@ And select the appropriate location to insert into the container. When traversin`
`118`	`118`	The elements in the unordered container are not sorted, and the internals is implemented by the Hash table. The average complexity of inserting and searching for elements is `O(constant)`,
`119`	`119`	`Significant performance gains can be achieved without concern for the order of the elements inside the container.`
`120`	`120`
`121`		-C++11 introduces two sets of unordered containers: `std::unordered_map`/`std::unordered_multimap` and
	`121`	+C++11 introduces two unordered containers: `std::unordered_map`/`std::unordered_multimap` and
`122`	`122`	`std::unordered_set`/`std::unordered_multiset`.
`123`	`123`
`124`	`124`	Their usage is basically similar to the original `std::map`/`std::multimap`/`std::set`/`set::multiset`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -115,7 +115,7 @@ std::sort(arr.begin(), arr.end());`
`115`	`115`	而无序容器中的元素是不进行排序的,内部通过 Hash 表实现,插入和搜索元素的平均复杂度为 `O(constant)`,
`116`	`116`	`在不关心容器内部元素顺序时,能够获得显著的性能提升。`
`117`	`117`
`118`		-C++11 引入了两组无序容器:`std::unordered_map`/`std::unordered_multimap` 和
	`118`	+C++11 引入了的两组无序容器分别是:`std::unordered_map`/`std::unordered_multimap` 和
`119`	`119`	`std::unordered_set`/`std::unordered_multiset`。
`120`	`120`
`121`	`121`	它们的用法和原有的 `std::map`/`std::multimap`/`std::set`/`set::multiset` 基本类似,

Comments

(0)