Boost.Range

Terminology and style guidelines

The use of a consistent terminologi is as important for iterator Ranges and ExternalRange-based algorithms as it is for iterators and iterator-based algorithms. If a conventional set of names are adopted, we can avoid misunderstandings and write generic function prototypes that are self-documenting.

Since iterator ranges are characterized by a specific underlying iterator type, we get a type of iterator range for each type of iterator. Hence we can speak of the following types of iterator ranges:

Range
ReversibleRange
Value access category:
- ReadableRange
- WriteableRange
- SwappableRange
- LvalueRange
Traversal category:
- IncrementableRange
- SinglePassRange
- ForwardRange
- BidirectionalRange
- RandomAccessRange

Notice how we have used the categories from the new style iterators.

Notice that an interator (and therefore an iterator range) has one traversal property and one or more properties from the value access category. So in reality we will mostly talk about mixtures such as

RandomAccessReadableWriteableRange
ForwardLvalueRange

By convention, we should always specify the travelsal property first as done above. This seems resonable since there will only be one traversal property, but perhaps many value acccess properties.

As an example, consider how we specify the interface of std::sort(). The iterator-based version looks like this:

   template< class RandomAccessTraversalReadableWritableIterator >
   void sort( RandomAccessTraversalReadableWritableIterator first,
              RandomAccessTraversalReadableWritableIterator last );

For iterator ranges the interface becomes

   template< class RandomAccessReadableWritableRange >
   void sort( RandomAccessReadableWritableRange& r );