...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
Synopsis Complexities |
interval |
interval |
element |
element |
---|---|---|---|---|
|
O(1) |
O(1) |
O(1) |
O(1) |
|
O(1) |
O(1) |
O(1) |
O(1) |
|
O(1) |
O(1) |
O(1) |
O(1) |
|
O(1) |
O(1) |
O(1) |
O(1) |
|
O(log n) |
O(log n) |
O(log n) |
O(log n) |
|
O(log n) |
O(log n) |
O(log n) |
O(log n) |
|
O(log n) |
O(log n) |
O(log n) |
O(log n) |
Iterator related |
|
---|---|
iterator T::begin() const_iterator T::begin()const
|
Returns an iterator to the first value of the container. |
iterator T::end() const_iterator T::end()const
|
Returns an iterator to a position |
reverse_iterator T::rbegin() const_reverse_iterator T::rbegin()const
|
Returns a reverse iterator to the last value of the container. |
reverse_iterator T::rend() const_reverse_iterator T::rend()const
|
Returns a reverse iterator to a position |
iterator T::lower_bound(const key_type& k) const_iterator T::lower_bound(const key_type& key)const
|
Returns an iterator that points to the first element |
iterator T::upper_bound(const key_type&) const_iterator T::upper_bound(const key_type&)const
|
Returns an iterator that points to the first element |
pair<iterator,iterator> T::equal_range(const key_type& key) pair<const_iterator,const_iterator> T::equal_range(const key_type& key)const
|
Returns a range
For interval containers |
See also . . .
Back to section . . .
Copyright © 2007 -2010 Joachim Faulhaber Copyright © 1999 -2006 Cortex Software GmbH Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) |