diff --git a/doc/index.html b/doc/index.html index 05ea5b9..3b9fc7e 100644 --- a/doc/index.html +++ b/doc/index.html @@ -1,6 +1,9 @@ + + +
diff --git a/doc/refmanual.html b/doc/refmanual.html index ee8cd57..313cf6d 100644 --- a/doc/refmanual.html +++ b/doc/refmanual.html @@ -1,6 +1,9 @@ + + + diff --git a/doc/refmanual/accumulate.html b/doc/refmanual/accumulate.html index 2975322..3e83a14 100644 --- a/doc/refmanual/accumulate.html +++ b/doc/refmanual/accumulate.html @@ -1,6 +1,9 @@ + + + diff --git a/doc/refmanual/acknowledgements.html b/doc/refmanual/acknowledgements.html index eb3dda2..6fd30bc 100644 --- a/doc/refmanual/acknowledgements.html +++ b/doc/refmanual/acknowledgements.html @@ -1,6 +1,9 @@ + + + diff --git a/doc/refmanual/advance.html b/doc/refmanual/advance.html index 02c8823..ef26635 100644 --- a/doc/refmanual/advance.html +++ b/doc/refmanual/advance.html @@ -1,6 +1,9 @@ + + + diff --git a/doc/refmanual/algorithms-concepts.html b/doc/refmanual/algorithms-concepts.html index 17c73fe..f1c95fa 100644 --- a/doc/refmanual/algorithms-concepts.html +++ b/doc/refmanual/algorithms-concepts.html @@ -1,6 +1,9 @@ + + + diff --git a/doc/refmanual/algorithms.html b/doc/refmanual/algorithms.html index 121f45d..e87c335 100644 --- a/doc/refmanual/algorithms.html +++ b/doc/refmanual/algorithms.html @@ -1,6 +1,9 @@ + + + @@ -43,13 +46,14 @@ transformation algorithm provides a revers allowing for a wider range of efficient transformations — a common functionality documented by the Reversible Algorithm concept. - ++ | Front Page / Algorithms / Runtime Algorithms / for_each | +
+template< + typename Sequence + , typename F + > +void for_each( F f ); + +template< + typename Sequence + , typename TransformOp + , typename F + > +void for_each( F f ); ++
for_each is a family of overloaded function templates:
++#include <boost/mpl/for_each.hpp> ++
Parameter | +Requirement | +Description | +
---|---|---|
Sequence | +Forward Sequence | +A sequence to iterate. | +
TransformOp | +Lambda Expression | +A transformation. | +
f | +An unary function object | +A runtime operation to apply. | +
For any Forward Sequence s, Lambda Expression op , and an +unary function object f:
++for_each<s>( f ); ++
Return type: | void | +
---|---|
Postcondition: | Equivalent to ++typedef begin<Sequence>::type i1; +value_initialized< deref<i1>::type > x1; +f(boost::get(x1)); + +typedef next<i1>::type i2; +value_initialized< deref<i2>::type > x2; +f(boost::get(x2)); +... +value_initialized< deref<in>::type > xn; +f(boost::get(xn)); +typedef next<in>::type last; ++ where n == size<s>::value and last is identical to +end<s>::type; no effect if empty<s>::value == true. + |
+
+for_each<s,op>( f ); ++
Return type: | void | +
---|---|
Postcondition: | Equivalent to ++for_each< tranform_view<s,op> >( f ); ++ |
+
Linear. Exactly size<s>::value applications of op and f.
++ |
+ | Front Page / Algorithms / Runtime Algorithms | +
+ |