![]() |
Home | Libraries | People | FAQ | More |
A Bidirectional Sequence is a Forward Sequence whose iterators model Bidirectional Iterator.
Notation
sA Bidirectional Sequence
SA Bidirectional Sequence type
oAn arbitrary object
eA Sequence element
In addition to the requirements defined in Forward Sequence, for any Bidirectional Sequence the following must be met:
|
Expression |
Return type |
Type Requirements |
Runtime Complexity |
|---|---|---|---|
|
|
Constant |
||
|
|
Constant |
||
|
|
Any type |
Constant |
|
|
|
Any type |
|
Constant |
|
Expression |
Compile Time Complexity |
|---|---|
|
|
Amortized constant time |
|
|
Amortized constant time |
|
|
Amortized constant time |
The semantics of an expression are defined only where they differ from, or are not defined in Forward Sequence.
std::pair
boost::array
vector
map
reverse_view
single_view
iterator_range
(where adapted sequence is a Bidirectional Sequence)
transform_view
(where adapted sequence is a Bidirectional Sequence)
zip_view
(where adapted sequences are models of Bidirectional Sequence)