Hallo Group Members
there is one page that causes problems under w3m:
http://www.boost.org/doc/libs/1_39_0/libs/range/doc/range.html
<link href="style.css" rel="stylesheet" type="text/css"><link href="/favicon.ico" rel="icon" type="image/ico"><link href="/style/section-basic.css" rel="stylesheet" type="text/css">[boost] Boost.Range
Range concepts
<_SYMBOL TYPE=32>• Overview
<_SYMBOL TYPE=32>• Single Pass Range
<_SYMBOL TYPE=32>• Forward Range
<_SYMBOL TYPE=32>• Bidirectional Range
<_SYMBOL TYPE=32>• Random Access Range
<_SYMBOL TYPE=32>• Concept Checking
<nobr><_SYMBOL TYPE=26>━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
</nobr>
Overview
A Range is a concept similar to the STL Container concept. A Range provides iterators for accessing a half-open range
[first,one_past_last) of elements and provides information about the number of elements in the Range. However, a Range
has much fewer requirements than a Container.
The motivation for the Range concept is that there are many useful Container-like types that do not meet the full
requirements of Container, and many algorithms that can be written with this reduced set of requirements. In particular,
a Range does not necessarily
<_SYMBOL TYPE=32>• own the elements that can be accessed through it,
<_SYMBOL TYPE=32>• have copy semantics,
best regards,
Michal
