map<Key,T>
the key_type is Key, the mapped_type is T, and the value_type is std::pair<const Key,T>.Maps support bidirectional iterators.
Definition at line 92 of file stl_map.h.
map | ( | const _Compare & | __comp, | |
const allocator_type & | __a = allocator_type() | |||
) | [inline, explicit] |
map | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
Builds a map from a range.
first | An input iterator. | |
last | An input iterator. |
map | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Compare & | __comp, | |||
const allocator_type & | __a = allocator_type() | |||
) | [inline] |
Builds a map from a range.
first | An input iterator. | |
last | An input iterator. | |
comp | A comparison functor. | |
a | An allocator object. |
mapped_type& at | ( | const key_type & | __k | ) | [inline] |
Access to map data.
k | The key for which data should be retrieved. |
std::out_of_range | If no such data is present. |
Definition at line 362 of file stl_map.h.
References std::lower_bound().
const_iterator begin | ( | ) | const [inline] |
iterator begin | ( | ) | [inline] |
void clear | ( | ) | [inline] |
Finds the number of elements with given key.
x | Key of (key, value) pairs to be located. |
bool empty | ( | ) | const [inline] |
const_iterator end | ( | ) | const [inline] |
iterator end | ( | ) | [inline] |
std::pair<const_iterator, const_iterator> equal_range | ( | const key_type & | __x | ) | const [inline] |
Finds a subsequence matching given key.
x | Key of (key, value) pairs to be located. |
std::make_pair(c.lower_bound(val), c.upper_bound(val))
This function probably only makes sense for multimaps.
Finds a subsequence matching given key.
x | Key of (key, value) pairs to be located. |
std::make_pair(c.lower_bound(val), c.upper_bound(val))
This function probably only makes sense for multimaps.
Erases a [first,last) range of elements from a map.
first | Iterator pointing to the start of the range to be erased. | |
last | Iterator pointing to the end of the range to be erased. |
Erases elements according to the provided key.
x | Key of element to be erased. |
void erase | ( | iterator | __position | ) | [inline] |
Erases an element from a map.
position | An iterator pointing to the element to be erased. |
const_iterator find | ( | const key_type & | __x | ) | const [inline] |
Tries to locate an element in a map.
x | Key of (key, value) pair to be located. |
end()
) iterator.
Tries to locate an element in a map.
x | Key of (key, value) pair to be located. |
end()
) iterator.
allocator_type get_allocator | ( | ) | const [inline] |
Get a copy of the memory allocation object.
Definition at line 233 of file stl_map.h.
References _Rb_tree::get_allocator().
void insert | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
iterator insert | ( | iterator | position, | |
const value_type & | __x | |||
) | [inline] |
Attempts to insert a std::pair into the map.
position | An iterator that serves as a hint as to where the pair should be inserted. | |
x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 for more on "hinting".
Insertion requires logarithmic time (if the hint is not taken).
std::pair<iterator,bool> insert | ( | const value_type & | __x | ) | [inline] |
Attempts to insert a std::pair into the map.
x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
Insertion requires logarithmic time.
key_compare key_comp | ( | ) | const [inline] |
const_iterator lower_bound | ( | const key_type & | __x | ) | const [inline] |
Finds the beginning of a subsequence matching given key.
x | Key of (key, value) pair to be located. |
Finds the beginning of a subsequence matching given key.
x | Key of (key, value) pair to be located. |
size_type max_size | ( | ) | const [inline] |
mapped_type& operator[] | ( | const key_type & | __k | ) | [inline] |
Subscript ( [] ) access to map data.
k | The key for which data should be retrieved. |
[] ) operator. Returns data associated with the key specified in subscript. If the key does not exist, a pair with that key is created using default values, which is then returned.Lookup requires logarithmic time.
Definition at line 340 of file stl_map.h.
References __glibcxx_function_requires, and std::lower_bound().
const_reverse_iterator rbegin | ( | ) | const [inline] |
reverse_iterator rbegin | ( | ) | [inline] |
const_reverse_iterator rend | ( | ) | const [inline] |
reverse_iterator rend | ( | ) | [inline] |
size_type size | ( | ) | const [inline] |
void swap | ( | map< _Key, _Tp, _Compare, _Alloc > & | __x | ) | [inline] |
Swaps data with another map.
x | A map of the same element and allocator types. |
Compare
type (which itself is often stateless and empty), so it should be quite fast.) Note that the global std::swap() function is specialized such that std::swap(m1,m2) will feed to this function.
Definition at line 490 of file stl_map.h.
References map::_M_t.
Referenced by std::swap().
const_iterator upper_bound | ( | const key_type & | __x | ) | const [inline] |
value_compare value_comp | ( | ) | const [inline] |