Data Abstraction and Problem Solving with C++ Walls and Mirrors by Frank M. Carrano
Text Home Text Errata	begin() : map< Key, T, Compare > City() : City cityName() : City count() : map< Key, T, Compare > empty() : priority_queue< T, Container, Compare >, map< Key, T, Compare > end() : map< Key, T, Compare > erase() : map< Key, T, Compare > find() : map< Key, T, Compare > getPopulation() : City insert() : map< Key, T, Compare > lower_bound() : map< Key, T, Compare > map() : map< Key, T, Compare > max_size() : map< Key, T, Compare > pop() : priority_queue< T, Container, Compare >, City priority_queue() : priority_queue< T, Container, Compare > push() : priority_queue< T, Container, Compare > setPopulation() : City size() : priority_queue< T, Container, Compare >, map< Key, T, Compare > swap() : map< Key, T, Compare > top() : priority_queue< T, Container, Compare > upper_bound() : map< Key, T, Compare >

---