#include <set_mt.h>
Public Member Functions | |
| void | lock () |
| Lock container access. | |
| void | unlock () |
| Unock container access. | |
| vector_set_mt (Allocator const &a=Allocator()) | |
| vector_set_mt (size_type n, const T &x=T(), Allocator const &a=Allocator()) | |
| vector_set_mt (const std_vector &a) | |
| vector_set_mt & | operator= (const std_vector &a) |
| vector_set_mt & | operator= (const vector_set_mt &a) |
| ::std::pair< iterator, bool > | insert (const T &x) |
| void | insert (iterator pos, const T &x) |
| void | insert (iterator i1, iterator i2) |
| size_type | erase (const T &x) |
| void | erase (iterator __position) |
| void | erase (iterator __first, iterator __last) |
| void | clear () |
| size_type | count (const T &x) const |
| const_iterator | lower_bound (const T &x) const |
| iterator | lower_bound (const T &x) |
| const_iterator | upper_bound (const T &x) const |
| iterator | upper_bound (const T &x) |
| ::std::pair< const_iterator, const_iterator > | equal_range (const T &x) const |
| ::std::pair< iterator, iterator > | equal_range (const T &x) |
| const_iterator | find (const T &x) const |
| iterator | find (const T &x) |
| bool | has (const T &x) const |
| tl.vector_set_mt< T, Allocator >.vector_set_mt | ( | Allocator const & | a = Allocator() |
) |
| tl.vector_set_mt< T, Allocator >.vector_set_mt | ( | size_type | n, | |
| const T & | x = T(), |
|||
| Allocator const & | a = Allocator() | |||
| ) |
| tl.vector_set_mt< T, Allocator >.vector_set_mt | ( | const std_vector & | a | ) |
| void tl.vector_set_mt< T, Allocator >.lock | ( | ) |
Lock container access.
Use it before accessing iterators.
| void tl.vector_set_mt< T, Allocator >.unlock | ( | ) |
Unock container access.
| vector_set_mt& tl.vector_set_mt< T, Allocator >.operator= | ( | const std_vector & | a | ) |
| vector_set_mt& tl.vector_set_mt< T, Allocator >.operator= | ( | const vector_set_mt< T, Allocator > & | a | ) |
| ::std::pair<iterator, bool> tl.vector_set_mt< T, Allocator >.insert | ( | const T & | x | ) |
| void tl.vector_set_mt< T, Allocator >.insert | ( | iterator | pos, | |
| const T & | x | |||
| ) |
| void tl.vector_set_mt< T, Allocator >.insert | ( | iterator | i1, | |
| iterator | i2 | |||
| ) |
| size_type tl.vector_set_mt< T, Allocator >.erase | ( | const T & | x | ) |
| void tl.vector_set_mt< T, Allocator >.erase | ( | iterator | __position | ) |
| void tl.vector_set_mt< T, Allocator >.erase | ( | iterator | __first, | |
| iterator | __last | |||
| ) |
| void tl.vector_set_mt< T, Allocator >.clear | ( | ) |
| size_type tl.vector_set_mt< T, Allocator >.count | ( | const T & | x | ) | const |
| const_iterator tl.vector_set_mt< T, Allocator >.lower_bound | ( | const T & | x | ) | const |
| iterator tl.vector_set_mt< T, Allocator >.lower_bound | ( | const T & | x | ) |
| const_iterator tl.vector_set_mt< T, Allocator >.upper_bound | ( | const T & | x | ) | const |
| iterator tl.vector_set_mt< T, Allocator >.upper_bound | ( | const T & | x | ) |
| ::std::pair<const_iterator, const_iterator> tl.vector_set_mt< T, Allocator >.equal_range | ( | const T & | x | ) | const |
| ::std::pair<iterator, iterator> tl.vector_set_mt< T, Allocator >.equal_range | ( | const T & | x | ) |
| const_iterator tl.vector_set_mt< T, Allocator >.find | ( | const T & | x | ) | const |
| iterator tl.vector_set_mt< T, Allocator >.find | ( | const T & | x | ) |
| bool tl.vector_set_mt< T, Allocator >.has | ( | const T & | x | ) | const |
Genereated on Tue Mar 11 19:25:43 2008 by Doxygen.
(c) Copyright 2005, 2008 The Apache Software Foundation or its licensors, as applicable.