|
libbmb
Modern implementation of STL
|
#include <cstddef>#include "utils/concepts.h"#include "utils/move.h"#include "utils/type_traits.h"Go to the source code of this file.
Namespaces | |
| namespace | bmb |
| namespace | bmb::detail |
Concepts | |
| concept | bmb::InputIterator |
| InputIterator. | |
| concept | bmb::OutputIterator |
| OutputIterator. | |
| concept | bmb::ForwardIterator |
| ForwardIterator. | |
| concept | bmb::BidirectionalIterator |
| BidirectionalIterator. | |
| concept | bmb::RandomAccessIterator |
| RandomAccessIterator. | |
| concept | bmb::ContiguousIterator |
| ContiguousIterator. | |
Functions | |
| template<InputIterator Iter> | |
| auto | bmb::distance (Iter first, Iter last) -> IteratorTraits< Iter >::difference_type |
| Returns the number of elements in [first, last). | |
| template<InputIterator Iter, typename Distance > | |
| void | bmb::advance (Iter &it, Distance dist) |
| Increments given iterator by dist. | |
| template<InputIterator Iter> | |
| Iter | bmb::next (Iter it, typename IteratorTraits< Iter >::difference_type n=1) |
| Returns the n-th successor of given iterator. | |
| template<BidirectionalIterator Iter> | |
| Iter | bmb::prev (Iter it, typename IteratorTraits< Iter >::difference_type n=1) |
| Returns the n-th predecessor of given iterator. If n < 0, will chose n-th successor. | |
Provides iterator tags, concepts, and iterator adaptors