text cover

Data Abstraction and Problem Solving with C++

Walls and Mirrors

by Frank M. Carrano

Addison Wesley Logo

c11p634.h

Go to the documentation of this file.
00001 
00014 template <typename Key, typename T, typename Compare = less<Key> >
00015 class map
00016 {
00017 public:
00022    explicit map(const Compare& cmp = Compare());
00023 
00031    template <typename InputIter>
00032    map(InputIter first, InputIter last,
00033        const Compare& comp = Compare());
00034 
00040    bool empty() const;
00041 
00047    size_type size() const;
00048 
00053    size_type max_size() const;
00054 
00062    Iter insert(Iter i, const value_type& e);
00063 
00070    Iter erase(Iter i)
00071 
00072   
00075    void erase(Iter first, Iter last);
00076 
00083    Iter find(const key_value& e) const;
00084 
00090    size_type count(const key_type& k);
00091 
00097    Iter lower_bound(const key_type& k) const;
00098 
00104    Iter upper_bound(const key_type& k) const;
00105 
00110    void swap(map<Key, T, Compare>& m);
00111 
00117    Iter begin();
00118 
00123    Iter end();
00124 
00125 }; // end std::map

Generated on Sun Aug 27 22:03:18 2006 for AWLogo by  doxygen 1.4.6