diff --git a/doc/html/fusion/acknowledgements.html b/doc/html/fusion/acknowledgements.html index 39960553..d10ff6f0 100644 --- a/doc/html/fusion/acknowledgements.html +++ b/doc/html/fusion/acknowledgements.html @@ -42,11 +42,12 @@
- |
@@ -52,7 +52,7 @@
[13] +
[13] Fusion sequences may also be adapted as fully conforming MPL sequences (see Intrinsics). That way, we can have 2-way adaptation to and from MPL @@ -62,11 +62,12 @@
- |
@@ -41,14 +41,14 @@ #include <boost/fusion/include/array.hpp>
@@ -61,7 +61,7 @@ std::cout << at_c<2>(arr) << std::endl;
@@ -70,11 +70,12 @@
- |
@@ -41,13 +41,13 @@ #include <boost/fusion/include/boost_tuple.hpp>
@@ -56,7 +56,7 @@ std::cout << *boost::fusion::next(boost::fusion::begin(example_tuple)) << '\n';
@@ -66,11 +66,12 @@
- |
@@ -44,13 +44,13 @@ #include <boost/fusion/include/variant.hpp>
@@ -60,7 +60,7 @@ std::cout << example_variant << '\n';
@@ -69,11 +69,12 @@
- |
@@ -39,7 +39,7 @@ #include <boost/fusion/include/mpl.hpp>
@@ -77,7 +77,7 @@ std::cout << at_c<1>(v) << std::endl;
@@ -86,11 +86,12 @@
- |
@@ -41,14 +41,14 @@ #include <boost/fusion/include/std_pair.hpp>
@@ -58,7 +58,7 @@ std::cout << p << std::endl;
@@ -69,11 +69,12 @@
- |
@@ -66,7 +66,7 @@ as we want without incurring a high runtime penalty.
@@ -89,7 +89,7 @@ functions to convert back to the original sequence type.
@@ -99,11 +99,12 @@
- |
@@ -44,11 +44,12 @@
- |
- |
@@ -37,7 +37,7 @@ and the previous state.
@@ -50,7 +50,7 @@ Sequence& seq, State const& initial_state, F const& f);
Linear, exactly result_of::size<Sequence>::value applications of f.
@@ -167,7 +167,7 @@ #include <boost/fusion/include/accumulate.hpp>
@@ -188,11 +188,12 @@
- |
@@ -37,7 +37,7 @@ and the previous state.
@@ -50,7 +50,7 @@ Sequence& seq, State const& initial_state, F const& f);
Linear, exactly result_of::size<Sequence>::value applications of f.
@@ -167,7 +167,7 @@ #include <boost/fusion/include/fold.hpp>
@@ -188,11 +188,12 @@
- |
Applies a unary function object to each element of a sequence.
@@ -45,7 +45,7 @@ Sequence& seq, F const& f);
Linear, exactly result_of::size<Sequence>::value applications of f.
@@ -144,7 +144,7 @@ #include <boost/fusion/include/for_each.hpp>
@@ -164,11 +164,12 @@
- |
- |
Returns the result type of accumulate.
@@ -47,7 +47,7 @@
};
Linear, exactly result_of::size<Sequence>::value applications of F.
@@ -166,11 +166,12 @@
- |
Returns the result type of fold.
@@ -47,7 +47,7 @@
};
Linear, exactly result_of::size<Sequence>::value applications of F.
@@ -166,11 +166,12 @@
- |
@@ -48,7 +48,7 @@
};
Constant.
@@ -148,11 +148,12 @@
- |
@@ -43,11 +43,12 @@
- |
- |
@@ -37,7 +37,7 @@ element of seq.
@@ -49,7 +49,7 @@ Sequence const& seq, F f);
Linear. At most result_of::size<Sequence>::value comparisons.
@@ -148,7 +148,7 @@ #include <boost/fusion/include/all.hpp>
@@ -167,11 +167,12 @@
- |
@@ -37,7 +37,7 @@ least one element of seq.
@@ -49,7 +49,7 @@ Sequence const& seq, F f);
Linear. At most result_of::size<Sequence>::value comparisons.
@@ -148,7 +148,7 @@ #include <boost/fusion/include/any.hpp>
@@ -167,11 +167,12 @@
- |
Returns the number of elements of a given type within a sequence.
@@ -45,7 +45,7 @@ Sequence const& seq, T const& t);
Linear. At most result_of::size<Sequence>::value comparisons.
@@ -144,7 +144,7 @@ #include <boost/fusion/include/count.hpp>
@@ -154,11 +154,12 @@
- |
@@ -34,7 +34,7 @@ a given unary function object evaluates to true.
@@ -46,7 +46,7 @@ Sequence const& seq, F f);
Linear. At most result_of::size<Sequence>::value comparisons.
@@ -143,7 +143,7 @@ #include <boost/fusion/include/count_if.hpp>
@@ -153,11 +153,12 @@
- |
Finds the first element of a given type within a sequence.
@@ -50,7 +50,7 @@ unspecified find(Sequence& seq);
Linear. At most result_of::size<Sequence>::value comparisons.
@@ -148,7 +148,7 @@ #include <boost/fusion/include/find.hpp>
@@ -159,11 +159,12 @@
- |
@@ -52,7 +52,7 @@ unspecified find_if(Sequence& seq);
@@ -147,7 +147,7 @@ /algorithm/query/find_if.hpp>
@@ -158,11 +158,12 @@
- |
@@ -37,7 +37,7 @@ element of seq.
@@ -49,7 +49,7 @@ Sequence const& seq, F f);
Linear. At most result_of::size<Sequence>::value comparisons.
@@ -148,7 +148,7 @@ #include <boost/fusion/include/none.hpp>
@@ -167,11 +167,12 @@
- |
- |
A metafunction returning the result type of all.
@@ -47,7 +47,7 @@
};
Constant.
@@ -151,11 +151,12 @@
- |
A metafunction returning the result type of any.
@@ -47,7 +47,7 @@
};
Constant.
@@ -151,11 +151,12 @@
- |
@@ -34,7 +34,7 @@ given the sequence and search types.
@@ -48,7 +48,7 @@
};
Constant.
@@ -146,11 +146,12 @@
- |
@@ -34,7 +34,7 @@ given the sequence and predicate types.
@@ -48,7 +48,7 @@
};
Constant.
@@ -146,11 +146,12 @@
- |
@@ -34,7 +34,7 @@ given the sequence and search types.
@@ -48,7 +48,7 @@
};
Linear, at most result_of::size<Sequence>::value comparisons.
@@ -148,11 +148,12 @@
- |
@@ -34,7 +34,7 @@ given the sequence and predicate types.
@@ -48,7 +48,7 @@
};
Linear. At most result_of::size<Sequence>::value comparisons.
@@ -149,11 +149,12 @@
- |
A metafunction returning the result type of none.
@@ -47,7 +47,7 @@
};
Constant.
@@ -151,11 +151,12 @@
- |
@@ -56,11 +56,12 @@
- |
- |
clear returns an empty sequence.
@@ -43,7 +43,7 @@ typename result_of::clear<Sequence const>::type clear(Sequence const& seq);
Constant.
@@ -121,7 +121,7 @@ #include <boost/fusion/include/clear.hpp>
@@ -130,11 +130,12 @@
- |
@@ -34,7 +34,7 @@ those at a specified iterator, or between two iterators.
@@ -54,7 +54,7 @@ Sequence const& seq, First const& it1, Last const& it2);
Constant. Returns a view which is lazily evaluated.
@@ -187,7 +187,7 @@ #include <boost/fusion/include/erase.hpp>
@@ -198,11 +198,12 @@
- |
@@ -39,7 +39,7 @@ with a given key.
@@ -50,7 +50,7 @@ typename result_of::erase_key<Sequence const, Key>::type erase_key(Sequence const& seq);
Constant. Returns a view which is lazily evaluated.
@@ -148,7 +148,7 @@ #include <boost/fusion/include/erase_key.hpp>
@@ -157,11 +157,12 @@
- |
@@ -34,7 +34,7 @@ the elements of a specified type.
@@ -45,7 +45,7 @@ typename result_of::filter<Sequence const, T>::type filter(Sequence const& seq);
Constant. Returns a view which is lazily evaluated.
@@ -144,7 +144,7 @@ #include <boost/fusion/include/filter.hpp>
@@ -154,11 +154,12 @@
- |
@@ -35,7 +35,7 @@ Lambda Expression evaluates to boost::mpl::true_.
@@ -46,7 +46,7 @@ typename result_of::filter_if<Sequence const, Pred>::type filter_if(Sequence const& seq);
Constant. Returns a view which is lazily evaluated.
@@ -147,7 +147,7 @@ #include <boost/fusion/include/filter_if.hpp>
@@ -157,11 +157,12 @@
- |
@@ -34,7 +34,7 @@ element inserted the position described by a given iterator.
@@ -46,7 +46,7 @@ unspecified insert(Sequence const& seq, Pos const& pos, T const& t);
Constant. Returns a view which is lazily evaluated.
@@ -165,7 +165,7 @@ #include <boost/fusion/include/insert.hpp>
@@ -175,11 +175,12 @@
- |
@@ -34,7 +34,7 @@ iterator.
@@ -47,7 +47,7 @@ Sequence const& seq, Pos const& pos, Range const& range);
Constant. Returns a view which is lazily evaluated.
@@ -168,7 +168,7 @@ #include <boost/fusion/include/insert_range.hpp>
@@ -178,11 +178,12 @@
- |
@@ -34,7 +34,7 @@ first followed by the elements of the second.
@@ -44,7 +44,7 @@ typename result_of::join<LhSequence, RhSequence>::type join(LhSequence const& lhs, RhSequence const& rhs);
Constant. Returns a view which is lazily evaluated.
@@ -145,7 +145,7 @@ #include <boost/fusion/include/join.hpp>
@@ -156,11 +156,12 @@
- |
Returns a new sequence, with the last element of the original removed.
@@ -43,7 +43,7 @@ typename result_of::pop_back<Sequence const>::type pop_back(Sequence const& seq);
Constant. Returns a view which is lazily evaluated.
@@ -123,7 +123,7 @@ #include <boost/fusion/include/pop_back.hpp>
@@ -132,11 +132,12 @@
- |
Returns a new sequence, with the first element of the original removed.
@@ -43,7 +43,7 @@ typename result_of::pop_front<Sequence const>::type pop_front(Sequence const& seq);
Constant. Returns a view which is lazily evaluated.
@@ -123,7 +123,7 @@ #include <boost/fusion/include/pop_front.hpp>
@@ -132,11 +132,12 @@
- |
Returns a new sequence with an element added at the end.
@@ -45,7 +45,7 @@ Sequence const& seq, T const& t);
Constant. Returns a view which is lazily evaluated.
@@ -144,7 +144,7 @@ #include <boost/fusion/include/push_back.hpp>
@@ -153,11 +153,12 @@
- |
Returns a new sequence with an element added at the beginning.
@@ -45,7 +45,7 @@ Sequence const& seq, T const& t);
Constant. Returns a view which is lazily evaluated.
@@ -145,7 +145,7 @@ #include <boost/fusion/include/push_front.hpp>
@@ -154,11 +154,12 @@
- |
@@ -34,7 +34,7 @@ except those of a given type.
@@ -45,7 +45,7 @@ typename result_of::remove<Sequence const, T>::type replace(Sequence const& seq);
Constant. Returns a view which is lazily evaluated.
@@ -144,7 +144,7 @@ #include <boost/fusion/include/remove.hpp>
@@ -154,11 +154,12 @@
- |
@@ -34,7 +34,7 @@ those where a given unary function object evaluates to true.
@@ -45,7 +45,7 @@ typename result_of::remove_if<Sequence const, Pred>::type remove_if(Sequence const& seq);
Constant. Returns a view which is lazily evaluated.
@@ -146,7 +146,7 @@ #include <boost/fusion/include/remove_if.hpp>
@@ -156,11 +156,12 @@
- |
@@ -34,7 +34,7 @@ a new value.
@@ -46,7 +46,7 @@ Sequence const& seq, T const& old_value, T const& new_value);
Constant. Returns a view which is lazily evaluated.
@@ -166,7 +166,7 @@ #include <boost/fusion/include/replace.hpp>
@@ -175,11 +175,12 @@
- |
@@ -35,7 +35,7 @@ replaced with a new value.
@@ -47,7 +47,7 @@ Sequence const& seq, F f, T const& new_value);
Constant. Returns a view which is lazily evaluated.
@@ -166,7 +166,7 @@ #include <boost/fusion/include/replace_if.hpp>
@@ -184,11 +184,12 @@
- |
Returns a new sequence with the elements of the original in reverse order.
@@ -43,7 +43,7 @@ typename result_of::reverse<Sequence const>::type reverse(Sequence const& seq);
Constant. Returns a view which is lazily evaluated.
@@ -122,7 +122,7 @@ #include <boost/fusion/include/reverse.hpp>
@@ -131,11 +131,12 @@
- |
@@ -37,7 +37,7 @@ of seq.
Table 1.56. Parameters
+Table 1.56. Parameters
- |
@@ -34,7 +34,7 @@ of the members of the component sequences.
@@ -48,7 +48,7 @@ zip(Sequence1 const& seq1, Sequence2 const& seq2, ... SequenceN const& seqN);
Constant. Returns a view which is lazily evaluated.
@@ -132,7 +132,7 @@ #include <boost/fusion/include/zip.hpp>
@@ -143,11 +143,12 @@
- |
- |
@@ -34,7 +34,7 @@ type.
@@ -47,7 +47,7 @@
};
Constant.
@@ -124,11 +124,12 @@
- |
@@ -48,7 +48,7 @@
};
Constant.
@@ -181,11 +181,12 @@
- |
@@ -34,7 +34,7 @@ and key types.
@@ -48,7 +48,7 @@
};
Constant.
@@ -148,11 +148,12 @@
- |
@@ -34,7 +34,7 @@ and type to retain.
@@ -48,7 +48,7 @@
};
Constant.
@@ -150,11 +150,12 @@
- |
@@ -35,7 +35,7 @@ Lambda Expression predicate type.
@@ -49,7 +49,7 @@
};
Constant.
@@ -151,11 +151,12 @@
- |
@@ -34,7 +34,7 @@ position iterator and insertion types.
@@ -49,7 +49,7 @@
};
Constant.
@@ -169,11 +169,12 @@
- |
@@ -34,7 +34,7 @@ sequence, position iterator and insertion range types.
@@ -49,7 +49,7 @@
};
Constant.
@@ -171,11 +171,12 @@
- |
Returns the result of joining 2 sequences, given the sequence types.
@@ -47,7 +47,7 @@
};
Constant.
@@ -83,11 +83,12 @@
- |
@@ -34,7 +34,7 @@ type.
@@ -47,7 +47,7 @@
};
Constant.
@@ -128,11 +128,12 @@
- |
@@ -34,7 +34,7 @@ type.
@@ -47,7 +47,7 @@
};
@@ -123,11 +123,12 @@
- |
@@ -34,7 +34,7 @@ the input sequence and element to push.
@@ -48,7 +48,7 @@
};
@@ -144,11 +144,12 @@
- |
@@ -34,7 +34,7 @@ of the input sequence and element to push.
@@ -48,7 +48,7 @@
};
@@ -144,11 +144,12 @@
- |
@@ -34,7 +34,7 @@ removal types.
@@ -48,7 +48,7 @@
};
Constant.
@@ -150,11 +150,12 @@
- |
@@ -35,7 +35,7 @@ Lambda Expression predicate types.
@@ -49,7 +49,7 @@
};
Constant.
@@ -151,11 +151,12 @@
- |
@@ -34,7 +34,7 @@ the input sequence and element to replace.
@@ -48,7 +48,7 @@
};
Constant.
@@ -147,11 +147,12 @@
- |
@@ -36,7 +36,7 @@ Function Object predicate and replacement object.
@@ -50,7 +50,7 @@
};
Constant.
@@ -168,11 +168,12 @@
- |
@@ -34,7 +34,7 @@ type.
@@ -47,7 +47,7 @@
};
Constant.
@@ -127,11 +127,12 @@
- |
@@ -37,7 +37,7 @@ of seq.
Table 1.76. Parameters
+Table 1.76. Parameters
- |
@@ -34,7 +34,7 @@ of the members of the component sequences.
@@ -50,7 +50,7 @@
};
Constant.
@@ -90,11 +90,12 @@
- |
- |
@@ -59,11 +59,12 @@
- |
@@ -42,7 +42,7 @@ Inlined Functions).
@@ -50,7 +50,7 @@ #include <boost/fusion/include/cons.hpp>
@@ -58,7 +58,7 @@ struct cons;
@@ -298,7 +298,7 @@ Inlined Functions).
@@ -309,11 +309,12 @@
- |
@@ -43,11 +43,12 @@
- |
- |
Convert a fusion sequence to a list.
@@ -46,7 +46,7 @@ as_list(Sequence const& seq);
@@ -114,7 +114,7 @@ #include <boost/fusion/include/as_list.hpp>
@@ -123,11 +123,12 @@
- |
Convert a fusion sequence to a map.
@@ -46,7 +46,7 @@ as_map(Sequence const& seq);
@@ -119,7 +119,7 @@ #include <boost/fusion/include/as_map.hpp>
@@ -130,11 +130,12 @@
- |
Convert a fusion sequence to a set.
@@ -46,7 +46,7 @@ as_set(Sequence const& seq);
@@ -118,7 +118,7 @@ #include <boost/fusion/include/as_set.hpp>
@@ -127,11 +127,12 @@
- |
Convert a fusion sequence to a vector.
@@ -46,7 +46,7 @@ as_vector(Sequence const& seq);
@@ -114,7 +114,7 @@ #include <boost/fusion/include/as_vector.hpp>
@@ -123,11 +123,12 @@
- |
- |
Returns the result type of as_list.
@@ -41,7 +41,7 @@ struct as_list;
@@ -110,7 +110,7 @@ #include <boost/fusion/include/as_list.hpp>
@@ -119,11 +119,12 @@
- |
Returns the result type of as_map.
@@ -41,7 +41,7 @@ struct as_map;
@@ -115,7 +115,7 @@ #include <boost/fusion/include/as_map.hpp>
@@ -126,11 +126,12 @@
- |
Returns the result type of as_set.
@@ -41,7 +41,7 @@ struct as_set;
@@ -114,7 +114,7 @@ #include <boost/fusion/include/as_set.hpp>
@@ -123,11 +123,12 @@
- |
Returns the result type of as_vector.
@@ -41,7 +41,7 @@ struct as_vector;
@@ -110,7 +110,7 @@ #include <boost/fusion/include/as_vector.hpp>
@@ -119,11 +119,12 @@
- |
@@ -43,11 +43,12 @@
- |
- |
Constructs a tie using a list sequence.
@@ -53,7 +53,7 @@ #define FUSION_MAX_LIST_SIZE 20
@@ -123,7 +123,7 @@ #include <boost/fusion/include/list_tie.hpp>
@@ -134,11 +134,12 @@
- |
@@ -35,7 +35,7 @@ and optional cdr (tail).
@@ -48,7 +48,7 @@ make_cons(Car const& car, Cdr const& cdr);
@@ -136,14 +136,14 @@ #include <boost/fusion/include/make_cons.hpp>
make_cons('x', make_cons(123))
- |
@@ -34,7 +34,7 @@ from one or more values.
@@ -54,7 +54,7 @@ #define FUSION_MAX_LIST_SIZE 20
@@ -123,14 +123,14 @@ #include <boost/fusion/include/make_list.hpp>
make_list(123, "hello", 12.5)
- |
@@ -34,7 +34,7 @@ from one or more key/data pairs.
@@ -47,7 +47,7 @@The variadic function accepts 0 to FUSION_MAX_VECTOR_SIZE - [9] + [9] elements, where FUSION_MAX_VECTOR_SIZE is a user definable predefined maximum that defaults to 10. You may define the preprocessor constant FUSION_MAX_VECTOR_SIZE @@ -57,7 +57,7 @@ #define FUSION_MAX_VECTOR_SIZE 20
@@ -154,7 +154,7 @@ #include <boost/fusion/include/make_map.hpp>
@@ -163,7 +163,7 @@ , make_pair<double>("Men"))
[9] +
[9] map is implemented in terms of the vector. That is why we reuse FUSION_MAX_VECTOR_SIZE
- |
@@ -34,7 +34,7 @@ from one or more values.
@@ -45,7 +45,7 @@The variadic function accepts 0 to FUSION_MAX_VECTOR_SIZE - [8] + [8] elements, where FUSION_MAX_VECTOR_SIZE is a user definable predefined maximum that defaults to 10. You may define the preprocessor constant FUSION_MAX_VECTOR_SIZE @@ -55,7 +55,7 @@ #define FUSION_MAX_VECTOR_SIZE 20
@@ -128,14 +128,14 @@ #include <boost/fusion/include/make_set.hpp>
make_set(123, "hello", 12.5)
[8] +
[8] set is implemented in terms of the vector. That is why we reuse FUSION_MAX_VECTOR_SIZE
- |
@@ -34,7 +34,7 @@ from one or more values.
@@ -54,7 +54,7 @@ #define FUSION_MAX_VECTOR_SIZE 20
@@ -123,14 +123,14 @@ #include <boost/fusion/include/make_vector.hpp>
make_vector(123, "hello", 12.5)
- |
Constructs a tie using a map sequence.
@@ -53,7 +53,7 @@ #define FUSION_MAX_MAP_SIZE 20
@@ -146,7 +146,7 @@ #include <boost/fusion/include/map_tie.hpp>
@@ -160,11 +160,12 @@
- |
@@ -67,7 +67,7 @@ when calling functions which return sequences.
@@ -82,7 +82,7 @@
- |
Constructs a tie using a vector sequence.
@@ -53,7 +53,7 @@ #define FUSION_MAX_VECTOR_SIZE 20
@@ -123,7 +123,7 @@ #include <boost/fusion/include/vector_tie.hpp>
@@ -134,11 +134,12 @@
- |
- |
Returns the result type of list_tie.
@@ -52,7 +52,7 @@ #define FUSION_MAX_LIST_SIZE 20
@@ -122,7 +122,7 @@ #include <boost/fusion/include/list_tie.hpp>
@@ -131,11 +131,12 @@
- |
Returns the result type of make_cons.
@@ -41,7 +41,7 @@ struct make_cons;
@@ -131,7 +131,7 @@ #include <boost/fusion/include/make_cons.hpp>
@@ -140,11 +140,12 @@
- |
Returns the result type of make_list.
@@ -52,7 +52,7 @@ #define FUSION_MAX_LIST_SIZE 20
@@ -123,7 +123,7 @@ #include <boost/fusion/include/make_list.hpp>
@@ -132,11 +132,12 @@
- |
Returns the result type of make_map.
@@ -45,7 +45,7 @@The variadic function accepts 0 to FUSION_MAX_VECTOR_SIZE - [12] + [12] elements, where FUSION_MAX_VECTOR_SIZE is a user definable predefined maximum that defaults to 10. You may define the preprocessor constant FUSION_MAX_VECTOR_SIZE @@ -55,7 +55,7 @@ #define FUSION_MAX_VECTOR_SIZE 20
@@ -151,14 +151,14 @@ #include <boost/fusion/include/make_map.hpp>
result_of::make_map<int, double, char, double>::type
[12] +
[12] map is implemented in terms of the vector. That is why we reuse FUSION_MAX_VECTOR_SIZE
- |
Returns the result type of make_set.
@@ -43,7 +43,7 @@The variadic function accepts 0 to FUSION_MAX_VECTOR_SIZE - [11] + [11] elements, where FUSION_MAX_VECTOR_SIZE is a user definable predefined maximum that defaults to 10. You may define the preprocessor constant FUSION_MAX_VECTOR_SIZE @@ -53,7 +53,7 @@ #define FUSION_MAX_VECTOR_SIZE 20
@@ -128,7 +128,7 @@ #include <boost/fusion/include/make_set.hpp>
@@ -136,7 +136,7 @@
[11] +
[11] set is implemented in terms of the vector. That is why we reuse FUSION_MAX_VECTOR_SIZE
- |
Returns the result type of make_vector.
@@ -52,7 +52,7 @@ #define FUSION_MAX_VECTOR_SIZE 20
@@ -123,7 +123,7 @@ #include <boost/fusion/include/make_list.hpp>
@@ -132,11 +132,12 @@
- |
Returns the result type of map_tie.
@@ -52,7 +52,7 @@ #define FUSION_MAX_MAP_SIZE 20
@@ -144,7 +144,7 @@ #include <boost/fusion/include/map_tie.hpp>
@@ -156,11 +156,12 @@
- |
Returns the result type of vector_tie.
@@ -52,7 +52,7 @@ #define FUSION_MAX_VECTOR_SIZE 20
@@ -122,7 +122,7 @@ #include <boost/fusion/include/vector_tie.hpp>
@@ -131,11 +131,12 @@
- |
@@ -38,7 +38,7 @@ runtime cost of access to each element is peculiarly constant (see Recursive Inlined Functions).
@@ -48,7 +48,7 @@ #include <boost/fusion/include/list_fwd.hpp>
@@ -79,7 +79,7 @@ #define FUSION_MAX_LIST_SIZE 20
@@ -265,7 +265,7 @@ Inlined Functions).
@@ -276,11 +276,12 @@
- |
@@ -40,7 +40,7 @@ (see Overloaded Functions).
@@ -50,7 +50,7 @@ #include <boost/fusion/include/map_fwd.hpp>
@@ -81,7 +81,7 @@ #define FUSION_MAX_MAP_SIZE 20
@@ -246,7 +246,7 @@
@@ -265,11 +265,12 @@
- |
@@ -39,7 +39,7 @@ Functions).
@@ -49,7 +49,7 @@ #include <boost/fusion/include/set_fwd.hpp>
@@ -80,7 +80,7 @@ #define FUSION_MAX_SET_SIZE 20
@@ -245,7 +245,7 @@
@@ -258,11 +258,12 @@
- |
@@ -39,7 +39,7 @@ efficient.
@@ -61,7 +61,7 @@ #include <boost/fusion/include/vector50.hpp>
@@ -122,7 +122,7 @@ #define FUSION_MAX_VECTOR_SIZE 20
@@ -281,7 +281,7 @@
@@ -292,11 +292,12 @@
- |
- |
@@ -80,7 +80,7 @@ Start guide.
@@ -530,11 +530,12 @@
- |
@@ -35,7 +35,7 @@ iterator.
@@ -43,7 +43,7 @@ struct iterator_facade;
@@ -57,7 +57,7 @@ type.
@@ -373,7 +373,7 @@ #include <boost/fusion/include/iterator_facade.hpp>
@@ -383,11 +383,12 @@
- |
- |
@@ -39,7 +39,7 @@ Sequence.
@@ -51,7 +51,7 @@
)
@@ -82,7 +82,7 @@ /adapted/struct/adapt_assoc_struct.hpp>- + Example
@@ -112,11 +112,12 @@
- |
@@ -36,7 +36,7 @@ Access Sequence.
@@ -48,7 +48,7 @@
)
@@ -76,7 +76,7 @@ /adapted/struct/adapt_struct.hpp>- + Example
@@ -98,11 +98,12 @@
- |
@@ -35,7 +35,7 @@ iterator.
@@ -43,7 +43,7 @@ struct sequence_facade;
@@ -59,7 +59,7 @@ type.
@@ -251,7 +251,7 @@ #include <boost/fusion/include/sequence_facade.hpp>
@@ -261,11 +261,12 @@
- |
- |
- |
@@ -59,7 +59,7 @@ /functional/adapter/fused.hpp>
@@ -67,7 +67,7 @@ class fused;
@@ -222,7 +222,7 @@ assert(f(make_vector(1,2l)) == 3l);
- |
@@ -49,7 +49,7 @@ /functional/adapter/fused_function_object.hpp>
@@ -57,7 +57,7 @@ class fused_function_object;
@@ -243,7 +243,7 @@
}
- |
@@ -66,7 +66,7 @@ /functional/adapter/fused_procedure.hpp>
@@ -74,7 +74,7 @@ class fused_procedure;
@@ -241,7 +241,7 @@
}
- |
@@ -58,7 +58,7 @@ /functional/adapter/unfused_generic.hpp>
@@ -66,7 +66,7 @@ class unfused_generic;
@@ -269,7 +269,7 @@
}
- |
@@ -51,7 +51,7 @@ /functional/adapter/unfused_lvalue_args.hpp>
@@ -59,7 +59,7 @@ class unfused_lvalue_args;
@@ -239,7 +239,7 @@
}
- |
@@ -51,7 +51,7 @@ /functional/adapter/unfused_rvalue_args.hpp>
@@ -59,7 +59,7 @@ class unfused_rvalue_args;
@@ -237,7 +237,7 @@
}
- |
@@ -65,7 +65,7 @@ /functional/adapter/unfused_typed.hpp>
@@ -73,7 +73,7 @@ class unfused_typed;
@@ -319,7 +319,7 @@
}
- |
- |
@@ -36,7 +36,7 @@ of a function call operator.
@@ -69,11 +69,12 @@
- |
@@ -40,7 +40,7 @@ to determine the result of a call.
@@ -151,11 +151,12 @@
- |
@@ -39,7 +39,7 @@ Callable Object type.
@@ -163,11 +163,12 @@
- |
@@ -39,7 +39,7 @@ can appear immediately to the left of a function call operator.
@@ -144,11 +144,12 @@
- |
- |
- |
@@ -40,7 +40,7 @@ conversion is applied to the target function.
@@ -50,7 +50,7 @@ make_fused(F const & f);
@@ -119,7 +119,7 @@ #include <boost/fusion/include/make_fused.hpp>
@@ -135,7 +135,7 @@
}
- |
@@ -42,7 +42,7 @@ conversion is applied to the target function.
@@ -52,7 +52,7 @@ make_fused_function_object(F const & f);
@@ -122,7 +122,7 @@ #include <boost/fusion/include/make_fused_function_object.hpp>
@@ -151,7 +151,7 @@
}
- |
@@ -42,7 +42,7 @@ conversion applied to the target function.
@@ -52,7 +52,7 @@ make_fused_procedure(F const & f);
@@ -121,7 +121,7 @@ #include <boost/fusion/include/make_fused_procedure.hpp>
@@ -131,7 +131,7 @@ assert(front(v) == 0);
- |
@@ -42,7 +42,7 @@ conversion is applied to the target function.
@@ -52,7 +52,7 @@ make_unfused_generic(F const & f);
@@ -122,7 +122,7 @@ #include <boost/fusion/include/make_unfused_generic.hpp>
@@ -158,7 +158,7 @@
}
- |
@@ -42,7 +42,7 @@ conversion is applied to the target function.
@@ -52,7 +52,7 @@ make_unfused_lvalue_args(F const & f);
@@ -122,7 +122,7 @@ #include <boost/fusion/include/make_unfused_lvalue_args.hpp>
@@ -149,7 +149,7 @@
}
- |
@@ -41,7 +41,7 @@ conversion is applied to the target function.
@@ -51,7 +51,7 @@ make_unfused_rvalue_args(F const & f);
@@ -121,7 +121,7 @@ #include <boost/fusion/include/make_unfused_rvalue_args.hpp>
@@ -147,7 +147,7 @@
}
- |
- |
@@ -38,7 +38,7 @@ make_fused">make_fused.
@@ -46,7 +46,7 @@ #include <boost/fusion/include/make_fused.hpp>
@@ -60,7 +60,7 @@
}
- |
@@ -39,7 +39,7 @@ make_fused_function_object">make_fused_function_object.
@@ -47,7 +47,7 @@ #include <boost/fusion/include/make_fused_function_object.hpp>
@@ -61,7 +61,7 @@
}
- |
@@ -39,7 +39,7 @@ make_fused_procedure">make_fused_procedure.
@@ -47,7 +47,7 @@ #include <boost/fusion/include/make_fused_procedure.hpp>
@@ -61,7 +61,7 @@
}
- |
@@ -39,7 +39,7 @@ make_unfused_generic">make_unfused_generic.
@@ -47,7 +47,7 @@ #include <boost/fusion/include/make_unfused_generic.hpp>
@@ -61,7 +61,7 @@
}
- |
@@ -39,7 +39,7 @@ make_unfused_lvalue_args">make_unfused_lvalue_args.
@@ -47,7 +47,7 @@ #include <boost/fusion/include/make_unfused_lvalue_args.hpp>
@@ -61,7 +61,7 @@
}
- |
@@ -38,7 +38,7 @@ make_unfused_rvalue_args">make_unfused_rvalue_args.
@@ -46,7 +46,7 @@ #include <boost/fusion/include/make_unfused_rvalue_args.hpp>
@@ -60,7 +60,7 @@
}
- |
- |
- |
@@ -47,7 +47,7 @@ and boost::shared_ptr).
@@ -66,7 +66,7 @@ invoke(Function f, Sequence const & s);
@@ -162,7 +162,7 @@ assert(invoke(add,make_vector(1,1)) == 2);
- |
@@ -43,7 +43,7 @@ and/or to control the const qualification of a function object.
@@ -64,7 +64,7 @@ invoke_function_object(Function f, Sequence const & s);
@@ -179,7 +179,7 @@
}
- |
@@ -54,7 +54,7 @@ isn't implemented).
@@ -75,7 +75,7 @@ invoke_procedure(Function f, Sequence const & s);
@@ -171,7 +171,7 @@ assert(front(v) == 3);
- |
- |
Returns the result type of invoke.
@@ -51,7 +51,7 @@
}
- |
@@ -38,7 +38,7 @@ invoke_function_object">invoke_function_object.
@@ -55,7 +55,7 @@
}
- |
@@ -38,7 +38,7 @@ invoke_procedure">invoke_procedure.
@@ -55,7 +55,7 @@
}
- |
- |
- |
- |
- |
- |
- |
- |
Moves an iterator by a specified distance.
@@ -44,7 +44,7 @@ typename result_of::advance<I, M>::type advance(I const& i);
@@ -146,11 +146,12 @@
- |
Moves an iterator by a specified distance.
@@ -44,7 +44,7 @@ typename result_of::advance_c<I, N>::type advance_c(I const& i);
@@ -145,11 +145,12 @@
- |
Deferences an iterator.
@@ -43,7 +43,7 @@ typename result_of::deref<I>::type deref(I const& i);
@@ -122,11 +122,12 @@
- |
Returns the distance between 2 iterators.
@@ -44,7 +44,7 @@ typename result_of::distance<I, J>::type distance(I const& i, J const& j);
@@ -120,11 +120,12 @@
- |
Moves an iterator 1 position forwards.
@@ -43,7 +43,7 @@ typename result_of::next<I>::type next(I const& i);
@@ -122,11 +122,12 @@
- |
Moves an iterator 1 position backwards.
@@ -43,7 +43,7 @@ typename result_of::prior<I>::type prior(I const& i);
@@ -121,11 +121,12 @@
- |
- |
Moves an iterator a specified distance.
@@ -47,7 +47,7 @@
};
@@ -150,11 +150,12 @@
- |
Moves an iterator by a specified distance.
@@ -47,7 +47,7 @@
};
@@ -149,11 +149,12 @@
- |
Returns the type that will be returned by dereferencing an iterator.
@@ -46,7 +46,7 @@
};
@@ -128,11 +128,12 @@
- |
Returns the distance between two iterators.
@@ -47,7 +47,7 @@
};
@@ -128,11 +128,12 @@
- |
@@ -35,7 +35,7 @@ and J are equal.
@@ -49,7 +49,7 @@
};
@@ -126,11 +126,12 @@
- |
Returns the type of the next iterator in a sequence.
@@ -46,7 +46,7 @@
};
@@ -123,11 +123,12 @@
- |
Returns the type of the previous iterator in a sequence.
@@ -46,7 +46,7 @@
};
@@ -126,11 +126,12 @@
- |
Returns the type stored at the position of an iterator.
@@ -46,7 +46,7 @@
};
@@ -126,11 +126,12 @@
- |
- |
Compares 2 iterators for equality.
@@ -49,7 +49,7 @@ unspecified operator==(I const& i, J const& i);
- |
Compares 2 iterators for inequality.
@@ -48,7 +48,7 @@ unspecified operator==(I const& i, J const& i);
- |
Dereferences an iterator.
@@ -47,7 +47,7 @@ typename result_of::deref<I>::type operator*(unspecified<I> const& i);
@@ -126,11 +126,12 @@
- |
@@ -51,7 +51,7 @@ given a key, k.
@@ -103,7 +103,7 @@
@@ -138,7 +138,7 @@ it very cheap to pass around.
@@ -161,7 +161,7 @@
Array arguments are deduced to reference to const types. For example - [14] + [14] :
@@ -194,7 +194,7 @@ list<void (*)(int)>
@@ -237,7 +237,7 @@
[14] +
[14] Note that the type of a string literal is an array of const characters, not const char*. To get make_list to create a list with an element of a non-const array type one must use the ref @@ -247,11 +247,12 @@
- |
@@ -65,7 +65,7 @@ against.- + Directory
@@ -186,7 +186,7 @@
- + Example
@@ -202,12 +202,12 @@
The first includes all containers The second includes only list - [3] + [3] .
-[3] +
@@ -215,11 +215,12 @@[3] Modules may contain smaller components. Header file information for each component will be provided as part of the component's documentation.
-
diff --git a/doc/html/fusion/preface.html b/doc/html/fusion/preface.html index b4a71e62..cf6c413d 100644 --- a/doc/html/fusion/preface.html +++ b/doc/html/fusion/preface.html @@ -44,7 +44,7 @@- + Description
@@ -62,7 +62,7 @@ of compile time metaprogramming with runtime programming.
- + Motivation
@@ -88,7 +88,7 @@ an instant AHA! moment.
- + How to use this manual
@@ -96,7 +96,7 @@ icons precede some text to indicate:
-Table 1.1. Icons
+Table 1.1. Icons
@@ -199,7 +199,7 @@ Tools. - + Support
@@ -215,11 +215,12 @@
-
diff --git a/doc/html/fusion/quick_start.html b/doc/html/fusion/quick_start.html index 068094aa..f6aa9396 100644 --- a/doc/html/fusion/quick_start.html +++ b/doc/html/fusion/quick_start.html @@ -33,7 +33,7 @@For starters, we shall include all of Fusion's Sequence(s) - [1] + [1] :
@@ -42,7 +42,7 @@Let's begin with a vector - [2] + [2] :
@@ -60,7 +60,7 @@ Let's see some examples.- + Print the vector as XML
@@ -118,7 +118,7 @@ print just about any Fusion Sequence.- + Print only pointers
@@ -152,7 +152,7 @@ Easy, right?
- + Associative tuples
@@ -227,7 +227,7 @@ a dog or a whole alternate_universe.
- + Tip of the Iceberg
@@ -238,12 +238,12 @@
-[1] +
-[1] There are finer grained header files available if you wish to have more control over which components to include (see section Orgainization for details).
[2] +
[2] Unless otherwise noted, components are in namespace boost::fusion. For the sake of simplicity, code in this quick start implies using directives for the fusion components we will be using. @@ -252,11 +252,12 @@
-
diff --git a/doc/html/fusion/references.html b/doc/html/fusion/references.html index 0746e726..783cd2f8 100644 --- a/doc/html/fusion/references.html +++ b/doc/html/fusion/references.html @@ -57,11 +57,12 @@
-
diff --git a/doc/html/fusion/sequence.html b/doc/html/fusion/sequence.html index 8cc0c904..019ea590 100644 --- a/doc/html/fusion/sequence.html +++ b/doc/html/fusion/sequence.html @@ -59,7 +59,7 @@ type that can be used to iterate through the Sequence's elements.- + Header
@@ -69,11 +69,12 @@
-
diff --git a/doc/html/fusion/sequence/concepts.html b/doc/html/fusion/sequence/concepts.html index b5714779..0340f9a9 100644 --- a/doc/html/fusion/sequence/concepts.html +++ b/doc/html/fusion/sequence/concepts.html @@ -40,7 +40,7 @@ Fusion Sequences are organized into a hierarchy of concepts.- + Traversal
@@ -58,7 +58,7 @@ Sequence. These concepts pertain to sequence traversal.
- + Associativity
@@ -70,11 +70,12 @@
-
diff --git a/doc/html/fusion/sequence/concepts/associative_sequence.html b/doc/html/fusion/sequence/concepts/associative_sequence.html index 998e18ae..6bc665f4 100644 --- a/doc/html/fusion/sequence/concepts/associative_sequence.html +++ b/doc/html/fusion/sequence/concepts/associative_sequence.html @@ -30,7 +30,7 @@ Sequence">Associative Sequence- + Description
@@ -71,7 +71,7 @@
- + Valid Expressions
@@ -180,7 +180,7 @@- + Result Type Expressions
@@ -252,7 +252,7 @@ result_of::value_at_key<S, N>.- + Expression Semantics
@@ -307,7 +307,7 @@
- |
@@ -42,7 +42,7 @@ Iterator.
- |
- |
@@ -43,7 +43,7 @@ sequence elements.
- |
@@ -50,7 +50,7 @@
[4] +
[4] In practice, many of intrinsic functions have default implementations that will work in majority of cases
- |
- |
Returns the N-th element from the beginning of the sequence.
@@ -46,7 +46,7 @@ at(Sequence const& seq);
@@ -149,7 +149,7 @@ #include <boost/fusion/include/at.hpp>
@@ -159,11 +159,12 @@
- |
Returns the N-th element from the beginning of the sequence.
@@ -46,7 +46,7 @@ at_c(Sequence const& seq);
@@ -149,7 +149,7 @@ #include <boost/fusion/include/at_c.hpp>
@@ -159,11 +159,12 @@
- |
Returns the element associated with a Key from the sequence.
@@ -46,7 +46,7 @@ at_key(Sequence const& seq);
@@ -144,7 +144,7 @@ #include <boost/fusion/include/at_key.hpp>
@@ -154,11 +154,12 @@
- |
Returns the last element in the sequence.
@@ -46,7 +46,7 @@ back(Sequence const& seq);
@@ -125,7 +125,7 @@ #include <boost/fusion/include/back.hpp>
@@ -135,11 +135,12 @@
- |
Returns an iterator pointing to the first element in the sequence.
@@ -46,7 +46,7 @@ begin(Sequence const& seq);
@@ -131,7 +131,7 @@ #include <boost/fusion/include/begin.hpp>
@@ -141,11 +141,12 @@
- |
@@ -35,7 +35,7 @@ the sequence is empty, else, evaluates to false.
@@ -44,7 +44,7 @@ empty(Sequence const& seq);
@@ -114,7 +114,7 @@ #include <boost/fusion/include/empty.hpp>
@@ -124,11 +124,12 @@
- |
Returns an iterator pointing to one element past the end of the sequence.
@@ -46,7 +46,7 @@ end(Sequence const& seq);
@@ -131,7 +131,7 @@ #include <boost/fusion/include/end.hpp>
@@ -141,11 +141,12 @@
- |
Returns the first element in the sequence.
@@ -46,7 +46,7 @@ front(Sequence const& seq);
@@ -125,7 +125,7 @@ #include <boost/fusion/include/front.hpp>
@@ -135,11 +135,12 @@
- |
@@ -36,7 +36,7 @@ to false.
@@ -45,7 +45,7 @@ has_key(Sequence const& seq);
@@ -134,7 +134,7 @@ #include <boost/fusion/include/has_key.hpp>
@@ -144,11 +144,12 @@
- |
@@ -34,7 +34,7 @@ that evaluates the number of elements in the sequence.
@@ -43,7 +43,7 @@ size(Sequence const& seq);
@@ -113,7 +113,7 @@ #include <boost/fusion/include/size.hpp>
@@ -123,11 +123,12 @@
- |
Performs an element by element swap of the elements in 2 sequences.
@@ -41,7 +41,7 @@ void swap(Seq1& seq1, Seq2& seq2);
@@ -120,11 +120,12 @@
- |
- |
Returns the result type of at - [5] + [5] .
@@ -48,7 +48,7 @@
};
@@ -141,7 +141,7 @@
[5] +
[5] result_of::at reflects the actual return type of the function at. Sequence(s) typically return references to its elements via the at function. If you want @@ -151,11 +151,12 @@
- |
Returns the result type of at_c - [6] + [6] .
@@ -48,7 +48,7 @@
};
@@ -140,7 +140,7 @@
[6] +
[6] result_of::at_c reflects the actual return type of the function at_c. Sequence(s) typically return references to its elements via the at_c function. If you want @@ -150,11 +150,12 @@
- |
Returns the result type of at_key - [7] + [7] .
@@ -48,7 +48,7 @@
};
@@ -142,7 +142,7 @@
[7] +
[7] result_of::at_key reflects the actual return type of the function at_key. _sequence_s typically return references to its elements via the at_key function. If you @@ -152,11 +152,12 @@
- |
Returns the result type of back.
@@ -44,7 +44,7 @@
};
@@ -118,11 +118,12 @@
- |
Returns the result type of begin.
@@ -44,7 +44,7 @@
};
@@ -120,11 +120,12 @@
- |
Returns the result type of empty.
@@ -44,7 +44,7 @@
};
@@ -123,11 +123,12 @@
- |
Returns the result type of end.
@@ -44,7 +44,7 @@
};
@@ -120,11 +120,12 @@
- |
Returns the result type of front.
@@ -44,7 +44,7 @@
};
@@ -119,11 +119,12 @@
- |
Returns the result type of has_key.
@@ -46,7 +46,7 @@
};
@@ -143,11 +143,12 @@
- |
Returns the result type of size.
@@ -44,7 +44,7 @@
};
@@ -120,11 +120,12 @@
- |
Returns the return type of swap.
@@ -44,7 +44,7 @@
};
- |
Returns the actual type at a given index from the Sequence.
@@ -46,7 +46,7 @@
};
@@ -140,11 +140,12 @@
- |
Returns the actual type at a given index from the Sequence.
@@ -46,7 +46,7 @@
};
@@ -139,11 +139,12 @@
- |
Returns the actual element type associated with a Key from the Sequence.
@@ -46,7 +46,7 @@
};
@@ -140,11 +140,12 @@
- |
- |
@@ -58,11 +58,12 @@
- |
Compare two sequences for equality.
@@ -43,7 +43,7 @@ operator==(Seq1 const& a, Seq2 const& b);
@@ -133,7 +133,7 @@ #include <boost/fusion/include/equal_to.hpp>
@@ -144,11 +144,12 @@
- |
@@ -43,7 +43,7 @@ operator>(Seq1 const& a, Seq2 const& b);
@@ -125,7 +125,7 @@ #include <boost/fusion/include/less_equal.hpp>
@@ -138,11 +138,12 @@
- |
@@ -42,7 +42,7 @@ operator>=(Seq1 const& a, Seq2 const& b);
@@ -124,7 +124,7 @@ #include <boost/fusion/include/greater_equal.hpp>
@@ -137,11 +137,12 @@
- |
@@ -43,7 +43,7 @@ operator<(Seq1 const& a, Seq2 const& b);
@@ -127,7 +127,7 @@ #include <boost/fusion/include/less.hpp>
@@ -140,11 +140,12 @@
- |
@@ -43,7 +43,7 @@ operator<=(Seq1 const& a, Seq2 const& b);
@@ -125,7 +125,7 @@ #include <boost/fusion/include/less_equal.hpp>
@@ -138,11 +138,12 @@
- |
@@ -42,7 +42,7 @@ operator!=(Seq1 const& a, Seq2 const& b);
@@ -127,7 +127,7 @@ #include <boost/fusion/include/not_equal_to.hpp>
@@ -140,11 +140,12 @@
- |
@@ -126,11 +126,12 @@
- |
@@ -34,7 +34,7 @@ stream.
@@ -43,7 +43,7 @@ operator>>(IStream& is, Sequence& seq);
@@ -131,7 +131,7 @@ #include <boost/fusion/include/in.hpp>
@@ -141,11 +141,12 @@
- |
@@ -34,7 +34,7 @@ stream.
@@ -43,7 +43,7 @@ operator<<(OStream& os, Sequence& seq);
@@ -131,7 +131,7 @@ #include <boost/fusion/include/out.hpp>
@@ -140,11 +140,12 @@
- |
- |
@@ -36,7 +36,7 @@ Sequence Concepts).
@@ -50,7 +50,7 @@
}
@@ -169,7 +169,7 @@ #include <boost/fusion/include/category_of.hpp>
@@ -182,11 +182,12 @@
- |
@@ -39,7 +39,7 @@ Reference wrappers are removed (see boost::ref).
@@ -47,7 +47,7 @@ #include <boost/fusion/include/deduce.hpp>
@@ -61,7 +61,7 @@
}
@@ -82,18 +82,19 @@
}
- |
@@ -39,7 +39,7 @@ original type as its argument.
@@ -47,7 +47,7 @@ #include <boost/fusion/include/deduce_sequence.hpp>
@@ -61,7 +61,7 @@
}
@@ -84,18 +84,19 @@
}
- |
@@ -37,7 +37,7 @@ conforming sequences.
@@ -51,7 +51,7 @@
}
@@ -122,7 +122,7 @@ #include <boost/fusion/include/is_sequence.hpp>
@@ -136,11 +136,12 @@
- |
@@ -40,7 +40,7 @@ specialized to accomodate clients providing Fusion conforming views.
@@ -54,7 +54,7 @@
}
@@ -116,7 +116,7 @@ otherwise.- + Header
@@ -124,7 +124,7 @@ #include <boost/fusion/include/is_view.hpp>- + Example
@@ -140,11 +140,12 @@
- |
@@ -37,7 +37,7 @@ for example.
@@ -61,7 +61,7 @@ make_pair(Second const &);
@@ -315,7 +315,7 @@ #include <boost/fusion/include/pair.hpp>
@@ -327,11 +327,12 @@
- |
@@ -40,7 +40,7 @@ conforming sequences.
@@ -54,7 +54,7 @@
}
@@ -113,7 +113,7 @@ with T.- + Header
@@ -121,7 +121,7 @@ #include <boost/fusion/include/tag_of.hpp>- + Example
@@ -136,11 +136,12 @@
- |
- |
@@ -65,11 +65,12 @@
- |
@@ -38,7 +38,7 @@ in this section.
- |
@@ -40,7 +40,7 @@ function to provide access to it's elements by zero based numeric index.
@@ -84,11 +84,12 @@
- |
@@ -38,7 +38,7 @@ Tuple provides the standard boolean relational operators.
- |
@@ -40,7 +40,7 @@ functions are described in this section.
@@ -69,11 +69,12 @@
- |
@@ -40,7 +40,7 @@ tuple size, and the element types.
@@ -76,11 +76,12 @@
- |
@@ -36,7 +36,7 @@ as if it were a 2 element tuple.
@@ -97,11 +97,12 @@
- |
@@ -54,11 +54,12 @@
- |
@@ -37,7 +37,7 @@ only those elements for which its predicate evaluates to mpl::true_.
@@ -45,7 +45,7 @@ #include <boost/fusion/include/filter_view.hpp>
@@ -53,7 +53,7 @@ struct filter_view;
@@ -214,7 +214,7 @@
@@ -231,11 +231,12 @@
- |
@@ -34,7 +34,7 @@ sub-range of its underlying sequence delimited by a pair of iterators.
@@ -42,7 +42,7 @@ #include <boost/fusion/include/iterator_range.hpp>
@@ -50,7 +50,7 @@ struct iterator_range;
@@ -246,11 +246,12 @@
- |
@@ -34,7 +34,7 @@ which is a concatenation of two sequences.
@@ -42,7 +42,7 @@ #include <boost/fusion/include/joint_view.hpp>
@@ -50,7 +50,7 @@ struct joint_view;
@@ -217,7 +217,7 @@
@@ -232,11 +232,12 @@
- |
@@ -39,7 +39,7 @@ #include <boost/fusion/include/reverse_view.hpp>
@@ -47,7 +47,7 @@ struct reverse_view;
@@ -204,11 +204,12 @@
- |
@@ -38,7 +38,7 @@ #include <boost/fusion/include/single_view.hpp>
@@ -46,7 +46,7 @@ struct single_view;
@@ -186,7 +186,7 @@
@@ -196,11 +196,12 @@
- |
@@ -43,7 +43,7 @@ #include <boost/fusion/include/transform_view.hpp>
@@ -61,7 +61,7 @@ struct transform_view;
@@ -367,11 +367,12 @@
- |
@@ -37,7 +37,7 @@ to the component _sequence_s.
@@ -45,7 +45,7 @@ #include <boost/fusion/include/zip_view.hpp>
@@ -53,7 +53,7 @@ struct zip_view;
@@ -204,7 +204,7 @@
@@ -218,11 +218,12 @@
- |
Copyright © 2001-2007 Joel de Guzman, Dan Marsden, Tobias Schwinger
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -244,8 +244,8 @@Last revised: November 07, 2007 at 03:41:59 GMT |
-+ | Last revised: November 14, 2007 at 10:10:22 GMT |
+