feedc0de/boost_range
1
0
Fork 0
forked from boostorg/range
Code Pull Requests Activity

fixes broken one from trunk ... still not finished

Browse Source 
[SVN r40520]
This commit is contained in:
Thorsten Jørgen Ottosen
2007-10-28 10:11:10 +00:00
parent 3f98d69c94
commit 00e70244a5
1 changed files with 10 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
include/boost/range/concepts.hpp
View File

@ -60,7 +60,8 @@ namespace boost {
struct SinglePassRangeConcept { struct SinglePassRangeConcept {
typedef typename range_value<T>::type range_value; typedef typename range_value<T>::type range_value;
typedef typename range_iterator<T>::type range_iterator; typedef typename range_iterator<T>::type range_iterator;
typedef typename range_const_iterator<T>::type range_const_iterator; //typedef typename range_iterator<const T>::type range_const_iterator;
void constraints() void constraints()
{ {
function_requires< function_requires<
@ -80,7 +81,6 @@ namespace boost {
} }
T a; T a;
range_iterator i; range_iterator i;
range_const_iterator ci;
bool b; bool b;
}; };
@ -88,7 +88,6 @@ namespace boost {
template<typename T> template<typename T>
struct ForwardRangeConcept { struct ForwardRangeConcept {
typedef typename range_difference<T>::type range_difference; typedef typename range_difference<T>::type range_difference;
typedef typename range_size<T>::type range_size;
void constraints() void constraints()
{ {
function_requires< function_requires<
@ -99,17 +98,13 @@ namespace boost {
typename range_iterator<T>::type typename range_iterator<T>::type
> >
>(); >();
s = boost::size(a);
} }
T a;
range_size s;
}; };
//! Check if a type T models the BidirectionalRange range concept. //! Check if a type T models the BidirectionalRange range concept.
template<typename T> template<typename T>
struct BidirectionalRangeConcept { struct BidirectionalRangeConcept {
typedef typename range_reverse_iterator<T>::type range_reverse_iterator; typedef typename range_reverse_iterator<T>::type range_reverse_iterator;
typedef typename range_const_reverse_iterator<T>::type range_const_reverse_iterator;
void constraints() void constraints()
{ {
function_requires< function_requires<
@ -131,12 +126,13 @@ namespace boost {
} }
T a; T a;
range_reverse_iterator i; range_reverse_iterator i;
range_const_reverse_iterator ci;
}; };
//! Check if a type T models the RandomAccessRange range concept. //! Check if a type T models the RandomAccessRange range concept.
template<typename T> template<typename T>
struct RandomAccessRangeConcept { struct RandomAccessRangeConcept {
typedef typename range_size<T>::type range_size;
void constraints() void constraints()
{ {
function_requires< function_requires<
@ -147,7 +143,12 @@ namespace boost {
typename range_iterator<T>::type typename range_iterator<T>::type
> >
>(); >();
}
s = boost::size(a);
}
T a;
range_size s;
}; };
} // namespace boost } // namespace boost