STL Containers

We will cover the following recipes in this chapter:

• Using the erase-remove idiom on std::vector
• Deleting items from an unsorted std::vector in O(1) time
• Accessing std::vector instances the fast or the safe way
• Keeping std::vector instances sorted
• Inserting items efficiently and conditionally into std::map
• Knowing the new insertion hint semantics of std::map::insert
  
• Efficiently modifying the keys of std::map items
• Using std::unordered_map with custom types
• Filtering duplicates from user input and printing them in alphabetical order with std::set
• Implementing a simple RPN calculator with std::stack
• Implementing a word frequency counter with std::map
• Implementing a writing style helper tool for finding very long sentences in texts with std::set
• Implementing a personal to-do list using std::priority_queue