diff --git a/doc/ref/Reference/erase_all.html b/doc/ref/Reference/erase_all.html deleted file mode 100644 index ceb8f67..0000000 --- a/doc/ref/Reference/erase_all.html +++ /dev/null @@ -1,62 +0,0 @@ - -
-
-template< - typename Sequence - , typename T - > -struct erase_all -{ - typedef implementation-defined type; -}; --
-
-[to do] -
-
-
-#include "boost/mpl/erase_all.hpp" --
-
Parameter | Requirement | Description | Default argument |
---|---|---|---|
Param | A model of Concept | [to do] | [to do] |
-
Member | Description |
---|---|
type | [to do] |
-
-[to do] -
-
-
-[to do] --
-
-Algorithms, erase
, erase_if
, erase_range
-
-
-template< - typename Sequence - , typename Predicate - > -struct erase_if -{ - typedef implementation-defined type; -}; --
-
-[to do] -
-
-
-#include "boost/mpl/erase_if.hpp" --
-
Parameter | Requirement | Description | Default argument |
---|---|---|---|
Param | A model of Concept | [to do] | [to do] |
-
Member | Description |
---|---|
type | [to do] |
-
-[to do] -
-
-
-[to do] --
-
-Algorithms, erase_all
, erase_if
, erase_range
-
-
-template< - typename Sequence - , typename State - , typename BackwardOp - , typename ForwardOp = _1 - > -struct iter_fold_backward -{ - typedef unspecified type; -}; --
-
-Returns the result of the successive application of binary BackwardOp
to the result of the previous BackwardOp
invocation (State
if it's the first call) and each iterator in the range [begin<Sequence>::type,end<Sequence>::type)
in the reverse order. If ForwardOp
is provided, then it's applied on forward traversal to form the result which is passed to the first BackwardOp
call.
-
-
-
-#include "boost/mpl/iter_fold_backward.hpp" --
-
Parameter | Requirement | Description | Default value |
---|---|---|---|
Sequence | A model of Sequence | A sequence to iterate. | |
State | A type | The initial state for the first BackwardOp /ForwardOp application. | |
BackwardOp | A model of [Lambda Function] | The operation to be executed on backward traversal. | |
ForwardOp | A model of [Lambda Function] | The operation to be executed on forward traversal. | arg<1> |
-
-
Expression | Expression type | Precondition | Semantics | Postcondition |
---|---|---|---|---|
typedef iter_fold_backward< Sequence,T,BackwardOp >::type t; | A type | Equivalent to typedef lambda<BackwardOp>::type bk_op; typedef begin<Sequence>::type i1; typedef i1::next i2; ...; typedef in::next last; typedef apply<bk_op,T,in>::type tn; typedef apply<bk_op,tn,in-1>::type tn-1; ...; typedef apply<bk_op,t2,i1>::type t1; typedef t1 t , where n == size<Sequence>::type::value and last is identical to end<Sequence>::type ; Equivalent to typedef T t; if the sequence is empty. | ||
typedef iter_fold_backward< Sequence,T,BackwardOp,ForwardOp >::type t; | A type | Equivalent to typedef iter_fold_backward<Sequence, iter_fold<Sequence,State,ForwardOp>::type, BackwardOp>::type t; . |
-
-Linear. Exactly size<Sequence>::type::value
applications of BackwardOp
and ForwardOp
.
-
-
-Finds an iterator to the last negative element in the sequence. -
-
-typedef list_c<int,5,-1,0,7,2,0,-5,4> numbers; -typedef iter_fold_backward< - numbers - , end<numbers>::type - , if_< less< deref<_2>, int_c<0> >,_2,_1 > - >::type last_negative_iter; ---BOOST_STATIC_ASSERT(last_negative_iter::type::value == -5); -
-
-Algorithms, iter_fold
, fold_backward
, fold
, copy
, copy_backward
-
-
-template< - typename F1 - , typename F2 - , typename F3 = true_c - ... - , typename Fn = true_c - > -struct logical_and -{ - typedef unspecified type; -}; --
-
-Returns the result of short-circuit logical and (&&
) operation on its arguments.
-
-
-
-#include "boost/mpl/logical/and.hpp" --
-
Parameter | Requirement | Description |
---|---|---|
F1, F2, .., Fn | A model of nullary Metafunction |
-
-
Expression | Precondition | Semantics | Postcondition |
---|---|---|---|
typedef logical_and<f1,f2,..,fn>::type c; | Returns false_c if either of f1::type::value, f2::type::value, .., fn::type::value expressions evaluates to false , and true_c otherwise; guarantees left-to-right evaluation; moreover, the operands subsequent to the first fi metafunction that evaluates to false are not evaluated. |
-
-
-// will generate compile-time error if invoked with T == any fundamental type -template< typename T > struct fail -{ - typedef typename T::nonexistent type; -}; ---BOOST_STATIC_ASSERT((logical_and< true_c,false_c >::type::value == false)); -BOOST_STATIC_ASSERT((logical_and< false_c,fail<int> >::type::value == false)); // ok, fail<int> is never invoked -BOOST_STATIC_ASSERT((logical_and< true_c,false_c,fail<int> >::type::value == false)); // ok too -
-
-Metafunctions, logical_or
, logical_not
-
-
-template< - typename F - > -struct logical_not -{ - typedef unspecified type; -}; --
-
-Returns the result of logical not (!
) operation on its argument.
-
-
-
-#include "boost/mpl/logical/not.hpp" --
-
Parameter | Requirement | Description |
---|---|---|
F | A model of nullary Metafunction |
-
-
Expression | Expression type | Precondition | Semantics | Postcondition |
---|---|---|---|---|
typedef logical_not<f>::type c; | A model of bool Integral Constant | Equivalent to typedef bool_c<(!f::type::value)> c; |
-
-
-BOOST_STATIC_ASSERT(logical_not<true_c>::type::value == false); -BOOST_STATIC_ASSERT(logical_not<false_c>::type::value == true); --
-
-Metafunctions, logical_and
, logical_or
-
-
-template< - typename F1 - , typename F2 - , typename F3 = false_c - ... - , typename Fn = false_c - > -struct logical_or -{ - typedef unspecified type; -}; --
-
-Returns the result of short-circuit logical or (||
) operation on its arguments.
-
-
-
-#include "boost/mpl/logical/or.hpp" --
-
Parameter | Requirement | Description |
---|---|---|
F1, F2, .., Fn | A model of nullary Metafunction |
-
-
Expression | Expression type | Precondition | Semantics | Postcondition |
---|---|---|---|---|
typedef logical_or<f1,f2,..,fn>::type c; | A model of bool Integral Constant | Returns true_c if either of f1::type::value, f2::type::value, .., fn::type::value expressions evaluates to true, and false_c otherwise; guarantees left-to-right evaluation; moreover, the operands subsequent to the first fi metafunction that evaluates to true are not evaluated. |
-
-
-// will generate compile-time error if invoked with T == any fundamental type -template< typename T > struct fail -{ - typedef typename T::nonexistent type; -}; ---BOOST_STATIC_ASSERT((logical_or< false_c,true_c >::type::value == true)); -BOOST_STATIC_ASSERT((logical_or< true_c,fail<int> >::type::value == true)); // ok, fail<int> is never invoked -BOOST_STATIC_ASSERT((logical_or< false_c,true_c,fail<int> >::type::value == true)); // ok too -
-
-Metafunctions, logical_and
, logical_not
-
-
-template< - typename T - > -struct next -{ - typedef implementation-defined type; -}; --
-
-[to do] -
-
-
-#include "boost/mpl/next.hpp" --
-
Parameter | Requirement | Description | Default argument |
---|---|---|---|
Param | A model of Concept | [to do] | [to do] |
-
Member | Description |
---|---|
type | [to do] |
-
-[to do] -
-
-
-[to do] --
-
-Algorithms, prior
-
-
-template< - typename T - > -struct prior -{ - typedef implementation-defined type; -}; --
-
-[to do] -
-
-
-#include "boost/mpl/prior.hpp" --
-
Parameter | Requirement | Description | Default argument |
---|---|---|---|
Param | A model of Concept | [to do] | [to do] |
-
Member | Description |
---|---|
type | [to do] |
-
-[to do] -
-
-
-[to do] --
-
-Algorithms, next
-
-
-template< - typename Sequence - , typename Compare = less<_1,_2> - > -struct sort -{ - typedef implementation-defined type; -}; --
-
-[to do] -
-
-
-#include "boost/mpl/sort.hpp" --
-
Parameter | Requirement | Description | Default argument |
---|---|---|---|
Param | A model of Concept | [to do] | [to do] |
-
Member | Description |
---|---|
type | [to do] |
-
-[to do] -
-
-
-[to do] --
-
-Algorithms, lower_bound
, upper_bound
-
-
-template< - typename Sequence - , typename Predicate = is_same<_1,_2> - > -struct unique -{ - typedef implementation-defined type; -}; --
-
-[to do] -
-
-
-#include "boost/mpl/unique.hpp" --
-
Parameter | Requirement | Description | Default argument |
---|---|---|---|
Param | A model of Concept | [to do] | [to do] |
-
Member | Description |
---|---|
type | [to do] |
-
-[to do] -
-
-
-[to do] --
-
-Algorithms, erase
, erase_if
-