Preface. </font><br>Acknowledgments. </font><br>Introduction. </font><br></font><br>1. Containers. </font><br></font><br>Item 1: Choose your containers with care. </font><br>Item 2: Beware the illusion of container-independent code. </font><br>Item 3: Make copying cheap and correct for objects in containers. </font><br>Item 4: Call empty instead of checking size against zero. </font><br>Item 5: Prefer range member functions to their single-element counterparts. </font><br>Item 6: Be alert for C++'s most vexing parse. </font><br>Item 7: When using containers of newed pointers, remember to delete the pointers before the container is destroyed. </font><br>Item 8: Never create containers of auto_ptrs. </font><br>Item 9: Choose carefully among erasing options. </font><br>Item 10: Be aware of allocator conventions and restrictions. </font><br>Item 11: Understand the legitimate uses of custom allocators. </font><br>Item 12: Have realistic expectations about the thread safety of STL containers. </font><br></font><br></font><br>2. Vector and string. </font><br></font><br>Item 13: Prefer vector and string to dynamically allocated arrays. </font><br>Item 14: Use reserve to avoid unnecessary reallocations. </font><br>Item 15: Be aware of variations in string implementations. </font><br>Item 16: Know how to pass vector and string data to legacy APIs. </font><br>Item 17: Use "the swap trick" to trim excess capacity. </font><br>Item 18: Avoid using vector. </font><br></font><br></font><br>3. Associative Containers. </font><br></font><br>Item 19: Understand the difference between equality and equivalence. </font><br>Item 20: Specify comparison types for associative containers of pointers. </font><br>Item 21: Always have comparison functions return false for equal values. </font><br>Item 22: Avoid in-place key modification in set and multiset. </font><br>Item 23: Consider replacing associative containers with sorted vectors. </font><br>Item 24: Prefer map::insert to map::operator when efficiency is a concern. </font><br>Item 25: Familiarize yourself with the nonstandard hashed containers. </font><br></font><br></font><br>4. Iterators. </font><br></font><br>Item 26: Prefer iterator to const_iterator, reverse_iterator, and const_reverse_iterator. </font><br>Item 27: Use distance and advance to convert const_iterators to iterators. </font><br>Item 28: Understand how to use a reverse_iterator's base iterator. </font><br>Item 29: Consider istreambuf_iterators for character by character input. </font><br></font><br></font><br>5. Algorithms. </font><br></font><br>Item 30: Make sure destination ranges are big enough. </font><br>Item 31: Know your sorting options. </font><br>Item 32: Follow remove-like algorithms by erase if you really want to remove something. </font><br>Item 33: Be wary of remove-like algorithms on containers of pointers. </font><br>Item 34: Note which algorithms expect sorted ranges. </font><br>Item 35: Implement simple case-insensitive string comparisons via mismatch or lexicographical_compare. </font><br>Item 36: Use not1 and remove_copy_if to perform a copy_if. </font><br>Item 37: Use accumulate or for_each to summarize sequences. </font><br></font><br></font><br>6. Functors, Functor Classes, Functions, etc. </font><br></font><br>Item 38: Design functor classes for pass-by-value. </font><br>Item 39: Make predicates pure functions. </font><br>Item 40: Make functor classes adaptable. </font><br>Item 41: Understand the reasons for ptr_fun, mem_fun, and mem_fun_ref. </font><br>Item 42: Make sure less means operator<. </font><br></font><br></font><br>7. Programming with the STL. </font><br></font><br>Item 43: Prefer algorithm calls to hand-written loops. </font><br>Item 44: Prefer member functions to algorithms with the same names. </font><br>Item 45: Distinguish among count, find, binary_search, lower_bound, upper_bound, and equal_range. </font><br>Item 46: Consider function objects instead of functions as algorithm parameters. </font><br>Item 47: Avoid producing write-only code. </font><br>Item 48: Always #include the proper headers. </font><br>Item 49: Learn to decipher STL-related compiler diagnostics. </font><br>Item 50: Familiarize yourself with STL-related web sites</font><br></font><br>Bibliography</font><br></font><br>Appendix A:Locales and Case-Insensitive String Comparisons</font><br></font><br>Appendix B:Remarks on Microsoft's STL Platforms</font><br></font><br>Index