ruihuank的博客

always have comparison functions return false for equal values

algorithm & hand-written

sort

delete the pointers

difference between equality and equivalence

replacing associative container with sorted vector

count & find & binary_search & lower_bound & upper_bound & equal_range

mismatch & lexicographical_compare

accumulate(numeric) &for_each

function objects

avoid producing write-only code

locales and case-insensitive string comparisons

compiler diagnostics

insertvector<int> v;v.reserve(5);// 1 2 3 4 5 for (int i = 1; i <= 5; ++i) { v.push_back(i);}// 1 2 3(ri) 4(i) 5vector<int>::reverse_iterator ri = find(v.rbegin(), b.ren...

istreambuf_iterators for charactor-by-charactor input

Specify comparison types for associative containers of pointers

pass vector and string data to legacy APIs

use "the swap trick" to trim excess capacity

avoid using vector<bool>

To eliminate all objects in a container that have a particular value:contiguous-memory container(vector, deque, or staing)c.erase(remove(c.begin(), c.eng(), 1963), c.end());listc.remove(19...

avoid in-place key modification in set and multiset

algorithms expected sorted ranges

choose between map::operator[] and map::insert.

make predicate pure functions

ptr_fun & unary_function & binary_function & bind1st &bind2nd

vexing parse

Use distance and advance to convert a container's const_iterators to iterators.

mem_fun & mem_fun_ref