The library have been under way for a long time. Dietmar Kühl originally intended
to submit an
template which had most of the functionality present now, but only for arrays
and standard containers.
Meanwhile work on algorithms for containers in various contexts showed the need for handling pairs of iterators, and string libraries needed special treatment of character arrays. In the end it made sense to formalize the minimal requirements of these similar concepts. And the results are the Range concepts found in this library.
The term Range was adopted because of paragraph 24.1/7 from the C++ standard:
Most of the library's algorithmic templates that operate on data structures have interfaces that use ranges. A range is a pair of iterators that designate the beginning and end of the computation. A range [i, i) is an empty range; in general, a range [i, j) refers to the elements in the data structure starting with the one pointed to by i and up to but not including the one pointed to by j. Range [i, j) is valid if and only if j is reachable from i. The result of the application of functions in the library to invalid ranges is undefined.
Special thanks goes to
The concept checks and their documentation was provided by Daniel Walker.
This version introduced Range Adaptors and Range Algorithms. This version 2 is the result of a merge of all of the RangeEx features into Boost.Range.
There were an enormous number of very significant contributors through all stages of this library.
The people in the following list all made contributions in the form of reviews, user feedback, design suggestions, or defect detection:
Regardless of how I write this section it will never truly fairly capture the gratitude that I feel to all who have contributed. Thank you everyone.