std__map.3

Free C++ Standard Library

.TH std::map 3 "13 Sep 1999" "FREE_C++_STANDARD_LIBRARY" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::map \- 
.SH SYNOPSIS
.br
.PP
.SS Public Members

.in +1c
.ti -1c
.RI "typedef Key \fBkey_type\fR"
.br
.ti -1c
.RI "typedef T \fBmapped_type\fR"
.br
.ti -1c
.RI "typedef pair<const Key, T> \fBvalue_type\fR"
.br
.ti -1c
.RI "typedef Compare \fBkey_compare\fR"
.br
.ti -1c
.RI "typedef Allocator \fBallocator_type\fR"
.br
.ti -1c
.RI "typedef Allocator::reference \fBreference\fR"
.br
.ti -1c
.RI "typedef Allocator::const_reference \fBconst_reference\fR"
.br
.ti -1c
.RI "typedef implementation defined \fBiterator\fR"
.br
.ti -1c
.RI "typedef implementation defined \fBconst_iterator\fR"
.br
.ti -1c
.RI "typedef Allocator::size_type \fBsize_type\fR"
.br
.ti -1c
.RI "typedef Allocator::difference_type \fBdifference_type\fR"
.br
.ti -1c
.RI "typedef Allocator::pointer \fBpointer\fR"
.br
.ti -1c
.RI "typedef Allocator::const_pointer \fBconst_pointer\fR"
.br
.ti -1c
.RI "typedef std::reverse_iterator<iterator> \fBreverse_iterator\fR"
.br
.ti -1c
.RI "typedef std::reverse_iterator<const_iterator> \fBconst_reverse_iterator\fR"
.br
.ti -1c
.RI "explicit \fBmap\fR (const Compare& comp = Compare(), const Allocator& = Allocator())"
.br
.ti -1c
.RI "template<class InputIterator> \fBmap\fR<InputIterator> (InputIterator first, InputIterator last, const Compare& comp = Compare(), const Allocator& = Allocator())"
.br
.ti -1c
.RI "\fBmap\fR (const map<Key,T,Compare,Allocator>& x)"
.br
.ti -1c
.RI "\fB~map\fR ()"
.br
.ti -1c
.RI "map<Key,T,Compare,Allocator>& \fBoperator=\fR (const map<Key,T,Compare,Allocator>& x)"
.br
.ti -1c
.RI "\fBiterator\fR \fBbegin\fR ()"
.br
.ti -1c
.RI "\fBconst_iterator\fR \fBbegin\fR () const"
.br
.ti -1c
.RI "\fBiterator\fR \fBend\fR ()"
.br
.ti -1c
.RI "\fBconst_iterator\fR \fBend\fR () const"
.br
.ti -1c
.RI "\fBreverse_iterator\fR \fBrbegin\fR ()"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fR \fBrbegin\fR () const"
.br
.ti -1c
.RI "\fBreverse_iterator\fR \fBrend\fR ()"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fR \fBrend\fR () const"
.br
.ti -1c
.RI "bool \fBempty\fR () const"
.br
.ti -1c
.RI "\fBsize_type\fR \fBsize\fR () const"
.br
.ti -1c
.RI "\fBsize_type\fR \fBmax_size\fR () const"
.br
.ti -1c
.RI "\fBreference\fR \fBoperator[]\fR (const \fBkey_type\fR &x)"
.br
.ti -1c
.RI "pair<iterator, bool> \fBinsert\fR (const \fBvalue_type\fR &x)"
.br
.ti -1c
.RI "\fBiterator\fR \fBinsert\fR (\fBiterator\fR position, const \fBvalue_type\fR &x)"
.br
.ti -1c
.RI "template<class InputIterator> void \fBinsert\fR<InputIterator> (InputIterator first, InputIterator last)"
.br
.ti -1c
.RI "void \fBerase\fR (\fBiterator\fR position)"
.br
.ti -1c
.RI "\fBsize_type\fR \fBerase\fR (const \fBkey_type\fR &x)"
.br
.ti -1c
.RI "void \fBerase\fR (\fBiterator\fR first, \fBiterator\fR last)"
.br
.ti -1c
.RI "void \fBswap\fR (map<Key,T,Compare,Allocator>&)"
.br
.ti -1c
.RI "void \fBclear\fR ()"
.br
.ti -1c
.RI "\fBkey_compare\fR \fBkey_comp\fR () const"
.br
.ti -1c
.RI "\fBvalue_compare\fR \fBvalue_comp\fR () const"
.br
.ti -1c
.RI "\fBiterator\fR \fBfind\fR (const \fBkey_type\fR& x)"
.br
.ti -1c
.RI "\fBconst_iterator\fR \fBfind\fR (const \fBkey_type\fR& x) const"
.br
.ti -1c
.RI "\fBsize_type\fR \fBcount\fR (const \fBkey_type\fR& x) const"
.br
.ti -1c
.RI "\fBiterator\fR \fBlower_bound\fR (const \fBkey_type\fR& x)"
.br
.ti -1c
.RI "\fBconst_iterator\fR \fBlower_bound\fR (const \fBkey_type\fR& x) const"
.br
.ti -1c
.RI "\fBiterator\fR \fBupper_bound\fR (const \fBkey_type\fR& x)"
.br
.ti -1c
.RI "\fBconst_iterator\fR \fBupper_bound\fR (const \fBkey_type\fR& x) const"
.br
.ti -1c
.RI "pair<iterator,iterator> \fBequal_range\fR (const \fBkey_type\fR& x)"
.br
.ti -1c
.RI "pair<const_iterator,const_iterator> \fBequal_range\fR (const \fBkey_type\fR& x) const"
.br
.in -1c
.SH MEMBER TYPEDEF DOCUMENTATION
.PP 
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef Key std::map<Key, T, Compare, Allocator>::key_type
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef T std::map<Key, T, Compare, Allocator>::mapped_type
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef pair<const Key, T> std::map<Key, T, Compare, Allocator>::value_type
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef Compare std::map<Key, T, Compare, Allocator>::key_compare
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef Allocator std::map<Key, T, Compare, Allocator>::allocator_type
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef Allocator::reference std::map<Key, T, Compare, Allocator>::reference
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef Allocator::const_reference std::map<Key, T, Compare, Allocator>::const_reference
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef implementation defined std::map<Key, T, Compare, Allocator>::iterator
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef implementation defined std::map<Key, T, Compare, Allocator>::const_iterator
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef Allocator::size_type std::map<Key, T, Compare, Allocator>::size_type
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef Allocator::difference_type std::map<Key, T, Compare, Allocator>::difference_type
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef Allocator::pointer std::map<Key, T, Compare, Allocator>::pointer
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef Allocator::const_pointer std::map<Key, T, Compare, Allocator>::const_pointer
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef std::reverse_iterator<iterator> std::map<Key, T, Compare, Allocator>::reverse_iterator
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> typedef std::reverse_iterator<const_iterator> std::map<Key, T, Compare, Allocator>::const_reverse_iterator
.PP
.SH MEMBER FUNCTION DOCUMENTATION
.PP 
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> explicit std::map<Key, T, Compare, Allocator>::map<Key, T, Compare, Allocator> (const Compare & comp = Compare(), const Allocator & = Allocator())
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>>  template<class InputIterator> std::map<Key, T, Compare, Allocator>::map<Key, T, Compare, Allocator> (InputIterator first, InputIterator last, const Compare & comp = Compare(), const Allocator & = Allocator())
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> std::map<Key, T, Compare, Allocator>::map<Key, T, Compare, Allocator> (const map<Key,T,Compare,Allocator>& x)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> std::map<Key, T, Compare, Allocator>::~map<Key, T, Compare, Allocator> ()
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> map<Key,T,Compare,Allocator>& std::map<Key, T, Compare, Allocator>::operator= (const map<Key,T,Compare,Allocator>& x)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBiterator\fR std::map<Key, T, Compare, Allocator>::begin ()
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBconst_iterator\fR std::map<Key, T, Compare, Allocator>::begin () const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBiterator\fR std::map<Key, T, Compare, Allocator>::end ()
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBconst_iterator\fR std::map<Key, T, Compare, Allocator>::end () const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBreverse_iterator\fR std::map<Key, T, Compare, Allocator>::rbegin ()
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBconst_reverse_iterator\fR std::map<Key, T, Compare, Allocator>::rbegin () const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBreverse_iterator\fR std::map<Key, T, Compare, Allocator>::rend ()
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBconst_reverse_iterator\fR std::map<Key, T, Compare, Allocator>::rend () const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> bool std::map<Key, T, Compare, Allocator>::empty () const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBsize_type\fR std::map<Key, T, Compare, Allocator>::size () const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBsize_type\fR std::map<Key, T, Compare, Allocator>::max_size () const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBreference\fR std::map<Key, T, Compare, Allocator>::operator[] (const \fBkey_type\fR & x)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> pair<iterator, bool> std::map<Key, T, Compare, Allocator>::insert (const \fBvalue_type\fR & x)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBiterator\fR std::map<Key, T, Compare, Allocator>::insert (\fBiterator\fR position, const \fBvalue_type\fR & x)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>>  template<class InputIterator> void std::map<Key, T, Compare, Allocator>::insert (InputIterator first, InputIterator last)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> void std::map<Key, T, Compare, Allocator>::erase (\fBiterator\fR position)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBsize_type\fR std::map<Key, T, Compare, Allocator>::erase (const \fBkey_type\fR & x)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> void std::map<Key, T, Compare, Allocator>::erase (\fBiterator\fR first, \fBiterator\fR last)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> void std::map<Key, T, Compare, Allocator>::swap (map<Key,T,Compare,Allocator>&)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> void std::map<Key, T, Compare, Allocator>::clear ()
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBkey_compare\fR std::map<Key, T, Compare, Allocator>::key_comp () const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBvalue_compare\fR std::map<Key, T, Compare, Allocator>::value_comp () const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBiterator\fR std::map<Key, T, Compare, Allocator>::find (const \fBkey_type\fR & x)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBconst_iterator\fR std::map<Key, T, Compare, Allocator>::find (const \fBkey_type\fR & x) const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBsize_type\fR std::map<Key, T, Compare, Allocator>::count (const \fBkey_type\fR & x) const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBiterator\fR std::map<Key, T, Compare, Allocator>::lower_bound (const \fBkey_type\fR & x)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBconst_iterator\fR std::map<Key, T, Compare, Allocator>::lower_bound (const \fBkey_type\fR & x) const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBiterator\fR std::map<Key, T, Compare, Allocator>::upper_bound (const \fBkey_type\fR & x)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> \fBconst_iterator\fR std::map<Key, T, Compare, Allocator>::upper_bound (const \fBkey_type\fR & x) const
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> pair<iterator,iterator> std::map<Key, T, Compare, Allocator>::equal_range (const \fBkey_type\fR & x)
.PP
.SS template<class Key, class T, class Compare = less<Key>, class Allocator = allocator<T>> pair<const_iterator,const_iterator> std::map<Key, T, Compare, Allocator>::equal_range (const \fBkey_type\fR & x) const
.PP


.SH AUTHOR
.PP 
Generated automatically by Doxygen for FREE_C++_STANDARD_LIBRARY from the source code.