Boost C++ Libraries

...one of the most highly regarded and expertly designed C++ library projects in the world. Herb Sutter and Andrei Alexandrescu, C++ Coding Standards

The MPL Reference Manual: Random Access Sequence
Front Page / Sequences / Concepts / Random Access Sequence

Random Access Sequence

Description

A Random Access Sequence is a Bidirectional Sequence whose iterators model Random Access Iterator. A random access sequence guarantees amortized constant time access to an arbitrary sequence element.

Expression requirements

In addition to the requirements defined in Bidirectional Sequence, for any Random Access Sequence s the following must be met:

Expression Type Complexity
begin<s>::type Random Access Iterator Amortized constant time
end<s>::type Random Access Iterator Amortized constant time
at<s,n>::type Any type Amortized constant time

Expression semantics

Semantics of an expression is defined only where it differs from, or is not defined in Bidirectional Sequence.

Expression Semantics
at<s,n>::type The nth element from the beginning of the sequence; see at.