From f27ed26e44e30c00512cd59de941a94d5dfb454c Mon Sep 17 00:00:00 2001
From: Eric Niebler
Fusion provides a couple of adapters for other sequences such as arrays,
BOOST_FUSION_ADAPT_ADT is a macro than can be used to generate all the necessary
@@ -32,7 +32,7 @@
Access Sequence.
diff --git a/doc/html/fusion/adapted/adapt_assoc.html b/doc/html/fusion/adapted/adapt_assoc.html
index f49d2a6a..20a2865a 100644
--- a/doc/html/fusion/adapted/adapt_assoc.html
+++ b/doc/html/fusion/adapted/adapt_assoc.html
@@ -24,10 +24,10 @@
@@ -37,7 +37,7 @@
Sequence.
@@ -66,14 +66,14 @@
should be the fully namespace qualified name of the struct to be adapted.
BOOST_FUSION_ADAPT_ASSOC_ADT is a macro than can be used to generate all
@@ -34,7 +34,7 @@
Sequence.
diff --git a/doc/html/fusion/adapted/adapt_assoc_struct_named.html b/doc/html/fusion/adapted/adapt_assoc_struct_named.html
index f65e53f0..a549ebb4 100644
--- a/doc/html/fusion/adapted/adapt_assoc_struct_named.html
+++ b/doc/html/fusion/adapted/adapt_assoc_struct_named.html
@@ -24,10 +24,10 @@
@@ -38,7 +38,7 @@
Sequence. The given struct is adapted using the given name.
@@ -83,14 +83,14 @@
should be the fully namespace qualified name of the struct to be converted.
BOOST_FUSION_ADAPT_ASSOC_TPL_ADT is a macro than can be used to generate
@@ -34,7 +34,7 @@
Sequence.
diff --git a/doc/html/fusion/adapted/adapt_assoc_tpl_struct.html b/doc/html/fusion/adapted/adapt_assoc_tpl_struct.html
index 99ae67b9..09cfa6a8 100644
--- a/doc/html/fusion/adapted/adapt_assoc_tpl_struct.html
+++ b/doc/html/fusion/adapted/adapt_assoc_tpl_struct.html
@@ -24,10 +24,10 @@
@@ -38,7 +38,7 @@
Sequence.
@@ -72,14 +72,14 @@
should be the fully namespace qualified name of the struct to be adapted.
@@ -36,7 +36,7 @@
Access Sequence.
@@ -63,14 +63,14 @@
should be the fully namespace qualified name of the struct to be adapted.
@@ -37,7 +37,7 @@
Access Sequence. The given struct is adapted using the given name.
@@ -81,14 +81,14 @@
should be the fully namespace qualified name of the struct to be converted.
BOOST_FUSION_ADAPT_TPL_ADT is a macro than can be used to generate all the
@@ -33,7 +33,7 @@
Access Sequence.
diff --git a/doc/html/fusion/adapted/adapt_tpl_struct.html b/doc/html/fusion/adapted/adapt_tpl_struct.html
index 2a52e87b..da0dddf8 100644
--- a/doc/html/fusion/adapted/adapt_tpl_struct.html
+++ b/doc/html/fusion/adapted/adapt_tpl_struct.html
@@ -24,10 +24,10 @@
@@ -37,7 +37,7 @@
Sequence.
@@ -69,14 +69,14 @@
should be the fully namespace qualified name of the struct to be adapted.
This module provides adapters for arrays. Including the module header makes
@@ -32,20 +32,22 @@
Access Sequence.
diff --git a/doc/html/fusion/adapted/boost__tuple.html b/doc/html/fusion/adapted/boost__tuple.html
index 28f954dc..9294ba1e 100644
--- a/doc/html/fusion/adapted/boost__tuple.html
+++ b/doc/html/fusion/adapted/boost__tuple.html
@@ -33,19 +33,21 @@
Sequence.
diff --git a/doc/html/fusion/adapted/define_assoc_struct.html b/doc/html/fusion/adapted/define_assoc_struct.html
index 3f95d087..0b5f1a38 100644
--- a/doc/html/fusion/adapted/define_assoc_struct.html
+++ b/doc/html/fusion/adapted/define_assoc_struct.html
@@ -24,10 +24,10 @@
@@ -38,7 +38,7 @@
Sequence.
@@ -38,7 +38,7 @@
Sequence.
BOOST_FUSION_DEFINE_STRUCT is a macro that can be used to generate all the
@@ -33,7 +33,7 @@
Access Sequence.
@@ -37,7 +37,7 @@
Access Sequence.
-
std::pair
,
@@ -60,7 +60,7 @@
various data structures, non-intrusively, as full fledged Fusion sequences.
-
+
Header
#include <boost/fusion/adapted.hpp>
diff --git a/doc/html/fusion/adapted/adapt_adt.html b/doc/html/fusion/adapted/adapt_adt.html
index 79378220..cd164c91 100644
--- a/doc/html/fusion/adapted/adapt_adt.html
+++ b/doc/html/fusion/adapted/adapt_adt.html
@@ -24,7 +24,7 @@
-
+
Synopsis
BOOST_FUSION_ADAPT_ADT(
@@ -43,7 +43,7 @@
)
-
+
Expression
Semantics
@@ -88,14 +88,14 @@
should be the fully namespace qualified name of the class type to be adapted.
-
+
Header
#include <boost/fusion/adapted/adt/adapt_adt.hpp>
#include <boost/fusion/include/adapt_adt.hpp>
-
+
Example
namespace demo
@@ -137,11 +137,11 @@
demo::employee e;
front(e)="Edward Norton";
back(e)=41;
-//Prints 'Edward Norton is 41 years old'
-std::cout << e.get_name() << " is " << e.get_age() << " years old" << std::endl;
+//Prints 'Edward Norton is 41 years old'
+std::cout << e.get_name() << " is " << e.get_age() << " years old" << std::endl;
-
+
See also
-
+
Description
-
+
Synopsis
BOOST_FUSION_ADAPT_ASSOC_STRUCT(
@@ -48,7 +48,7 @@
)
-
+
Semantics
-
+
Header
#include <boost/fusion/adapted/struct/adapt_assoc_struct.hpp>
#include <boost/fusion/include/adapt_assoc_struct.hpp>
-
+
Example
namespace demo
@@ -91,10 +91,10 @@
struct age;
}
-// demo::employee is now a Fusion sequence.
-// It is also an associative sequence with
-// keys keys::name and keys::age present.
-BOOST_FUSION_ADAPT_ASSOC_STRUCT(
+// demo::employee is now a Fusion sequence.
+// It is also an associative sequence with
+// keys keys::name and keys::age present.
+BOOST_FUSION_ADAPT_ASSOC_STRUCT(
demo::employee,
(std::string, name, keys::name)
(int, age, keys::age))
diff --git a/doc/html/fusion/adapted/adapt_assoc_adt.html b/doc/html/fusion/adapted/adapt_assoc_adt.html
index 8e36e112..199b3f65 100644
--- a/doc/html/fusion/adapted/adapt_assoc_adt.html
+++ b/doc/html/fusion/adapted/adapt_assoc_adt.html
@@ -24,7 +24,7 @@
-
+
Synopsis
BOOST_FUSION_ADAPT_ASSOC_ADT(
@@ -45,7 +45,7 @@
)
-
+
Expression
Semantics
@@ -92,14 +92,14 @@
should be the fully namespace qualified name of the class type to be adapted.
-
+
Header
#include <boost/fusion/adapted/adt/adapt_assoc_adt.hpp>
#include <boost/fusion/include/adapt_assoc_adt.hpp>
-
+
Example
namespace demo
@@ -147,11 +147,11 @@
demo::employee e;
at_key<keys::name>(e)="Edward Norton";
at_key<keys::age>(e)=41;
-//Prints 'Edward Norton is 41 years old'
-std::cout << e.get_name() << " is " << e.get_age() << " years old" << std::endl;
+//Prints 'Edward Norton is 41 years old'
+std::cout << e.get_name() << " is " << e.get_age() << " years old" << std::endl;
-
+
See also
-
+
Description
-
+
Synopsis
BOOST_FUSION_ADAPT_ASSOC_STRUCT_NAMED(
@@ -58,7 +58,7 @@
)
-
+
Semantics
-
+
Header
#include <boost/fusion/adapted/struct/adapt_assoc_struct_named.hpp>
#include <boost/fusion/include/adapt_assoc_struct_named.hpp>
-
+
Example
namespace demo
@@ -108,9 +108,9 @@
struct age;
}
-// boost::fusion::adapted::adapted_employee is now a Fusion sequence
-// referring to demo::employee
-BOOST_FUSION_ADAPT_ASSOC_STRUCT_NAMED(
+// boost::fusion::adapted::adapted_employee is now a Fusion sequence
+// referring to demo::employee
+BOOST_FUSION_ADAPT_ASSOC_STRUCT_NAMED(
demo::employee, adapted_employee,
(std::string, name, keys::name)
(int, age, keys::age))
diff --git a/doc/html/fusion/adapted/adapt_assoc_tpl_adt.html b/doc/html/fusion/adapted/adapt_assoc_tpl_adt.html
index 00311571..f569fa19 100644
--- a/doc/html/fusion/adapted/adapt_assoc_tpl_adt.html
+++ b/doc/html/fusion/adapted/adapt_assoc_tpl_adt.html
@@ -24,7 +24,7 @@
-
+
Synopsis
BOOST_FUSION_ADAPT_ASSOC_TPL_ADT(
@@ -46,7 +46,7 @@
)
-
+
Expression
Semantics
@@ -98,14 +98,14 @@
be adapted.
-
+
Header
#include <boost/fusion/adapted/adt/adapt_assoc_adt.hpp>
#include <boost/fusion/include/adapt_assoc_adt.hpp>
-
+
Example
namespace demo
@@ -155,11 +155,11 @@
demo::employee<std::string, int> e;
at_key<keys::name>(e)="Edward Norton";
at_key<keys::age>(e)=41;
-//Prints 'Edward Norton is 41 years old'
-std::cout << e.get_name() << " is " << e.get_age() << " years old" << std::endl;
+//Prints 'Edward Norton is 41 years old'
+std::cout << e.get_name() << " is " << e.get_age() << " years old" << std::endl;
-
+
See also
-
+
Description
-
+
Synopsis
BOOST_FUSION_ADAPT_ASSOC_TPL_STRUCT(
@@ -50,7 +50,7 @@
)
-
+
Semantics
-
+
Header
#include <boost/fusion/adapted/struct/adapt_assoc_struct.hpp>
#include <boost/fusion/include/adapt_assoc_struct.hpp>
-
+
Example
namespace demo
@@ -98,10 +98,10 @@
struct age;
}
-// Any instantiated demo::employee is now a Fusion sequence.
-// It is also an associative sequence with
-// keys keys::name and keys::age present.
-BOOST_FUSION_ADAPT_ASSOC_TPL_STRUCT(
+// Any instantiated demo::employee is now a Fusion sequence.
+// It is also an associative sequence with
+// keys keys::name and keys::age present.
+BOOST_FUSION_ADAPT_ASSOC_TPL_STRUCT(
(Name)(Age),
(demo::employee) (Name)(Age),
(Name, name, keys::name)
diff --git a/doc/html/fusion/adapted/adapt_struct.html b/doc/html/fusion/adapted/adapt_struct.html
index a0cabda7..cd1a5b54 100644
--- a/doc/html/fusion/adapted/adapt_struct.html
+++ b/doc/html/fusion/adapted/adapt_struct.html
@@ -24,10 +24,10 @@
-
+
Description
-
+
Synopsis
BOOST_FUSION_ADAPT_STRUCT(
@@ -47,7 +47,7 @@
)
-
+
Semantics
-
+
Header
#include <boost/fusion/adapted/struct/adapt_struct.hpp>
#include <boost/fusion/include/adapt_struct.hpp>
-
+
Example
namespace demo
@@ -82,8 +82,8 @@
};
}
-// demo::employee is now a Fusion sequence
-BOOST_FUSION_ADAPT_STRUCT(
+// demo::employee is now a Fusion sequence
+BOOST_FUSION_ADAPT_STRUCT(
demo::employee,
(std::string, name)
(int, age))
diff --git a/doc/html/fusion/adapted/adapt_struct_named.html b/doc/html/fusion/adapted/adapt_struct_named.html
index 3ce6554a..65af72eb 100644
--- a/doc/html/fusion/adapted/adapt_struct_named.html
+++ b/doc/html/fusion/adapted/adapt_struct_named.html
@@ -24,10 +24,10 @@
-
+
Description
-
+
Synopsis
BOOST_FUSION_ADAPT_STRUCT_NAMED(
@@ -57,7 +57,7 @@
)
-
+
Semantics
-
+
Header
#include <boost/fusion/adapted/struct/adapt_struct_named.hpp>
#include <boost/fusion/include/adapt_struct_named.hpp>
-
+
Example
namespace demo
@@ -100,9 +100,9 @@
};
}
-// boost::fusion::adapted::adapted_employee is now a Fusion sequence
-// referring to demo::employee
-BOOST_FUSION_ADAPT_STRUCT_NAMED(
+// boost::fusion::adapted::adapted_employee is now a Fusion sequence
+// referring to demo::employee
+BOOST_FUSION_ADAPT_STRUCT_NAMED(
demo::employee, adapted_employee,
(std::string, name)
(int, age))
diff --git a/doc/html/fusion/adapted/adapt_tpl_adt.html b/doc/html/fusion/adapted/adapt_tpl_adt.html
index af15fcf3..46a22756 100644
--- a/doc/html/fusion/adapted/adapt_tpl_adt.html
+++ b/doc/html/fusion/adapted/adapt_tpl_adt.html
@@ -24,7 +24,7 @@
-
+
Synopsis
BOOST_FUSION_ADAPT_ADT(
@@ -45,7 +45,7 @@
)
-
+
Expression
Semantics
@@ -95,14 +95,14 @@
be adapted.
-
+
Header
#include <boost/fusion/adapted/adt/adapt_adt.hpp>
#include <boost/fusion/include/adapt_adt.hpp>
-
+
Example
namespace demo
@@ -146,11 +146,11 @@
demo::employee<std::string, int> e;
boost::fusion::front(e)="Edward Norton";
boost::fusion::back(e)=41;
- //Prints 'Edward Norton is 41 years old'
- std::cout << e.get_name() << " is " << e.get_age() << " years old" << std::endl;
+ //Prints 'Edward Norton is 41 years old'
+ std::cout << e.get_name() << " is " << e.get_age() << " years old" << std::endl;
-
+
See also
-
+
Description
-
+
Synopsis
BOOST_FUSION_ADAPT_TPL_STRUCT(
@@ -49,7 +49,7 @@
)
-
+
Semantics
-
+
Header
#include <boost/fusion/adapted/struct/adapt_struct.hpp>
#include <boost/fusion/include/adapt_struct.hpp>
-
+
Example
namespace demo
@@ -89,8 +89,8 @@
};
}
-// Any instantiated demo::employee is now a Fusion sequence
-BOOST_FUSION_ADAPT_TPL_STRUCT(
+// Any instantiated demo::employee is now a Fusion sequence
+BOOST_FUSION_ADAPT_TPL_STRUCT(
(Name)(Age),
(demo::employee) (Name)(Age),
(Name, name)
diff --git a/doc/html/fusion/adapted/array.html b/doc/html/fusion/adapted/array.html
index 76771829..01390beb 100644
--- a/doc/html/fusion/adapted/array.html
+++ b/doc/html/fusion/adapted/array.html
@@ -24,7 +24,7 @@
-
+
Header
#include <boost/fusion/adapted/array.hpp>
#include <boost/fusion/include/array.hpp>
-
+
Model of
-
+
-
+
Example
int arr[3] = {1,2,3};
diff --git a/doc/html/fusion/adapted/boost__array.html b/doc/html/fusion/adapted/boost__array.html
index d1e06713..0c46a131 100644
--- a/doc/html/fusion/adapted/boost__array.html
+++ b/doc/html/fusion/adapted/boost__array.html
@@ -33,20 +33,22 @@
Access Sequence.
-
+
Header
#include <boost/fusion/adapted/boost_array.hpp>
#include <boost/fusion/include/boost_array.hpp>
-
+
Model of
-
+
-
+
Example
boost::array<int,3> arr = {{1,2,3}};
@@ -58,7 +60,7 @@
std::cout <<
at_c
<2>(arr) << std::endl;
-
+
See also
-
+
Header
#include <boost/fusion/adapted/boost_tuple.hpp>
#include <boost/fusion/include/boost_tuple.hpp>
-
+
Model of
-
+
-
+
Example
boost::tuple<int,std::string> example_tuple(101, "hello");
@@ -53,7 +55,7 @@
std::cout << *boost::fusion::next(boost::fusion::begin(example_tuple)) << '\n';
-
+
See also
-
+
Description
-
+
Synopsis
BOOST_FUSION_DEFINE_ASSOC_STRUCT(
@@ -68,7 +68,7 @@
-
+
Expression
Semantics
@@ -182,14 +182,14 @@
-
+
Header
#include <boost/fusion/adapted/struct/define_assoc_struct.hpp>
#include <boost/fusion/include/define_assoc_struct.hpp>
-
+
Example
namespace keys
@@ -198,8 +198,8 @@
struct age;
}
-// demo::employee is a Fusion sequence
-BOOST_FUSION_DEFINE_ASSOC_STRUCT(
+// demo::employee is a Fusion sequence
+BOOST_FUSION_DEFINE_ASSOC_STRUCT(
(demo), employee,
(std::string, name, keys::name)
(int, age, keys::age))
diff --git a/doc/html/fusion/adapted/define_assoc_tpl_struct.html b/doc/html/fusion/adapted/define_assoc_tpl_struct.html
index c1279e74..7e065b27 100644
--- a/doc/html/fusion/adapted/define_assoc_tpl_struct.html
+++ b/doc/html/fusion/adapted/define_assoc_tpl_struct.html
@@ -24,10 +24,10 @@
-
+
Description
-
+
Synopsis
BOOST_FUSION_DEFINE_ASSOC_TPL_STRUCT(
@@ -73,7 +73,7 @@
-
+
Expression
Semantics
@@ -187,14 +187,14 @@
-
+
Header
#include <boost/fusion/adapted/struct/define_assoc_struct.hpp>
#include <boost/fusion/include/define_assoc_struct.hpp>
-
+
Example
namespace keys
@@ -203,8 +203,8 @@
struct age;
}
-// Any instantiated demo::employee is a Fusion sequence
-BOOST_FUSION_DEFINE_ASSOC_TPL_STRUCT(
+// Any instantiated demo::employee is a Fusion sequence
+BOOST_FUSION_DEFINE_ASSOC_TPL_STRUCT(
(Name)(Age), (demo), employee,
(Name, name, keys::name)
(Age, age, keys::age))
diff --git a/doc/html/fusion/adapted/define_struct.html b/doc/html/fusion/adapted/define_struct.html
index efb11e05..33c3f222 100644
--- a/doc/html/fusion/adapted/define_struct.html
+++ b/doc/html/fusion/adapted/define_struct.html
@@ -24,7 +24,7 @@
-
+
Synopsis
BOOST_FUSION_DEFINE_STRUCT(
@@ -63,7 +63,7 @@
-
+
Expression
Semantics
@@ -174,18 +174,18 @@
-
+
Header
#include <boost/fusion/adapted/struct/define_struct.hpp>
#include <boost/fusion/include/define_struct.hpp>
-
+
Example
-// demo::employee is a Fusion sequence
-BOOST_FUSION_DEFINE_STRUCT(
+
// demo::employee is a Fusion sequence
+BOOST_FUSION_DEFINE_STRUCT(
(demo), employee,
(std::string, name)
(int, age))
diff --git a/doc/html/fusion/adapted/define_tpl_struct.html b/doc/html/fusion/adapted/define_tpl_struct.html
index b64348cf..894eff87 100644
--- a/doc/html/fusion/adapted/define_tpl_struct.html
+++ b/doc/html/fusion/adapted/define_tpl_struct.html
@@ -24,10 +24,10 @@
-
+
Description
-
+
Synopsis
BOOST_FUSION_DEFINE_TPL_STRUCT(
@@ -72,7 +72,7 @@
-
+
Expression
Semantics
@@ -183,18 +183,18 @@
-
+
Header
#include <boost/fusion/adapted/struct/define_struct.hpp>
#include <boost/fusion/include/define_struct.hpp>
-
+
Example
-// Any instantiated demo::employee is a Fusion sequence
-BOOST_FUSION_DEFINE_TPL_STRUCT(
+
// Any instantiated demo::employee is a Fusion sequence
+BOOST_FUSION_DEFINE_TPL_STRUCT(
(Name)(Age), (demo), employee,
(Name, name)
(Age, age))
diff --git a/doc/html/fusion/adapted/mpl_sequence.html b/doc/html/fusion/adapted/mpl_sequence.html
index 6a743dca..3d676161 100644
--- a/doc/html/fusion/adapted/mpl_sequence.html
+++ b/doc/html/fusion/adapted/mpl_sequence.html
@@ -32,35 +32,35 @@
sequences fully conforming fusion sequences.
#include <boost/fusion/adapted/mpl.hpp> #include <boost/fusion/include/mpl.hpp>
mpl::vector_c<int, 123, 456> vec_c;
@@ -73,7 +73,7 @@
std::cout << at_c
<1>(v) << std::endl;
diff --git a/doc/html/fusion/adapted/std__pair.html b/doc/html/fusion/adapted/std__pair.html index 3c36a4a9..1b14b9a1 100644 --- a/doc/html/fusion/adapted/std__pair.html +++ b/doc/html/fusion/adapted/std__pair.html @@ -33,20 +33,22 @@ Access Sequence.
#include <boost/fusion/adapted/std_pair.hpp> #include <boost/fusion/include/std_pair.hpp>
std::pair<int, std::string> p(123, "Hola!!!"); @@ -55,7 +57,7 @@ std::cout << p << std::endl;
diff --git a/doc/html/fusion/algorithm.html b/doc/html/fusion/algorithm.html index b38e5479..5fad2a83 100644 --- a/doc/html/fusion/algorithm.html +++ b/doc/html/fusion/algorithm.html @@ -46,20 +46,18 @@
Unlike MPL, Fusion
- algorithms are lazy
- [10]
- and non sequence-type preserving
- [11]
- . This is by design. Runtime efficiency is given a high priority. Like MPL, and unlike STL, fusion
- algorithms are mostly functional in nature such that algorithms are non mutating
- (no side effects). However, due to the high cost of returning full sequences
- such as vectors and lists, Views are returned from Fusion
- algorithms instead. For example, the transform
algorithm does not actually
+ algorithms are lazy[10] and non sequence-type preserving [11]. This is by design. Runtime efficiency is given a high priority.
+ Like MPL, and
+ unlike STL,
+ fusion algorithms are mostly functional in nature such that algorithms are
+ non mutating (no side effects). However, due to the high cost of returning
+ full sequences such as vectors and lists, Views are returned
+ from Fusion algorithms instead. For example, the transform
algorithm does not actually
return a transformed version of the original sequence. transform
returns a transform_view
. This view holds a
reference to the original sequence plus the transform function. Iteration over
the transform_view
@@ -68,7 +66,7 @@
as we want without incurring a high runtime penalty.
@@ -91,7 +89,7 @@ functions to convert back to the original sequence type.
#include <boost/fusion/algorithm.hpp> @@ -99,15 +97,15 @@
[10]
- Except for some special cases such as for_each
and copy
which are inherently imperative
- algorithms.
-
[11] - What does that mean? It means that when you operate on a sequence through - a Fusion algorithm that returns a sequence, the sequence returned may not - be of the same class as the original -
[10]
+ Except for some special cases such as for_each
and copy
which are inherently imperative
+ algorithms.
+
[11] + What does that mean? It means that when you operate on a sequence through + a Fusion algorithm that returns a sequence, the sequence returned may not + be of the same class as the original +
- - Parameter - - |
+
- - Requirement - - |
+
- - Description - - |
+
---|---|---|
-
- |
+
- - A model of Forward - Sequence - - |
+
- - Operation's argument - - |
+
-
- |
+
- - Any type - - |
+
- - Initial state - - |
+
-
- |
+
-
- |
+
- - Operation's argument - - |
+
- -
+accumulate(seq, initial_state, f);
-
+ Return type: Any type +- Return type: Any type -
+ Semantics: Equivalent tof(...
+ f(f(initial_state,e1),e2) ...eN)
where e1 ...eN
+ are the consecutive elements of seq
.
+
+-
-
- Semantics: Equivalent to f(...
- f(f(initial_state,e1),e2) ...eN)
where e1 ...eN
- are the consecutive elements of seq
.
-
-
-
- Linear, exactly
applications of result_of::size
<Sequence>::valuef
.
-
- -
+ Linear, exactlyresult_of::size
<Sequence>::value
applications of f
.
+
+#include <boost/fusion/algorithm/iteration/accumulate.hpp> #include <boost/fusion/include/accumulate.hpp>- -
- -
+struct make_string
{
typedef std::string result_type;
@@ -233,8 +191,6 @@
const vector
<int,int> vec(1,2);
assert(accumulate(vec,std::string(""), make_string()) == "12");
--
diff --git a/doc/html/fusion/algorithm/iteration/functions/fold.html b/doc/html/fusion/algorithm/iteration/functions/fold.html index 63382db6..9d1b2a6c 100644 --- a/doc/html/fusion/algorithm/iteration/functions/fold.html +++ b/doc/html/fusion/algorithm/iteration/functions/fold.html @@ -26,35 +26,24 @@ + |
- - Parameter - - |
+
- - Requirement - - |
+
- - Description - - |
+
---|---|---|
-
- |
+
- - A model of Forward - Sequence - - |
+
- - Operation's argument - - |
+
-
- |
+
- - Any type - - |
+
- - Initial state - - |
+
-
- |
+
-
- |
+
- - Operation's argument - - |
+
- -
+fold(seq, initial_state, f);
-
+ Return type: Any type +- Return type: Any type -
+ Semantics: Equivalent tof(...
+ f(f(initial_state,e1),e2) ...eN)
where e1 ...eN
+ are the consecutive elements of seq
.
+
+-
-
- Semantics: Equivalent to f(...
- f(f(initial_state,e1),e2) ...eN)
where e1 ...eN
- are the consecutive elements of seq
.
-
-
-
- Linear, exactly
applications of result_of::size
<Sequence>::valuef
.
-
- -
+ Linear, exactlyresult_of::size
<Sequence>::value
applications of f
.
+
+#include <boost/fusion/algorithm/iteration/fold.hpp> #include <boost/fusion/include/fold.hpp>- -
- -
+struct make_string
{
typedef std::string result_type;
@@ -233,8 +191,6 @@
const vector
<int,int> vec(1,2);
assert(fold(vec,std::string(""), make_string()) == "12");
--
diff --git a/doc/html/fusion/algorithm/iteration/functions/for_each.html b/doc/html/fusion/algorithm/iteration/functions/for_each.html index 9d6c5da8..d8eaac42 100644 --- a/doc/html/fusion/algorithm/iteration/functions/for_each.html +++ b/doc/html/fusion/algorithm/iteration/functions/for_each.html @@ -27,14 +27,14 @@ for_each |
- - Parameter - - |
+
- - Requirement - - |
+
- - Description - - |
+
---|---|---|
-
- |
+
- - A model of Forward - Sequence - - |
+
- - Operation's argument - - |
+
-
- |
+
- - Any type - - |
+
- - Initial state - - |
+
-
- |
+
-
- |
+
- - Operation's argument - - |
+
- -
+iter_fold(seq, initial_state, f);
-
+ Return type: Any type +- Return type: Any type -
+ Semantics: Equivalent tof(...
+ f(f(initial_state,it1),it2) ...itN)
where it1 ...itN
+ are consecutive iterators on the elements of seq
.
+
+-
-
- Semantics: Equivalent to f(...
- f(f(initial_state,it1),it2) ...itN)
where it1 ...itN
- are consecutive iterators on the elements of seq
.
-
-
-
- Linear, exactly
applications of result_of::size
<Sequence>::valuef
.
-
- -
+ Linear, exactlyresult_of::size
<Sequence>::value
applications of f
.
+
+#include <boost/fusion/algorithm/iteration/iter_fold.hpp> #include <boost/fusion/include/iter_fold.hpp>- -
- -
+struct make_string
{
typedef std::string result_type;
@@ -233,8 +191,6 @@
const vector
<int,int> vec(1,2);
assert(iter_fold(vec,std::string(""), make_string()) == "12");
--
diff --git a/doc/html/fusion/algorithm/iteration/functions/reverse_fold.html b/doc/html/fusion/algorithm/iteration/functions/reverse_fold.html index 88e691d1..e11416ad 100644 --- a/doc/html/fusion/algorithm/iteration/functions/reverse_fold.html +++ b/doc/html/fusion/algorithm/iteration/functions/reverse_fold.html @@ -26,35 +26,24 @@ + |
- - Parameter - - |
+
- - Requirement - - |
+
- - Description - - |
+
---|---|---|
-
- |
+
- - A model of Bidirectional - Sequence - - |
+
- - Operation's argument - - |
+
-
- |
+
- - Any type - - |
+
- - Initial state - - |
+
-
- |
+
-
- |
+
- - Operation's argument - - |
+
- -
+reverse_fold(seq, initial_state, f);
-
+ Return type: Any type +- Return type: Any type -
+ Semantics: Equivalent tof(...
+ f(f(initial_state,eN),eN-1) ...e1)
where e1 ...eN
+ are the consecutive elements of seq
.
+
+-
-
- Semantics: Equivalent to f(...
- f(f(initial_state,eN),eN-1) ...e1)
where e1 ...eN
- are the consecutive elements of seq
.
-
-
-
- Linear, exactly
applications of result_of::size
<Sequence>::valuef
.
-
- -
+ Linear, exactlyresult_of::size
<Sequence>::value
applications of f
.
+
+#include <boost/fusion/algorithm/iteration/reverse_fold.hpp> #include <boost/fusion/include/reverse_fold.hpp>- -
- -
+struct make_string
{
typedef std::string result_type;
@@ -233,8 +191,6 @@
const vector
<int,int> vec(1,2);
assert(reverse_fold(vec,std::string(""), make_string()) == "21");
--
diff --git a/doc/html/fusion/algorithm/iteration/functions/reverse_iter_fold.html b/doc/html/fusion/algorithm/iteration/functions/reverse_iter_fold.html index c2487da7..950176bd 100644 --- a/doc/html/fusion/algorithm/iteration/functions/reverse_iter_fold.html +++ b/doc/html/fusion/algorithm/iteration/functions/reverse_iter_fold.html @@ -26,35 +26,24 @@ + |
- - Parameter - - |
+
- - Requirement - - |
+
- - Description - - |
+
---|---|---|
-
- |
+
- - A model of Bidirectional - Sequence - - |
+
- - Operation's argument - - |
+
-
- |
+
- - Any type - - |
+
- - Initial state - - |
+
-
- |
+
-
- |
+
- - Operation's argument - - |
+
- -
+reverse_iter_fold(seq, initial_state, f);
-
+ Return type: Any type +- Return type: Any type -
+ Semantics: Equivalent tof(...
+ f(f(initial_state,itN),itN-1) ...it1)
where it1 ...itN
+ are consecutive iterators on the elements of seq
.
+
+-
-
- Semantics: Equivalent to f(...
- f(f(initial_state,itN),itN-1) ...it1)
where it1
- ...itN
are consecutive iterators on the elements of seq
.
-
-
-
- Linear, exactly
applications of result_of::size
<Sequence>::valuef
.
-
- -
+ Linear, exactlyresult_of::size
<Sequence>::value
applications of f
.
+
+#include <boost/fusion/algorithm/iteration/reverse_iter_fold.hpp> #include <boost/fusion/include/reverse_iter_fold.hpp>- -
- -
+struct make_string
{
typedef std::string result_type;
@@ -233,8 +191,6 @@
const vector
<int,int> vec(1,2);
assert(reverse_iter_fold(vec,std::string(""), make_string()) == "21");
--
diff --git a/doc/html/fusion/algorithm/iteration/metafunctions/accumulate.html b/doc/html/fusion/algorithm/iteration/metafunctions/accumulate.html index ae3863dc..3ba4f7bd 100644 --- a/doc/html/fusion/algorithm/iteration/metafunctions/accumulate.html +++ b/doc/html/fusion/algorithm/iteration/metafunctions/accumulate.html @@ -26,28 +26,17 @@ + |
- - Parameter - - |
+
- - Requirement - - |
+
- - Description - - |
+
---|---|---|
-
- |
+
- - A model of Forward - Sequence - - |
+
- - The sequence to iterate - - |
+
-
- |
+
- - Any type - - |
+
-
- The initial state for the first application of |
+
-
- |
+
-
- |
+
- - The operation to be applied on traversal - - |
+
- -
+accumulate<Sequence, State, F>::type
-
+ Return type: Any type +- Return type: Any type -
+ Semantics: Returns the result of applying +accumulate
to a sequence of
+ type Sequence
, with an
+ initial state of type State
+ and binary function object or function pointer of type F
.
+
+-
-
- Semantics: Returns the result of applying
- accumulate
to a sequence of
- type Sequence
, with
- an initial state of type State
- and binary function object or function pointer of type F
.
-
-
-
- Linear, exactly
applications of result_of::size
<Sequence>::valueF
.
-
- -
+ Linear, exactlyresult_of::size
<Sequence>::value
applications of F
.
+
+#include <boost/fusion/algorithm/iteration/accumulate.hpp> #include <boost/fusion/include/accumulate.hpp>-
-
diff --git a/doc/html/fusion/algorithm/iteration/metafunctions/fold.html b/doc/html/fusion/algorithm/iteration/metafunctions/fold.html index 611e7d1f..9f539ed7 100644 --- a/doc/html/fusion/algorithm/iteration/metafunctions/fold.html +++ b/doc/html/fusion/algorithm/iteration/metafunctions/fold.html @@ -26,28 +26,17 @@ + |
- - Parameter - - |
+
- - Requirement - - |
+
- - Description - - |
+
---|---|---|
-
- |
+
- - A model of Forward - Sequence - - |
+
- - The sequence to iterate - - |
+
-
- |
+
- - Any type - - |
+
-
- The initial state for the first application of |
+
-
- |
+
-
- |
+
- - The operation to be applied on traversal - - |
+
- -
+fold<Sequence, State, F>::type
-
+ Return type: Any type +- Return type: Any type -
+ Semantics: Returns the result of applying +fold
to a sequence of type
+ Sequence
, with an initial
+ state of type State
and
+ binary function object or function pointer of type F
.
+
+-
-
- Semantics: Returns the result of applying
- fold
to a sequence of type
- Sequence
, with an initial
- state of type State
- and binary function object or function pointer of type F
.
-
-
-
- Linear, exactly
applications of result_of::size
<Sequence>::valueF
.
-
- -
+ Linear, exactlyresult_of::size
<Sequence>::value
applications of F
.
+
+#include <boost/fusion/algorithm/iteration/fold.hpp> #include <boost/fusion/include/fold.hpp>-
-
diff --git a/doc/html/fusion/algorithm/iteration/metafunctions/for_each.html b/doc/html/fusion/algorithm/iteration/metafunctions/for_each.html index 16925792..f583754e 100644 --- a/doc/html/fusion/algorithm/iteration/metafunctions/for_each.html +++ b/doc/html/fusion/algorithm/iteration/metafunctions/for_each.html @@ -31,11 +31,11 @@ return type of |
- - Parameter - - |
+
- - Requirement - - |
+
- - Description - - |
+
---|---|---|
-
- |
+
- - A model of Forward - Sequence - - |
+
- - The sequence to iterate - - |
+
-
- |
+
- - Any type - - |
+
-
- The initial state for the first application of |
+
-
- |
+
-
- |
+
- - The operation to be applied on traversal - - |
+
- -
+iter_fold<Sequence, State, F>::type
-
+ Return type: Any type +- Return type: Any type -
+ Semantics: Returns the result of applying +iter_fold
to a sequence of type
+ Sequence
, with an initial
+ state of type State
and
+ binary function object or function pointer of type F
.
+
+-
-
- Semantics: Returns the result of applying
- iter_fold
to a sequence of
- type Sequence
, with
- an initial state of type State
- and binary function object or function pointer of type F
.
-
-
-
- Linear, exactly
applications of result_of::size
<Sequence>::valueF
.
-
- -
+ Linear, exactlyresult_of::size
<Sequence>::value
applications of F
.
+
+#include <boost/fusion/algorithm/iteration/iter_fold.hpp> #include <boost/fusion/include/iter_fold.hpp>-
-
diff --git a/doc/html/fusion/algorithm/iteration/metafunctions/reverse_fold.html b/doc/html/fusion/algorithm/iteration/metafunctions/reverse_fold.html index 53668e3e..e2c8f622 100644 --- a/doc/html/fusion/algorithm/iteration/metafunctions/reverse_fold.html +++ b/doc/html/fusion/algorithm/iteration/metafunctions/reverse_fold.html @@ -26,28 +26,17 @@ + |
- - Parameter - - |
+
- - Requirement - - |
+
- - Description - - |
+
---|---|---|
-
- |
+
- - A model of Bidirectional - Sequence - - |
+
- - The sequence to iterate - - |
+
-
- |
+
- - Any type - - |
+
-
- The initial state for the first application of |
+
-
- |
+
-
- |
+
- - The operation to be applied on traversal - - |
+
- -
+reverse_fold<Sequence, State, F>::type
-
+ Return type: Any type +- Return type: Any type -
+ Semantics: Returns the result of applying +reverse_fold
to a sequence of
+ type Sequence
, with an
+ initial state of type State
+ and binary function object or function pointer of type F
.
+
+-
-
- Semantics: Returns the result of applying
- reverse_fold
to a sequence
- of type Sequence
, with
- an initial state of type State
- and binary function object or function pointer of type F
.
-
-
-
- Linear, exactly
applications of result_of::size
<Sequence>::valueF
.
-
- -
+ Linear, exactlyresult_of::size
<Sequence>::value
applications of F
.
+
+#include <boost/fusion/algorithm/iteration/reverse_fold.hpp> #include <boost/fusion/include/reverse_fold.hpp>-
-
diff --git a/doc/html/fusion/algorithm/iteration/metafunctions/reverse_iter_fold.html b/doc/html/fusion/algorithm/iteration/metafunctions/reverse_iter_fold.html index 2de292af..4b32b3ae 100644 --- a/doc/html/fusion/algorithm/iteration/metafunctions/reverse_iter_fold.html +++ b/doc/html/fusion/algorithm/iteration/metafunctions/reverse_iter_fold.html @@ -26,28 +26,17 @@ + |
- - Parameter - - |
+
- - Requirement - - |
+
- - Description - - |
+
---|---|---|
-
- |
+
- - A model of Bidirectional - Sequence - - |
+
- - The sequence to iterate - - |
+
-
- |
+
- - Any type - - |
+
-
- The initial state for the first application of |
+
-
- |
+
-
- |
+
- - The operation to be applied on traversal - - |
+
- -
+reverse_iter_fold<Sequence, State, F>::type
-
+ Return type: Any type +- Return type: Any type -
+ Semantics: Returns the result of applying +reverse_iter_fold
to a sequence
+ of type Sequence
, with
+ an initial state of type State
+ and binary function object or function pointer of type F
.
+
+-
-
- Semantics: Returns the result of applying
- reverse_iter_fold
to a sequence
- of type Sequence
, with
- an initial state of type State
- and binary function object or function pointer of type F
.
-
-
-
- Linear, exactly
applications of result_of::size
<Sequence>::valueF
.
-
- -
+ Linear, exactlyresult_of::size
<Sequence>::value
applications of F
.
+
+#include <boost/fusion/algorithm/iteration/reverse_iter_fold.hpp> #include <boost/fusion/include/reverse_iter_fold.hpp>-
-
diff --git a/doc/html/fusion/algorithm/query.html b/doc/html/fusion/algorithm/query.html index abd788e2..b9ebb3c3 100644 --- a/doc/html/fusion/algorithm/query.html +++ b/doc/html/fusion/algorithm/query.html @@ -34,7 +34,7 @@ The query algorithms provide support for searching and analyzing sequences. |
#include <boost/fusion/algorithm/transformation.hpp> diff --git a/doc/html/fusion/algorithm/transformation/functions/clear.html b/doc/html/fusion/algorithm/transformation/functions/clear.html index 7e218fa9..d24d232a 100644 --- a/doc/html/fusion/algorithm/transformation/functions/clear.html +++ b/doc/html/fusion/algorithm/transformation/functions/clear.html @@ -27,14 +27,14 @@ clear- + Description
clear
returns an empty sequence.- + Synposis
template< @@ -43,7 +43,7 @@ typenameresult_of::clear
<Sequence const>::type clear(Sequence const& seq);- + Expression Semantics
@@ -103,21 +103,21 @@ with no elements.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/clear.hpp> #include <boost/fusion/include/clear.hpp>- + Example
assert(clear
(make_vector
(1,2,3)) ==make_vector
()); diff --git a/doc/html/fusion/algorithm/transformation/functions/erase.html b/doc/html/fusion/algorithm/transformation/functions/erase.html index c4dff429..45256962 100644 --- a/doc/html/fusion/algorithm/transformation/functions/erase.html +++ b/doc/html/fusion/algorithm/transformation/functions/erase.html @@ -27,7 +27,7 @@ erase- + Description
@@ -35,7 +35,7 @@ those at a specified iterator, or between two iterators.
- + Synposis
template< @@ -54,7 +54,7 @@ Sequence const& seq, First const& it1, Last const& it2);- + Expression Semantics
@@ -149,15 +149,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifseq
- implements the Associative - Sequence model. -seq
+ implements the Associative + Sequence model. +Semantics: Returns a new sequence, containing @@ -171,15 +171,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifseq
- implements the Associative - Sequence model. -seq
+ implements the Associative + Sequence model. +Semantics: Returns a new sequence, with @@ -187,21 +187,21 @@ in their original order, except those in the range [
first
,last
).- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/erase.hpp> #include <boost/fusion/include/erase.hpp>- + Example
constvector
<int, double, char> vec(1, 2.0, 'c'); diff --git a/doc/html/fusion/algorithm/transformation/functions/erase_key.html b/doc/html/fusion/algorithm/transformation/functions/erase_key.html index 5e325928..d63fd4ad 100644 --- a/doc/html/fusion/algorithm/transformation/functions/erase_key.html +++ b/doc/html/fusion/algorithm/transformation/functions/erase_key.html @@ -27,7 +27,7 @@ erase_key- + Description
@@ -39,7 +39,7 @@ key.
- + Synposis
template< @@ -49,7 +49,7 @@ typenameresult_of::erase_key
<Sequence const, Key>::type erase_key(Sequence const& seq);- + Expression Semantics
@@ -131,21 +131,21 @@ except those with keyKey
.- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/erase_key.hpp> #include <boost/fusion/include/erase_key.hpp>- + Example
assert(erase_key
<int>(make_map
<int, long>('a', 'b')) ==make_map
<long>('b')); diff --git a/doc/html/fusion/algorithm/transformation/functions/filter.html b/doc/html/fusion/algorithm/transformation/functions/filter.html index 81b93812..b45753d0 100644 --- a/doc/html/fusion/algorithm/transformation/functions/filter.html +++ b/doc/html/fusion/algorithm/transformation/functions/filter.html @@ -27,7 +27,7 @@ filter- + Description
@@ -35,7 +35,7 @@ the elements of a specified type.
- + Synopsis
template< @@ -45,7 +45,7 @@ typenameresult_of::filter
<Sequence const, T>::type filter(Sequence const& seq);- + Expression Semantics
@@ -120,15 +120,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifseq
- implements the Associative - Sequence model. -seq
+ implements the Associative + Sequence model. +Semantics: Returns a sequence containing @@ -137,21 +137,21 @@ to
.
filter_if
<boost::same_type<_, T> >(seq)- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/filter.hpp> #include <boost/fusion/include/filter.hpp>- + Example
constvector
<int,int,long,long> vec(1,2,3,4); diff --git a/doc/html/fusion/algorithm/transformation/functions/filter_if.html b/doc/html/fusion/algorithm/transformation/functions/filter_if.html index e86b3933..4605984d 100644 --- a/doc/html/fusion/algorithm/transformation/functions/filter_if.html +++ b/doc/html/fusion/algorithm/transformation/functions/filter_if.html @@ -27,7 +27,7 @@ filter_if- + Description
@@ -36,7 +36,7 @@ Lambda Expression evaluates to
boost::mpl::true_
.- + Synopsis
template< @@ -46,7 +46,7 @@ typenameresult_of::filter_if
<Sequence const, Pred>::type filter_if(Sequence const& seq);- + Expression Semantics
@@ -122,15 +122,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifseq
- implements the Associative - Sequence model. -seq
+ implements the Associative + Sequence model. +Semantics: Returns a sequence containing @@ -140,21 +140,21 @@ is the same as in the original sequence.
- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/filter_if.hpp> #include <boost/fusion/include/filter_if.hpp>- + Example
constvector
<int,int,double,double> vec(1,2,3.0,4.0); diff --git a/doc/html/fusion/algorithm/transformation/functions/insert.html b/doc/html/fusion/algorithm/transformation/functions/insert.html index 2e7958c5..a82b79ec 100644 --- a/doc/html/fusion/algorithm/transformation/functions/insert.html +++ b/doc/html/fusion/algorithm/transformation/functions/insert.html @@ -27,7 +27,7 @@ insert- + Description
@@ -35,7 +35,7 @@ element inserted the position described by a given iterator.
- + Synposis
template< @@ -47,7 +47,7 @@ Sequence const& seq, Pos const& pos, T const& t);- + Expression Semantics
@@ -139,9 +139,9 @@ Return type:+ A model of Forward + Sequence. +
- - A model of Forward - Sequence. -
Semantics: Returns a new sequence, containing all the elements of
seq
, @@ -150,21 +150,21 @@pos
.- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/insert.hpp> #include <boost/fusion/include/insert.hpp>- + Example
constvector
<int,int> vec(1,2); diff --git a/doc/html/fusion/algorithm/transformation/functions/insert_range.html b/doc/html/fusion/algorithm/transformation/functions/insert_range.html index 1fd76288..35454bd4 100644 --- a/doc/html/fusion/algorithm/transformation/functions/insert_range.html +++ b/doc/html/fusion/algorithm/transformation/functions/insert_range.html @@ -27,7 +27,7 @@ insert_range- + Description
@@ -35,7 +35,7 @@ iterator.
- + Synposis
template< @@ -47,7 +47,7 @@ Sequence const& seq, Pos const& pos, Range const& range);- + Expression Semantics
@@ -141,15 +141,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifseq
- implements the Associative - Sequence model. -seq
+ implements the Associative + Sequence model. +Semantics: Returns a new sequence, containing @@ -159,21 +159,21 @@ All elements retaining their ordering from the orignal sequences.
- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/insert_range.hpp> #include <boost/fusion/include/insert_range.hpp>- + Example
constvector
<int,int> vec(1,2); diff --git a/doc/html/fusion/algorithm/transformation/functions/join.html b/doc/html/fusion/algorithm/transformation/functions/join.html index 2b7159d9..bf925950 100644 --- a/doc/html/fusion/algorithm/transformation/functions/join.html +++ b/doc/html/fusion/algorithm/transformation/functions/join.html @@ -27,7 +27,7 @@ join- + Description
@@ -35,7 +35,7 @@ first followed by the elements of the second.
- + Synopsis
template< @@ -44,7 +44,7 @@ typenameresult_of::join
<LhSequence, RhSequence>::type join(LhSequence const& lhs, RhSequence const& rhs);- + Expression Semantics
@@ -120,16 +120,16 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence iflhs
- andrhs
implement the - Associative - Sequence model. -lhs
+ andrhs
implement + the Associative + Sequence model. +Semantics: Returns a sequence containing @@ -138,21 +138,21 @@ The order of the elements is preserved.
- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/join.hpp> #include <boost/fusion/include/join.hpp>- + Example
vector
<int,char> v1(1, 'a'); diff --git a/doc/html/fusion/algorithm/transformation/functions/pop_back.html b/doc/html/fusion/algorithm/transformation/functions/pop_back.html index db1c16a2..2f2605e0 100644 --- a/doc/html/fusion/algorithm/transformation/functions/pop_back.html +++ b/doc/html/fusion/algorithm/transformation/functions/pop_back.html @@ -27,14 +27,14 @@ pop_back- + Description
Returns a new sequence, with the last element of the original removed.
- + Synopsis
template< @@ -43,7 +43,7 @@ typenameresult_of::pop_back
<Sequence const>::type pop_back(Sequence const& seq);- + Expression Semantics
@@ -99,15 +99,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifseq
- implements the Associative - Sequence model. -seq
+ implements the Associative + Sequence model. +Semantics: Returns a new sequence containing @@ -116,21 +116,21 @@ same order as they were in
seq
.- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/pop_back.hpp> #include <boost/fusion/include/pop_back.hpp>- + Example
assert(___pop_back__(make_vector
(1,2,3)) ==make_vector
(1,2)); diff --git a/doc/html/fusion/algorithm/transformation/functions/pop_front.html b/doc/html/fusion/algorithm/transformation/functions/pop_front.html index edddb5ab..06ffd2a5 100644 --- a/doc/html/fusion/algorithm/transformation/functions/pop_front.html +++ b/doc/html/fusion/algorithm/transformation/functions/pop_front.html @@ -27,14 +27,14 @@ pop_front- + Description
Returns a new sequence, with the first element of the original removed.
- + Synopsis
template< @@ -43,7 +43,7 @@ typenameresult_of::pop_front
<Sequence const>::type pop_front(Sequence const& seq);- + Expression Semantics
@@ -99,15 +99,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifseq
- implements the Associative - Sequence model. -seq
+ implements the Associative + Sequence model. +Semantics: Returns a new sequence containing @@ -116,21 +116,21 @@ same order as they were in
seq
.- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/pop_front.hpp> #include <boost/fusion/include/pop_front.hpp>- + Example
assert(pop_front
(make_vector
(1,2,3)) ==make_vector
(2,3)); diff --git a/doc/html/fusion/algorithm/transformation/functions/push_back.html b/doc/html/fusion/algorithm/transformation/functions/push_back.html index fbc1bd58..5e5069e3 100644 --- a/doc/html/fusion/algorithm/transformation/functions/push_back.html +++ b/doc/html/fusion/algorithm/transformation/functions/push_back.html @@ -27,14 +27,14 @@ push_back- + Description
Returns a new sequence with an element added at the end.
- + Synopsis
template< @@ -45,7 +45,7 @@ Sequence const& seq, T const& t);- + Expression Semantics
@@ -119,9 +119,9 @@ Return type:+ A model of Forward + Sequence. +
- - A model of Forward - Sequence. -
Semantics: Returns a new sequence, containing all the elements of
seq
, @@ -129,21 +129,21 @@ to the end. The elements are in the same order as they were inseq
.- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/push_back.hpp> #include <boost/fusion/include/push_back.hpp>- + Example
assert(push_back
(make_vector
(1,2,3),4) ==make_vector
(1,2,3,4)); diff --git a/doc/html/fusion/algorithm/transformation/functions/push_front.html b/doc/html/fusion/algorithm/transformation/functions/push_front.html index 853f8352..bf3f87d7 100644 --- a/doc/html/fusion/algorithm/transformation/functions/push_front.html +++ b/doc/html/fusion/algorithm/transformation/functions/push_front.html @@ -27,14 +27,14 @@ push_front- + Description
Returns a new sequence with an element added at the beginning.
- + Synopsis
template< @@ -45,7 +45,7 @@ Sequence const& seq, T const& t);- + Expression Semantics
@@ -119,9 +119,9 @@ Return type:+ A model of Forward + Sequence. +
- - A model of Forward - Sequence. -
Semantics: Returns a new sequence, containing all the elements of
seq
, @@ -130,21 +130,21 @@seq
.- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/push_front.hpp> #include <boost/fusion/include/push_front.hpp>- + Example
assert(push_front
(make_vector
(1,2,3),0) ==make_vector
(0,1,2,3)); diff --git a/doc/html/fusion/algorithm/transformation/functions/remove.html b/doc/html/fusion/algorithm/transformation/functions/remove.html index 5d192f1d..be996a35 100644 --- a/doc/html/fusion/algorithm/transformation/functions/remove.html +++ b/doc/html/fusion/algorithm/transformation/functions/remove.html @@ -27,7 +27,7 @@ remove- + Description
@@ -35,7 +35,7 @@ except those of a given type.
- + Synopsis
template< @@ -45,7 +45,7 @@ typenameresult_of::remove
<Sequence const, T>::type replace(Sequence const& seq);- + Expression Semantics
@@ -120,15 +120,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a new sequence, containing @@ -137,21 +137,21 @@ Equivalent to
.
remove_if
<boost::is_same<_,T> >(seq)- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/remove.hpp> #include <boost/fusion/include/remove.hpp>- + Example
constvector
<int,double> vec(1,2.0); diff --git a/doc/html/fusion/algorithm/transformation/functions/remove_if.html b/doc/html/fusion/algorithm/transformation/functions/remove_if.html index 3fc8936b..fabb95a0 100644 --- a/doc/html/fusion/algorithm/transformation/functions/remove_if.html +++ b/doc/html/fusion/algorithm/transformation/functions/remove_if.html @@ -27,7 +27,7 @@ remove_if- + Description
@@ -35,7 +35,7 @@ those where a given unary function object evaluates to
true
.- + Synopsis
template< @@ -45,7 +45,7 @@ typenameresult_of::remove_if
<Sequence const, Pred>::type remove_if(Sequence const& seq);- + Expression Semantics
@@ -121,15 +121,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifseq
- implements the Associative - Sequence model. -seq
+ implements the Associative + Sequence model. +Semantics: Returns a new sequence, containing @@ -139,21 +139,21 @@ >(seq).
- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/remove_if.hpp> #include <boost/fusion/include/remove_if.hpp>- + Example
constvector
<int,double> vec(1,2.0); diff --git a/doc/html/fusion/algorithm/transformation/functions/replace.html b/doc/html/fusion/algorithm/transformation/functions/replace.html index 653c3c61..327000ee 100644 --- a/doc/html/fusion/algorithm/transformation/functions/replace.html +++ b/doc/html/fusion/algorithm/transformation/functions/replace.html @@ -27,7 +27,7 @@ replace- + Description
@@ -35,7 +35,7 @@ a new value.
- + Synopsis
template< @@ -46,7 +46,7 @@ Sequence const& seq, T const& old_value, T const& new_value);- + Expression Semantics
@@ -149,21 +149,21 @@ to elements with the same type and equal toold_value
.- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/replace.hpp> #include <boost/fusion/include/replace.hpp>- + Example
assert(replace
(make_vector
(1,2), 2, 3) ==make_vector
(1,3)); diff --git a/doc/html/fusion/algorithm/transformation/functions/replace_if.html b/doc/html/fusion/algorithm/transformation/functions/replace_if.html index 2bbaa865..b5d2a2df 100644 --- a/doc/html/fusion/algorithm/transformation/functions/replace_if.html +++ b/doc/html/fusion/algorithm/transformation/functions/replace_if.html @@ -27,7 +27,7 @@ replace_if- + Description
@@ -36,7 +36,7 @@ replaced with a new value.
- + Synopsis
template< @@ -47,7 +47,7 @@ Sequence const& seq, F f, T const& new_value);- + Expression Semantics
@@ -149,21 +149,21 @@ evaluates totrue
.- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/replace_if.hpp> #include <boost/fusion/include/replace_if.hpp>- + Example
struct odd diff --git a/doc/html/fusion/algorithm/transformation/functions/reverse.html b/doc/html/fusion/algorithm/transformation/functions/reverse.html index 40a6991e..1032b5fd 100644 --- a/doc/html/fusion/algorithm/transformation/functions/reverse.html +++ b/doc/html/fusion/algorithm/transformation/functions/reverse.html @@ -27,14 +27,14 @@ reverse- + Description
Returns a new sequence with the elements of the original in reverse order.
- + Synposis
template< @@ -43,7 +43,7 @@ typenameresult_of::reverse
<Sequence const>::type reverse(Sequence const& seq);- + Expression Semantics
@@ -99,20 +99,20 @@
- - A model of Bidirectional - Sequence if
+ A model of Bidirectional + Sequence ifseq
- is a Bidirectional - Sequence else, Random - Access Sequence ifseq
- is a Random - Access Sequence. -seq
+ is a Bidirectional + Sequence else, Random + Access Sequence ifseq
+ is a Random + Access Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifseq
- implements the Associative - Sequence model. -seq
+ implements the Associative + Sequence model. +Semantics: Returns a new sequence containing @@ -120,21 +120,21 @@ in reverse order.
- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/reverse.hpp> #include <boost/fusion/include/reverse.hpp>- + Example
assert(reverse
(make_vector
(1,2,3)) ==make_vector
(3,2,1)); diff --git a/doc/html/fusion/algorithm/transformation/functions/transform.html b/doc/html/fusion/algorithm/transformation/functions/transform.html index 9b043708..a7b245d9 100644 --- a/doc/html/fusion/algorithm/transformation/functions/transform.html +++ b/doc/html/fusion/algorithm/transformation/functions/transform.html @@ -27,7 +27,7 @@ transform- + Description
@@ -38,7 +38,7 @@ of
seq
.- + Unary version synopsis
@@ -50,7 +50,7 @@ Sequence const& seq, F f);- + Expression Semantics
@@ -134,7 +134,7 @@ withinseq
.- + Binary version synopsis
@@ -147,7 +147,7 @@ Sequence1 const& seq1, Sequence2 const& seq2, F f);-Table 1.67. Parameters
+Table 1.67. Parameters
@@ -244,21 +244,21 @@ within seq1
andseq2
respectively.- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/transform.hpp> #include <boost/fusion/include/transform.hpp>- + Example
struct triple diff --git a/doc/html/fusion/algorithm/transformation/functions/zip.html b/doc/html/fusion/algorithm/transformation/functions/zip.html index 5b4131e9..5f19dca4 100644 --- a/doc/html/fusion/algorithm/transformation/functions/zip.html +++ b/doc/html/fusion/algorithm/transformation/functions/zip.html @@ -27,7 +27,7 @@ zip- + Description
@@ -35,7 +35,7 @@ of the members of the component sequences.
- + Synopsis
template< @@ -48,7 +48,7 @@ zip(Sequence1 const& seq1, Sequence2 const& seq2, ... SequenceN const& seqN);- + Expression Semantics
@@ -114,21 +114,21 @@ 'c'))- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/zip.hpp> #include <boost/fusion/include/zip.hpp>- + Example
vector
<int,char> v1(1, 'a'); diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/clear.html b/doc/html/fusion/algorithm/transformation/metafunctions/clear.html index 256c42c0..7bdc4acc 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/clear.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/clear.html @@ -27,7 +27,7 @@ clear- + Description
@@ -35,7 +35,7 @@ type.
- + Synopsis
template< @@ -47,7 +47,7 @@ };- + Expression Semantics
@@ -105,14 +105,14 @@ Semantics: Returns an empty sequence.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/clear.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/erase.html b/doc/html/fusion/algorithm/transformation/metafunctions/erase.html index 78530cb0..8683bff0 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/erase.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/erase.html @@ -31,11 +31,11 @@ and range delimiting iterator types.- + Description
- + Synopsis
template< @@ -48,7 +48,7 @@ };- + Expression Semantics
@@ -142,15 +142,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a new sequence with @@ -168,14 +168,14 @@ and
It2
removed.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/erase.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/erase_key.html b/doc/html/fusion/algorithm/transformation/metafunctions/erase_key.html index 3cd47c6b..466e7136 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/erase_key.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/erase_key.html @@ -27,7 +27,7 @@ erase_key- + Description
@@ -35,7 +35,7 @@ and key types.
- + Synopsis
template< @@ -48,7 +48,7 @@ };- + Expression Semantics
@@ -130,14 +130,14 @@ except those with keyKey
.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/erase_key.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/filter.html b/doc/html/fusion/algorithm/transformation/metafunctions/filter.html index 53bdc0f5..d0d15b47 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/filter.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/filter.html @@ -27,7 +27,7 @@ filter- + Description
@@ -35,7 +35,7 @@ and type to retain.
- + Synopsis
template< @@ -48,7 +48,7 @@ };- + Expression Semantics
@@ -123,15 +123,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a sequence containing @@ -141,14 +141,14 @@ boost::is_same<mpl::_, T> >::type.
- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/filter.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/filter_if.html b/doc/html/fusion/algorithm/transformation/metafunctions/filter_if.html index cf4945a1..05cdef1b 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/filter_if.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/filter_if.html @@ -27,7 +27,7 @@ filter_if- + Description
@@ -36,7 +36,7 @@ Lambda Expression predicate type.
- + Synopsis
template< @@ -49,7 +49,7 @@ };- + Expression Semantics
@@ -125,15 +125,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a sequence containing @@ -142,14 +142,14 @@ to
boost::mpl::true_
.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/filter_if.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/insert.html b/doc/html/fusion/algorithm/transformation/metafunctions/insert.html index de7a2a9b..10095f3c 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/insert.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/insert.html @@ -27,7 +27,7 @@ insert- + Description
@@ -35,7 +35,7 @@ position iterator and insertion types.
- + Synopsis
template< @@ -49,7 +49,7 @@ };- + Expression Semantics
@@ -141,9 +141,9 @@ Return type:+ A model of Forward + Sequence. +
- - A model of Forward - Sequence. -
Semantics: Returns a sequence with an element of type
T
inserted @@ -151,14 +151,14 @@ inSequence
.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/insert.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/insert_range.html b/doc/html/fusion/algorithm/transformation/metafunctions/insert_range.html index 950c3e5f..c65afda1 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/insert_range.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/insert_range.html @@ -27,7 +27,7 @@ insert_range- + Description
@@ -35,7 +35,7 @@ sequence, position iterator and insertion range types.
- + Synopsis
template< @@ -49,7 +49,7 @@ };- + Expression Semantics
@@ -143,15 +143,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a sequence with the @@ -160,14 +160,14 @@ into
Sequence
.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/insert_range.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/join.html b/doc/html/fusion/algorithm/transformation/metafunctions/join.html index b5f185c0..b1d2f82c 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/join.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/join.html @@ -27,14 +27,14 @@ join- + Description
Returns the result of joining 2 sequences, given the sequence types.
- + Synopsis
template< @@ -47,7 +47,7 @@ };- + Expression Semantics
@@ -58,16 +58,16 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifLhSequence
- amdRhSequence
implement - the Associative - Sequence model. -LhSequence
+ amdRhSequence
implement + the Associative + Sequence model. +Semantics: Returns a sequence containing @@ -76,14 +76,14 @@ The order of the elements in the 2 sequences is preserved.
- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/join.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/pop_back.html b/doc/html/fusion/algorithm/transformation/metafunctions/pop_back.html index 83f270b1..d80e4a6c 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/pop_back.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/pop_back.html @@ -27,7 +27,7 @@ pop_back- + Description
@@ -35,7 +35,7 @@ type.
- + Synopsis
template< @@ -47,7 +47,7 @@ };- + Expression Semantics
@@ -103,15 +103,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a sequence with all @@ -119,14 +119,14 @@ except the last element.
- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/pop_back.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/pop_front.html b/doc/html/fusion/algorithm/transformation/metafunctions/pop_front.html index def63af6..e7b00290 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/pop_front.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/pop_front.html @@ -27,7 +27,7 @@ pop_front- + Description
@@ -35,7 +35,7 @@ type.
- + Synopsis
template< @@ -47,7 +47,7 @@ };- + Expression Semantics
@@ -103,15 +103,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a sequence with all @@ -119,14 +119,14 @@ except the first element.
- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/pop_front.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/push_back.html b/doc/html/fusion/algorithm/transformation/metafunctions/push_back.html index c1ef4eea..f4bfdfe8 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/push_back.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/push_back.html @@ -27,7 +27,7 @@ push_back- + Description
@@ -35,7 +35,7 @@ the input sequence and element to push.
- + Synopsis
template< @@ -48,7 +48,7 @@ };- + Expression Semantics
@@ -122,9 +122,9 @@ Return type:+ A model of Forward + Sequence. +
- - A model of Forward - Sequence. -
Semantics: Returns a sequence with the elements of
Sequence
@@ -132,14 +132,14 @@ added to the end.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/push_back.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/push_front.html b/doc/html/fusion/algorithm/transformation/metafunctions/push_front.html index 6db21dec..eed04014 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/push_front.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/push_front.html @@ -27,7 +27,7 @@ push_front- + Description
@@ -35,7 +35,7 @@ of the input sequence and element to push.
- + Synopsis
template< @@ -48,7 +48,7 @@ };- + Expression Semantics
@@ -122,9 +122,9 @@ Return type:+ A model of Forward + Sequence. +
- - A model of Forward - Sequence. -
Semantics: Returns a sequence with the elements of
Sequence
@@ -132,14 +132,14 @@ added to the beginning.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/push_front.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/remove.html b/doc/html/fusion/algorithm/transformation/metafunctions/remove.html index 604b42f6..f364684a 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/remove.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/remove.html @@ -27,7 +27,7 @@ remove- + Description
@@ -35,7 +35,7 @@ removal types.
- + Synopsis
template< @@ -48,7 +48,7 @@ };- + Expression Semantics
@@ -123,15 +123,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a sequence containing @@ -141,14 +141,14 @@ boost::is_same<mpl::_, T> >::type.
- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/remove.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/remove_if.html b/doc/html/fusion/algorithm/transformation/metafunctions/remove_if.html index c4c171a9..fcd56ca2 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/remove_if.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/remove_if.html @@ -27,7 +27,7 @@ remove_if- + Description
@@ -36,7 +36,7 @@ Lambda Expression predicate types.
- + Synopsis
template< @@ -49,7 +49,7 @@ };- + Expression Semantics
@@ -125,15 +125,15 @@
- - A model of Forward - Sequence. -
+ A model of Forward + Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a sequence containing @@ -142,14 +142,14 @@ to
boost::mpl::false_
.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/remove_if.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/replace.html b/doc/html/fusion/algorithm/transformation/metafunctions/replace.html index a54e4966..112d249b 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/replace.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/replace.html @@ -27,7 +27,7 @@ replace- + Description
@@ -35,7 +35,7 @@ the input sequence and element to replace.
- + Synopsis
template< @@ -48,7 +48,7 @@ };- + Expression Semantics
@@ -127,14 +127,14 @@replace
.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/replace.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/replace_if.html b/doc/html/fusion/algorithm/transformation/metafunctions/replace_if.html index 548eb6ec..9e6f62ec 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/replace_if.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/replace_if.html @@ -27,7 +27,7 @@ replace_if- + Description
@@ -36,7 +36,7 @@ Function Object predicate and replacement object.
- + Synopsis
template< @@ -49,7 +49,7 @@ };- + Expression Semantics
@@ -146,14 +146,14 @@replace_if
.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/replace_if.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/reverse.html b/doc/html/fusion/algorithm/transformation/metafunctions/reverse.html index 80066844..a83c47a2 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/reverse.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/reverse.html @@ -27,7 +27,7 @@ reverse- + Description
@@ -35,7 +35,7 @@ type.
- + Synopsis
template< @@ -47,7 +47,7 @@ };- + Expression Semantics
@@ -103,34 +103,34 @@
- - A model of Bidirectional - Sequence if
+ A model of Bidirectional + Sequence ifSequence
- is a Bidirectional - Sequence else, Random - Access Sequence ifSequence
- is a Random - Access Sequence. -Sequence
+ is a Bidirectional + Sequence else, Random + Access Sequence ifSequence
+ is a Random + Access Sequence. +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a sequence with the elements in the reverse order to
Sequence
.- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/reverse.hpp> diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/transform.html b/doc/html/fusion/algorithm/transformation/metafunctions/transform.html index 35ae0aa4..940ee1f0 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/transform.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/transform.html @@ -27,7 +27,7 @@ transform- + Description
@@ -38,7 +38,7 @@ of
seq
.- + Unary version synopsis
@@ -50,7 +50,7 @@ Sequence const& seq, F f);- + Expression Semantics
@@ -129,15 +129,15 @@
- - A model of Forward - Sequence -
+ A model of Forward + Sequence +- - A model of Associative - Sequence if
+ A model of Associative + Sequence ifSequence
- implements the Associative - Sequence model. -Sequence
+ implements the Associative + Sequence model. +Semantics: Returns a new sequence, containing @@ -145,7 +145,7 @@ within
seq
.- + Binary version synopsis
@@ -158,7 +158,7 @@ Sequence1 const& seq1, Sequence2 const& seq2, F f);-diff --git a/doc/html/fusion/extension/ext_full.html b/doc/html/fusion/extension/ext_full.html index a041fdfe..3bd04ac0 100644 --- a/doc/html/fusion/extension/ext_full.html +++ b/doc/html/fusion/extension/ext_full.html @@ -24,7 +24,7 @@Table 1.87. Parameters
+Table 1.87. Parameters
@@ -255,21 +255,21 @@ within seq1
andseq2
respectively.- + Complexity
Constant. Returns a view which is lazily evaluated.
- + Header
#include <boost/fusion/algorithm/transformation/transform.hpp> #include <boost/fusion/include/transform.hpp>- + Example
struct triple diff --git a/doc/html/fusion/algorithm/transformation/metafunctions/zip.html b/doc/html/fusion/algorithm/transformation/metafunctions/zip.html index 002d89ff..92d8e1ee 100644 --- a/doc/html/fusion/algorithm/transformation/metafunctions/zip.html +++ b/doc/html/fusion/algorithm/transformation/metafunctions/zip.html @@ -27,7 +27,7 @@ zip- + Description
@@ -35,7 +35,7 @@ of the members of the component sequences.
- + Synopsis
template< @@ -50,7 +50,7 @@ };- + Expression Semantics
@@ -72,14 +72,14 @@ 'c'))- + Complexity
Constant.
- + Header
#include <boost/fusion/algorithm/transformation/zip.hpp> diff --git a/doc/html/fusion/change_log.html b/doc/html/fusion/change_log.html index 8afaa06b..3e8710f0 100644 --- a/doc/html/fusion/change_log.html +++ b/doc/html/fusion/change_log.html @@ -31,66 +31,68 @@
- - Sep 27, 2006: Added
+ Sep 27, 2006: Addedboost::tuple
- support. (Joel de Guzman) -boost::tuple
+ support. (Joel de Guzman) +- - Nov 17, 2006: Added
+ Nov 17, 2006: Addedboost::variant
- support. (Joel de Guzman) -boost::variant
+ support. (Joel de Guzman) +- - Feb 15, 2007: Added functional module. (Tobias Schwinger) -
+ Feb 15, 2007: Added functional module. (Tobias Schwinger) +- - April 2, 2007: Added struct adapter. (Joel de Guzman) -
+ April 2, 2007: Added struct adapter. (Joel de Guzman) +- - May 8, 2007: Added associative struct adapter. (Dan Marsden) -
+ May 8, 2007: Added associative struct adapter. (Dan Marsden) +- - Dec 20, 2007: Removed
+ Dec 20, 2007: Removedboost::variant
- support. After thorough investigation, I think now that the move to make - variant a fusion sequence is rather quirky. A variant will always have a - size==1 regardless of the number of types it can contain and there's no way - to know at compile time what it contains. Iterating over its types is simply - wrong. All these imply that the variant is not - a fusion sequence. (Joel de Guzman) -boost::variant
+ support. After thorough investigation, I think now that the move to make + variant a fusion sequence is rather quirky. A variant will always have + a size==1 regardless of the number of types it can contain and there's + no way to know at compile time what it contains. Iterating over its types + is simply wrong. All these imply that the variant is not + a fusion sequence. (Joel de Guzman) +- - Oct 12, 2009: The accumulator is the first argument to the functor of
+ Oct 12, 2009: The accumulator is the first argument to the functor of +fold
- andaccumulate
. (Christopher Schmidt) -fold
andaccumulate
. (Christopher Schmidt) +- - Oct 30, 2009: Added support for associative iterators and views. (Christopher - Schmidt) -
+ Oct 30, 2009: Added support for associative iterators and views. (Christopher + Schmidt) +- - March 1, 2010: Added
+ March 1, 2010: AddedBOOST_FUSION_ADAPT_STRUCT_NAMED
- andBOOST_FUSION_ADAPT_STRUCT_NAMED_NS
- (Hartmut Kaiser) -BOOST_FUSION_ADAPT_STRUCT_NAMED
+ andBOOST_FUSION_ADAPT_STRUCT_NAMED_NS
+ (Hartmut Kaiser) +- - April 4, 2010: Added array support, -
+ April 4, 2010: Added array + support,BOOST_FUSION_ADAPT_TPL_STRUCT
, -BOOST_FUSION_ADAPT_ASSOC_TPL_STRUCT
, -BOOST_FUSION_ADAPT_ASSOC_STRUCT_NAMED
- andBOOST_FUSION_ADAPT_ASSOC_STRUCT_NAMED_NS
- (Christopher Schmidt) -BOOST_FUSION_ADAPT_TPL_STRUCT
, +BOOST_FUSION_ADAPT_ASSOC_TPL_STRUCT
, +BOOST_FUSION_ADAPT_ASSOC_STRUCT_NAMED
+ andBOOST_FUSION_ADAPT_ASSOC_STRUCT_NAMED_NS
+ (Christopher Schmidt) +- - April 5, 2010: Added
+ April 5, 2010: AddedBOOST_FUSION_DEFINE_STRUCT
,BOOST_FUSION_DEFINE_TPL_STRUCT
, -BOOST_FUSION_DEFINE_ASSOC_STRUCT
- andBOOST_FUSION_DEFINE_ASSOC_TPL_STRUCT
- (Christopher Schmidt) -BOOST_FUSION_DEFINE_STRUCT
,BOOST_FUSION_DEFINE_TPL_STRUCT
, +BOOST_FUSION_DEFINE_ASSOC_STRUCT
+ andBOOST_FUSION_DEFINE_ASSOC_TPL_STRUCT
+ (Christopher Schmidt) +- - June 18, 2010: Added
+ June 18, 2010: Addedreverse_fold
,iter_fold
andreverse_iter_fold
(Christopher Schmidt) -reverse_fold
,iter_fold
andreverse_iter_fold
(Christopher + Schmidt) +- - October 7, 2010: Added
+ October 7, 2010: AddedBOOST_FUSION_ADAPT_ADT
,BOOST_FUSION_ADAPT_TPL_ADT
,BOOST_FUSION_ADAPT_ASSOC_ADT
- andBOOST_FUSION_ADAPT_ASSOC_TPL_ADT
- (Joel de Guzman, Hartmut Kaiser and Christopher Schmidt) -BOOST_FUSION_ADAPT_ADT
,BOOST_FUSION_ADAPT_TPL_ADT
, +BOOST_FUSION_ADAPT_ASSOC_ADT
+ andBOOST_FUSION_ADAPT_ASSOC_TPL_ADT
+ (Joel de Guzman, Hartmut Kaiser and Christopher Schmidt) +
diff --git a/doc/html/fusion/container.html b/doc/html/fusion/container.html index d4384437..835efdf2 100644 --- a/doc/html/fusion/container.html +++ b/doc/html/fusion/container.html @@ -49,7 +49,7 @@ These containers are more or less counterparts of those in STL. - + Header
#include <boost/fusion/container.hpp> diff --git a/doc/html/fusion/container/cons.html b/doc/html/fusion/container/cons.html index 173ad208..892bf0c0 100644 --- a/doc/html/fusion/container/cons.html +++ b/doc/html/fusion/container/cons.html @@ -27,7 +27,7 @@ cons- + Description
@@ -42,21 +42,21 @@ Inlined Functions).
- + Header
#include <boost/fusion/container/list/cons.hpp> #include <boost/fusion/include/cons.hpp>- + Synopsis
template <typename Car, typename Cdr = nil> struct cons;- + Template parameters
@@ -95,8 +95,6 @@
- -
@@ -119,10 +117,12 @@ - + Model of
- +
- + Forward Sequence +
Notation
@@ -159,7 +159,7 @@
- + Expression Semantics
@@ -292,7 +292,7 @@
- + Example
cons<int, cons<float> > l(12, cons<float>(5.5f)); diff --git a/doc/html/fusion/container/conversion.html b/doc/html/fusion/container/conversion.html index 67a4aec2..e1cccef8 100644 --- a/doc/html/fusion/container/conversion.html +++ b/doc/html/fusion/container/conversion.html @@ -35,7 +35,7 @@ types using one of these conversion functions.- + Header
#include <boost/fusion/include/convert.hpp> diff --git a/doc/html/fusion/container/conversion/functions/as_list.html b/doc/html/fusion/container/conversion/functions/as_list.html index 0d6ec598..e1172ada 100644 --- a/doc/html/fusion/container/conversion/functions/as_list.html +++ b/doc/html/fusion/container/conversion/functions/as_list.html @@ -27,14 +27,14 @@ as_list- + Description
Convert a fusion sequence to a
list
.- + Synopsis
template <typename Sequence> @@ -46,7 +46,7 @@ as_list(Sequence const& seq);- + Parameters
@@ -91,7 +91,7 @@
- + Expression Semantics
@@ -105,14 +105,14 @@seq
, to alist
.- + Header
#include <boost/fusion/container/list/convert.hpp> #include <boost/fusion/include/as_list.hpp>- + Example
as_list(make_vector
('x', 123, "hello")) diff --git a/doc/html/fusion/container/conversion/functions/as_map.html b/doc/html/fusion/container/conversion/functions/as_map.html index e15630e4..77cd3e26 100644 --- a/doc/html/fusion/container/conversion/functions/as_map.html +++ b/doc/html/fusion/container/conversion/functions/as_map.html @@ -27,14 +27,14 @@ as_map- + Description
Convert a fusion sequence to a
map
.- + Synopsis
template <typename Sequence> @@ -46,7 +46,7 @@ as_map(Sequence const& seq);- + Parameters
@@ -91,7 +91,7 @@
- + Expression Semantics
@@ -106,18 +106,17 @@Precondition: The elements of the sequence - are assumed to be __fusionpair_s. - There may be no duplicate
fusion::pair
key types. + are assumed to be __fusion_pair__s. There may be no duplicatefusion::pair
key types.- + Header
#include <boost/fusion/container/map/convert.hpp> #include <boost/fusion/include/as_map.hpp>- + Example
as_map(make_vector
( diff --git a/doc/html/fusion/container/conversion/functions/as_set.html b/doc/html/fusion/container/conversion/functions/as_set.html index bc78765f..5d6ae4cb 100644 --- a/doc/html/fusion/container/conversion/functions/as_set.html +++ b/doc/html/fusion/container/conversion/functions/as_set.html @@ -27,14 +27,14 @@ as_set- + Description
Convert a fusion sequence to a
set
.- + Synopsis
template <typename Sequence> @@ -46,7 +46,7 @@ as_set(Sequence const& seq);- + Parameters
@@ -91,7 +91,7 @@
- + Expression Semantics
@@ -109,14 +109,14 @@ key types.- + Header
#include <boost/fusion/container/set/convert.hpp> #include <boost/fusion/include/as_set.hpp>- + Example
as_set(make_vector
('x', 123, "hello")) diff --git a/doc/html/fusion/container/conversion/functions/as_vector.html b/doc/html/fusion/container/conversion/functions/as_vector.html index 14c9d27e..efca0b8a 100644 --- a/doc/html/fusion/container/conversion/functions/as_vector.html +++ b/doc/html/fusion/container/conversion/functions/as_vector.html @@ -27,14 +27,14 @@ as_vector- + Description
Convert a fusion sequence to a
vector
.- + Synopsis
template <typename Sequence> @@ -46,7 +46,7 @@ as_vector(Sequence const& seq);- + Parameters
@@ -91,7 +91,7 @@
- + Expression Semantics
@@ -105,14 +105,14 @@seq
, to avector
.- + Header
#include <boost/fusion/container/vector/convert.hpp> #include <boost/fusion/include/as_vector.hpp>- + Example
as_vector(make_list
('x', 123, "hello")) diff --git a/doc/html/fusion/container/conversion/metafunctions/as_list.html b/doc/html/fusion/container/conversion/metafunctions/as_list.html index 68e01649..019605c6 100644 --- a/doc/html/fusion/container/conversion/metafunctions/as_list.html +++ b/doc/html/fusion/container/conversion/metafunctions/as_list.html @@ -27,21 +27,21 @@ as_list- + Description
Returns the result type of
as_list
.- + Synopsis
template <typename Sequence> struct as_list;- + Parameters
@@ -86,7 +86,7 @@
- + Expression Semantics
@@ -101,14 +101,14 @@Sequence
, to alist
.- + Header
#include <boost/fusion/container/list/convert.hpp> #include <boost/fusion/include/as_list.hpp>- + Example
result_of::as_list<vector
<char, int> >::type diff --git a/doc/html/fusion/container/conversion/metafunctions/as_map.html b/doc/html/fusion/container/conversion/metafunctions/as_map.html index 12d616d2..7658114b 100644 --- a/doc/html/fusion/container/conversion/metafunctions/as_map.html +++ b/doc/html/fusion/container/conversion/metafunctions/as_map.html @@ -27,21 +27,21 @@ as_map- + Description
Returns the result type of
as_map
.- + Synopsis
template <typename Sequence> struct as_map;- + Parameters
@@ -86,7 +86,7 @@
- + Expression Semantics
@@ -102,18 +102,17 @@Precondition: The elements of the sequence - are assumed to be __fusionpair_s. - There may be no duplicate
fusion::pair
key types. + are assumed to be __fusion_pair__s. There may be no duplicatefusion::pair
key types.- + Header
#include <boost/fusion/container/map/convert.hpp> #include <boost/fusion/include/as_map.hpp>- + Example
result_of::as_map<vector
< diff --git a/doc/html/fusion/container/conversion/metafunctions/as_set.html b/doc/html/fusion/container/conversion/metafunctions/as_set.html index 600c4360..0e94baf3 100644 --- a/doc/html/fusion/container/conversion/metafunctions/as_set.html +++ b/doc/html/fusion/container/conversion/metafunctions/as_set.html @@ -27,21 +27,21 @@ as_set- + Description
Returns the result type of
as_set
.- + Synopsis
template <typename Sequence> struct as_set;- + Parameters
@@ -86,7 +86,7 @@
- + Expression Semantics
@@ -105,14 +105,14 @@ key types.- + Header
#include <boost/fusion/container/set/convert.hpp> #include <boost/fusion/include/as_set.hpp>- + Example
result_of::as_set<vector
<char, int> >::type diff --git a/doc/html/fusion/container/conversion/metafunctions/as_vector.html b/doc/html/fusion/container/conversion/metafunctions/as_vector.html index a8c955ff..fe16c4c3 100644 --- a/doc/html/fusion/container/conversion/metafunctions/as_vector.html +++ b/doc/html/fusion/container/conversion/metafunctions/as_vector.html @@ -27,21 +27,21 @@ as_vector- + Description
Returns the result type of
as_vector
.- + Synopsis
template <typename Sequence> struct as_vector;- + Parameters
@@ -86,7 +86,7 @@
- + Expression Semantics
@@ -101,14 +101,14 @@Sequence
, to avector
.- + Header
#include <boost/fusion/container/vector/convert.hpp> #include <boost/fusion/include/as_vector.hpp>- + Example
result_of::as_vector<list
<char, int> >::type diff --git a/doc/html/fusion/container/generation.html b/doc/html/fusion/container/generation.html index 9932c8a4..0b54ff8a 100644 --- a/doc/html/fusion/container/generation.html +++ b/doc/html/fusion/container/generation.html @@ -34,7 +34,7 @@ These are the functions that you can use to generate various forms of Container from elemental values.- + Header
#include <boost/fusion/container/generation.hpp> diff --git a/doc/html/fusion/container/generation/functions/list_tie.html b/doc/html/fusion/container/generation/functions/list_tie.html index bf1f316e..6e45762f 100644 --- a/doc/html/fusion/container/generation/functions/list_tie.html +++ b/doc/html/fusion/container/generation/functions/list_tie.html @@ -27,14 +27,14 @@ list_tie- + Description
Constructs a tie using a
list
sequence.- + Synopsis
template <typename T0, typename T1,... typename TN> @@ -52,7 +52,7 @@#define FUSION_MAX_LIST_SIZE 20- + Parameters
@@ -99,7 +99,7 @@
- + Expression Semantics
@@ -113,14 +113,14 @@ Semantics: Create alist
of references fromx0, x1,... xN
.- + Header
#include <boost/fusion/container/generation/list_tie.hpp> #include <boost/fusion/include/list_tie.hpp>- + Example
int i = 123; diff --git a/doc/html/fusion/container/generation/functions/make_cons.html b/doc/html/fusion/container/generation/functions/make_cons.html index c43dd32b..bf206bdf 100644 --- a/doc/html/fusion/container/generation/functions/make_cons.html +++ b/doc/html/fusion/container/generation/functions/make_cons.html @@ -27,7 +27,7 @@ make_cons- + Description
@@ -36,7 +36,7 @@ and optional
cdr
(tail).- + Synopsis
template <typename Car> @@ -48,7 +48,7 @@ make_cons(Car const& car, Cdr const& cdr);- + Parameters
@@ -112,7 +112,7 @@
- + Expression Semantics
@@ -127,20 +127,20 @@ (tail).- + Header
#include <boost/fusion/container/generation/make_cons.hpp> #include <boost/fusion/include/make_cons.hpp>- + Example
make_cons('x', make_cons(123))- + See also
diff --git a/doc/html/fusion/container/generation/functions/make_list.html b/doc/html/fusion/container/generation/functions/make_list.html index 7b30598f..946d6f51 100644 --- a/doc/html/fusion/container/generation/functions/make_list.html +++ b/doc/html/fusion/container/generation/functions/make_list.html @@ -27,7 +27,7 @@ make_list- + Description
@@ -35,7 +35,7 @@ from one or more values.
- + Synopsis
template <typename T0, typename T1,... typename TN> @@ -53,7 +53,7 @@#define FUSION_MAX_LIST_SIZE 20- + Parameters
@@ -100,7 +100,7 @@
- + Expression Semantics
@@ -113,20 +113,20 @@ Semantics: Create alist
fromx0, x1,... xN
.- + Header
#include <boost/fusion/container/generation/make_list.hpp> #include <boost/fusion/include/make_list.hpp>- + Example
make_list(123, "hello", 12.5)- + See also
diff --git a/doc/html/fusion/container/generation/functions/make_map.html b/doc/html/fusion/container/generation/functions/make_map.html index b7525596..2eef475c 100644 --- a/doc/html/fusion/container/generation/functions/make_map.html +++ b/doc/html/fusion/container/generation/functions/make_map.html @@ -27,7 +27,7 @@ make_map- + Description
@@ -35,7 +35,7 @@ from one or more key/data pairs.
- + Synopsis
template < @@ -55,7 +55,7 @@#define FUSION_MAX_MAP_SIZE 20- + Parameters
@@ -123,7 +123,7 @@
- + Expression Semantics
@@ -143,20 +143,20 @@ key types.- + Header
#include <boost/fusion/container/generation/make_map.hpp> #include <boost/fusion/include/make_map.hpp>- + Example
make_map<int, double>('X', "Men")- + See also
diff --git a/doc/html/fusion/container/generation/functions/make_set.html b/doc/html/fusion/container/generation/functions/make_set.html index 4fdca06b..6ac89e89 100644 --- a/doc/html/fusion/container/generation/functions/make_set.html +++ b/doc/html/fusion/container/generation/functions/make_set.html @@ -27,7 +27,7 @@ make_set- + Description
@@ -35,7 +35,7 @@ from one or more values.
- + Synopsis
template <typename T0, typename T1,... typename TN> @@ -53,7 +53,7 @@#define FUSION_MAX_SET_SIZE 20- + Parameters
@@ -100,7 +100,7 @@
- + Expression Semantics
@@ -117,20 +117,20 @@ key types.- + Header
#include <boost/fusion/container/generation/make_set.hpp> #include <boost/fusion/include/make_set.hpp>- + Example
make_set(123, "hello", 12.5)- + See also
diff --git a/doc/html/fusion/container/generation/functions/make_vector.html b/doc/html/fusion/container/generation/functions/make_vector.html index b1b5c128..5c9b05b6 100644 --- a/doc/html/fusion/container/generation/functions/make_vector.html +++ b/doc/html/fusion/container/generation/functions/make_vector.html @@ -27,7 +27,7 @@ make_vector- + Description
@@ -35,7 +35,7 @@ from one or more values.
- + Synopsis
template <typename T0, typename T1,... typename TN> @@ -53,7 +53,7 @@#define FUSION_MAX_VECTOR_SIZE 20- + Parameters
@@ -100,7 +100,7 @@
- + Expression Semantics
@@ -113,20 +113,20 @@ Semantics: Create avector
fromx0, x1,... xN
.- + Header
#include <boost/fusion/container/generation/make_vector.hpp> #include <boost/fusion/include/make_vector.hpp>- + Example
make_vector(123, "hello", 12.5)- + See also
diff --git a/doc/html/fusion/container/generation/functions/map_tie.html b/doc/html/fusion/container/generation/functions/map_tie.html index 0bc3cc9a..34d1d229 100644 --- a/doc/html/fusion/container/generation/functions/map_tie.html +++ b/doc/html/fusion/container/generation/functions/map_tie.html @@ -27,14 +27,14 @@ map_tie- + Description
Constructs a tie using a
map
sequence.- + Synopsis
template <typename K0, typename K1,... typename KN, typename D0, typename D1,... typename DN> @@ -52,7 +52,7 @@#define FUSION_MAX_MAP_SIZE 20- + Parameters
@@ -121,7 +121,7 @@
- + Expression Semantics
@@ -136,14 +136,14 @@ Semantics: Create amap
of references fromx0, x1,... xN
with keysK0, K1,... KN
- + Header
#include <boost/fusion/container/generation/map_tie.hpp> #include <boost/fusion/include/map_tie.hpp>- + Example
struct int_key; diff --git a/doc/html/fusion/container/generation/functions/tiers.html b/doc/html/fusion/container/generation/functions/tiers.html index 1816e20d..c18a140a 100644 --- a/doc/html/fusion/container/generation/functions/tiers.html +++ b/doc/html/fusion/container/generation/functions/tiers.html @@ -33,9 +33,15 @@ flavors.-
- -
list_tie
- -
vector_tie
- +
map_tie
- +
+list_tie
+- +
+vector_tie
+- +
map_tie
+Example: @@ -48,9 +54,7 @@ The
vector_tie
function creates avector
of type. The same result could be achieved - with the call
vector
<int&, char&, double&>make_vector
(ref
(i),ref
(c),ref
(a)) - [9] - . + with the callmake_vector
(ref
(i),ref
(c),ref
(a)) [9].A tie can be used to 'unpack' another tuple into @@ -66,7 +70,7 @@ when calling functions which return sequences.
- + Ignore
@@ -80,10 +84,10 @@
diff --git a/doc/html/fusion/container/generation/functions/vector_tie.html b/doc/html/fusion/container/generation/functions/vector_tie.html index 70e610e3..074dde96 100644 --- a/doc/html/fusion/container/generation/functions/vector_tie.html +++ b/doc/html/fusion/container/generation/functions/vector_tie.html @@ -27,14 +27,14 @@ vector_tie - + Description
Constructs a tie using a
vector
sequence.- + Synopsis
template <typename T0, typename T1,... typename TN> @@ -52,7 +52,7 @@#define FUSION_MAX_VECTOR_SIZE 20- + Parameters
@@ -99,7 +99,7 @@
- + Expression Semantics
@@ -113,14 +113,14 @@ Semantics: Create avector
of references fromx0, x1,... xN
.- + Header
#include <boost/fusion/container/generation/vector_tie.hpp> #include <boost/fusion/include/vector_tie.hpp>- + Example
int i = 123; diff --git a/doc/html/fusion/container/generation/metafunctions/list_tie.html b/doc/html/fusion/container/generation/metafunctions/list_tie.html index b1c92917..230a78a2 100644 --- a/doc/html/fusion/container/generation/metafunctions/list_tie.html +++ b/doc/html/fusion/container/generation/metafunctions/list_tie.html @@ -27,14 +27,14 @@ list_tie- + Description
Returns the result type of
list_tie
.- + Synopsis
template <typename T0, typename T1,... typename TN> @@ -51,7 +51,7 @@#define FUSION_MAX_LIST_SIZE 20- + Parameters
@@ -98,7 +98,7 @@
- + Expression Semantics
@@ -112,14 +112,14 @@ Semantics: Create alist
of references fromT0, T1,... TN
.- + Header
#include <boost/fusion/container/generation/list_tie.hpp> #include <boost/fusion/include/list_tie.hpp>- + Example
result_of::list_tie<int, double>::type diff --git a/doc/html/fusion/container/generation/metafunctions/make_cons.html b/doc/html/fusion/container/generation/metafunctions/make_cons.html index 404661af..0a3e2872 100644 --- a/doc/html/fusion/container/generation/metafunctions/make_cons.html +++ b/doc/html/fusion/container/generation/metafunctions/make_cons.html @@ -27,21 +27,21 @@ make_cons- + Description
Returns the result type of
make_cons
.- + Synopsis
template <typename Car, typename Cdr = nil> struct make_cons;- + Parameters
@@ -105,7 +105,7 @@
- + Expression Semantics
@@ -122,14 +122,14 @@ (tail).- + Header
#include <boost/fusion/container/generation/make_cons.hpp> #include <boost/fusion/include/make_cons.hpp>- + Example
result_of::make_cons<char, result_of::make_cons<int>::type>::type diff --git a/doc/html/fusion/container/generation/metafunctions/make_list.html b/doc/html/fusion/container/generation/metafunctions/make_list.html index 6965b729..a9190387 100644 --- a/doc/html/fusion/container/generation/metafunctions/make_list.html +++ b/doc/html/fusion/container/generation/metafunctions/make_list.html @@ -27,14 +27,14 @@ make_list- + Description
Returns the result type of
make_list
.- + Synopsis
template <typename T0, typename T1,... typename TN> @@ -51,7 +51,7 @@#define FUSION_MAX_LIST_SIZE 20- + Parameters
@@ -98,7 +98,7 @@
- + Expression Semantics
@@ -113,14 +113,14 @@ Semantics: Create alist
fromT0, T1,... TN
.- + Header
#include <boost/fusion/container/generation/make_list.hpp> #include <boost/fusion/include/make_list.hpp>- + Example
result_of::make_list<int, const char(&)[7], double>::type diff --git a/doc/html/fusion/container/generation/metafunctions/make_map.html b/doc/html/fusion/container/generation/metafunctions/make_map.html index de70f19b..65a9a2fe 100644 --- a/doc/html/fusion/container/generation/metafunctions/make_map.html +++ b/doc/html/fusion/container/generation/metafunctions/make_map.html @@ -27,14 +27,14 @@ make_map- + Description
Returns the result type of
make_map
.- + Synopsis
template < @@ -53,7 +53,7 @@#define FUSION_MAX_MAP_SIZE 20- + Parameters
@@ -121,7 +121,7 @@
- + Expression Semantics
@@ -140,20 +140,20 @@ key types.- + Header
#include <boost/fusion/container/generation/make_map.hpp> #include <boost/fusion/include/make_map.hpp>- + Example
result_of::make_map<int, double, char, double>::type- + See also
diff --git a/doc/html/fusion/container/generation/metafunctions/make_set.html b/doc/html/fusion/container/generation/metafunctions/make_set.html index cdb47a8a..26a7272b 100644 --- a/doc/html/fusion/container/generation/metafunctions/make_set.html +++ b/doc/html/fusion/container/generation/metafunctions/make_set.html @@ -27,14 +27,14 @@ make_set- + Description
Returns the result type of
make_set
.- + Synopsis
template <typename T0, typename T1,... typename TN> @@ -51,7 +51,7 @@#define FUSION_MAX_SET_SIZE 20- + Parameters
@@ -98,7 +98,7 @@
- + Expression Semantics
@@ -117,14 +117,14 @@ key types.- + Header
#include <boost/fusion/container/generation/make_set.hpp> #include <boost/fusion/include/make_set.hpp>- + Example
result_of::make_set<int, char, double>::type diff --git a/doc/html/fusion/container/generation/metafunctions/make_vector.html b/doc/html/fusion/container/generation/metafunctions/make_vector.html index aa677be7..1b669d31 100644 --- a/doc/html/fusion/container/generation/metafunctions/make_vector.html +++ b/doc/html/fusion/container/generation/metafunctions/make_vector.html @@ -27,14 +27,14 @@ make_vector- + Description
Returns the result type of
make_vector
.- + Synopsis
template <typename T0, typename T1,... typename TN> @@ -51,7 +51,7 @@#define FUSION_MAX_VECTOR_SIZE 20- + Parameters
@@ -98,7 +98,7 @@
- + Expression Semantics
@@ -113,14 +113,14 @@ Semantics: Create avector
fromT0, T1,... TN
.- + Header
#include <boost/fusion/container/generation/make_list.hpp> #include <boost/fusion/include/make_list.hpp>- + Example
result_of::make_vector<int, const char(&)[7], double>::type diff --git a/doc/html/fusion/container/generation/metafunctions/map_tie.html b/doc/html/fusion/container/generation/metafunctions/map_tie.html index e7a8bd34..f2ea1fef 100644 --- a/doc/html/fusion/container/generation/metafunctions/map_tie.html +++ b/doc/html/fusion/container/generation/metafunctions/map_tie.html @@ -27,14 +27,14 @@ map_tie- + Description
Returns the result type of
map_tie
.- + Synopsis
template <typename K0, typename K1,... typename KN, typename D0, typename D1,... typename DN> @@ -51,7 +51,7 @@#define FUSION_MAX_MAP_SIZE 20- + Parameters
@@ -119,7 +119,7 @@
- + Expression Semantics
@@ -134,14 +134,14 @@ Semantics: Create amap
of references fromD0, D1,... DN
with keysK0, K1,... KN
- + Header
#include <boost/fusion/container/generation/map_tie.hpp> #include <boost/fusion/include/map_tie.hpp>- + Example
struct int_key; diff --git a/doc/html/fusion/container/generation/metafunctions/vector_tie.html b/doc/html/fusion/container/generation/metafunctions/vector_tie.html index 37cd6d9b..0a902f3d 100644 --- a/doc/html/fusion/container/generation/metafunctions/vector_tie.html +++ b/doc/html/fusion/container/generation/metafunctions/vector_tie.html @@ -27,14 +27,14 @@ vector_tie- + Description
Returns the result type of
vector_tie
.- + Synopsis
template <typename T0, typename T1,... typename TN> @@ -51,7 +51,7 @@#define FUSION_MAX_VECTOR_SIZE 20- + Parameters
@@ -98,7 +98,7 @@
- + Expression Semantics
@@ -112,14 +112,14 @@ Semantics: Create avector
of references fromT0, T1,... TN
.- + Header
#include <boost/fusion/container/generation/vector_tie.hpp> #include <boost/fusion/include/vector_tie.hpp>- + Example
result_of::vector_tie<int, double>::type diff --git a/doc/html/fusion/container/list.html b/doc/html/fusion/container/list.html index e2e1df51..44c7344f 100644 --- a/doc/html/fusion/container/list.html +++ b/doc/html/fusion/container/list.html @@ -27,7 +27,7 @@ list- + Description
@@ -38,7 +38,7 @@ runtime cost of access to each element is peculiarly constant (see Recursive Inlined Functions).
- + Header
#include <boost/fusion/container/list.hpp> @@ -47,7 +47,7 @@ #include <boost/fusion/include/list_fwd.hpp>- + Synopsis
template < @@ -75,7 +75,7 @@#define FUSION_MAX_LIST_SIZE 20- + Template parameters
@@ -120,10 +120,12 @@
- + Model of
- +
- + Forward Sequence +
Notation
@@ -152,7 +154,7 @@
- + Expression Semantics
@@ -259,7 +261,7 @@
- + Example
list<int, float> l(12, 5.5f); diff --git a/doc/html/fusion/container/map.html b/doc/html/fusion/container/map.html index 87de7a4d..3dd55981 100644 --- a/doc/html/fusion/container/map.html +++ b/doc/html/fusion/container/map.html @@ -27,7 +27,7 @@ map- + Description
@@ -40,7 +40,7 @@ (see Overloaded Functions).
- + Header
#include <boost/fusion/container/map.hpp> @@ -49,7 +49,7 @@ #include <boost/fusion/include/map_fwd.hpp>- + Synopsis
template < @@ -77,7 +77,7 @@#define FUSION_MAX_MAP_SIZE 20- + Template parameters
@@ -122,13 +122,17 @@
- + Model of
Notation
@@ -153,7 +157,7 @@- + Expression Semantics
@@ -237,7 +241,7 @@
- + Example
typedef map< diff --git a/doc/html/fusion/container/set.html b/doc/html/fusion/container/set.html index 52e35f6d..a44b9248 100644 --- a/doc/html/fusion/container/set.html +++ b/doc/html/fusion/container/set.html @@ -27,7 +27,7 @@ set- + Description
@@ -39,7 +39,7 @@ Functions).
- + Header
#include <boost/fusion/container/set.hpp> @@ -48,7 +48,7 @@ #include <boost/fusion/include/set_fwd.hpp>- + Synopsis
template < @@ -76,7 +76,7 @@#define FUSION_MAX_SET_SIZE 20- + Template parameters
@@ -121,13 +121,17 @@
- + Model of
Notation
@@ -152,7 +156,7 @@- + Expression Semantics
@@ -236,7 +240,7 @@
- + Example
typedef set<int, float> S; diff --git a/doc/html/fusion/container/vector.html b/doc/html/fusion/container/vector.html index d8b9d22b..5630b681 100644 --- a/doc/html/fusion/container/vector.html +++ b/doc/html/fusion/container/vector.html @@ -27,7 +27,7 @@ vector- + Description
@@ -39,7 +39,7 @@ efficient.
- + Header
#include <boost/fusion/container/vector.hpp> @@ -47,8 +47,8 @@ #include <boost/fusion/container/vector/vector_fwd.hpp> #include <boost/fusion/include/vector_fwd.hpp> -// numbered forms -#include <boost/fusion/container/vector/vector10.hpp> +// numbered forms +#include <boost/fusion/container/vector/vector10.hpp> #include <boost/fusion/include/vector10.hpp> #include <boost/fusion/container/vector/vector20.hpp> #include <boost/fusion/include/vector20.hpp> @@ -60,7 +60,7 @@ #include <boost/fusion/include/vector50.hpp>- + Synopsis
@@ -115,7 +115,7 @@
#define FUSION_MAX_VECTOR_SIZE 20- + Template parameters
@@ -160,11 +160,13 @@
- + Model of
- +Notation
@@ -188,7 +190,7 @@
- + Expression Semantics
@@ -271,7 +273,7 @@
- + Example
vector<int, float> v(12, 5.5f); diff --git a/doc/html/fusion/extension.html b/doc/html/fusion/extension.html index 4121e3c4..d824138e 100644 --- a/doc/html/fusion/extension.html +++ b/doc/html/fusion/extension.html @@ -27,7 +27,7 @@ ExtensionThe Fusion library is designed to be extensible, new sequences types can @@ -37,19 +37,20 @@
- - Enable the tag dispatching - mechanism used by Fusion for your sequence type -
+ Enable the tag + dispatching mechanism used by Fusion for your sequence + type +- - Design an iterator type for the sequence -
+ Design an iterator type for the sequence +- - Provide specialized behaviour for the intrinsic operations of the new Fusion - sequence -
+ Provide specialized behaviour for the intrinsic operations of the new + Fusion sequence +- + Our example
@@ -79,7 +80,7 @@ Start guide.
- + Enabling Tag Dispatching
@@ -90,8 +91,8 @@ a new tag type for the mechanism to use. For example:namespace example { - struct example_sequence_tag; // Only definition needed -} + struct example_sequence_tag; // Only definition needed +}Next we need to enable the
traits::tag_of
@@ -120,7 +121,7 @@ #include <boost/fusion/include/tag_of.hpp>- + Designing a suitable iterator
@@ -154,23 +155,23 @@
- - The iterator is parameterized by the type it is iterating over, and the - index of the current element. -
+ The iterator is parameterized by the type it is iterating over, and the + index of the current element. +- - The typedefs
+ The typedefsstruct_type
- andindex
provide convenient - access to information we will need later in the implementation. -struct_type
+ andindex
provide convenient + access to information we will need later in the implementation. +- - The typedef
+ The typedefcategory
allows - thetraits::
- metafunction to establish the traversal category of the iterator. -category_of
category
+ allows thetraits::
+ metafunction to establish the traversal category of the iterator. +category_of
- - The constructor stores a reference to the
+ The constructor stores a reference to theexample_struct
- being iterated over. -example_struct
+ being iterated over. +We also need to enable tag @@ -182,7 +183,7 @@ clearer as we add features to our implementation.
- + A first couple of instructive features
@@ -322,7 +323,7 @@- + Implementing the remaining iterator functionality
@@ -373,7 +374,7 @@ are provided in the example code.- + Implementing the intrinsic functions of the sequence
@@ -429,7 +430,7 @@value_at_impl
andat_impl
.- + Enabling our type as an associative sequence
@@ -437,9 +438,8 @@ In order forexample_struct
to serve as an associative forward sequence, we need to adapt the traversal category of our sequence and our iterator accordingly and enable 3 intrinsic - sequence lookup features,at_key
, __value_atkey_ - andhas_key
. We also need to enable - 3 iterator lookup features,result_of::key_of
,result_of::value_of_data
andderef_data
. + sequence lookup features,at_key
, __value_at_key__ andhas_key
. + We also need to enable 3 iterator lookup features,result_of::key_of
,result_of::value_of_data
andderef_data
.To implement
at_key_impl
@@ -494,7 +494,7 @@ are provided in the example code.- + Summary
diff --git a/doc/html/fusion/extension/iterator_facade.html b/doc/html/fusion/extension/iterator_facade.html index c0f32c73..0942789f 100644 --- a/doc/html/fusion/extension/iterator_facade.html +++ b/doc/html/fusion/extension/iterator_facade.html @@ -27,7 +27,7 @@ Iterator Facade
- + Description
@@ -36,14 +36,14 @@ iterator.
- + Synopsis
template<typename Derived, typename TravesalTag> struct iterator_facade;- + Usage
@@ -57,7 +57,7 @@ type.
- + Header
#include <boost/fusion/iterator/iterator_facade.hpp> #include <boost/fusion/include/iterator_facade.hpp>- + Example
diff --git a/doc/html/fusion/extension/sequence_facade.html b/doc/html/fusion/extension/sequence_facade.html index ef9a4bc6..8ad28731 100644 --- a/doc/html/fusion/extension/sequence_facade.html +++ b/doc/html/fusion/extension/sequence_facade.html @@ -27,7 +27,7 @@ Sequence Facade
- + Description
@@ -36,14 +36,14 @@ sequence.
- + Synopsis
template<typename Derived, typename TravesalTag, typename IsView = mpl::false_> struct sequence_facade;- + Usage
@@ -59,7 +59,7 @@ type.
- + Include
#include <boost/fusion/sequence/sequence_facade.hpp> #include <boost/fusion/include/sequence_facade.hpp>- + Example
diff --git a/doc/html/fusion/functional.html b/doc/html/fusion/functional.html index c0756573..1ec0d730 100644 --- a/doc/html/fusion/functional.html +++ b/doc/html/fusion/functional.html @@ -29,12 +29,12 @@
-
- Concepts
- Invocation
@@ -43,7 +43,7 @@- Metafunctions
- Limits
Adapters +Adapters
- fused
- fused_procedure
@@ -63,13 +63,13 @@ through a function object interface.- + Header
#include <boost/fusion/functional.hpp>- + Fused and unfused forms
@@ -103,7 +103,7 @@ form off'
.- + Calling functions and function objects
@@ -133,7 +133,7 @@ Constructors can be called applying Boost.Functional/Factory.- + Making Fusion code callable through a function object interface
diff --git a/doc/html/fusion/functional/adapters.html b/doc/html/fusion/functional/adapters.html index 68207f44..d77476bd 100644 --- a/doc/html/fusion/functional/adapters.html +++ b/doc/html/fusion/functional/adapters.html @@ -24,7 +24,7 @@- + Description
@@ -54,20 +54,20 @@ and
boost::shared_ptr
).- + Header
#include <boost/fusion/functional/adapter/fused.hpp>- + Synopsis
template <typename Function> class fused;- + Template parameters
@@ -107,20 +107,22 @@- -
Notation
@@ -146,7 +148,7 @@fused<std::plus
<long> > f; assert(f(make_vector
(1,2l)) == 3l);
fused_procedure
fused_function_object
invoke
make_fused
deduce
fused_procedure
+ fused_function_object
+ invoke
+ make_fused
+ deduce
+
- - |
Notation
@@ -137,7 +139,7 @@template<class SeqOfSeqs, class Func> @@ -239,16 +241,26 @@ }
fused
fused_procedure
invoke_function_object
make_fused_function_object
deduce
fused
+ fused_procedure
+ invoke_function_object
+ make_fused_function_object
+ deduce
+
- - |
Notation
@@ -155,7 +157,7 @@template<class SequenceOfSequences, class Func> @@ -240,15 +242,23 @@ }
fused
fused_function_object
invoke_procedure
make_fused_procedure
fused
+ fused_function_object
+ invoke_procedure
+ make_fused_procedure
+
- - |
Notation
@@ -172,7 +174,7 @@struct fused_incrementer @@ -264,12 +266,16 @@ }
unfused_typed
make_unfused
unfused_typed
+ make_unfused
+
- - |
- - |
Notation
@@ -186,7 +186,7 @@struct add_assign // applies operator+= -{ - typedef void result_type; // for simplicity - +struct add_assign // applies operator+= +{ + typedef void result_type; // for simplicity + template <typename T> void operator()(T & lhs, T const & rhs) const { @@ -285,8 +285,8 @@ } }; -// accepts a tie and creates a typed function object from it -struct fused_parallel_adder_maker +// accepts a tie and creates a typed function object from it +struct fused_parallel_adder_maker { template <typename Sig> struct result; @@ -312,22 +312,28 @@ void try_it() { int a = 2; char b = 'X'; - // the second call is strictly typed with the types deduced from the - // first call - parallel_add(a,b)(3,2); + // the second call is strictly typed with the types deduced from the + // first call + parallel_add(a,b)(3,2); parallel_add(a,b)(3); parallel_add(a,b)(); assert(a == 8 && b == 'Z'); }- + See also
-
- -
unfused
- -
deduce
- +
deduce_sequence
- +
+unfused
+- +
+deduce
+- +
deduce_sequence
+
& a_free_function @@ -136,10 +138,10 @@ & a_class::a_nonstatic_data_member & a_class::a_nonstatic_member_function std::less<int>() -// using namespace boost; -bind(std::less<int>(), _1, 5) -// Note: Boost.Lambda expressions don't work with __boost_result_of__ -fusion::make_fused_function_object
(std::less<int>()) +// using namespace boost; +bind(std::less<int>(), _1, 5) +// Note: Boost.Lambda expressions don't work with __boost_result_of__ +fusion::make_fused_function_object
(std::less<int>())
& a_free_function & a_class::a_static_member_function std::less<int>() -// using namespace boost; -bind(std::less<int>(), _1, 5) -// Note: Boost.Lambda expressions don't work with __boost_result_of__ -fusion::make_fused_function_object
(std::less<int>()) +// using namespace boost; +bind(std::less<int>(), _1, 5) +// Note: Boost.Lambda expressions don't work with __boost_result_of__ +fusion::make_fused_function_object
(std::less<int>())
& a_free_function
& a_class::a_static_member_function
std::less<int>()
-// using namespace boost;
-bind(std::less<int>(), _1, 5)
+// using namespace boost;
+bind(std::less<int>(), _1, 5)
lambda::_1 += lambda::_2;
fusion::make_fused_function_object
(std::less<int>())
diff --git a/doc/html/fusion/functional/generation/functions.html b/doc/html/fusion/functional/generation/functions.html
index 0f60c80b..44e766ab 100644
--- a/doc/html/fusion/functional/generation/functions.html
+++ b/doc/html/fusion/functional/generation/functions.html
@@ -27,14 +27,10 @@
Functions
fused
adapter for f
.
#include <boost/fusion/functional/generation/make_fused.hpp> #include <boost/fusion/include/make_fused.hpp>
float sub(float a, float b) { return a - b; } @@ -126,14 +125,20 @@ }
fused
deduce
make_fused
fused
+ deduce
+ make_fused
+ f
.
#include <boost/fusion/functional/generation/make_fused_function_object.hpp> #include <boost/fusion/include/make_fused_function_object.hpp>
struct sub @@ -141,14 +140,20 @@ }
f
.
#include <boost/fusion/functional/generation/make_fused_procedure.hpp> #include <boost/fusion/include/make_fused_procedure.hpp>
vector
<int,int,int> v(1,2,3); @@ -122,14 +121,20 @@ assert(front
(v) == 0);
fused_procedure
deduce
make_fused_procedure
fused_procedure
+ deduce
+ make_fused_procedure
+ unfused
adapter for f
.
#include <boost/fusion/functional/generation/make_unfused.hpp> #include <boost/fusion/include/make_unfused.hpp>
struct fused_incrementer @@ -138,14 +137,20 @@ }
unfused
deduce
make_unfused
unfused
+ deduce
+ make_unfused
+ diff --git a/doc/html/fusion/functional/generation/metafunctions/mk_fused_fobj.html b/doc/html/fusion/functional/generation/metafunctions/mk_fused_fobj.html index 8ebcf5ca..981fc0ed 100644 --- a/doc/html/fusion/functional/generation/metafunctions/mk_fused_fobj.html +++ b/doc/html/fusion/functional/generation/metafunctions/mk_fused_fobj.html @@ -24,25 +24,24 @@ |
diff --git a/doc/html/fusion/functional/generation/metafunctions/mk_fused_proc.html b/doc/html/fusion/functional/generation/metafunctions/mk_fused_proc.html index abb85b90..6054225b 100644 --- a/doc/html/fusion/functional/generation/metafunctions/mk_fused_proc.html +++ b/doc/html/fusion/functional/generation/metafunctions/mk_fused_proc.html @@ -24,25 +24,24 @@ |
diff --git a/doc/html/fusion/functional/generation/metafunctions/mk_unfused.html b/doc/html/fusion/functional/generation/metafunctions/mk_unfused.html index b9040b89..c26b8169 100644 --- a/doc/html/fusion/functional/generation/metafunctions/mk_unfused.html +++ b/doc/html/fusion/functional/generation/metafunctions/mk_unfused.html @@ -24,25 +24,24 @@ |
diff --git a/doc/html/fusion/functional/invocation/functions.html b/doc/html/fusion/functional/invocation/functions.html index d37df442..e8a63ee2 100644 --- a/doc/html/fusion/functional/invocation/functions.html +++ b/doc/html/fusion/functional/invocation/functions.html @@ -28,10 +28,8 @@ |
#include <boost/fusion/functional/invocation/invoke.hpp>
std::plus
<int> add; assert(invoke(add,make_vector
(1,1)) == 2);
invoke_procedure
invoke_function_object
result_of::invoke
fused
make_fused
invoke_procedure
+ invoke_function_object
+ result_of::invoke
+ fused
+ make_fused
+ #include <boost/fusion/functional/invocation/invoke_function_object.hpp>
struct sub @@ -175,16 +174,26 @@ }
#include <booost/fusion/functional/invocation/invoke_procedure.hpp>
vector
<int,int> v(1,2); @@ -166,16 +165,26 @@ assert(front
(v) == 3);
map
- iterator
- map
+ iterator
+
set
- iterator
- set
+ iterator
+
filter_view
- iterator (where adapted sequence is an Associative
- Sequence and a Forward
- Sequence)
- filter_view
+ iterator (where adapted sequence is an Associative
+ Sequence and a Forward
+ Sequence)
+
iterator_range
- iterator (where adapted iterators are Associative
- Iterators)
- iterator_range
+ iterator (where adapted iterators are Associative
+ Iterators)
+
joint_view
- iterator (where adapted sequences are Associative
- Sequences and Forward
- Sequences)
- joint_view
+ iterator (where adapted sequences are Associative
+ Sequences and Forward
+ Sequences)
+
reverse_view
- iterator (where adapted sequence is an Associative
- Sequence and a Bidirectional
- Sequence)
- reverse_view
+ iterator (where adapted sequence is an Associative
+ Sequence and a Bidirectional
+ Sequence)
+
@@ -256,41 +256,52 @@ Iterator, the following invariants always hold:
prior
(next
(i)) == i && prior
(next
(i)) == next
(prior
(i))
prior
(i) == advance_c
<-1>(i)
prior
to traverse a sequence
- will never return a previously seen position
- prior
(next
(i)) == i &&
+ prior
(next
(i)) == next
(prior
(i))
+
+prior
(i) == advance_c
<-1>(i)
+ prior
to traverse a
+ sequence will never return a previously seen position
+ std::pair
- iterator
- std::pair
+ iterator
+
boost::array
- iterator
- boost::array
+ iterator
+
vector
- iterator
- vector
+ iterator
+
iterator_range
- (where adapted sequence is a Bidirectional
- Sequence)
- single_view
+ iterator
+
transform_view
- (where adapted sequence is a Bidirectional
- Sequence)
- reverse_view
iterator_range
+ (where adapted sequence is a Bidirectional
+ Sequence)
+
+transform_view
+ (where adapted sequence is a Bidirectional
+ Sequence)
+ reverse_view
+
- - Expression - - |
-
- - Semantics - - |
-
---|---|
-
- |
-
-
- An iterator to the element following |
-
-
- |
-
- - Iterator equality comparison - - |
-
-
- |
-
- - Iterator inequality comparison - - |
-
-
- |
-
-
- An iterator n elements after |
-
-
- |
-
-
- Equivalent to |
-
-
- |
-
-
- The number of elements between |
-
-
- |
-
-
- The element at position |
-
-
- |
-
-
- Equivalent to |
-
+ [ table [[Expression] [Semantics]] [[
] [An
+ iterator to the element following next
(i)i
]]
+ [[i ==
+ j
] [Iterator equality comparison]]
+ [[i !=
+ j
] [Iterator inequality comparison]]
+ [[
] [An
+ iterator n elements after advance_c
<N>(i)i
+ in the sequence]] [[
] [Equivalent
+ to advance
<M>(i)advance_c<M::value>(i)
]] [[
] [The number of elements between distance
(i, j)i
and j
]]
+ [[
]
+ [The element at positionderef
(i)i
]]
+ [[*i
]
+ [Equivalent to deref(i)
]]
+ ]
+
The following invariants always hold:
!(i
- == j) == (i != j)
next
(i) == advance_c
<1>(i)
distance
(i, advance_c
<N>(i)) == N
next
to traverse the
- sequence will never return to a previously seen position
- !(i
+ == j) == (i != j)
+
deref
(i)
is equivalent to *i
-next
(i) == advance_c
<1>(i)
+
i ==
- j
then *i
is equivalent to *j
-distance
(i, advance_c
<N>(i)) == N
+
+next
to traverse the
+ sequence will never return to a previously seen position
+ deref
(i)
+ is equivalent to *i
+ i ==
+ j
then *i
is equivalent to *j
+ std::pair
- iterator
- std::pair
+ iterator
+
boost::array
- iterator
- boost::array
+ iterator
+
vector
- iterator
- vector
+ iterator
+
cons
- iterator
- cons
+ iterator
+
list
- iterator
- list
+ iterator
+
set
- iterator
- set
+ iterator
+
map
- iterator
- map
+ iterator
+
single_view
- iterator
- single_view
+ iterator
+
filter_view
- iterator
- filter_view
+ iterator
+
iterator_range
- iterator
- iterator_range
+ iterator
+
joint_view
- iterator
- joint_view
+ iterator
+
transform_view
- iterator
- transform_view
+ iterator
+
reverse_view
- iterator
- reverse_view
+ iterator
+
vector
- iterator
- vector
+ iterator
+
std::pair
- iterator
- std::pair
+ iterator
+
boost::array
- iterator
- boost::array
+ iterator
+
iterator_range
- iterator (where adapted sequence is a Random
- Access Sequence)
- single_view
+ iterator
+
transform_view
- iterator (where adapted sequence is a Random
- Access Sequence)
- iterator_range
+ iterator (where adapted sequence is a Random
+ Access Sequence)
+
reverse_view
- iterator (where adapted sequence is a Random
- Access Sequence)
- transform_view
+ iterator (where adapted sequence is a Random
+ Access Sequence)
+
+reverse_view
+ iterator (where adapted sequence is a Random
+ Access Sequence)
+ [12]
- 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
- wrapper (see boost::ref
).
-
[12]
+ 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
+ wrapper (see boost::ref
).
+
- - |
@@ -135,8 +133,6 @@ |
- - |
@@ -173,7 +169,7 @@ |
set
map
filter_view
- (where adapted sequence is an Associative
- Sequence and a Forward
- Sequence)
- set
+
iterator_range
- (where adapted iterators are Associative
- Iterators)
- map
+
joint_view
- (where adapted sequences are Associative
- Sequences and Forward
- Sequences)
- filter_view
+ (where adapted sequence is an Associative
+ Sequence and a Forward
+ Sequence)
+
reverse_view
- (where adapted sequence is an Associative
- Sequence and a Bidirectional
- Sequence)
- iterator_range
+ (where adapted iterators are Associative
+ Iterators)
+
+joint_view
+ (where adapted sequences are Associative
+ Sequences and Forward
+ Sequences)
+ reverse_view
+ (where adapted sequence is an Associative
+ Sequence and a Bidirectional
+ Sequence)
+
- - |
@@ -139,8 +137,6 @@ |
- - |
@@ -160,8 +156,6 @@ |
- - |
@@ -198,7 +192,7 @@ |
std::pair
boost::array
vector
reverse_view
iterator_range
- (where adapted sequence is a Bidirectional Sequence)
- std::pair
+
transform_view
- (where adapted sequence is a Bidirectional Sequence)
- boost::array
+
zip_view
- (where adapted sequences are models of Bidirectional Sequence)
- vector
+
+reverse_view
+ single_view
+ iterator_range
+ (where adapted sequence is a Bidirectional Sequence)
+ transform_view
+ (where adapted sequence is a Bidirectional Sequence)
+ zip_view
+ (where adapted sequences are models of Bidirectional Sequence)
+
- - |
@@ -132,8 +130,6 @@ |
- - |
@@ -154,8 +150,6 @@ |
- - |
@@ -176,8 +170,6 @@ |
- - |
@@ -197,8 +189,6 @@ |
- - |
@@ -235,7 +225,7 @@ |
@@ -416,42 +406,71 @@
[begin
(s), end
(s))
is always a valid range.
- [begin
(s), end
(s))
is always a valid range.
+
[begin
(s), end
(s))
will pass through every element of
- s
exactly once.
- [begin
(s), end
(s))
will pass through every element of
+ s
exactly once.
+
begin
(s)
- is identical to end
(s))
- if and only if s
is empty.
- begin
(s)
+ is identical to end
(s))
+ if and only if s
is
+ empty.
+
s
- will access its elements in the same order.
- s
+ will access its elements in the same order.
+
std::pair
boost::array
vector
cons
list
set
map
single_view
filter_view
iterator_range
joint_view
transform_view
reverse_view
zip_view
std::pair
+ boost::array
+ vector
+ cons
+ list
+ set
+ map
+ single_view
+ filter_view
+ iterator_range
+ joint_view
+ transform_view
+ reverse_view
+ zip_view
+
- - |
@@ -146,8 +144,6 @@ |
- - |
@@ -167,8 +163,6 @@ |
- - |
@@ -205,7 +199,7 @@ |
std::pair
boost::array
vector
reverse_view
iterator_range
- (where adapted sequence is a Random Access Sequence)
- std::pair
+
transform_view
- (where adapted sequence is a Random Access Sequence)
- boost::array
+
zip_view
- (where adapted sequences are models of Random Access Sequence)
- vector
+
+reverse_view
+ single_view
+ iterator_range
+ (where adapted sequence is a Random Access Sequence)
+ transform_view
+ (where adapted sequence is a Random Access Sequence)
+ zip_view
+ (where adapted sequences are models of Random Access Sequence)
+ deref
(advance
<N>(begin
(s)))
#include <boost/fusion/sequence/intrinsic/at.hpp> #include <boost/fusion/include/at.hpp>
vector
<int, int, int> v(1, 2, 3); diff --git a/doc/html/fusion/sequence/intrinsic/functions/at_c.html b/doc/html/fusion/sequence/intrinsic/functions/at_c.html index dbb2c62e..e5cafd76 100644 --- a/doc/html/fusion/sequence/intrinsic/functions/at_c.html +++ b/doc/html/fusion/sequence/intrinsic/functions/at_c.html @@ -27,14 +27,14 @@ at_c- + Description
Returns the N-th element from the beginning of the sequence.
- + Synopsis
template <int N, typename Sequence> @@ -46,7 +46,7 @@ at_c(Sequence const& seq);- + Parameters
@@ -111,7 +111,7 @@
- + Expression Semantics
@@ -138,14 +138,14 @@deref
(advance
<N>(begin
(s)))- + Header
#include <boost/fusion/sequence/intrinsic/at_c.hpp> #include <boost/fusion/include/at_c.hpp>- + Example
vector
<int, int, int> v(1, 2, 3); diff --git a/doc/html/fusion/sequence/intrinsic/functions/at_key.html b/doc/html/fusion/sequence/intrinsic/functions/at_key.html index ace219fd..0ac391e2 100644 --- a/doc/html/fusion/sequence/intrinsic/functions/at_key.html +++ b/doc/html/fusion/sequence/intrinsic/functions/at_key.html @@ -27,14 +27,14 @@ at_key- + Description
Returns the element associated with a Key from the sequence.
- + Synopsis
template <typename Key, typename Sequence> @@ -46,7 +46,7 @@ at_key(Sequence const& seq);- + Parameters
@@ -111,7 +111,7 @@
- + Expression Semantics
@@ -134,14 +134,14 @@ with Key.- + Header
#include <boost/fusion/sequence/intrinsic/at_key.hpp> #include <boost/fusion/include/at_key.hpp>- + Example
set
<int, char, bool> s(1, 'x', true); diff --git a/doc/html/fusion/sequence/intrinsic/functions/back.html b/doc/html/fusion/sequence/intrinsic/functions/back.html index 255ce5aa..7bc31c29 100644 --- a/doc/html/fusion/sequence/intrinsic/functions/back.html +++ b/doc/html/fusion/sequence/intrinsic/functions/back.html @@ -27,14 +27,14 @@ back- + Description
Returns the last element in the sequence.
- + Synopsis
template <typename Sequence> @@ -46,7 +46,7 @@ back(Sequence const& seq);- + Parameters
@@ -92,7 +92,7 @@
- + Expression Semantics
@@ -115,14 +115,14 @@ in the sequence.- + Header
#include <boost/fusion/sequence/intrinsic/back.hpp> #include <boost/fusion/include/back.hpp>- + Example
vector
<int, int, int> v(1, 2, 3); diff --git a/doc/html/fusion/sequence/intrinsic/functions/begin.html b/doc/html/fusion/sequence/intrinsic/functions/begin.html index da04b53d..1f4b1beb 100644 --- a/doc/html/fusion/sequence/intrinsic/functions/begin.html +++ b/doc/html/fusion/sequence/intrinsic/functions/begin.html @@ -27,14 +27,14 @@ begin- + Description
Returns an iterator pointing to the first element in the sequence.
- + Synopsis
template <typename Sequence> @@ -46,7 +46,7 @@ begin(Sequence const& seq);- + Parameters
@@ -92,7 +92,7 @@
- + Expression Semantics
@@ -103,37 +103,37 @@
- - A model of Forward - Iterator if
+ A model of Forward + Iterator ifseq
- is a Forward - Sequence else, Bidirectional - Iterator ifseq
- is a Bidirectional - Sequence else, Random - Access Iterator ifseq
- is a Random - Access Sequence. -seq
+ is a Forward + Sequence else, Bidirectional + Iterator ifseq
+ is a Bidirectional + Sequence else, Random + Access Iterator ifseq
+ is a Random + Access Sequence. +- - A model of Associative - Iterator if
+ A model of Associative + Iterator ifseq
- is an Associative - Sequence. -seq
+ is an Associative + Sequence. +Semantics: Returns an iterator pointing to the first element in the sequence.
- + Header
#include <boost/fusion/sequence/intrinsic/begin.hpp> #include <boost/fusion/include/begin.hpp>- + Example
vector
<int, int, int> v(1, 2, 3); diff --git a/doc/html/fusion/sequence/intrinsic/functions/empty.html b/doc/html/fusion/sequence/intrinsic/functions/empty.html index 397b45d9..a8f3626c 100644 --- a/doc/html/fusion/sequence/intrinsic/functions/empty.html +++ b/doc/html/fusion/sequence/intrinsic/functions/empty.html @@ -27,7 +27,7 @@ empty- + Description
@@ -36,7 +36,7 @@ the sequence is empty, else, evaluates to
false
.- + Synopsis
template <typename Sequence> @@ -44,7 +44,7 @@ empty(Sequence const& seq);- + Parameters
@@ -90,7 +90,7 @@
- + Expression Semantics
@@ -104,14 +104,14 @@ tofalse
.- + Header
#include <boost/fusion/sequence/intrinsic/empty.hpp> #include <boost/fusion/include/empty.hpp>- + Example
vector
<int, int, int> v(1, 2, 3); diff --git a/doc/html/fusion/sequence/intrinsic/functions/end.html b/doc/html/fusion/sequence/intrinsic/functions/end.html index b697fb8d..9985eead 100644 --- a/doc/html/fusion/sequence/intrinsic/functions/end.html +++ b/doc/html/fusion/sequence/intrinsic/functions/end.html @@ -27,14 +27,14 @@ end- + Description
Returns an iterator pointing to one element past the end of the sequence.
- + Synopsis
template <typename Sequence> @@ -46,7 +46,7 @@ end(Sequence const& seq);- + Parameters
@@ -92,7 +92,7 @@
- + Expression Semantics
@@ -103,37 +103,37 @@
- - A model of Forward - Iterator if
+ A model of Forward + Iterator ifseq
- is a Forward - Sequence else, Bidirectional - Iterator ifseq
- is a Bidirectional - Sequence else, Random - Access Iterator ifseq
- is a Random - Access Sequence. -seq
+ is a Forward + Sequence else, Bidirectional + Iterator ifseq
+ is a Bidirectional + Sequence else, Random + Access Iterator ifseq
+ is a Random + Access Sequence. +- - A model of Associative - Iterator if
+ A model of Associative + Iterator ifseq
- is an Associative - Sequence. -seq
+ is an Associative + Sequence. +Semantics: Returns an iterator pointing to one element past the end of the sequence.
- + Header
#include <boost/fusion/sequence/intrinsic/end.hpp> #include <boost/fusion/include/end.hpp>- + Example
vector
<int, int, int> v(1, 2, 3); diff --git a/doc/html/fusion/sequence/intrinsic/functions/front.html b/doc/html/fusion/sequence/intrinsic/functions/front.html index 0d1d74e8..1ee317f3 100644 --- a/doc/html/fusion/sequence/intrinsic/functions/front.html +++ b/doc/html/fusion/sequence/intrinsic/functions/front.html @@ -27,14 +27,14 @@ front- + Description
Returns the first element in the sequence.
- + Synopsis
template <typename Sequence> @@ -46,7 +46,7 @@ front(Sequence const& seq);- + Parameters
@@ -92,7 +92,7 @@
- + Expression Semantics
@@ -115,14 +115,14 @@ in the sequence.- + Header
#include <boost/fusion/sequence/intrinsic/front.hpp> #include <boost/fusion/include/front.hpp>- + Example
vector
<int, int, int> v(1, 2, 3); diff --git a/doc/html/fusion/sequence/intrinsic/functions/has_key.html b/doc/html/fusion/sequence/intrinsic/functions/has_key.html index 9177a076..9754c1e7 100644 --- a/doc/html/fusion/sequence/intrinsic/functions/has_key.html +++ b/doc/html/fusion/sequence/intrinsic/functions/has_key.html @@ -27,7 +27,7 @@ has_key- + Description
@@ -37,7 +37,7 @@ to
false
.- + Synopsis
template <typename Key, typename Sequence> @@ -45,7 +45,7 @@ has_key(Sequence const& seq);- + Parameters
@@ -110,7 +110,7 @@
- + Expression Semantics
@@ -124,14 +124,14 @@ associated with Key, else, evaluates tofalse
.- + Header
#include <boost/fusion/sequence/intrinsic/has_key.hpp> #include <boost/fusion/include/has_key.hpp>- + Example
set
<int, char, bool> s(1, 'x', true); diff --git a/doc/html/fusion/sequence/intrinsic/functions/size.html b/doc/html/fusion/sequence/intrinsic/functions/size.html index de71f62f..cdb6a09b 100644 --- a/doc/html/fusion/sequence/intrinsic/functions/size.html +++ b/doc/html/fusion/sequence/intrinsic/functions/size.html @@ -27,7 +27,7 @@ size- + Description
@@ -35,7 +35,7 @@ that evaluates the number of elements in the sequence.
- + Synopsis
template <typename Sequence> @@ -43,7 +43,7 @@ size(Sequence const& seq);- + Parameters
@@ -89,7 +89,7 @@
- + Expression Semantics
@@ -103,14 +103,14 @@ in the sequence.- + Header
#include <boost/fusion/sequence/intrinsic/size.hpp> #include <boost/fusion/include/size.hpp>- + Example
vector
<int, int, int> v(1, 2, 3); diff --git a/doc/html/fusion/sequence/intrinsic/functions/swap.html b/doc/html/fusion/sequence/intrinsic/functions/swap.html index 4748ace9..3834d00c 100644 --- a/doc/html/fusion/sequence/intrinsic/functions/swap.html +++ b/doc/html/fusion/sequence/intrinsic/functions/swap.html @@ -27,21 +27,21 @@ swap- + Description
Performs an element by element swap of the elements in 2 sequences.
- + Synopsis
template<typename Seq1, typename Seq2> void swap(Seq1& seq1, Seq2& seq2);- + Parameters
@@ -87,7 +87,7 @@
- + Expression Semantics
@@ -106,7 +106,7 @@ /sequence/intrinsic/swap.hpp>- + Example
vector
<int, std::string> v1(1, "hello"), v2(2, "world"); diff --git a/doc/html/fusion/sequence/intrinsic/metafunctions/at.html b/doc/html/fusion/sequence/intrinsic/metafunctions/at.html index f85b92da..8e2c365f 100644 --- a/doc/html/fusion/sequence/intrinsic/metafunctions/at.html +++ b/doc/html/fusion/sequence/intrinsic/metafunctions/at.html @@ -27,16 +27,14 @@ at- + Description
- Returns the result type of
at
- [6] - . + Returns the result type ofat
[6].- + Synopsis
template< @@ -48,7 +46,7 @@ };- + Expression Semantics
@@ -127,14 +125,14 @@ usingat
to access theN
th element ofSeq
.- + Header
#include <boost/fusion/sequence/intrinsic/at.hpp> #include <boost/fusion/include/at.hpp>- + Example
typedefvector
<int,float,char> vec; @@ -142,12 +140,12 @@
-+[6] -
result_of::at
reflects the actual return - type of the functionat
. Sequence(s) - typically return references to its elements via theat
function. If you want - to get the actual element type, useresult_of::value_at
-[6] +
result_of::at
reflects the actual return + type of the functionat
. Sequence(s) + typically return references to its elements via theat
function. If you want to + get the actual element type, useresult_of::value_at
+
a
, and for
each element, e2
, in
sequence b
, e1 == e2
returns true. For any 2 zero length
- _sequence_s, e and f, e == f returns
- true.
+ __sequence__s, e and f, e == f returns true.
#include <boost/fusion/sequence/comparison/equal_to.hpp> #include <boost/fusion/include/equal_to.hpp>
vector
<int, char> v1(5, 'a'); diff --git a/doc/html/fusion/sequence/operator/comparison/greater_than.html b/doc/html/fusion/sequence/operator/comparison/greater_than.html index c8f6ba8f..894eac5d 100644 --- a/doc/html/fusion/sequence/operator/comparison/greater_than.html +++ b/doc/html/fusion/sequence/operator/comparison/greater_than.html @@ -31,7 +31,7 @@ Lexicographically compare two sequences.- + Synopsis
template <typename Seq1, typename Seq2> @@ -39,7 +39,7 @@ operator>(Seq1 const& a, Seq2 const& b);- + Parameters
@@ -85,7 +85,7 @@
- + Expression Semantics
@@ -112,14 +112,14 @@ Semantics: Returns b < a.- + Header
#include <boost/fusion/sequence/comparison/less_equal.hpp> #include <boost/fusion/include/less_equal.hpp>- + Example
vector
<int, float> v1(4, 3.3f); diff --git a/doc/html/fusion/sequence/operator/comparison/greater_than_equal.html b/doc/html/fusion/sequence/operator/comparison/greater_than_equal.html index c2b67126..ed44f441 100644 --- a/doc/html/fusion/sequence/operator/comparison/greater_than_equal.html +++ b/doc/html/fusion/sequence/operator/comparison/greater_than_equal.html @@ -31,7 +31,7 @@ Lexicographically compare two sequences.- + Synopsis
template <typename Seq1, typename Seq2> @@ -39,7 +39,7 @@ operator>=(Seq1 const& a, Seq2 const& b);- + Parameters
@@ -85,7 +85,7 @@
- + Expression Semantics
@@ -112,14 +112,14 @@ Semantics: Returns !(a < b).- + Header
#include <boost/fusion/sequence/comparison/greater_equal.hpp> #include <boost/fusion/include/greater_equal.hpp>- + Example
vector
<int, float> v1(4, 3.3f); diff --git a/doc/html/fusion/sequence/operator/comparison/less_than.html b/doc/html/fusion/sequence/operator/comparison/less_than.html index fd2884d8..d1d6df44 100644 --- a/doc/html/fusion/sequence/operator/comparison/less_than.html +++ b/doc/html/fusion/sequence/operator/comparison/less_than.html @@ -31,7 +31,7 @@ Lexicographically compare two sequences.- + Synopsis
template <typename Seq1, typename Seq2> @@ -39,7 +39,7 @@ operator<(Seq1 const& a, Seq2 const& b);- + Parameters
@@ -85,7 +85,7 @@
- + Expression Semantics
@@ -114,14 +114,14 @@ andb
.- + Header
#include <boost/fusion/sequence/comparison/less.hpp> #include <boost/fusion/include/less.hpp>- + Example
vector
<int, float> v1(4, 3.3f); diff --git a/doc/html/fusion/sequence/operator/comparison/less_than_equal.html b/doc/html/fusion/sequence/operator/comparison/less_than_equal.html index f5974510..6e33dcb7 100644 --- a/doc/html/fusion/sequence/operator/comparison/less_than_equal.html +++ b/doc/html/fusion/sequence/operator/comparison/less_than_equal.html @@ -31,7 +31,7 @@ Lexicographically compare two sequences.- + Synopsis
template <typename Seq1, typename Seq2> @@ -39,7 +39,7 @@ operator<=(Seq1 const& a, Seq2 const& b);- + Parameters
@@ -85,7 +85,7 @@
- + Expression Semantics
@@ -112,14 +112,14 @@ Semantics: Returns !(b < a).- + Header
#include <boost/fusion/sequence/comparison/less_equal.hpp> #include <boost/fusion/include/less_equal.hpp>- + Example
vector
<int, float> v1(4, 3.3f); diff --git a/doc/html/fusion/sequence/operator/comparison/not_equal.html b/doc/html/fusion/sequence/operator/comparison/not_equal.html index eea3158a..6a8f7efd 100644 --- a/doc/html/fusion/sequence/operator/comparison/not_equal.html +++ b/doc/html/fusion/sequence/operator/comparison/not_equal.html @@ -31,7 +31,7 @@ Compare two sequences for inequality.- + Synopsis
template <typename Seq1, typename Seq2> @@ -39,7 +39,7 @@ operator!=(Seq1 const& a, Seq2 const& b);- + Parameters
@@ -85,7 +85,7 @@
- + Expression Semantics
@@ -115,14 +115,14 @@ Returns !(a == b).- + Header
#include <boost/fusion/sequence/comparison/not_equal_to.hpp> #include <boost/fusion/include/not_equal_to.hpp>- + Example
vector
<int, char> v3(5, 'b'); diff --git a/doc/html/fusion/sequence/operator/i_o.html b/doc/html/fusion/sequence/operator/i_o.html index e0da9452..990b7b68 100644 --- a/doc/html/fusion/sequence/operator/i_o.html +++ b/doc/html/fusion/sequence/operator/i_o.html @@ -113,7 +113,7 @@ representation may not be unambiguously parseable.- + Header
#include <boost/fusion/sequence/io.hpp> diff --git a/doc/html/fusion/sequence/operator/i_o/in.html b/doc/html/fusion/sequence/operator/i_o/in.html index b6a98b18..b04a0932 100644 --- a/doc/html/fusion/sequence/operator/i_o/in.html +++ b/doc/html/fusion/sequence/operator/i_o/in.html @@ -27,7 +27,7 @@ in- + Description
@@ -35,7 +35,7 @@ stream.
- + Synopsis
template <typename IStream, typename Sequence> @@ -43,7 +43,7 @@ operator>>(IStream& is, Sequence& seq);- + Parameters
@@ -107,7 +107,7 @@
- + Expression Semantics
@@ -122,14 +122,14 @@ e.- + Header
#include <boost/fusion/sequence/io/in.hpp> #include <boost/fusion/include/in.hpp>- + Example
vector
<int, std::string, char> v; diff --git a/doc/html/fusion/sequence/operator/i_o/out.html b/doc/html/fusion/sequence/operator/i_o/out.html index e1a9ab6a..c3fd7f5d 100644 --- a/doc/html/fusion/sequence/operator/i_o/out.html +++ b/doc/html/fusion/sequence/operator/i_o/out.html @@ -27,7 +27,7 @@ out- + Description
@@ -35,7 +35,7 @@ stream.
- + Synopsis
template <typename OStream, typename Sequence> @@ -43,7 +43,7 @@ operator<<(OStream& os, Sequence& seq);- + Parameters
@@ -107,7 +107,7 @@
- + Expression Semantics
@@ -122,14 +122,14 @@ e.- + Header
#include <boost/fusion/sequence/io/out.hpp> #include <boost/fusion/include/out.hpp>- + Example
std::cout <<make_vector
(123, "Hello", 'x') << std::endl; diff --git a/doc/html/fusion/support/category_of.html b/doc/html/fusion/support/category_of.html index ba07cfca..2d80db72 100644 --- a/doc/html/fusion/support/category_of.html +++ b/doc/html/fusion/support/category_of.html @@ -27,7 +27,7 @@ category_of- + Description
@@ -37,7 +37,7 @@ Sequence Concepts).
- + Synopsis
namespace traits @@ -50,7 +50,7 @@ }- + Parameters
@@ -95,7 +95,7 @@
- + Expression Semantics
@@ -137,14 +137,14 @@ of a particular Sequence or Iterator.- + Header
#include <boost/fusion/support/category_of.hpp> #include <boost/fusion/include/category_of.hpp>- + Example
using boost::is_base_of; diff --git a/doc/html/fusion/support/deduce.html b/doc/html/fusion/support/deduce.html index 8fe7a8ea..78813dc7 100644 --- a/doc/html/fusion/support/deduce.html +++ b/doc/html/fusion/support/deduce.html @@ -27,7 +27,7 @@ deduce- + Description
@@ -40,14 +40,14 @@ Reference wrappers are removed (see
boost::ref
).- + Header
#include <boost/fusion/support/deduce.hpp> #include <boost/fusion/include/deduce.hpp>- + Synopsis
namespace traits @@ -60,7 +60,7 @@ }- + Example
template <typename T> @@ -80,10 +80,12 @@ }- + See also
- +
- +
deduce_sequence
+
diff --git a/doc/html/fusion/support/deduce_sequence.html b/doc/html/fusion/support/deduce_sequence.html index fccd3838..c620818f 100644 --- a/doc/html/fusion/support/deduce_sequence.html +++ b/doc/html/fusion/support/deduce_sequence.html @@ -27,7 +27,7 @@ deduce_sequence |
diff --git a/doc/html/fusion/support/is_sequence.html b/doc/html/fusion/support/is_sequence.html index feaeed93..0ef1a98f 100644 --- a/doc/html/fusion/support/is_sequence.html +++ b/doc/html/fusion/support/is_sequence.html @@ -27,7 +27,7 @@ is_sequence |
#include <boost/fusion/support/is_sequence.hpp> #include <boost/fusion/include/is_sequence.hpp>
BOOST_MPL_ASSERT_NOT(( traits::is_sequence< std::vector<int> > )); diff --git a/doc/html/fusion/support/is_view.html b/doc/html/fusion/support/is_view.html index d49994d8..40128231 100644 --- a/doc/html/fusion/support/is_view.html +++ b/doc/html/fusion/support/is_view.html @@ -27,7 +27,7 @@ is_view- + Description
@@ -41,7 +41,7 @@ specialized to accomodate clients providing Fusion conforming views.
- + Synopsis
namespace traits @@ -54,7 +54,7 @@ }- + Parameters
@@ -99,7 +99,7 @@
- + Expression Semantics
typedef traits::is_view<T>::type c; @@ -115,14 +115,14 @@ otherwise.- + Header
#include <boost/fusion/support/is_view.hpp> #include <boost/fusion/include/is_view.hpp>- + Example
BOOST_MPL_ASSERT_NOT(( traits::is_view<std::vector<int> > )); diff --git a/doc/html/fusion/support/pair.html b/doc/html/fusion/support/pair.html index f6ff3323..0e79948c 100644 --- a/doc/html/fusion/support/pair.html +++ b/doc/html/fusion/support/pair.html @@ -27,7 +27,7 @@ pair- + Description
@@ -37,7 +37,7 @@ the first type does not have data. It is used as elements in
map
s, for example.- + Synopsis
template <typename First, typename Second> @@ -60,7 +60,7 @@ make_pair(Second const &);- + Template parameters
@@ -137,7 +137,7 @@
- + Expression Semantics
@@ -317,14 +317,14 @@
- + Header
#include <boost/fusion/support/pair.hpp> #include <boost/fusion/include/pair.hpp>- + Example
pair<int, char> p('X'); diff --git a/doc/html/fusion/support/tag_of.html b/doc/html/fusion/support/tag_of.html index 44df1f87..5f5b3f62 100644 --- a/doc/html/fusion/support/tag_of.html +++ b/doc/html/fusion/support/tag_of.html @@ -27,7 +27,7 @@ tag_of- + Description
@@ -41,7 +41,7 @@ conforming sequences.
- + Synopsis
namespace traits @@ -54,7 +54,7 @@ }- + Parameters
@@ -99,7 +99,7 @@
- + Expression Semantics
typedef traits::tag_of<T>::type tag; @@ -112,14 +112,14 @@ withT
.- + Header
#include <boost/fusion/support/tag_of.hpp> #include <boost/fusion/include/tag_of.hpp>- + Example
typedef traits::tag_of<list
<> >::type tag1; diff --git a/doc/html/fusion/tuple/class_template_tuple.html b/doc/html/fusion/tuple/class_template_tuple.html index ab31bafc..00ad4835 100644 --- a/doc/html/fusion/tuple/class_template_tuple.html +++ b/doc/html/fusion/tuple/class_template_tuple.html @@ -48,7 +48,7 @@ in future releases of fusion.- + Synopsis
template< diff --git a/doc/html/fusion/tuple/class_template_tuple/construction.html b/doc/html/fusion/tuple/class_template_tuple/construction.html index 3969cc0e..cb0f7258 100644 --- a/doc/html/fusion/tuple/class_template_tuple/construction.html +++ b/doc/html/fusion/tuple/class_template_tuple/construction.html @@ -27,7 +27,7 @@ Construction- + Description
@@ -38,7 +38,7 @@ in this section.
- + Specification
diff --git a/doc/html/fusion/tuple/class_template_tuple/element_access.html b/doc/html/fusion/tuple/class_template_tuple/element_access.html index c8a9dd23..c99f6e74 100644 --- a/doc/html/fusion/tuple/class_template_tuple/element_access.html +++ b/doc/html/fusion/tuple/class_template_tuple/element_access.html @@ -28,7 +28,7 @@ access- + Description
@@ -37,7 +37,7 @@ function to provide access to it's elements by zero based numeric index.
- + Specification
template<int I, T> diff --git a/doc/html/fusion/tuple/class_template_tuple/relational_operators.html b/doc/html/fusion/tuple/class_template_tuple/relational_operators.html index e586f7ab..5ade5e72 100644 --- a/doc/html/fusion/tuple/class_template_tuple/relational_operators.html +++ b/doc/html/fusion/tuple/class_template_tuple/relational_operators.html @@ -28,7 +28,7 @@ operators- + Description
@@ -36,7 +36,7 @@ Tuple provides the standard boolean relational operators.
- + Specification
diff --git a/doc/html/fusion/tuple/class_template_tuple/tuple_creation_functions.html b/doc/html/fusion/tuple/class_template_tuple/tuple_creation_functions.html index 3f879cd4..0b0a0fb4 100644 --- a/doc/html/fusion/tuple/class_template_tuple/tuple_creation_functions.html +++ b/doc/html/fusion/tuple/class_template_tuple/tuple_creation_functions.html @@ -28,17 +28,17 @@ creation functions- + Description
- TR1 describes 2 utility functions for creating _tr1tuple_s.
make_tuple
- builds a tuple out of it's argument list, andtie
+ TR1 describes 2 utility functions for creating __tr1__tuple__s.make_tuple
builds a tuple out of it's + argument list, andtie
builds a tuple of references to it's arguments. The details of these creation functions are described in this section.- + Specification
template<typename T1, typename T2, ..., typename TN> diff --git a/doc/html/fusion/tuple/class_template_tuple/tuple_helper_classes.html b/doc/html/fusion/tuple/class_template_tuple/tuple_helper_classes.html index 36ee3868..c2e93744 100644 --- a/doc/html/fusion/tuple/class_template_tuple/tuple_helper_classes.html +++ b/doc/html/fusion/tuple/class_template_tuple/tuple_helper_classes.html @@ -28,7 +28,7 @@ helper classes- + Description
@@ -37,7 +37,7 @@ tuple size, and the element types.
- + Specification
tuple_size<T>::value diff --git a/doc/html/fusion/tuple/pairs.html b/doc/html/fusion/tuple/pairs.html index 196853ca..4c89cd3b 100644 --- a/doc/html/fusion/tuple/pairs.html +++ b/doc/html/fusion/tuple/pairs.html @@ -27,7 +27,7 @@ Pairs- + Description
@@ -36,7 +36,7 @@ as if it were a 2 element tuple.
- + Specification
tuple_size<std::pair<T1, T2> >::value @@ -83,10 +83,7 @@ ill-formed.- Returns:
diff --git a/doc/html/fusion/view.html b/doc/html/fusion/view.html index 53d5d02c..73f3a10d 100644 --- a/doc/html/fusion/view.html +++ b/doc/html/fusion/view.html @@ -47,7 +47,7 @@ to copy and be passed around by value.pr.first
- ifI == - 0
elsepr.second
.[*Returns: -pr.first
ifI + [*Returns:
pr.first
ifI == 0
elsepr.second
.- + Header
#include <boost/fusion/view.hpp> diff --git a/doc/html/fusion/view/filter_view.html b/doc/html/fusion/view/filter_view.html index 35a6afd5..76868945 100644 --- a/doc/html/fusion/view/filter_view.html +++ b/doc/html/fusion/view/filter_view.html @@ -27,7 +27,7 @@ filter_view- + Description
@@ -38,21 +38,21 @@ only those elements for which its predicate evaluates to
mpl::true_
.- + Header
#include <boost/fusion/view/filter_view.hpp> #include <boost/fusion/include/filter_view.hpp>- + Synopsis
template <typename Sequence, typename Pred> struct filter_view;- + Template parameters
@@ -92,8 +92,6 @@
- -
@@ -108,24 +106,24 @@ - -
- + Model of
-
- Forward Sequence
- -Associative - Sequence if
+ Forward Sequence + +Sequence
- implements the Associative - Sequence model. -- + Associative + Sequence if
Sequence
+ implements the Associative + Sequence model. +Notation
@@ -146,7 +144,7 @@- + Expression Semantics
@@ -216,7 +214,7 @@
- + Example
using boost::mpl::_; diff --git a/doc/html/fusion/view/iterator_range.html b/doc/html/fusion/view/iterator_range.html index 8932f575..43b95aed 100644 --- a/doc/html/fusion/view/iterator_range.html +++ b/doc/html/fusion/view/iterator_range.html @@ -27,7 +27,7 @@ iterator_range- + Description
@@ -35,21 +35,21 @@ sub-range of its underlying sequence delimited by a pair of iterators.
- + Header
#include <boost/fusion/view/iterator_range.hpp> #include <boost/fusion/include/iterator_range.hpp>- + Synopsis
template <typename First, typename Last> struct iterator_range;- + Template parameters
@@ -88,8 +88,6 @@
- -
@@ -104,32 +102,30 @@ - -
- + Model of
- -Forward Sequence, - Bidirectional - Sequence or Random - Access Sequence depending on the traversal characteristics (see - Sequence Traversal Concept) - of its underlying sequence. -
+ Forward Sequence, + Bidirectional + Sequence or Random + Access Sequence depending on the traversal characteristics (see + Sequence Traversal + Concept) of its underlying sequence. +- -Associative - Sequence if
+ Associative + Sequence ifFirst
- andLast
implement the - Associative - Iterator model. -First
+ andLast
implement the + Associative + Iterator model. +Notation
@@ -153,7 +149,7 @@- + Expression Semantics
@@ -227,7 +223,7 @@
char const* s = "Ruby"; diff --git a/doc/html/fusion/view/joint_view.html b/doc/html/fusion/view/joint_view.html index 5a28a489..93a87107 100644 --- a/doc/html/fusion/view/joint_view.html +++ b/doc/html/fusion/view/joint_view.html @@ -27,7 +27,7 @@ joint_view- + Description
@@ -35,21 +35,21 @@ which is a concatenation of two sequences.
- + Header
#include <boost/fusion/view/joint_view.hpp> #include <boost/fusion/include/joint_view.hpp>- + Synopsis
template <typename Sequence1, typename Sequence2> struct joint_view;- + Template parameters
@@ -89,8 +89,6 @@
- -
@@ -106,25 +104,25 @@ - -
- + Model of
-
- Forward Sequence
- -Associative - Sequence if
+ Forward Sequence + +Sequence1
- andSequence2
implement - the Associative - Sequence model. -- + Associative + Sequence if
Sequence1
+ andSequence2
implement + the Associative + Sequence model. +Notation
@@ -148,7 +146,7 @@- + Expression Semantics
@@ -220,7 +218,7 @@
vector
<int, char> v1(3, 'x'); diff --git a/doc/html/fusion/view/nview.html b/doc/html/fusion/view/nview.html index 9672bcf4..19653eb6 100644 --- a/doc/html/fusion/view/nview.html +++ b/doc/html/fusion/view/nview.html @@ -27,7 +27,7 @@ nview- + Description
@@ -38,14 +38,14 @@ and a list of indicies specifying the elements to iterate over.
- + Header
#include <boost/fusion/view/nview.hpp> #include <boost/fusion/include/nview.hpp>- + Synopsis
template <typename Sequence, typename Indicies> @@ -56,7 +56,7 @@ as_nview(Sequence& s);- + Template parameters
@@ -96,8 +96,6 @@
- -
@@ -113,8 +111,6 @@ - -
@@ -137,14 +133,14 @@ - + Model of
+ Random + Access Sequence (see Sequence + Traversal Concept) +Notation
@@ -163,7 +159,7 @@
- + Expression Semantics
@@ -239,7 +235,7 @@ of references to the elements of the original Fusion Sequence
- + Example
typedef+std::cout << nview<vec, indicies>(v1) << std::endl; // (2.0 c 1 2.0 1) +std::cout << as_nview<2, 1, 1, 0>(v1) << std::endl; // (2.0 c c 1) +vector
<int, char, double> vec; @@ -247,9 +243,9 @@ vec v1(1, 'c', 2.0); -std::cout << nview<vec, indicies>(v1) << std::endl; // (2.0 c 1 2.0 1) -std::cout << as_nview<2, 1, 1, 0>(v1) << std::endl; // (2.0 c c 1) -
diff --git a/doc/html/fusion/view/repetitive_view.html b/doc/html/fusion/view/repetitive_view.html index ef1b8ca4..9c636bfe 100644 --- a/doc/html/fusion/view/repetitive_view.html +++ b/doc/html/fusion/view/repetitive_view.html @@ -27,7 +27,7 @@ repetitive_view |
- - |
-
@@ -169,8 +165,6 @@
-
@@ -188,8 +182,6 @@
-
@@ -213,8 +205,6 @@
-
typedef vector
<int, char, double> vec1;
@@ -272,8 +262,8 @@
vec1 v1(1, 'c', 2.0);
vec2 v2(repetitive_view<vec1>(v1));
-std::cout << v2 << std::endl; // 1, 'c', 2.0, 1, 'c'
-
+std::cout << v2 << std::endl; // 1, 'c', 2.0, 1, 'c'
+
diff --git a/doc/html/fusion/view/reverse_view.html b/doc/html/fusion/view/reverse_view.html index c642bbea..6df8902b 100644 --- a/doc/html/fusion/view/reverse_view.html +++ b/doc/html/fusion/view/reverse_view.html @@ -32,21 +32,21 @@ element will be its first. |
- - |
Sequence
- is a Bidirectional
- Sequence else, Random
- Access Sequence if Sequence
- is a Random
- Access Sequence.
- Sequence
+ is a Bidirectional
+ Sequence else, Random
+ Access Sequence if Sequence
+ is a Random
+ Access Sequence.
+
Sequence
- implements the Associative
- Sequence model.
- Sequence
+ implements the Associative
+ Sequence model.
+
Notation
@@ -129,7 +127,7 @@typedefvector
<int, short, double> vector_type; diff --git a/doc/html/fusion/view/single_view.html b/doc/html/fusion/view/single_view.html index 8309989e..3902dd28 100644 --- a/doc/html/fusion/view/single_view.html +++ b/doc/html/fusion/view/single_view.html @@ -31,21 +31,21 @@ a value as a single element sequence.- + Header
#include <boost/fusion/view/single_view.hpp> #include <boost/fusion/include/single_view.hpp>- + Synopsis
template <typename T> struct single_view;- + Template parameters
@@ -83,16 +83,17 @@
- -
- + Model of
- +Notation
@@ -111,13 +112,13 @@
- + Expression Semantics
Semantics of an expression is defined only where it differs from, or is not - defined in Forward - Sequence. + defined in Random + Access Sequence.
@@ -182,7 +183,7 @@ - + Example
single_view<int> view(3); diff --git a/doc/html/fusion/view/transform_view.html b/doc/html/fusion/view/transform_view.html index b62c69e5..da88ed47 100644 --- a/doc/html/fusion/view/transform_view.html +++ b/doc/html/fusion/view/transform_view.html @@ -36,14 +36,14 @@ Traversal Concept) of its underlying sequence or sequences.- + Header
#include <boost/fusion/view/transform_view.hpp> #include <boost/fusion/include/transform_view.hpp>- + Synopsis
@@ -59,7 +59,7 @@ struct transform_view;
- + Template parameters
@@ -99,8 +99,6 @@
- -
@@ -116,8 +114,6 @@ - -
@@ -133,8 +129,6 @@ - -
@@ -152,8 +146,6 @@ - -
@@ -172,24 +164,22 @@ - -
- + Model of
+ Forward Sequence, + Bidirectional + Sequence or Random + Access Sequence depending on the traversal characteristics (see + Sequence Traversal + Concept) of its underlying sequence. +
- -Forward Sequence, - Bidirectional - Sequence or Random - Access Sequence depending on the traversal characteristics (see - Sequence Traversal Concept) - of its underlying sequence. -
Notation
@@ -234,7 +224,7 @@
- + Expression Semantics
@@ -329,7 +319,7 @@
struct square diff --git a/doc/html/fusion/view/zip_view.html b/doc/html/fusion/view/zip_view.html index aa19eb52..5ed95eca 100644 --- a/doc/html/fusion/view/zip_view.html +++ b/doc/html/fusion/view/zip_view.html @@ -27,7 +27,7 @@ zip_view- + Description
@@ -35,24 +35,24 @@ which iterates over a collection of Sequence(s) in parallel. A
zip_view
is constructed from a Sequence of references - to the component _sequence_s. + to the component __sequence__s.- + Header
#include <boost/fusion/view/zip_view.hpp> #include <boost/fusion/include/zip_view.hpp>- + Synopsis
template <typename Sequences> struct zip_view;- + Template parameters
@@ -87,27 +87,25 @@
A Forward - Sequence of references to other Fusion _sequence_s + Sequence of references to other Fusion __sequence__s
- -
- + Model of
+ Forward Sequence, + Bidirectional + Sequence or Random + Access Sequence depending on the traversal characteristics (see + Sequence Traversal + Concept) of its underlying sequence. +
- -Forward Sequence, - Bidirectional - Sequence or Random - Access Sequence depending on the traversal characteristics (see - Sequence Traversal Concept) - of its underlying sequence. -
Notation
@@ -126,7 +124,7 @@
- + Expression Semantics
@@ -161,7 +159,7 @@
Creates a
zip_view
- given a sequence of references to the component _sequence_s. + given a sequence of references to the component __sequence__s.
typedef+std::cout << zip_view<sequences>(sequences(v1, v2)) << std::endl; // ((1 a) (2 b)) +vector
<int,int> vec1; @@ -205,8 +203,8 @@ vec1 v1(1,2); vec2 v2('a','b'); typedefvector
<vec1&, vec2&> sequences; -std::cout << zip_view<sequences>(sequences(v1, v2)) << std::endl; // ((1 a) (2 b)) -
diff --git a/doc/html/index.html b/doc/html/index.html index 8a1fd378..e70b9d80 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -34,7 +34,7 @@ |
Last revised: July 06, 2011 at 18:22:15 GMT |
+Last revised: July 08, 2011 at 18:14:46 GMT |