作者:
[美]
Scott Meyers 出版社: Addison-Wesley Professional 副标题: 50 Specific Ways to Improve Your Use of the Standard Template Library 译者:
-
/
- 出版年: 2001-6-16 页数: 288 定价: USD 54.99 装帧: Paperback 丛书:Addison-Wesley Professional Computing Series ISBN: 9780201749625
To avoid resource leaks
when you have containers of pointers that should be deleted, you must either replace
the pointers with smart reference-counting pointer objects (such as Boost's shared_ptr)
or you must manually delete each pointer in the container before the container is
destroyed. (查看原文)
好书，深入浅出，学习STL必读 查漏补缺，用STL还不熟练，加油！加油！这是一本好书，配合STL的源码一起阅读。我最近还是多看看别人写的代码，学习别人的思维模式。ps, 这本书适合对STL理解深入，《C++ Primer Plus》还是没有仔细讨论STL。pps,看的英文版本的，中文版本字都重叠起来了lol
重点： item 1, 5, 9, 14, 18, 24, 28, 31 Item 5. Prefer range member functions to their single-element counterparts. Item 9. eg: container.erase(remove(c.begin(), c.end(), target), c.end()); (1) To eliminate all objects in a container that have a particular ...
(展开)
* If you need to perform a full sort on a vector, string, deque, or array, you can use sort or stable_sort. * If you have a vector, string, deque, or array and you need to put only the top n elements in order, partial_sort is available. * If you have a vector, string, deque, or array and you need to identify the element at position n or you need to identify the top n elements without putting th...
2015-11-22 16:23
* If you need to perform a full sort on a vector, string, deque, or array, you can use sort or stable_sort.
* If you have a vector, string, deque, or array and you need to put only the top n elements in order, partial_sort is available.
* If you have a vector, string, deque, or array and you need to identify the element at position n or you need to identify the top n elements without putting them in order. nth_element is at your beck and call.
* If you need to separate the elements of a standard sequence container or an array into those that do and do not satisfy some criterion, you're probably looking for partition or stable_partition.
* If your data is in a list, you can use partition and stable_partition directly, and you can use list-sort in place of sort and stable_sort. If you need the effects offered by partial_sort or nth_element, you'll have to approach the task indirectly, but there are a number of options, as I sketched above.引自 Item31.了解各种与排序有关的选择
advance(i, distance<ConstIter>(i, ci)); It's as efficient as the iterators allow it to be. For random access iterators (such as those sported by vector,string, and deque), it's a constant-time operation. For bidirectional iterators (i.e., those for all other standard containers and for some implementations of the hashed containers (see Item 25)), it's a linear-time operation.
2015-11-22 15:47
advance(i, distance<ConstIter>(i, ci));
It's as efficient as the iterators allow it to be. For random access iterators (such as those sported by vector,string, and deque), it's a constant-time operation. For bidirectional iterators (i.e., those for all other standard containers and for some implementations of the hashed containers (see Item 25)), it's a linear-time operation.引自 item27.使用distance和advance将容器的const_iterator转换成iterator
in map: If you're updating an existing map element, operator[] is preferable, but if you're adding a new element, insert has the edge.
2015-11-17 22:41
in map:
If you're updating an existing map element, operator[] is preferable, but if you're adding a new element, insert has the edge.引自 Item24.当效率至关重要时，请在map:operator[]与map:insert之间谨慎做出选择
That's why it makes sense to consider using a sorted vector instead of an associative container only when you know that your data structure is used in such a way that lookups are almost never mixed with insertions and erasures.
2015-11-17 21:11
That's why it makes sense to consider using a sorted vector instead of an associative container only when you know that your data structure is used in such a way that lookups are almost never mixed with insertions and erasures.引自 Item23.考虑用排序的vector替代关联容器
To avoid resource leaks when you have containers of pointers that should be deleted, you must either replace the pointers with smart reference-counting pointer objects (such as Boost's shared_ptr) or you must manually delete each pointer in the container before the container is destroyed.
2015-11-15 20:34
To avoid resource leaks
when you have containers of pointers that should be deleted, you must either replace
the pointers with smart reference-counting pointer objects (such as Boost's shared_ptr)
or you must manually delete each pointer in the container before the container is
destroyed.引自 Item 7.如果容器中包含了通过new创建的指针，切记在容器对象析构前将指针delete掉
1.the erase-remove idiom is the best way to get rid of elements with a specific value when c is a vector, string, or deque. vector<int> c; //...... c.erase( remove(c.begin(), c.end(), 1963), c.end());delete all 1963 elements 2.the remove member function is the best way to get rid of elements with a specific value when c is a list. list<int> c; //...... c. remove(1963);delete all 196...
2015-11-15 21:06
1.the erase-remove idiom is the best way to get rid of elements with a specific value when c is a vector, string, or deque.引自 Item9.慎重选择删除元素的方法
vector<int> c;
//......
c.erase( remove(c.begin(), c.end(), 1963), c.end());delete all 1963 elements
2.the remove member function is the best way to get rid of elements with a specific value when c is a list.引自 Item9.慎重选择删除元素的方法
list<int> c;
//......
c. remove(1963);delete all 1963 elements
* If you need to perform a full sort on a vector, string, deque, or array, you can use sort or stable_sort. * If you have a vector, string, deque, or array and you need to put only the top n elements in order, partial_sort is available. * If you have a vector, string, deque, or array and you need to identify the element at position n or you need to identify the top n elements without putting th...
2015-11-22 16:23
* If you need to perform a full sort on a vector, string, deque, or array, you can use sort or stable_sort.
* If you have a vector, string, deque, or array and you need to put only the top n elements in order, partial_sort is available.
* If you have a vector, string, deque, or array and you need to identify the element at position n or you need to identify the top n elements without putting them in order. nth_element is at your beck and call.
* If you need to separate the elements of a standard sequence container or an array into those that do and do not satisfy some criterion, you're probably looking for partition or stable_partition.
* If your data is in a list, you can use partition and stable_partition directly, and you can use list-sort in place of sort and stable_sort. If you need the effects offered by partial_sort or nth_element, you'll have to approach the task indirectly, but there are a number of options, as I sketched above.引自 Item31.了解各种与排序有关的选择
advance(i, distance<ConstIter>(i, ci)); It's as efficient as the iterators allow it to be. For random access iterators (such as those sported by vector,string, and deque), it's a constant-time operation. For bidirectional iterators (i.e., those for all other standard containers and for some implementations of the hashed containers (see Item 25)), it's a linear-time operation.
2015-11-22 15:47
advance(i, distance<ConstIter>(i, ci));
It's as efficient as the iterators allow it to be. For random access iterators (such as those sported by vector,string, and deque), it's a constant-time operation. For bidirectional iterators (i.e., those for all other standard containers and for some implementations of the hashed containers (see Item 25)), it's a linear-time operation.引自 item27.使用distance和advance将容器的const_iterator转换成iterator
in map: If you're updating an existing map element, operator[] is preferable, but if you're adding a new element, insert has the edge.
2015-11-17 22:41
in map:
If you're updating an existing map element, operator[] is preferable, but if you're adding a new element, insert has the edge.引自 Item24.当效率至关重要时，请在map:operator[]与map:insert之间谨慎做出选择
That's why it makes sense to consider using a sorted vector instead of an associative container only when you know that your data structure is used in such a way that lookups are almost never mixed with insertions and erasures.
2015-11-17 21:11
That's why it makes sense to consider using a sorted vector instead of an associative container only when you know that your data structure is used in such a way that lookups are almost never mixed with insertions and erasures.引自 Item23.考虑用排序的vector替代关联容器
小李飞刀
清华大学出版社2006版
大盗贼
清华大学出版社2006版
王很水
清华大学出版社2006版
LV8
电子工业出版社2013版
0 有用 阿诺 2006-02-18
stl是好东东
0 有用 小李 2012-02-21
Effective系列一脉相承，简约而不简单。
0 有用 邻家の低端码农 2013-10-21
某些Items还是很靠谱的。
0 有用 流星云 2015-11-08
相见恨晚
0 有用 散关清渭 2019-07-23
虽然有点儿老了 但是依旧是好书 对我这种C++ Beginner 很有意义
0 有用 kkkkk 2019-11-17
读之前常常自嘲自己不会cpp，只会c with STL。读完发现其实我对STL一无所知😂
0 有用 Ethanity 2020-01-01
2019年的最后一本technical。读了（以及在读）effective系列的其他三本 这本提供的惊喜最少。首先是内容太老 C++11及之后的STL更新对cpp编程的影响还是显著的 meyers该更新书的内容了。其次另三本effective告诉你“原来该这么做” C++STL则是“原来有这个” 各种TMP眼花缭乱。这本相对就平庸了些 也可能是我STL用的不够细致。
0 有用 散关清渭 2019-07-23
虽然有点儿老了 但是依旧是好书 对我这种C++ Beginner 很有意义
0 有用 女王公园的八神 2019-02-19
好书，深入浅出，学习STL必读 查漏补缺，用STL还不熟练，加油！加油！这是一本好书，配合STL的源码一起阅读。我最近还是多看看别人写的代码，学习别人的思维模式。ps, 这本书适合对STL理解深入，《C++ Primer Plus》还是没有仔细讨论STL。pps,看的英文版本的，中文版本字都重叠起来了lol
0 有用 raminloavo 2018-10-07
On my way to master C++ !!!!