diff --git a/BOOST_COMPUTE_ADAPT_STRUCT.html b/BOOST_COMPUTE_ADAPT_STRUCT.html index 3c9f1bde..08bd9f68 100644 --- a/BOOST_COMPUTE_ADAPT_STRUCT.html +++ b/BOOST_COMPUTE_ADAPT_STRUCT.html @@ -24,7 +24,7 @@ BOOST_COMPUTE_ADAPT_STRUCT(type, name, members)
-

Description

+

Description

The BOOST_COMPUTE_ADAPT_STRUCT() macro makes a C++ struct/class available to OpenCL kernels.

For example, to adapt a 2D particle struct with position (x, y) and velocity (dx, dy):

diff --git a/BOOST_COMPUTE_CLOSURE.html b/BOOST_COMPUTE_CLOSURE.html index 60162e2d..5892545d 100644 --- a/BOOST_COMPUTE_CLOSURE.html +++ b/BOOST_COMPUTE_CLOSURE.html @@ -24,7 +24,7 @@ BOOST_COMPUTE_CLOSURE(return_type, name, args, capture, source)
-

Description

+

Description

Creates a closure function object with name and source.

For example, to create a function which checks if a 2D point is contained in a circle of a given radius:

diff --git a/BOOST_COMPUTE_DETAIL_DECLARE_CAN_ACCUMULATE_WITH_REDUCE.html b/BOOST_COMPUTE_DETAIL_DECLARE_CAN_ACCUMULATE_WITH_REDUCE.html index 993c1d6b..565ce517 100644 --- a/BOOST_COMPUTE_DETAIL_DECLARE_CAN_ACCUMULATE_WITH_REDUCE.html +++ b/BOOST_COMPUTE_DETAIL_DECLARE_CAN_ACCUMULATE_WITH_REDUCE.html @@ -6,12 +6,12 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -34,7 +34,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/BOOST_COMPUTE_FUNCTION.html b/BOOST_COMPUTE_FUNCTION.html index e2717c13..8d868c5c 100644 --- a/BOOST_COMPUTE_FUNCTION.html +++ b/BOOST_COMPUTE_FUNCTION.html @@ -24,7 +24,7 @@ BOOST_COMPUTE_FUNCTION(return_type, name, args, source)
-

Description

+

Description

Creates a function object with name and source.

The function declaration and signature are automatically created using the return_type, name, and args macro parameters. The argument names are _1 to _N (where N is the arity of the function).

diff --git a/BOOST_COMPUTE_STRINGIZE_SOURCE.html b/BOOST_COMPUTE_STRINGIZE_SOURCE.html index 7111805a..4f1eceb6 100644 --- a/BOOST_COMPUTE_STRINGIZE_SOURCE.html +++ b/BOOST_COMPUTE_STRINGIZE_SOURCE.html @@ -24,7 +24,7 @@ BOOST_COMPUTE_STRINGIZE_SOURCE(source)
-

Description

+

Description

Stringizes OpenCL source code.

For example, to create a simple kernel which squares each input value: 

const char source[] = BOOST_COMPUTE_STRINGIZE_SOURCE(
diff --git a/BOOST_COMPUTE_TYPE_NAME.html b/BOOST_COMPUTE_TYPE_NAME.html
index 982086b9..032f9188 100644
--- a/BOOST_COMPUTE_TYPE_NAME.html
+++ b/BOOST_COMPUTE_TYPE_NAME.html
@@ -24,7 +24,7 @@
 
 BOOST_COMPUTE_TYPE_NAME(type, name)
-

Description

+

Description

Registers the OpenCL type for the C++ type to name.

For example, the following will allow Eigen's Vector2f type to be used with Boost.Compute algorithms and containers as the built-in float2 type. 

BOOST_COMPUTE_TYPE_NAME(Eigen::Vector2f, float2)
diff --git a/BOOST_COMPUTE_VERSION_PATCH.html b/BOOST_COMPUTE_VERSION_PATCH.html
index c8d54736..094be29e 100644
--- a/BOOST_COMPUTE_VERSION_PATCH.html
+++ b/BOOST_COMPUTE_VERSION_PATCH.html
@@ -7,11 +7,11 @@
 
 
 
-
+
 
 
 

-PrevUpHomeNext
+PrevUpHomeNext
 

 

 

@@ -34,7 +34,7 @@
 
 

 

-PrevUpHomeNext
+PrevUpHomeNext
 

 
 
diff --git a/boost/compute/accumulate_idp10551616.html b/boost/compute/accumulate_idp10551616.html
new file mode 100644
index 00000000..6ba21900
--- /dev/null
+++ b/boost/compute/accumulate_idp10551616.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp10584208.html b/boost/compute/accumulate_idp10584208.html
new file mode 100644
index 00000000..4545b724
--- /dev/null
+++ b/boost/compute/accumulate_idp10584208.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp10821872.html b/boost/compute/accumulate_idp10821872.html
new file mode 100644
index 00000000..cace5b88
--- /dev/null
+++ b/boost/compute/accumulate_idp10821872.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp10854384.html b/boost/compute/accumulate_idp10854384.html
new file mode 100644
index 00000000..39d32bb5
--- /dev/null
+++ b/boost/compute/accumulate_idp10854384.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp10919200.html b/boost/compute/accumulate_idp10919200.html
new file mode 100644
index 00000000..ec34a1ff
--- /dev/null
+++ b/boost/compute/accumulate_idp10919200.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp10950992.html b/boost/compute/accumulate_idp10950992.html
new file mode 100644
index 00000000..ea997c4e
--- /dev/null
+++ b/boost/compute/accumulate_idp10950992.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp11204240.html b/boost/compute/accumulate_idp11204240.html
new file mode 100644
index 00000000..26a44ba1
--- /dev/null
+++ b/boost/compute/accumulate_idp11204240.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp11236832.html b/boost/compute/accumulate_idp11236832.html
new file mode 100644
index 00000000..39cf282d
--- /dev/null
+++ b/boost/compute/accumulate_idp11236832.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp14341472.html b/boost/compute/accumulate_idp14341472.html
new file mode 100644
index 00000000..df6598bf
--- /dev/null
+++ b/boost/compute/accumulate_idp14341472.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp14373104.html b/boost/compute/accumulate_idp14373104.html
new file mode 100644
index 00000000..c2b9e3b6
--- /dev/null
+++ b/boost/compute/accumulate_idp14373104.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp15313344.html b/boost/compute/accumulate_idp15313344.html
new file mode 100644
index 00000000..beb9305d
--- /dev/null
+++ b/boost/compute/accumulate_idp15313344.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp15345136.html b/boost/compute/accumulate_idp15345136.html
new file mode 100644
index 00000000..659984ac
--- /dev/null
+++ b/boost/compute/accumulate_idp15345136.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp15749136.html b/boost/compute/accumulate_idp15749136.html
new file mode 100644
index 00000000..7bc9666d
--- /dev/null
+++ b/boost/compute/accumulate_idp15749136.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp15780768.html b/boost/compute/accumulate_idp15780768.html
new file mode 100644
index 00000000..7c640052
--- /dev/null
+++ b/boost/compute/accumulate_idp15780768.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp16103712.html b/boost/compute/accumulate_idp16103712.html
new file mode 100644
index 00000000..be834fc1
--- /dev/null
+++ b/boost/compute/accumulate_idp16103712.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp16135344.html b/boost/compute/accumulate_idp16135344.html
new file mode 100644
index 00000000..3a34d6b5
--- /dev/null
+++ b/boost/compute/accumulate_idp16135344.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp17188096.html b/boost/compute/accumulate_idp17188096.html
new file mode 100644
index 00000000..8bc164bd
--- /dev/null
+++ b/boost/compute/accumulate_idp17188096.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp17219808.html b/boost/compute/accumulate_idp17219808.html
new file mode 100644
index 00000000..9692cac0
--- /dev/null
+++ b/boost/compute/accumulate_idp17219808.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp18704432.html b/boost/compute/accumulate_idp18704432.html
new file mode 100644
index 00000000..a9f55f08
--- /dev/null
+++ b/boost/compute/accumulate_idp18704432.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp18737024.html b/boost/compute/accumulate_idp18737024.html
new file mode 100644
index 00000000..06d96c7b
--- /dev/null
+++ b/boost/compute/accumulate_idp18737024.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp20390112.html b/boost/compute/accumulate_idp20390112.html
new file mode 100644
index 00000000..e2ed9ab5
--- /dev/null
+++ b/boost/compute/accumulate_idp20390112.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp20421744.html b/boost/compute/accumulate_idp20421744.html
new file mode 100644
index 00000000..8c2c1e45
--- /dev/null
+++ b/boost/compute/accumulate_idp20421744.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp21523456.html b/boost/compute/accumulate_idp21523456.html
new file mode 100644
index 00000000..739a78d4
--- /dev/null
+++ b/boost/compute/accumulate_idp21523456.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp22465536.html b/boost/compute/accumulate_idp22465536.html
new file mode 100644
index 00000000..f6f95c56
--- /dev/null
+++ b/boost/compute/accumulate_idp22465536.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp22497328.html b/boost/compute/accumulate_idp22497328.html
new file mode 100644
index 00000000..db1a2125
--- /dev/null
+++ b/boost/compute/accumulate_idp22497328.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp26561632.html b/boost/compute/accumulate_idp26561632.html
new file mode 100644
index 00000000..e143a6d9
--- /dev/null
+++ b/boost/compute/accumulate_idp26561632.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp26593344.html b/boost/compute/accumulate_idp26593344.html
new file mode 100644
index 00000000..37dbd6f1
--- /dev/null
+++ b/boost/compute/accumulate_idp26593344.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp27326608.html b/boost/compute/accumulate_idp27326608.html
new file mode 100644
index 00000000..da7ce879
--- /dev/null
+++ b/boost/compute/accumulate_idp27326608.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp29492560.html b/boost/compute/accumulate_idp29492560.html
new file mode 100644
index 00000000..673b1879
--- /dev/null
+++ b/boost/compute/accumulate_idp29492560.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp29524272.html b/boost/compute/accumulate_idp29524272.html
new file mode 100644
index 00000000..a285af7f
--- /dev/null
+++ b/boost/compute/accumulate_idp29524272.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp30889168.html b/boost/compute/accumulate_idp30889168.html
new file mode 100644
index 00000000..be573c7f
--- /dev/null
+++ b/boost/compute/accumulate_idp30889168.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp30920960.html b/boost/compute/accumulate_idp30920960.html
new file mode 100644
index 00000000..2a71ba2f
--- /dev/null
+++ b/boost/compute/accumulate_idp30920960.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp34857872.html b/boost/compute/accumulate_idp34857872.html
new file mode 100644
index 00000000..87014cf7
--- /dev/null
+++ b/boost/compute/accumulate_idp34857872.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp34889664.html b/boost/compute/accumulate_idp34889664.html
new file mode 100644
index 00000000..1f6150fb
--- /dev/null
+++ b/boost/compute/accumulate_idp34889664.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp36006656.html b/boost/compute/accumulate_idp36006656.html
new file mode 100644
index 00000000..8061a454
--- /dev/null
+++ b/boost/compute/accumulate_idp36006656.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp36038288.html b/boost/compute/accumulate_idp36038288.html
new file mode 100644
index 00000000..96c6a1bc
--- /dev/null
+++ b/boost/compute/accumulate_idp36038288.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp37674256.html b/boost/compute/accumulate_idp37674256.html
new file mode 100644
index 00000000..593e8bfc
--- /dev/null
+++ b/boost/compute/accumulate_idp37674256.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp37706768.html b/boost/compute/accumulate_idp37706768.html
new file mode 100644
index 00000000..bd712dbf
--- /dev/null
+++ b/boost/compute/accumulate_idp37706768.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp40434656.html b/boost/compute/accumulate_idp40434656.html
new file mode 100644
index 00000000..29d821fb
--- /dev/null
+++ b/boost/compute/accumulate_idp40434656.html
@@ -0,0 +1,52 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T, typename BinaryFunction> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               BinaryFunction function, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the result of applying function to the elements in the range [first, last) and init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/accumulate_idp40466368.html b/boost/compute/accumulate_idp40466368.html
new file mode 100644
index 00000000..714b75e5
--- /dev/null
+++ b/boost/compute/accumulate_idp40466368.html
@@ -0,0 +1,51 @@
+
+
+
+Function template accumulate
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Function template accumulate

+
boost::compute::accumulate

+

+
Synopsis

+
// In header: <boost/compute/algorithm/accumulate.hpp>
+
+
+template<typename InputIterator, typename T> 
+  T accumulate(InputIterator first, InputIterator last, T init, 
+               command_queue & queue = system::default_queue());

+

+
Description

+
Returns the sum of the elements in the range [first, last) plus init.

+
See Also:

+
reduce() 

+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/adjacent_difference.html b/boost/compute/adjacent_difference.html
index c2256703..4c030433 100644
--- a/boost/compute/adjacent_difference.html
+++ b/boost/compute/adjacent_difference.html
@@ -29,7 +29,7 @@
                       OutputIterator result, 
                       command_queue & queue = system::default_queue());
-

Description

+

Description

Stores the difference of each pair of consecutive values in the range [first, last) to the range beginning at result.

diff --git a/boost/compute/adjacent_find.html b/boost/compute/adjacent_find.html index b230f75e..25f5098f 100644 --- a/boost/compute/adjacent_find.html +++ b/boost/compute/adjacent_find.html @@ -28,7 +28,7 @@ adjacent_find(InputIterator first, InputIterator last, command_queue & queue = system::default_queue());
-

Description

+

Description

Searches the range [first, last) for two identical adjacent elements and returns an iterator pointing to the first.

diff --git a/boost/compute/all_of.html b/boost/compute/all_of.html index f1e180ed..baf60f44 100644 --- a/boost/compute/all_of.html +++ b/boost/compute/all_of.html @@ -28,7 +28,7 @@ UnaryPredicate predicate, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns true if predicate returns true for all of the elements in the range [first, last).

diff --git a/boost/compute/allocator.html b/boost/compute/allocator.html index 50401aea..24fccb54 100644 --- a/boost/compute/allocator.html +++ b/boost/compute/allocator.html @@ -33,48 +33,48 @@ typedef std::ptrdiff_t difference_type; // construct/copy/destruct - allocator(const context &); - allocator(const allocator< T > &); - allocator< T > & operator=(const allocator< T > &); - ~allocator(); + allocator(const context &); + allocator(const allocator< T > &); + allocator< T > & operator=(const allocator< T > &); + ~allocator(); - // public member functions - pointer allocate(size_type); - void deallocate(pointer, size_type); - size_type max_size() const; - context get_context() const; + // public member functions + pointer allocate(size_type); + void deallocate(pointer, size_type); + size_type max_size() const; + context get_context() const; - // protected member functions - void set_mem_flags(cl_mem_flags); + // protected member functions + void set_mem_flags(cl_mem_flags); };
-

Description

+

Description

-

+

allocator public construct/copy/destruct

    -
  1. allocator(const context & context);
    2. -
  2. allocator(const allocator< T > & other);
    3. -
  3. allocator< T > & operator=(const allocator< T > & other);
    4. -
  4. ~allocator();
    5. +
  5. allocator(const context & context);
    6. +
  6. allocator(const allocator< T > & other);
    7. +
  7. allocator< T > & operator=(const allocator< T > & other);
    8. +
  8. ~allocator();
-

-allocator public member functions

+

+allocator public member functions

    -
  1. pointer allocate(size_type n);
    2. -
  2. void deallocate(pointer p, size_type n);
    3. -
  3. size_type max_size() const;
    4. -
  4. context get_context() const;
    5. +
  5. pointer allocate(size_type n);
    6. +
  6. void deallocate(pointer p, size_type n);
    7. +
  7. size_type max_size() const;
    8. +
  8. context get_context() const;
-

-allocator protected member functions

-
  1. void set_mem_flags(cl_mem_flags flags);
+

+allocator protected member functions

+
  1. void set_mem_flags(cl_mem_flags flags);
diff --git a/boost/compute/any_of.html b/boost/compute/any_of.html index d1dc1c3c..e934d281 100644 --- a/boost/compute/any_of.html +++ b/boost/compute/any_of.html @@ -28,7 +28,7 @@ UnaryPredicate predicate, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns true if predicate returns true for any of the elements in the range [first, last).

diff --git a/boost/compute/array.html b/boost/compute/array.html index 79d96f0a..e4610d2e 100644 --- a/boost/compute/array.html +++ b/boost/compute/array.html @@ -41,89 +41,89 @@ enum @0 { static_size = = N }; // construct/copy/destruct - explicit array(const context & = system::default_context()); - array(const array< T, N > &); - array(const boost::array< T, N > &, + explicit array(const context & = system::default_context()); + array(const array< T, N > &); + array(const boost::array< T, N > &, const context & = system::default_context()); - array< T, N > & operator=(const array< T, N > &); - array< T, N > & operator=(const boost::array< T, N > &); - ~array(); + array< T, N > & operator=(const array< T, N > &); + array< T, N > & operator=(const boost::array< T, N > &); + ~array(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - size_type size() const; - bool empty() const; - size_type max_size() const; - reference operator[](size_type); - const_reference operator[](size_type) const; - reference at(size_type); - const_reference at(size_type) const; - reference front(); - const_reference front() const; - reference back(); - const_reference back() const; - void fill(const value_type &); - void swap(array< T, N > &); - const buffer & get_buffer() const; + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + size_type size() const; + bool empty() const; + size_type max_size() const; + reference operator[](size_type); + const_reference operator[](size_type) const; + reference at(size_type); + const_reference at(size_type) const; + reference front(); + const_reference front() const; + reference back(); + const_reference back() const; + void fill(const value_type &); + void swap(array< T, N > &); + const buffer & get_buffer() const; };
-

Description

+

Description

-

+

array public construct/copy/destruct

    -
  1. explicit array(const context & context = system::default_context());
    2. -
  2. array(const array< T, N > & other);
    3. -
  3. array(const boost::array< T, N > & array, 
+
  4. explicit array(const context & context = system::default_context());
    5. 
+
  5. array(const array< T, N > & other);
    6. 
+
  6. array(const boost::array< T, N > & array, 
       const context & context = system::default_context());
    7. 
-
  7. array< T, N > & operator=(const array< T, N > & other);
    8. 
-
  8. array< T, N > & operator=(const boost::array< T, N > & array);
    9. 
-
  9. ~array();
    10. 
+
  10. array< T, N > & operator=(const array< T, N > & other);
    11. 
+
  11. array< T, N > & operator=(const boost::array< T, N > & array);
    12. 
+
  12. ~array();
    13.
-

-array public member functions

+

+array public member functions

    -
  1. iterator begin();
    2. -
  2. const_iterator begin() const;
    3. -
  3. const_iterator cbegin() const;
    4. -
  4. iterator end();
    5. -
  5. const_iterator end() const;
    6. -
  6. const_iterator cend() const;
    7. -
  7. reverse_iterator rbegin();
    8. -
  8. const_reverse_iterator rbegin() const;
    9. -
  9. const_reverse_iterator crbegin() const;
    10. -
  10. reverse_iterator rend();
    11. -
  11. const_reverse_iterator rend() const;
    12. -
  12. const_reverse_iterator crend() const;
    13. -
  13. size_type size() const;
    14. -
  14. bool empty() const;
    15. -
  15. size_type max_size() const;
    16. -
  16. reference operator[](size_type index);
    17. -
  17. const_reference operator[](size_type index) const;
    18. -
  18. reference at(size_type index);
    19. -
  19. const_reference at(size_type index) const;
    20. -
  20. reference front();
    21. -
  21. const_reference front() const;
    22. -
  22. reference back();
    23. -
  23. const_reference back() const;
    24. -
  24. void fill(const value_type & value);
    25. -
  25. void swap(array< T, N > & other);
    26. -
  26. const buffer & get_buffer() const;
    27. +
  27. iterator begin();
    28. +
  28. const_iterator begin() const;
    29. +
  29. const_iterator cbegin() const;
    30. +
  30. iterator end();
    31. +
  31. const_iterator end() const;
    32. +
  32. const_iterator cend() const;
    33. +
  33. reverse_iterator rbegin();
    34. +
  34. const_reverse_iterator rbegin() const;
    35. +
  35. const_reverse_iterator crbegin() const;
    36. +
  36. reverse_iterator rend();
    37. +
  37. const_reverse_iterator rend() const;
    38. +
  38. const_reverse_iterator crend() const;
    39. +
  39. size_type size() const;
    40. +
  40. bool empty() const;
    41. +
  41. size_type max_size() const;
    42. +
  42. reference operator[](size_type index);
    43. +
  43. const_reference operator[](size_type index) const;
    44. +
  44. reference at(size_type index);
    45. +
  45. const_reference at(size_type index) const;
    46. +
  46. reference front();
    47. +
  47. const_reference front() const;
    48. +
  48. reference back();
    49. +
  49. const_reference back() const;
    50. +
  50. void fill(const value_type & value);
    51. +
  51. void swap(array< T, N > & other);
    52. +
  52. const buffer & get_buffer() const;
diff --git a/boost/compute/basic_string.html b/boost/compute/basic_string.html index 3a437406..9c76fe56 100644 --- a/boost/compute/basic_string.html +++ b/boost/compute/basic_string.html @@ -37,109 +37,109 @@ typedef ::boost::compute::vector< CharT >::const_reverse_iterator const_reverse_iterator; // construct/copy/destruct - basic_string(); - basic_string(size_type, CharT); - basic_string(const basic_string &, size_type, size_type = npos); - basic_string(const char *, size_type); - basic_string(const char *); - template<typename InputIterator> basic_string(InputIterator, InputIterator); - basic_string(const basic_string< CharT, Traits > &); + basic_string(); + basic_string(size_type, CharT); + basic_string(const basic_string &, size_type, size_type = npos); + basic_string(const char *, size_type); + basic_string(const char *); + template<typename InputIterator> basic_string(InputIterator, InputIterator); + basic_string(const basic_string< CharT, Traits > &); basic_string< CharT, Traits > & - operator=(const basic_string< CharT, Traits > &); - ~basic_string(); + operator=(const basic_string< CharT, Traits > &); + ~basic_string(); - // public member functions - reference at(size_type); - const_reference at(size_type) const; - reference operator[](size_type); - const_reference operator[](size_type) const; - reference front(); - const_reference front() const; - reference back(); - const_reference back() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - bool empty() const; - size_type size() const; - size_type length() const; - size_type max_size() const; - void reserve(size_type); - size_type capacity() const; - void shrink_to_fit(); - void clear(); - basic_string< CharT, Traits > substr(size_type = 0, size_type = npos) const; - size_type find(CharT, size_type = 0) const; + // public member functions + reference at(size_type); + const_reference at(size_type) const; + reference operator[](size_type); + const_reference operator[](size_type) const; + reference front(); + const_reference front() const; + reference back(); + const_reference back() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + bool empty() const; + size_type size() const; + size_type length() const; + size_type max_size() const; + void reserve(size_type); + size_type capacity() const; + void shrink_to_fit(); + void clear(); + basic_string< CharT, Traits > substr(size_type = 0, size_type = npos) const; + size_type find(CharT, size_type = 0) const; // public data members static const size_type npos; };
-

Description

+

Description

-

+

basic_string public construct/copy/destruct

    -
  1. basic_string();
    2. -
  2. basic_string(size_type count, CharT ch);
    3. -
  3. basic_string(const basic_string & other, size_type pos, 
+
  4. basic_string();
    5. 
+
  5. basic_string(size_type count, CharT ch);
    6. 
+
  6. basic_string(const basic_string & other, size_type pos, 
              size_type count = npos);
    7. 
-
  7. basic_string(const char * s, size_type count);
    8. 
-
  8. basic_string(const char * s);
    9. 
+
  9. basic_string(const char * s, size_type count);
    10. 
+
  10. basic_string(const char * s);
    11. 
 
  11. template<typename InputIterator> 
-  basic_string(InputIterator first, InputIterator last);
    12. 
-
  12. basic_string(const basic_string< CharT, Traits > & other);
    13. 
+  basic_string(InputIterator first, InputIterator last);
    13. +
  13. basic_string(const basic_string< CharT, Traits > & other);
  14. basic_string< CharT, Traits > & 
-operator=(const basic_string< CharT, Traits > & other);
    15. -
  15. ~basic_string();
    16. +operator=(const basic_string< CharT, Traits > & other); +
  16. ~basic_string();
-

-basic_string public member functions

+

+basic_string public member functions

    -
  1. reference at(size_type pos);
    2. -
  2. const_reference at(size_type pos) const;
    3. -
  3. reference operator[](size_type pos);
    4. -
  4. const_reference operator[](size_type pos) const;
    5. -
  5. reference front();
    6. -
  6. const_reference front() const;
    7. -
  7. reference back();
    8. -
  8. const_reference back() const;
    9. -
  9. iterator begin();
    10. -
  10. const_iterator begin() const;
    11. -
  11. const_iterator cbegin() const;
    12. -
  12. iterator end();
    13. -
  13. const_iterator end() const;
    14. -
  14. const_iterator cend() const;
    15. -
  15. reverse_iterator rbegin();
    16. -
  16. const_reverse_iterator rbegin() const;
    17. -
  17. const_reverse_iterator crbegin() const;
    18. -
  18. reverse_iterator rend();
    19. -
  19. const_reverse_iterator rend() const;
    20. -
  20. const_reverse_iterator crend() const;
    21. -
  21. bool empty() const;
    22. -
  22. size_type size() const;
    23. -
  23. size_type length() const;
    24. -
  24. size_type max_size() const;
    25. -
  25. void reserve(size_type size);
    26. -
  26. size_type capacity() const;
    27. -
  27. void shrink_to_fit();
    28. -
  28. void clear();
    29. +
  29. reference at(size_type pos);
    30. +
  30. const_reference at(size_type pos) const;
    31. +
  31. reference operator[](size_type pos);
    32. +
  32. const_reference operator[](size_type pos) const;
    33. +
  33. reference front();
    34. +
  34. const_reference front() const;
    35. +
  35. reference back();
    36. +
  36. const_reference back() const;
    37. +
  37. iterator begin();
    38. +
  38. const_iterator begin() const;
    39. +
  39. const_iterator cbegin() const;
    40. +
  40. iterator end();
    41. +
  41. const_iterator end() const;
    42. +
  42. const_iterator cend() const;
    43. +
  43. reverse_iterator rbegin();
    44. +
  44. const_reverse_iterator rbegin() const;
    45. +
  45. const_reverse_iterator crbegin() const;
    46. +
  46. reverse_iterator rend();
    47. +
  47. const_reverse_iterator rend() const;
    48. +
  48. const_reverse_iterator crend() const;
    49. +
  49. bool empty() const;
    50. +
  50. size_type size() const;
    51. +
  51. size_type length() const;
    52. +
  52. size_type max_size() const;
    53. +
  53. void reserve(size_type size);
    54. +
  54. size_type capacity() const;
    55. +
  55. void shrink_to_fit();
    56. +
  56. void clear();
  57. basic_string< CharT, Traits > 
-substr(size_type pos = 0, size_type count = npos) const;
    58. -
  58. size_type find(CharT ch, size_type pos = 0) const;
    59. +substr(size_type pos = 0, size_type count = npos) const; +
  59. size_type find(CharT ch, size_type pos = 0) const;
diff --git a/boost/compute/binary_search.html b/boost/compute/binary_search.html index 9013ee44..35aceadb 100644 --- a/boost/compute/binary_search.html +++ b/boost/compute/binary_search.html @@ -27,7 +27,7 @@ bool binary_search(InputIterator first, InputIterator last, const T & value, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns true if value is in the sorted range [first, last).

diff --git a/boost/compute/buffer.html b/boost/compute/buffer.html index de859f8f..8b7088eb 100644 --- a/boost/compute/buffer.html +++ b/boost/compute/buffer.html @@ -6,12 +6,12 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -26,61 +26,61 @@ class buffer : public boost::compute::memory_object { public: // construct/copy/destruct - buffer(); - explicit buffer(cl_mem, bool = true); - buffer(const context &, size_t, cl_mem_flags = read_write, void * = 0); - buffer(const buffer &); - buffer(BOOST_RV_REF(buffer)); - buffer & operator=(const buffer &); - buffer & operator=(BOOST_RV_REF(buffer)); - ~buffer(); + buffer(); + explicit buffer(cl_mem, bool = true); + buffer(const context &, size_t, cl_mem_flags = read_write, void * = 0); + buffer(const buffer &); + buffer(BOOST_RV_REF(buffer)); + buffer & operator=(const buffer &); + buffer & operator=(BOOST_RV_REF(buffer)); + ~buffer(); - // public member functions - size_t size() const; - template<typename T> T get_info(cl_mem_info) const; + // public member functions + size_t size() const; + template<typename T> T get_info(cl_mem_info) const; };
-

Description

+

Description

The buffer class represents a memory buffer on a compute device.

See Also:

vector

-

+

buffer public construct/copy/destruct

  1. -
    buffer();
    Creates a null buffer object.
    2. +
    buffer();
    Creates a null buffer object.
  2. -
    explicit buffer(cl_mem mem, bool retain = true);
    +
    explicit buffer(cl_mem mem, bool retain = true);

    Creates a buffer object for mem. If retain is true, the reference count for mem will be incremented.

  3. -
    buffer(const context & context, size_t size, cl_mem_flags flags = read_write, 
+
    buffer(const context & context, size_t size, cl_mem_flags flags = read_write, 
        void * host_ptr = 0);
    
 
    Create a new memory buffer in of size with flags in context.
    
 
    See the documentation for clCreateBuffer() for more information.
  4. -
    buffer(const buffer & other);
    Creates a new buffer object as a copy of other.
    5. -
  5. buffer(BOOST_RV_REF(buffer) other);
    6. -
  6. buffer & operator=(const buffer & other);
    7. -
  7. buffer & operator=(BOOST_RV_REF(buffer) other);
    8. +
    buffer(const buffer & other);
    Creates a new buffer object as a copy of other. +
  8. buffer(BOOST_RV_REF(buffer) other);
    9. +
  9. buffer & operator=(const buffer & other);
    10. +
  10. buffer & operator=(BOOST_RV_REF(buffer) other);
  11. -
    ~buffer();
    Destroys the buffer object.
    12. +
    ~buffer();
    Destroys the buffer object.
-

-buffer public member functions

+

+buffer public member functions

  1. -
    size_t size() const;
    Returns the size of the buffer in bytes.
    2. +
    size_t size() const;
    Returns the size of the buffer in bytes.
  2. -
    template<typename T> T get_info(cl_mem_info info) const;
    +
    template<typename T> T get_info(cl_mem_info info) const;

    Returns information about the buffer.

    See the documentation for clGetMemObjectInfo() for more information.

    3. @@ -98,7 +98,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/boost/compute/buffer_iterator.html b/boost/compute/buffer_iterator.html index 38f45737..b105bcd1 100644 --- a/boost/compute/buffer_iterator.html +++ b/boost/compute/buffer_iterator.html @@ -6,12 +6,12 @@ - +
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -31,41 +31,41 @@ typedef super_type::difference_type difference_type; // construct/copy/destruct - buffer_iterator(); - buffer_iterator(const buffer &, size_t); - buffer_iterator(const buffer_iterator< T > &); - buffer_iterator< T > & operator=(const buffer_iterator< T > &); - ~buffer_iterator(); + buffer_iterator(); + buffer_iterator(const buffer &, size_t); + buffer_iterator(const buffer_iterator< T > &); + buffer_iterator< T > & operator=(const buffer_iterator< T > &); + ~buffer_iterator(); - // public member functions - const buffer & get_buffer() const; - size_t get_index() const; + // public member functions + const buffer & get_buffer() const; + size_t get_index() const; };
    -

    Description

    +

    Description

    See Also:

    make_buffer_iterator()

    -

    +

    buffer_iterator public construct/copy/destruct

      -
    1. buffer_iterator();
      2. -
    2. buffer_iterator(const buffer & buffer, size_t index);
      3. -
    3. buffer_iterator(const buffer_iterator< T > & other);
      4. -
    4. buffer_iterator< T > & operator=(const buffer_iterator< T > & other);
      5. -
    5. ~buffer_iterator();
      6. +
    6. buffer_iterator();
      7. +
    7. buffer_iterator(const buffer & buffer, size_t index);
      8. +
    8. buffer_iterator(const buffer_iterator< T > & other);
      9. +
    9. buffer_iterator< T > & operator=(const buffer_iterator< T > & other);
      10. +
    10. ~buffer_iterator();
    -

    -buffer_iterator public member functions

    +

    +buffer_iterator public member functions

      -
    1. const buffer & get_buffer() const;
      2. -
    2. size_t get_index() const;
      3. +
    3. const buffer & get_buffer() const;
      4. +
    4. size_t get_index() const;
    @@ -80,7 +80,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/boost/compute/command_queue.html b/boost/compute/command_queue.html index 82c895e0..a556182a 100644 --- a/boost/compute/command_queue.html +++ b/boost/compute/command_queue.html @@ -31,138 +31,138 @@ enum map_flags { map_read = = CL_MAP_READ, map_write = = CL_MAP_WRITE }; // construct/copy/destruct - command_queue(); - explicit command_queue(cl_command_queue, bool = true); - command_queue(const context &, const device &, + command_queue(); + explicit command_queue(cl_command_queue, bool = true); + command_queue(const context &, const device &, cl_command_queue_properties = 0); - command_queue(const command_queue &); - command_queue(BOOST_RV_REF(command_queue)); - command_queue & operator=(const command_queue &); - command_queue & operator=(BOOST_RV_REF(command_queue)); - ~command_queue(); + command_queue(const command_queue &); + command_queue(BOOST_RV_REF(command_queue)); + command_queue & operator=(const command_queue &); + command_queue & operator=(BOOST_RV_REF(command_queue)); + ~command_queue(); - // public member functions - cl_command_queue & get() const; - device get_device() const; - context get_context() const; - template<typename T> T get_info(cl_command_queue_info) const; - cl_command_queue_properties get_properties() const; - cl_int enqueue_read_buffer(const buffer &, size_t, size_t, void *); - event enqueue_read_buffer_async(const buffer &, size_t, size_t, void *); - cl_int enqueue_read_buffer_rect(const buffer &, const size_t, const size_t, + // public member functions + cl_command_queue & get() const; + device get_device() const; + context get_context() const; + template<typename T> T get_info(cl_command_queue_info) const; + cl_command_queue_properties get_properties() const; + cl_int enqueue_read_buffer(const buffer &, size_t, size_t, void *); + event enqueue_read_buffer_async(const buffer &, size_t, size_t, void *); + cl_int enqueue_read_buffer_rect(const buffer &, const size_t, const size_t, const size_t, size_t, size_t, size_t, size_t, void *); - cl_int enqueue_write_buffer(const buffer &, size_t, size_t, const void *); - event enqueue_write_buffer_async(const buffer &, size_t, size_t, + cl_int enqueue_write_buffer(const buffer &, size_t, size_t, const void *); + event enqueue_write_buffer_async(const buffer &, size_t, size_t, const void *); - cl_int enqueue_write_buffer_rect(const buffer &, const size_t, const size_t, + cl_int enqueue_write_buffer_rect(const buffer &, const size_t, const size_t, const size_t, size_t, size_t, size_t, size_t, void *); - event enqueue_copy_buffer(const buffer &, const buffer &, size_t, size_t, + event enqueue_copy_buffer(const buffer &, const buffer &, size_t, size_t, size_t); - cl_int enqueue_copy_buffer_rect(const buffer &, const buffer &, + cl_int enqueue_copy_buffer_rect(const buffer &, const buffer &, const size_t, const size_t, const size_t, size_t, size_t, size_t, size_t); - event enqueue_fill_buffer(const buffer &, const void *, size_t, size_t, + event enqueue_fill_buffer(const buffer &, const void *, size_t, size_t, size_t); - void * enqueue_map_buffer(const buffer &, cl_map_flags, size_t, size_t); - cl_int enqueue_unmap_buffer(const buffer &, void *); - cl_int enqueue_unmap_mem_object(cl_mem, void *); - cl_int enqueue_read_image(const image2d &, const size_t, const size_t, + void * enqueue_map_buffer(const buffer &, cl_map_flags, size_t, size_t); + cl_int enqueue_unmap_buffer(const buffer &, void *); + cl_int enqueue_unmap_mem_object(cl_mem, void *); + cl_int enqueue_read_image(const image2d &, const size_t, const size_t, size_t, void *); - cl_int enqueue_read_image(const image3d &, const size_t, const size_t, + cl_int enqueue_read_image(const image3d &, const size_t, const size_t, size_t, size_t, void *); - cl_int enqueue_write_image(const image2d &, const size_t, const size_t, + cl_int enqueue_write_image(const image2d &, const size_t, const size_t, size_t, const void *); - cl_int enqueue_write_image(const image3d &, const size_t, const size_t, + cl_int enqueue_write_image(const image3d &, const size_t, const size_t, size_t, size_t, const void *); - cl_int enqueue_copy_image(const image2d &, const image2d &, const size_t, + cl_int enqueue_copy_image(const image2d &, const image2d &, const size_t, const size_t, const size_t); - cl_int enqueue_copy_image(const image2d &, const image3d &, const size_t, + cl_int enqueue_copy_image(const image2d &, const image3d &, const size_t, const size_t, const size_t); - cl_int enqueue_copy_image(const image3d &, const image2d &, const size_t, + cl_int enqueue_copy_image(const image3d &, const image2d &, const size_t, const size_t, const size_t); - cl_int enqueue_copy_image(const image3d &, const image3d &, const size_t, + cl_int enqueue_copy_image(const image3d &, const image3d &, const size_t, const size_t, const size_t); - cl_int enqueue_copy_image_to_buffer(const image2d &, const buffer &, + cl_int enqueue_copy_image_to_buffer(const image2d &, const buffer &, const size_t, const size_t, size_t); - cl_int enqueue_copy_image_to_buffer(const image3d &, const buffer &, + cl_int enqueue_copy_image_to_buffer(const image3d &, const buffer &, const size_t, const size_t, size_t); - cl_int enqueue_copy_buffer_to_image(const buffer &, const image2d &, size_t, + cl_int enqueue_copy_buffer_to_image(const buffer &, const image2d &, size_t, const size_t, const size_t); - cl_int enqueue_copy_buffer_to_image(const buffer &, const image3d &, size_t, + cl_int enqueue_copy_buffer_to_image(const buffer &, const image3d &, size_t, const size_t, const size_t); - cl_int enqueue_fill_image(const image2d &, const void *, const size_t, + cl_int enqueue_fill_image(const image2d &, const void *, const size_t, const size_t); - cl_int enqueue_fill_image(const image3d &, const void *, const size_t, + cl_int enqueue_fill_image(const image3d &, const void *, const size_t, const size_t); - void enqueue_migrate_memory_objects(uint_, const cl_mem *, + void enqueue_migrate_memory_objects(uint_, const cl_mem *, cl_mem_migration_flags); - event enqueue_nd_range_kernel(const kernel &, size_t, const size_t *, + event enqueue_nd_range_kernel(const kernel &, size_t, const size_t *, const size_t *, const size_t * = 0); - event enqueue_task(const kernel &); - event enqueue_native_kernel(void(BOOST_COMPUTE_CL_CALLBACK *user_func)(void *), + event enqueue_task(const kernel &); + event enqueue_native_kernel(void(BOOST_COMPUTE_CL_CALLBACK *user_func)(void *), void *, size_t, uint_, const cl_mem *, const void **); - event enqueue_native_kernel(void(BOOST_COMPUTE_CL_CALLBACK *user_func)(void)); - void flush(); - void finish(); - void enqueue_barrier(); - void enqueue_barrier(const wait_list &); - event enqueue_marker(); - event enqueue_marker(const wait_list &); + event enqueue_native_kernel(void(BOOST_COMPUTE_CL_CALLBACK *user_func)(void)); + void flush(); + void finish(); + void enqueue_barrier(); + void enqueue_barrier(const wait_list &); + event enqueue_marker(); + event enqueue_marker(const wait_list &); };
-

Description

+

Description

Command queues provide the interface for interacting with compute devices. The command_queue class provides methods to copy data to and from a compute device as well as execute compute kernels.

Command queues are created for a compute device within a compute context.

The default command queue for the system can be obtained with the system::default_queue() method.

-

+

command_queue public construct/copy/destruct

  1. -
    command_queue();
    Creates a null command queue.
    2. -
  2. explicit command_queue(cl_command_queue queue, bool retain = true);
    3. +
    command_queue();
    Creates a null command queue. +
  3. explicit command_queue(cl_command_queue queue, bool retain = true);
  4. -
    command_queue(const context & context, const device & device, 
+
    command_queue(const context & context, const device & device, 
               cl_command_queue_properties properties = 0);
    
 
    Creates a command queue in context for device with properties.
    
 
    See the documentation for clCreateCommandQueue() for more information.
  5. -
    command_queue(const command_queue & other);
    Creates a new command queue object as a copy of other.
    6. -
  6. command_queue(BOOST_RV_REF(command_queue) other);
    7. -
  7. command_queue & operator=(const command_queue & other);
    8. -
  8. command_queue & operator=(BOOST_RV_REF(command_queue) other);
    9. +
    command_queue(const command_queue & other);
    Creates a new command queue object as a copy of other. +
  9. command_queue(BOOST_RV_REF(command_queue) other);
    10. +
  10. command_queue & operator=(const command_queue & other);
    11. +
  11. command_queue & operator=(BOOST_RV_REF(command_queue) other);
  12. -
    ~command_queue();
    +
    ~command_queue();

    Destroys the command queue.

    See the documentation for clReleaseCommandQueue() for more information.

-

-command_queue public member functions

+

+command_queue public member functions

  1. -
    cl_command_queue & get() const;
    Returns the underlying OpenCL command queue.
    2. +
    cl_command_queue & get() const;
    Returns the underlying OpenCL command queue.
  2. -
    device get_device() const;
    Returns the device that the command queue issues commands to.
    3. +
    device get_device() const;
    Returns the device that the command queue issues commands to.
  3. -
    context get_context() const;
    Returns the context for the command queue.
    4. +
    context get_context() const;
    Returns the context for the command queue.
  4. -
    template<typename T> T get_info(cl_command_queue_info info) const;
    +
    template<typename T> T get_info(cl_command_queue_info info) const;

    Returns information about the command queue.

    See the documentation for clGetCommandQueueInfo() for more information.

  5. -
    cl_command_queue_properties get_properties() const;
    Returns the properties for the command queue.
    6. +
    cl_command_queue_properties get_properties() const;
    Returns the properties for the command queue.
  6. -
    cl_int enqueue_read_buffer(const buffer & buffer, size_t offset, size_t size, 
+
    cl_int enqueue_read_buffer(const buffer & buffer, size_t offset, size_t size, 
                            void * host_ptr);
    
 
    Enqueues a command to read data from buffer to host memory.
    
 
    See the documentation for clEnqueueReadBuffer() for more information.
    
@@ -172,7 +172,7 @@
  7. -
    event enqueue_read_buffer_async(const buffer & buffer, size_t offset, 
+
    event enqueue_read_buffer_async(const buffer & buffer, size_t offset, 
                                 size_t size, void * host_ptr);
    
 
    Enqueues a command to read data from buffer to host memory. The copy will be performed asynchronously.
    
 
    See the documentation for clEnqueueReadBuffer() for more information.
    
@@ -182,7 +182,7 @@
  8. -
    cl_int enqueue_read_buffer_rect(const buffer & buffer, 
+
    cl_int enqueue_read_buffer_rect(const buffer & buffer, 
                                 const size_t buffer_origin, 
                                 const size_t host_origin, 
                                 const size_t region, size_t buffer_row_pitch, 
@@ -202,7 +202,7 @@
  9. -
    cl_int enqueue_write_buffer(const buffer & buffer, size_t offset, size_t size, 
+
    cl_int enqueue_write_buffer(const buffer & buffer, size_t offset, size_t size, 
                             const void * host_ptr);
    
 
    Enqueues a command to write data from host memory to buffer.
    
 
    See the documentation for clEnqueueWriteBuffer() for more information.
    
@@ -212,7 +212,7 @@
  10. -
    event enqueue_write_buffer_async(const buffer & buffer, size_t offset, 
+
    event enqueue_write_buffer_async(const buffer & buffer, size_t offset, 
                                  size_t size, const void * host_ptr);
    
 
    Enqueues a command to write data from host memory to buffer. The copy is performed asynchronously.
    
 
    See the documentation for clEnqueueWriteBuffer() for more information.
    
@@ -222,7 +222,7 @@
  11. -
    cl_int enqueue_write_buffer_rect(const buffer & buffer, 
+
    cl_int enqueue_write_buffer_rect(const buffer & buffer, 
                                  const size_t buffer_origin, 
                                  const size_t host_origin, 
                                  const size_t region, 
@@ -243,7 +243,7 @@
  12. -
    event enqueue_copy_buffer(const buffer & src_buffer, 
+
    event enqueue_copy_buffer(const buffer & src_buffer, 
                           const buffer & dst_buffer, size_t src_offset, 
                           size_t dst_offset, size_t size);
    
 
    Enqueues a command to copy data from src_buffer to dst_buffer.
    
@@ -254,7 +254,7 @@
  13. -
    cl_int enqueue_copy_buffer_rect(const buffer & src_buffer, 
+
    cl_int enqueue_copy_buffer_rect(const buffer & src_buffer, 
                                 const buffer & dst_buffer, 
                                 const size_t src_origin, 
                                 const size_t dst_origin, const size_t region, 
@@ -275,7 +275,7 @@
  14. -
    event enqueue_fill_buffer(const buffer & buffer, const void * pattern, 
+
    event enqueue_fill_buffer(const buffer & buffer, const void * pattern, 
                           size_t pattern_size, size_t offset, size_t size);
    
 
    Enqueues a command to fill buffer with pattern.
    
 
    See the documentation for clEnqueueFillBuffer() for more information.
    
@@ -294,79 +294,79 @@
  15. -
    void * enqueue_map_buffer(const buffer & buffer, cl_map_flags flags, 
+
    void * enqueue_map_buffer(const buffer & buffer, cl_map_flags flags, 
                           size_t offset, size_t size);
    
 
    Enqueues a command to map buffer into the host address space.
    
 
    See the documentation for clEnqueueMapBuffer() for more information.
  16. -
    cl_int enqueue_unmap_buffer(const buffer & buffer, void * mapped_ptr);
    +
    cl_int enqueue_unmap_buffer(const buffer & buffer, void * mapped_ptr);

    Enqueues a command to unmap buffer from the host memory space.

    See the documentation for clEnqueueUnmapMemObject() for more information.

  17. -
    cl_int enqueue_unmap_mem_object(cl_mem mem, void * mapped_ptr);
    +
    cl_int enqueue_unmap_mem_object(cl_mem mem, void * mapped_ptr);

    Enqueues a command to unmap mem from the host memory space.

    See the documentation for clEnqueueUnmapMemObject() for more information.

  18. -
    cl_int enqueue_read_image(const image2d & image, const size_t origin, 
+
    cl_int enqueue_read_image(const image2d & image, const size_t origin, 
                           const size_t region, size_t row_pitch, 
                           void * host_ptr);
    
 
    Enqueues a command to read data from image to host memory.
    
 
    See the documentation for clEnqueueReadImage() for more information.
  19. -
    cl_int enqueue_read_image(const image3d & image, const size_t origin, 
+
    cl_int enqueue_read_image(const image3d & image, const size_t origin, 
                           const size_t region, size_t row_pitch, 
                           size_t slice_pitch, void * host_ptr);
    
 
    Enqueues a command to read data from image to host memory.
    
 
    See the documentation for clEnqueueReadImage() for more information.
  20. -
    cl_int enqueue_write_image(const image2d & image, const size_t origin, 
+
    cl_int enqueue_write_image(const image2d & image, const size_t origin, 
                            const size_t region, size_t input_row_pitch, 
                            const void * host_ptr);
    
 
    Enqueues a command to write data from host memory to image.
    
 
    See the documentation for clEnqueueWriteImage() for more information.
  21. -
    cl_int enqueue_write_image(const image3d & image, const size_t origin, 
+
    cl_int enqueue_write_image(const image3d & image, const size_t origin, 
                            const size_t region, size_t input_row_pitch, 
                            size_t input_slice_pitch, const void * host_ptr);
    
 
    Enqueues a command to write data from host memory to image.
    
 
    See the documentation for clEnqueueWriteImage() for more information.
  22. -
    cl_int enqueue_copy_image(const image2d & src_image, 
+
    cl_int enqueue_copy_image(const image2d & src_image, 
                           const image2d & dst_image, const size_t src_origin, 
                           const size_t dst_origin, const size_t region);
    
 
    Enqueues a command to copy data from src_image to dst_image.
    
 
    See the documentation for clEnqueueCopyImage() for more information.
  23. -
    cl_int enqueue_copy_image(const image2d & src_image, 
+
    cl_int enqueue_copy_image(const image2d & src_image, 
                           const image3d & dst_image, const size_t src_origin, 
                           const size_t dst_origin, const size_t region);
    
 
    Enqueues a command to copy data from src_image to dst_image.
    
 
    See the documentation for clEnqueueCopyImage() for more information.
  24. -
    cl_int enqueue_copy_image(const image3d & src_image, 
+
    cl_int enqueue_copy_image(const image3d & src_image, 
                           const image2d & dst_image, const size_t src_origin, 
                           const size_t dst_origin, const size_t region);
    
 
    Enqueues a command to copy data from src_image to dst_image.
    
 
    See the documentation for clEnqueueCopyImage() for more information.
  25. -
    cl_int enqueue_copy_image(const image3d & src_image, 
+
    cl_int enqueue_copy_image(const image3d & src_image, 
                           const image3d & dst_image, const size_t src_origin, 
                           const size_t dst_origin, const size_t region);
    
 
    Enqueues a command to copy data from src_image to dst_image.
    
 
    See the documentation for clEnqueueCopyImage() for more information.
  26. -
    cl_int enqueue_copy_image_to_buffer(const image2d & src_image, 
+
    cl_int enqueue_copy_image_to_buffer(const image2d & src_image, 
                                     const buffer & dst_buffer, 
                                     const size_t src_origin, 
                                     const size_t region, size_t dst_offset);
    
@@ -374,7 +374,7 @@
 
    See the documentation for clEnqueueCopyImageToBuffer() for more information.
  27. -
    cl_int enqueue_copy_image_to_buffer(const image3d & src_image, 
+
    cl_int enqueue_copy_image_to_buffer(const image3d & src_image, 
                                     const buffer & dst_buffer, 
                                     const size_t src_origin, 
                                     const size_t region, size_t dst_offset);
    
@@ -382,7 +382,7 @@
 
    See the documentation for clEnqueueCopyImageToBuffer() for more information.
  28. -
    cl_int enqueue_copy_buffer_to_image(const buffer & src_buffer, 
+
    cl_int enqueue_copy_buffer_to_image(const buffer & src_buffer, 
                                     const image2d & dst_image, 
                                     size_t src_offset, 
                                     const size_t dst_origin, 
@@ -391,7 +391,7 @@
 
    See the documentation for clEnqueueCopyBufferToImage() for more information.
  29. -
    cl_int enqueue_copy_buffer_to_image(const buffer & src_buffer, 
+
    cl_int enqueue_copy_buffer_to_image(const buffer & src_buffer, 
                                     const image3d & dst_image, 
                                     size_t src_offset, 
                                     const size_t dst_origin, 
@@ -400,7 +400,7 @@
 
    See the documentation for clEnqueueCopyBufferToImage() for more information.
  30. -
    cl_int enqueue_fill_image(const image2d & image, const void * fill_color, 
+
    cl_int enqueue_fill_image(const image2d & image, const void * fill_color, 
                           const size_t origin, const size_t region);
    
 
    Enqueues a command to fill image with fill_color.
    
 
    See the documentation for clEnqueueFillImage() for more information.
    
@@ -415,7 +415,7 @@
  31. -
    cl_int enqueue_fill_image(const image3d & image, const void * fill_color, 
+
    cl_int enqueue_fill_image(const image3d & image, const void * fill_color, 
                           const size_t origin, const size_t region);
    
 
    Enqueues a command to fill image with fill_color.
    
 
    See the documentation for clEnqueueFillImage() for more information.
    
@@ -430,7 +430,7 @@
  32. -
    void enqueue_migrate_memory_objects(uint_ num_mem_objects, 
+
    void enqueue_migrate_memory_objects(uint_ num_mem_objects, 
                                     const cl_mem * mem_objects, 
                                     cl_mem_migration_flags flags);
    
 
    Enqueues a command to migrate mem_objects.
    
@@ -446,7 +446,7 @@
  33. -
    event enqueue_nd_range_kernel(const kernel & kernel, size_t work_dim, 
+
    event enqueue_nd_range_kernel(const kernel & kernel, size_t work_dim, 
                               const size_t * global_work_offset, 
                               const size_t * global_work_size, 
                               const size_t * local_work_size = 0);
    
@@ -454,33 +454,33 @@
 
    See the documentation for clEnqueueNDRangeKernel() for more information.
  34. -
    event enqueue_task(const kernel & kernel);
    +
    event enqueue_task(const kernel & kernel);

    Enqueues a kernel to execute using a single work-item.

    See the documentation for clEnqueueTask() for more information.

  35. -
    event enqueue_native_kernel(void(BOOST_COMPUTE_CL_CALLBACK *user_func)(void *), 
+
    event enqueue_native_kernel(void(BOOST_COMPUTE_CL_CALLBACK *user_func)(void *), 
                             void * args, size_t cb_args, 
                             uint_ num_mem_objects, const cl_mem * mem_list, 
                             const void ** args_mem_loc);
    Enqueues a function to execute on the host.
  36. -
    event enqueue_native_kernel(void(BOOST_COMPUTE_CL_CALLBACK *user_func)(void));
    +
    event enqueue_native_kernel(void(BOOST_COMPUTE_CL_CALLBACK *user_func)(void));

    Convience overload for enqueue_native_kernel() which enqueues a native kernel on the host with a nullary function.

  37. -
    void flush();
    +
    void flush();

    Flushes the command queue.

    See the documentation for clFlush() for more information.

  38. -
    void finish();
    +
    void finish();

    Blocks until all outstanding commands in the queue have finished.

    See the documentation for clFinish() for more information.

  39. -
    void enqueue_barrier();
    Enqueues a barrier in the queue.
    40. +
    void enqueue_barrier();
    Enqueues a barrier in the queue.
  40. -
    void enqueue_barrier(const wait_list & events);
    +
    void enqueue_barrier(const wait_list & events);

    Enqueues a barrier in the queue after events.

    @@ -493,11 +493,11 @@

  41. -
    event enqueue_marker();
    +
    event enqueue_marker();

    Enqueues a marker in the queue and returns an event that can be used to track its progress.

  42. -
    event enqueue_marker(const wait_list & events);
    +
    event enqueue_marker(const wait_list & events);

    Enqueues a marker after events in the queue and returns an event that can be used to track its progress.

    43. diff --git a/boost/compute/constant_buffer_iterator.html b/boost/compute/constant_buffer_iterator.html index cc543006..be3d8e4c 100644 --- a/boost/compute/constant_buffer_iterator.html +++ b/boost/compute/constant_buffer_iterator.html @@ -31,61 +31,61 @@ typedefsuper_type::difference_typedifference_type;// construct/copy/destruct - constant_buffer_iterator(); - constant_buffer_iterator(constbuffer&,size_t); - constant_buffer_iterator(constconstant_buffer_iterator<T>&); + constant_buffer_iterator(); + constant_buffer_iterator(constbuffer&,size_t); + constant_buffer_iterator(constconstant_buffer_iterator<T>&);constant_buffer_iterator<T>& - operator=(constconstant_buffer_iterator<T>&); - ~constant_buffer_iterator(); + operator=(constconstant_buffer_iterator<T>&); + ~constant_buffer_iterator(); - // public member functions - constbuffer&get_buffer()const; - size_tget_index()const; - template<typename Expr>unspecifiedoperator[](constExpr&)const; + // public member functions + constbuffer&get_buffer()const; + size_tget_index()const; + template<typename Expr>unspecifiedoperator[](constExpr&)const; - // private member functions - referencedereference()const; - boolequal(constconstant_buffer_iterator<T>&)const; - voidincrement(); - voiddecrement(); - voidadvance(difference_type); - difference_typedistance_to(constconstant_buffer_iterator<T>&)const; + // private member functions + referencedereference()const; + boolequal(constconstant_buffer_iterator<T>&)const; + voidincrement(); + voiddecrement(); + voidadvance(difference_type); + difference_typedistance_to(constconstant_buffer_iterator<T>&)const;};
    -

    Description

    +

    Description

    -

    +

    constant_buffer_iterator public construct/copy/destruct

      -
    1. constant_buffer_iterator();
      2. -
    2. constant_buffer_iterator(const buffer & buffer, size_t index);
      3. -
    3. constant_buffer_iterator(const constant_buffer_iterator< T > & other);
      4. +
    4. constant_buffer_iterator();
      5. +
    5. constant_buffer_iterator(const buffer & buffer, size_t index);
      6. +
    6. constant_buffer_iterator(const constant_buffer_iterator< T > & other);
    7. constant_buffer_iterator< T > & 
-operator=(const constant_buffer_iterator< T > & other);
      8. -
    8. ~constant_buffer_iterator();
      9. +operator=(const constant_buffer_iterator< T > & other); +
    9. ~constant_buffer_iterator();
    -

    -constant_buffer_iterator public member functions

    +

    +constant_buffer_iterator public member functions

      -
    1. const buffer & get_buffer() const;
      2. -
    2. size_t get_index() const;
      3. -
    3. template<typename Expr> unspecified operator[](const Expr & expr) const;
      4. +
    4. const buffer & get_buffer() const;
      5. +
    5. size_t get_index() const;
      6. +
    6. template<typename Expr> unspecified operator[](const Expr & expr) const;
    -

    -constant_buffer_iterator private member functions

    +

    +constant_buffer_iterator private member functions

      -
    1. reference dereference() const;
      2. -
    2. bool equal(const constant_buffer_iterator< T > & other) const;
      3. -
    3. void increment();
      4. -
    4. void decrement();
      5. -
    5. void advance(difference_type n);
      6. -
    6. difference_type distance_to(const constant_buffer_iterator< T > & other) const;
      7. +
    7. reference dereference() const;
      8. +
    8. bool equal(const constant_buffer_iterator< T > & other) const;
      9. +
    9. void increment();
      10. +
    10. void decrement();
      11. +
    11. void advance(difference_type n);
      12. +
    12. difference_type distance_to(const constant_buffer_iterator< T > & other) const;
    diff --git a/boost/compute/constant_iterator.html b/boost/compute/constant_iterator.html index 68d169a6..bbdb44f9 100644 --- a/boost/compute/constant_iterator.html +++ b/boost/compute/constant_iterator.html @@ -31,36 +31,36 @@ typedefsuper_type::difference_typedifference_type;// construct/copy/destruct - constant_iterator(constT&,size_t=0); - constant_iterator(constconstant_iterator<T>&); - constant_iterator<T>&operator=(constconstant_iterator<T>&); - ~constant_iterator(); + constant_iterator(constT&,size_t=0); + constant_iterator(constconstant_iterator<T>&); + constant_iterator<T>&operator=(constconstant_iterator<T>&); + ~constant_iterator(); - // public member functions - size_tget_index()const; + // public member functions + size_tget_index()const;};
    -

    Description

    +

    Description

    See Also:

    make_constant_iterator()

    -

    +

    constant_iterator public construct/copy/destruct

      -
    1. constant_iterator(const T & value, size_t index = 0);
      2. -
    2. constant_iterator(const constant_iterator< T > & other);
      3. -
    3. constant_iterator< T > & operator=(const constant_iterator< T > & other);
      4. -
    4. ~constant_iterator();
      5. +
    5. constant_iterator(const T & value, size_t index = 0);
      6. +
    6. constant_iterator(const constant_iterator< T > & other);
      7. +
    7. constant_iterator< T > & operator=(const constant_iterator< T > & other);
      8. +
    8. ~constant_iterator();
    -

    -constant_iterator public member functions

    -
    1. size_t get_index() const;
    +

    +constant_iterator public member functions

    +
    1. size_t get_index() const;
    diff --git a/boost/compute/context.html b/boost/compute/context.html index 6d8aefc1..d8b25d9a 100644 --- a/boost/compute/context.html +++ b/boost/compute/context.html @@ -7,11 +7,11 @@ - +
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -26,83 +26,83 @@ class context { public: // construct/copy/destruct - context(); - explicit context(const device &, const cl_context_properties * = 0); - explicit context(cl_context, bool = true); - context(const context &); - context(BOOST_RV_REF(context)); - context & operator=(const context &); - context & operator=(BOOST_RV_REF(context)); - ~context(); + context(); + explicit context(const device &, const cl_context_properties * = 0); + explicit context(cl_context, bool = true); + context(const context &); + context(BOOST_RV_REF(context)); + context & operator=(const context &); + context & operator=(BOOST_RV_REF(context)); + ~context(); - // public member functions - cl_context & get() const; - device get_device() const; - template<typename T> T get_info(cl_context_info) const; - bool operator==(const context &) const; - bool operator!=(const context &) const; + // public member functions + cl_context & get() const; + device get_device() const; + template<typename T> T get_info(cl_context_info) const; + bool operator==(const context &) const; + bool operator!=(const context &) const; - // private static functions + // private static functions static void BOOST_COMPUTE_CL_CALLBACK - default_error_handler(const char *, const void *, size_t, void *); + default_error_handler(const char *, const void *, size_t, void *); };
    -

    Description

    +

    Description

    The context class represents a compute context.

    See Also:

    device, command_queue

    -

    +

    context public construct/copy/destruct

    1. -
      context();
      Create a null context object.
      2. +
      context();
      Create a null context object.
    2. -
      explicit context(const device & device, 
+
      explicit context(const device & device, 
                  const cl_context_properties * properties = 0);
      
 
      Creates a new context for device with properties.
      
 
      See the documentation for clCreateContext() for more information.
    3. -
      explicit context(cl_context context, bool retain = true);
      +
      explicit context(cl_context context, bool retain = true);

      Creates a new context object for context. If retain is true, the reference count for context will be incremented.

    4. -
      context(const context & other);
      Creates a new context object as a copy of other.
      5. -
    5. context(BOOST_RV_REF(context) other);
      6. -
    6. context & operator=(const context & other);
      7. -
    7. context & operator=(BOOST_RV_REF(context) other);
      8. +
      context(const context & other);
      Creates a new context object as a copy of other. +
    8. context(BOOST_RV_REF(context) other);
      9. +
    9. context & operator=(const context & other);
      10. +
    10. context & operator=(BOOST_RV_REF(context) other);
    11. -
      ~context();
      Destroys the context object.
      12. +
      ~context();
      Destroys the context object.
    -

    -context public member functions

    +

    +context public member functions

    1. -
      cl_context & get() const;
      Returns the underlying OpenCL context.
      2. -
    2. device get_device() const;
      3. +
      cl_context & get() const;
      Returns the underlying OpenCL context. +
    3. device get_device() const;
    4. -
      template<typename T> T get_info(cl_context_info info) const;
      +
      template<typename T> T get_info(cl_context_info info) const;

      Returns information about the context.

      See the documentation for clGetContextInfo() for more information.

    5. -
      bool operator==(const context & other) const;
      Returns true if the context is the same at other.
      6. +
      bool operator==(const context & other) const;
      Returns true if the context is the same at other.
    6. -
      bool operator!=(const context & other) const;
      Returns true if the context is different from other.
      7. +
      bool operator!=(const context & other) const;
      Returns true if the context is different from other.
    -

    -context private static functions

    +

    +context private static functions

    1. static void BOOST_COMPUTE_CL_CALLBACK 
-default_error_handler(const char * errinfo, const void * private_info, 
+default_error_handler(const char * errinfo, const void * private_info, 
                       size_t cb, void * user_data);
    @@ -117,7 +117,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/boost/compute/context_error.html b/boost/compute/context_error.html index d314799f..06737eae 100644 --- a/boost/compute/context_error.html +++ b/boost/compute/context_error.html @@ -7,11 +7,11 @@ - +
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -26,32 +26,32 @@ class context_error : public exception { public: // construct/copy/destruct - context_error(const context *, const char *, const void *, size_t); - ~context_error(); + context_error(const context *, const char *, const void *, size_t); + ~context_error(); - // public member functions - const context * get_context() const; - const char * what() const; + // public member functions + const context * get_context() const; + const char * what() const; };
    -

    Description

    +

    Description

    -

    +

    context_error public construct/copy/destruct

      -
    1. context_error(const context * context, const char * errinfo, 
+
    2. context_error(const context * context, const char * errinfo, 
               const void * private_info, size_t private_info_size);
      3. 
-
    3. ~context_error();
      4. 
+
    4. ~context_error();
      5.
    -

    -context_error public member functions

    +

    +context_error public member functions

      -
    1. const context * get_context() const;
      2. -
    2. const char * what() const;
      3. +
    3. const context * get_context() const;
      4. +
    4. const char * what() const;
    @@ -66,7 +66,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/boost/compute/copy.html b/boost/compute/copy.html index 01c35cce..83da5b20 100644 --- a/boost/compute/copy.html +++ b/boost/compute/copy.html @@ -28,7 +28,7 @@ copy(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue = system::default_queue());
    -

    Description

    +

    Description

    Copies the values in the range [first, last) to the range beginning at result.

    The generic copy() function can be used for a variety of data transfer tasks and provides a standard interface to the following OpenCL functions:

      diff --git a/boost/compute/copy_async.html b/boost/compute/copy_async.html index 3dcde811..afdb96ca 100644 --- a/boost/compute/copy_async.html +++ b/boost/compute/copy_async.html @@ -28,7 +28,7 @@ copy_async(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue = system::default_queue());
    -

    Description

    +

    Description

    Copies the values in the range [first, last) to the range beginning at result. The copy is performed asynchronously.

    See Also:

    copy()

    diff --git a/boost/compute/copy_if.html b/boost/compute/copy_if.html index df5491bf..d1cd4cbf 100644 --- a/boost/compute/copy_if.html +++ b/boost/compute/copy_if.html @@ -29,7 +29,7 @@ Predicate predicate, command_queue & queue = system::default_queue());
    -

    Description

    +

    Description

    Copies each element in the range [first, last) for which predicate returns true to the range beginning at result.

    diff --git a/boost/compute/copy_n.html b/boost/compute/copy_n.html index 231ce7be..dc1245b2 100644 --- a/boost/compute/copy_n.html +++ b/boost/compute/copy_n.html @@ -28,7 +28,7 @@ copy_n(InputIterator first, Size count, OutputIterator result, command_queue & queue = system::default_queue());
-

Description

+

Description

Copies count elements from first to result.

See Also:

copy()

diff --git a/boost/compute/count.html b/boost/compute/count.html index 788eeafd..00151683 100644 --- a/boost/compute/count.html +++ b/boost/compute/count.html @@ -27,7 +27,7 @@ size_t count(InputIterator first, InputIterator last, const T & value, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns the number of occurrences of value in the range [first, last).

See Also:

count_if()

diff --git a/boost/compute/count_if.html b/boost/compute/count_if.html index 32925380..3a8cc51b 100644 --- a/boost/compute/count_if.html +++ b/boost/compute/count_if.html @@ -28,7 +28,7 @@ Predicate predicate, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns the number of elements in the range [first, last) for which predicate returns true.

diff --git a/boost/compute/counting_iterator.html b/boost/compute/counting_iterator.html index 6dca6da7..32e5d4bc 100644 --- a/boost/compute/counting_iterator.html +++ b/boost/compute/counting_iterator.html @@ -31,55 +31,55 @@ typedef super_type::difference_type difference_type; // construct/copy/destruct - counting_iterator(const T &); - counting_iterator(const counting_iterator< T > &); - counting_iterator< T > & operator=(const counting_iterator< T > &); - ~counting_iterator(); + counting_iterator(const T &); + counting_iterator(const counting_iterator< T > &); + counting_iterator< T > & operator=(const counting_iterator< T > &); + ~counting_iterator(); - // public member functions - size_t get_index() const; - template<typename Expr> unspecified operator[](const Expr &) const; + // public member functions + size_t get_index() const; + template<typename Expr> unspecified operator[](const Expr &) const; - // private member functions - reference dereference() const; - bool equal(const counting_iterator< T > &) const; - void increment(); - void decrement(); - void advance(difference_type); - difference_type distance_to(const counting_iterator< T > &) const; + // private member functions + reference dereference() const; + bool equal(const counting_iterator< T > &) const; + void increment(); + void decrement(); + void advance(difference_type); + difference_type distance_to(const counting_iterator< T > &) const; };
-

Description

+

Description

-

+

counting_iterator public construct/copy/destruct

    -
  1. counting_iterator(const T & init);
    2. -
  2. counting_iterator(const counting_iterator< T > & other);
    3. -
  3. counting_iterator< T > & operator=(const counting_iterator< T > & other);
    4. -
  4. ~counting_iterator();
    5. +
  5. counting_iterator(const T & init);
    6. +
  6. counting_iterator(const counting_iterator< T > & other);
    7. +
  7. counting_iterator< T > & operator=(const counting_iterator< T > & other);
    8. +
  8. ~counting_iterator();
-

-counting_iterator public member functions

+

+counting_iterator public member functions

    -
  1. size_t get_index() const;
    2. -
  2. template<typename Expr> unspecified operator[](const Expr & expr) const;
    3. +
  3. size_t get_index() const;
    4. +
  4. template<typename Expr> unspecified operator[](const Expr & expr) const;
-

-counting_iterator private member functions

+

+counting_iterator private member functions

    -
  1. reference dereference() const;
    2. -
  2. bool equal(const counting_iterator< T > & other) const;
    3. -
  3. void increment();
    4. -
  4. void decrement();
    5. -
  5. void advance(difference_type n);
    6. -
  6. difference_type distance_to(const counting_iterator< T > & other) const;
    7. +
  7. reference dereference() const;
    8. +
  8. bool equal(const counting_iterator< T > & other) const;
    9. +
  9. void increment();
    10. +
  10. void decrement();
    11. +
  11. void advance(difference_type n);
    12. +
  12. difference_type distance_to(const counting_iterator< T > & other) const;
diff --git a/boost/compute/device.html b/boost/compute/device.html index 519d445b..7f257a70 100644 --- a/boost/compute/device.html +++ b/boost/compute/device.html @@ -6,12 +6,12 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -29,41 +29,41 @@ enum type { cpu = = CL_DEVICE_TYPE_CPU, gpu = = CL_DEVICE_TYPE_GPU, accelerator = = CL_DEVICE_TYPE_ACCELERATOR }; // construct/copy/destruct - device(); - explicit device(cl_device_id, bool = true); - device(const device &); - device(BOOST_RV_REF(device)); - device & operator=(const device &); - device & operator=(BOOST_RV_REF(device)); - ~device(); + device(); + explicit device(cl_device_id, bool = true); + device(const device &); + device(BOOST_RV_REF(device)); + device & operator=(const device &); + device & operator=(BOOST_RV_REF(device)); + ~device(); - // public member functions - cl_device_id id() const; - cl_device_type type() const; - std::string name() const; - std::string vendor() const; - std::string profile() const; - std::string version() const; - std::string driver_version() const; - std::vector< std::string > extensions() const; - bool supports_extension(const std::string &) const; - uint_ address_bits() const; - ulong_ global_memory_size() const; - ulong_ local_memory_size() const; - uint_ clock_frequency() const; - uint_ compute_units() const; - template<typename T> uint_ preferred_vector_width() const; - size_t profiling_timer_resolution() const; - template<typename T> T get_info(cl_device_info) const; - std::vector< device > partition(const cl_device_partition_property *) const; - std::vector< device > partition_equally(size_t) const; + // public member functions + cl_device_id id() const; + cl_device_type type() const; + std::string name() const; + std::string vendor() const; + std::string profile() const; + std::string version() const; + std::string driver_version() const; + std::vector< std::string > extensions() const; + bool supports_extension(const std::string &) const; + uint_ address_bits() const; + ulong_ global_memory_size() const; + ulong_ local_memory_size() const; + uint_ clock_frequency() const; + uint_ compute_units() const; + template<typename T> uint_ preferred_vector_width() const; + size_t profiling_timer_resolution() const; + template<typename T> T get_info(cl_device_info) const; + std::vector< device > partition(const cl_device_partition_property *) const; + std::vector< device > partition_equally(size_t) const; std::vector< device > - partition_by_counts(const std::vector< size_t > &) const; + partition_by_counts(const std::vector< size_t > &) const; std::vector< device > - partition_by_affinity_domain(cl_device_affinity_domain) const; + partition_by_affinity_domain(cl_device_affinity_domain) const; };
-

Description

+

Description

Typical compute devices include GPUs and multi-core CPUs. A list of all compute devices available on a platform can be obtained via the platform::devices() method.

The default compute device for the system can be obtained with the system::default_device() method.

For example:

@@ -74,72 +74,72 @@

-

+

device public construct/copy/destruct

  1. -
    device();
    Creates a null device object.
    2. +
    device();
    Creates a null device object.
  2. -
    explicit device(cl_device_id id, bool retain = true);
    +
    explicit device(cl_device_id id, bool retain = true);

    Creates a new device object for id. If retain is true, the reference count for the device will be incremented.

  3. -
    device(const device & other);
    Creates a new device object as a copy of other.
    4. -
  4. device(BOOST_RV_REF(device) other);
    5. -
  5. device & operator=(const device & other);
    6. -
  6. device & operator=(BOOST_RV_REF(device) other);
    7. +
    device(const device & other);
    Creates a new device object as a copy of other. +
  7. device(BOOST_RV_REF(device) other);
    8. +
  8. device & operator=(const device & other);
    9. +
  9. device & operator=(BOOST_RV_REF(device) other);
  10. -
    ~device();
    Destroys the device object.
    11. +
    ~device();
    Destroys the device object.
-

-device public member functions

+

+device public member functions

  1. -
    cl_device_id id() const;
    Returns the ID of the device.
    2. +
    cl_device_id id() const;
    Returns the ID of the device.
  2. -
    cl_device_type type() const;
    Returns the type of the device.
    3. +
    cl_device_type type() const;
    Returns the type of the device.
  3. -
    std::string name() const;
    Returns the name of the device.
    4. +
    std::string name() const;
    Returns the name of the device.
  4. -
    std::string vendor() const;
    Returns the name of the vendor for the device.
    5. +
    std::string vendor() const;
    Returns the name of the vendor for the device.
  5. -
    std::string profile() const;
    Returns the device profile string.
    6. +
    std::string profile() const;
    Returns the device profile string.
  6. -
    std::string version() const;
    Returns the device version string.
    7. +
    std::string version() const;
    Returns the device version string.
  7. -
    std::string driver_version() const;
    Returns the driver version string.
    8. +
    std::string driver_version() const;
    Returns the driver version string.
  8. -
    std::vector< std::string > extensions() const;
    Returns a list of extensions supported by the device.
    9. +
    std::vector< std::string > extensions() const;
    Returns a list of extensions supported by the device.
  9. -
    bool supports_extension(const std::string & name) const;
    +
    bool supports_extension(const std::string & name) const;

    Returns true if the device supports the extension with name.

  10. -
    uint_ address_bits() const;
    Returns the number of address bits.
    11. +
    uint_ address_bits() const;
    Returns the number of address bits.
  11. -
    ulong_ global_memory_size() const;
    Returns the global memory size in bytes.
    12. +
    ulong_ global_memory_size() const;
    Returns the global memory size in bytes.
  12. -
    ulong_ local_memory_size() const;
    Returns the local memory size in bytes.
    13. +
    ulong_ local_memory_size() const;
    Returns the local memory size in bytes.
  13. -
    uint_ clock_frequency() const;
    Returns the clock frequency for the device's compute units.
    14. +
    uint_ clock_frequency() const;
    Returns the clock frequency for the device's compute units.
  14. -
    uint_ compute_units() const;
    Returns the number of compute units in the device.
    15. +
    uint_ compute_units() const;
    Returns the number of compute units in the device.
  15. -
    template<typename T> uint_ preferred_vector_width() const;
    Returns the preferred vector width for type T.
    16. +
    template<typename T> uint_ preferred_vector_width() const;
    Returns the preferred vector width for type T.
  16. -
    size_t profiling_timer_resolution() const;
    Returns the profiling timer resolution in nanoseconds.
    17. +
    size_t profiling_timer_resolution() const;
    Returns the profiling timer resolution in nanoseconds.
  17. -
    template<typename T> T get_info(cl_device_info info) const;
    +
    template<typename T> T get_info(cl_device_info info) const;

    Returns information about the device.

    See the documentation for clGetDeviceInfo() for more information. 

  18. std::vector< device > 
-partition(const cl_device_partition_property * properties) const;
    +partition(const cl_device_partition_property * properties) const;

    Partitions the device into multiple sub-devices according to properties.

    @@ -152,7 +152,7 @@

  19. -
    std::vector< device > partition_equally(size_t count) const;
    +
    std::vector< device > partition_equally(size_t count) const;
    20. @@ -165,7 +165,7 @@ 
  20. std::vector< device > 
-partition_by_counts(const std::vector< size_t > & counts) const;
    +partition_by_counts(const std::vector< size_t > & counts) const;
    21. [Warning]
    @@ -178,7 +178,7 @@ 
  21. std::vector< device > 
-partition_by_affinity_domain(cl_device_affinity_domain domain) const;
    +partition_by_affinity_domain(cl_device_affinity_domain domain) const;
    22. [Warning]
    @@ -203,7 +203,7 @@
    [Warning]
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/boost/compute/equal.html b/boost/compute/equal.html index d6bd28e4..bfb1bc05 100644 --- a/boost/compute/equal.html +++ b/boost/compute/equal.html @@ -28,7 +28,7 @@ InputIterator2 first2, command_queue & queue = system::default_queue());
    -

    Description

    +

    Description

    Returns true if the range [first1, last1) and the range beginning at first2 are equal.

diff --git a/boost/compute/equal_range.html b/boost/compute/equal_range.html index 1fc4220a..653d00c5 100644 --- a/boost/compute/equal_range.html +++ b/boost/compute/equal_range.html @@ -28,7 +28,7 @@ equal_range(InputIterator first, InputIterator last, const T & value, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns a pair of iterators containing the range of values equal to value in the sorted range [first, last).

diff --git a/boost/compute/event.html b/boost/compute/event.html index 6e19ea20..ca481ef7 100644 --- a/boost/compute/event.html +++ b/boost/compute/event.html @@ -26,71 +26,71 @@ class event { public: // construct/copy/destruct - event(); - explicit event(cl_event, bool = true); - event(const event &); - event(BOOST_RV_REF(event)); - event & operator=(const event &); - event & operator=(BOOST_RV_REF(event)); - ~event(); + event(); + explicit event(cl_event, bool = true); + event(const event &); + event(BOOST_RV_REF(event)); + event & operator=(const event &); + event & operator=(BOOST_RV_REF(event)); + ~event(); - // public member functions - cl_event & get() const; - cl_int get_status() const; - cl_command_type get_command_type() const; - template<typename T> T get_info(cl_event_info) const; - template<typename T> T get_profiling_info(cl_profiling_info) const; - void wait(); - bool operator==(const event &) const; - bool operator!=(const event &) const; + // public member functions + cl_event & get() const; + cl_int get_status() const; + cl_command_type get_command_type() const; + template<typename T> T get_info(cl_event_info) const; + template<typename T> T get_profiling_info(cl_profiling_info) const; + void wait(); + bool operator==(const event &) const; + bool operator!=(const event &) const; };
-

Description

+

Description

-

+

event public construct/copy/destruct

  1. -
    event();
    Creates a null event object.
    2. -
  2. explicit event(cl_event event, bool retain = true);
    3. -
  3. event(const event & other);
    4. -
  4. event(BOOST_RV_REF(event) other);
    5. -
  5. event & operator=(const event & other);
    6. -
  6. event & operator=(BOOST_RV_REF(event) other);
    7. +
    event();
    Creates a null event object. +
  7. explicit event(cl_event event, bool retain = true);
    8. +
  8. event(const event & other);
    9. +
  9. event(BOOST_RV_REF(event) other);
    10. +
  10. event & operator=(const event & other);
    11. +
  11. event & operator=(BOOST_RV_REF(event) other);
  12. -
    ~event();
    Destroys the event object.
    13. +
    ~event();
    Destroys the event object.
-

-event public member functions

+

+event public member functions

  1. -
    cl_event & get() const;
    Returns a reference to the underlying OpenCL event object.
    2. +
    cl_event & get() const;
    Returns a reference to the underlying OpenCL event object.
  2. -
    cl_int get_status() const;
    Returns the status of the event.
    3. +
    cl_int get_status() const;
    Returns the status of the event.
  3. -
    cl_command_type get_command_type() const;
    Returns the command type for the event.
    4. +
    cl_command_type get_command_type() const;
    Returns the command type for the event.
  4. -
    template<typename T> T get_info(cl_event_info info) const;
    +
    template<typename T> T get_info(cl_event_info info) const;

    Returns information about the event.

    See the documentation for clGetEventInfo() for more information.

  5. -
    template<typename T> T get_profiling_info(cl_profiling_info info) const;
    +
    template<typename T> T get_profiling_info(cl_profiling_info info) const;

    Returns profiling information for the event.

    See the documentation for clGetEventProfilingInfo() for more information.

  6. -
    void wait();
    +
    void wait();

    Blocks until the actions corresponding to the event have completed.

  7. -
    bool operator==(const event & other) const;
    Returns true if the event is the same as other.
    8. +
    bool operator==(const event & other) const;
    Returns true if the event is the same as other.
  8. -
    bool operator!=(const event & other) const;
    Returns true if the event is different from other.
    9. +
    bool operator!=(const event & other) const;
    Returns true if the event is different from other.
diff --git a/boost/compute/exclusive_scan.html b/boost/compute/exclusive_scan.html index be966757..256f51e6 100644 --- a/boost/compute/exclusive_scan.html +++ b/boost/compute/exclusive_scan.html @@ -29,7 +29,7 @@ OutputIterator result, command_queue & queue = system::default_queue());
-

Description

+

Description

Performs an exclusive scan on the elements in the range [first, last) and stores the results in the range beginning at result.

See Also:

inclusive_scan()

diff --git a/boost/compute/extension_unsu_idp20769904.html b/boost/compute/extension_unsu_idp20769904.html new file mode 100644 index 00000000..b46f90ff --- /dev/null +++ b/boost/compute/extension_unsu_idp20769904.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp20808176.html b/boost/compute/extension_unsu_idp20808176.html new file mode 100644 index 00000000..7a864914 --- /dev/null +++ b/boost/compute/extension_unsu_idp20808176.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp21217392.html b/boost/compute/extension_unsu_idp21217392.html new file mode 100644 index 00000000..850ba6ed --- /dev/null +++ b/boost/compute/extension_unsu_idp21217392.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp21637808.html b/boost/compute/extension_unsu_idp21637808.html new file mode 100644 index 00000000..84e5f519 --- /dev/null +++ b/boost/compute/extension_unsu_idp21637808.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp24414928.html b/boost/compute/extension_unsu_idp24414928.html new file mode 100644 index 00000000..a186e20c --- /dev/null +++ b/boost/compute/extension_unsu_idp24414928.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp25616640.html b/boost/compute/extension_unsu_idp25616640.html new file mode 100644 index 00000000..fda6fef6 --- /dev/null +++ b/boost/compute/extension_unsu_idp25616640.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp25859504.html b/boost/compute/extension_unsu_idp25859504.html new file mode 100644 index 00000000..d90adead --- /dev/null +++ b/boost/compute/extension_unsu_idp25859504.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp26056384.html b/boost/compute/extension_unsu_idp26056384.html new file mode 100644 index 00000000..eb5f51b5 --- /dev/null +++ b/boost/compute/extension_unsu_idp26056384.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp27194032.html b/boost/compute/extension_unsu_idp27194032.html new file mode 100644 index 00000000..3d0d7d96 --- /dev/null +++ b/boost/compute/extension_unsu_idp27194032.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp28952816.html b/boost/compute/extension_unsu_idp28952816.html new file mode 100644 index 00000000..7ee194c3 --- /dev/null +++ b/boost/compute/extension_unsu_idp28952816.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp30336304.html b/boost/compute/extension_unsu_idp30336304.html new file mode 100644 index 00000000..5f279aca --- /dev/null +++ b/boost/compute/extension_unsu_idp30336304.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp31509248.html b/boost/compute/extension_unsu_idp31509248.html new file mode 100644 index 00000000..eb2d8d26 --- /dev/null +++ b/boost/compute/extension_unsu_idp31509248.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp32709632.html b/boost/compute/extension_unsu_idp32709632.html new file mode 100644 index 00000000..c17a5928 --- /dev/null +++ b/boost/compute/extension_unsu_idp32709632.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp36870912.html b/boost/compute/extension_unsu_idp36870912.html new file mode 100644 index 00000000..ef396781 --- /dev/null +++ b/boost/compute/extension_unsu_idp36870912.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp39876208.html b/boost/compute/extension_unsu_idp39876208.html new file mode 100644 index 00000000..158cccf7 --- /dev/null +++ b/boost/compute/extension_unsu_idp39876208.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp41134432.html b/boost/compute/extension_unsu_idp41134432.html new file mode 100644 index 00000000..a8164e7c --- /dev/null +++ b/boost/compute/extension_unsu_idp41134432.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp45174240.html b/boost/compute/extension_unsu_idp45174240.html new file mode 100644 index 00000000..e124c1a4 --- /dev/null +++ b/boost/compute/extension_unsu_idp45174240.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp46104208.html b/boost/compute/extension_unsu_idp46104208.html new file mode 100644 index 00000000..47e286e2 --- /dev/null +++ b/boost/compute/extension_unsu_idp46104208.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp47722400.html b/boost/compute/extension_unsu_idp47722400.html new file mode 100644 index 00000000..d9318a8b --- /dev/null +++ b/boost/compute/extension_unsu_idp47722400.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/extension_unsu_idp50795600.html b/boost/compute/extension_unsu_idp50795600.html new file mode 100644 index 00000000..b49feda6 --- /dev/null +++ b/boost/compute/extension_unsu_idp50795600.html @@ -0,0 +1,73 @@ + + + +Class extension_unsupported_exception + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class extension_unsupported_exception

+

boost::compute::extension_unsupported_exception — Exception thrown when attempting to use an unsupported OpenCL extension.

+
+

Synopsis

+
// In header: <boost/compute/exception/extension_unsupported_exception.hpp>
+
+
+class extension_unsupported_exception : public exception {
+public:
+  // construct/copy/destruct
+  explicit extension_unsupported_exception(const char *);
+  ~extension_unsupported_exception();
+
+  // public member functions
+  const char * what() const;
+};
+
+

Description

+

This exception is thrown when the user attempts to use an OpenCL extension which is not supported on the platform and/or device.

+

An example of this is attempting to use CL-GL sharing on a non-GPU device.

+

See Also:

+

runtime_exception

+

+

+
+

+extension_unsupported_exception + public + construct/copy/destruct

+
    +
  1. explicit extension_unsupported_exception(const char * extension);
    2. +
  2. ~extension_unsupported_exception();
    3. +
+
+
+

+extension_unsupported_exception public member functions

+
  1. const char * what() const;
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/field.html b/boost/compute/field.html index 1b01e403..ba68d460 100644 --- a/boost/compute/field.html +++ b/boost/compute/field.html @@ -29,10 +29,10 @@ typedef T result_type; // Result type. // construct/copy/destruct - field(const std::string &); + field(const std::string &); };
-

Description

+

Description

Returns the named field from a value.

The template-type T specifies the field's value type. Note that the value type must match the actual type of the field otherwise runtime compilation or logic errors may occur.

For example, to access the second field in a std::pair<int, float> object:

@@ -47,12 +47,12 @@

-

+

field public construct/copy/destruct

  1. -
    field(const std::string & field);
    Creates a new field functor with field.
+
field(const std::string & field);
Creates a new field functor with field.
diff --git a/boost/compute/fill.html b/boost/compute/fill.html index 26ee8414..98ab7b65 100644 --- a/boost/compute/fill.html +++ b/boost/compute/fill.html @@ -27,7 +27,7 @@ void fill(BufferIterator first, BufferIterator last, const T & value, command_queue & queue = system::default_queue());
-

Description

+

Description

Fills the range [first, last) with value.

See Also:

fill_n()

diff --git a/boost/compute/fill_n.html b/boost/compute/fill_n.html index 1d0197b3..5025a988 100644 --- a/boost/compute/fill_n.html +++ b/boost/compute/fill_n.html @@ -27,7 +27,7 @@ void fill_n(BufferIterator first, Size count, const T & value, command_queue & queue = system::default_queue());
-

Description

+

Description

Fills the range [first, first + count) with value.

See Also:

fill()

diff --git a/boost/compute/find.html b/boost/compute/find.html index fd66a626..74bd3d69 100644 --- a/boost/compute/find.html +++ b/boost/compute/find.html @@ -28,7 +28,7 @@ find(InputIterator first, InputIterator last, const T & value, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns an iterator pointing to the first element in the range [first, last) that equals value.

diff --git a/boost/compute/find_if.html b/boost/compute/find_if.html index fc2ab4c9..9dc13975 100644 --- a/boost/compute/find_if.html +++ b/boost/compute/find_if.html @@ -28,7 +28,7 @@ find_if(InputIterator first, InputIterator last, UnaryPredicate predicate, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns an iterator pointing to the first element in the range [first, last) for which predicate returns true.

diff --git a/boost/compute/find_if_not.html b/boost/compute/find_if_not.html index 789ef583..dd3b52ff 100644 --- a/boost/compute/find_if_not.html +++ b/boost/compute/find_if_not.html @@ -29,7 +29,7 @@ UnaryPredicate predicate, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns an iterator pointing to the first element in the range [first, last) for which predicate returns false.

See Also:

find_if()

diff --git a/boost/compute/flat_map.html b/boost/compute/flat_map.html index 78f373af..3684f6eb 100644 --- a/boost/compute/flat_map.html +++ b/boost/compute/flat_map.html @@ -42,122 +42,122 @@ typedef vector_type::const_reverse_iterator const_reverse_iterator; // construct/copy/destruct - explicit flat_map(const context & = system::default_context()); - flat_map(const flat_map< Key, T > &); - flat_map< Key, T > & operator=(const flat_map< Key, T > &); - ~flat_map(); + explicit flat_map(const context & = system::default_context()); + flat_map(const flat_map< Key, T > &); + flat_map< Key, T > & operator=(const flat_map< Key, T > &); + ~flat_map(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - size_type size() const; - size_type max_size() const; - bool empty() const; - size_type capacity() const; - void reserve(size_type, command_queue &); - void reserve(size_type); - void shrink_to_fit(); - void clear(); - std::pair< iterator, bool > insert(const value_type &, command_queue &); - std::pair< iterator, bool > insert(const value_type &); - iterator erase(const const_iterator &, command_queue &); - iterator erase(const const_iterator &); - iterator erase(const const_iterator &, const const_iterator &, + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + size_type size() const; + size_type max_size() const; + bool empty() const; + size_type capacity() const; + void reserve(size_type, command_queue &); + void reserve(size_type); + void shrink_to_fit(); + void clear(); + std::pair< iterator, bool > insert(const value_type &, command_queue &); + std::pair< iterator, bool > insert(const value_type &); + iterator erase(const const_iterator &, command_queue &); + iterator erase(const const_iterator &); + iterator erase(const const_iterator &, const const_iterator &, command_queue &); - iterator erase(const const_iterator &, const const_iterator &); - size_type erase(const key_type &, command_queue &); - iterator find(const key_type &, command_queue &); - iterator find(const key_type &); - const_iterator find(const key_type &, command_queue &) const; - const_iterator find(const key_type &) const; - size_type count(const key_type &, command_queue &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &, command_queue &); - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &, command_queue &) const; - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &, command_queue &); - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &, command_queue &) const; - const_iterator upper_bound(const key_type &) const; - const mapped_type at(const key_type &) const; - unspecified operator[](const key_type &); + iterator erase(const const_iterator &, const const_iterator &); + size_type erase(const key_type &, command_queue &); + iterator find(const key_type &, command_queue &); + iterator find(const key_type &); + const_iterator find(const key_type &, command_queue &) const; + const_iterator find(const key_type &) const; + size_type count(const key_type &, command_queue &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &, command_queue &); + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &, command_queue &) const; + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &, command_queue &); + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &, command_queue &) const; + const_iterator upper_bound(const key_type &) const; + const mapped_type at(const key_type &) const; + unspecified operator[](const key_type &); };
-

Description

+

Description

-

+

flat_map public construct/copy/destruct

    -
  1. explicit flat_map(const context & context = system::default_context());
    2. -
  2. flat_map(const flat_map< Key, T > & other);
    3. -
  3. flat_map< Key, T > & operator=(const flat_map< Key, T > & other);
    4. -
  4. ~flat_map();
    5. +
  5. explicit flat_map(const context & context = system::default_context());
    6. +
  6. flat_map(const flat_map< Key, T > & other);
    7. +
  7. flat_map< Key, T > & operator=(const flat_map< Key, T > & other);
    8. +
  8. ~flat_map();
-

-flat_map public member functions

+

+flat_map public member functions

    -
  1. iterator begin();
    2. -
  2. const_iterator begin() const;
    3. -
  3. const_iterator cbegin() const;
    4. -
  4. iterator end();
    5. -
  5. const_iterator end() const;
    6. -
  6. const_iterator cend() const;
    7. -
  7. reverse_iterator rbegin();
    8. -
  8. const_reverse_iterator rbegin() const;
    9. -
  9. const_reverse_iterator crbegin() const;
    10. -
  10. reverse_iterator rend();
    11. -
  11. const_reverse_iterator rend() const;
    12. -
  12. const_reverse_iterator crend() const;
    13. -
  13. size_type size() const;
    14. -
  14. size_type max_size() const;
    15. -
  15. bool empty() const;
    16. -
  16. size_type capacity() const;
    17. -
  17. void reserve(size_type size, command_queue & queue);
    18. -
  18. void reserve(size_type size);
    19. -
  19. void shrink_to_fit();
    20. -
  20. void clear();
    21. +
  21. iterator begin();
    22. +
  22. const_iterator begin() const;
    23. +
  23. const_iterator cbegin() const;
    24. +
  24. iterator end();
    25. +
  25. const_iterator end() const;
    26. +
  26. const_iterator cend() const;
    27. +
  27. reverse_iterator rbegin();
    28. +
  28. const_reverse_iterator rbegin() const;
    29. +
  29. const_reverse_iterator crbegin() const;
    30. +
  30. reverse_iterator rend();
    31. +
  31. const_reverse_iterator rend() const;
    32. +
  32. const_reverse_iterator crend() const;
    33. +
  33. size_type size() const;
    34. +
  34. size_type max_size() const;
    35. +
  35. bool empty() const;
    36. +
  36. size_type capacity() const;
    37. +
  37. void reserve(size_type size, command_queue & queue);
    38. +
  38. void reserve(size_type size);
    39. +
  39. void shrink_to_fit();
    40. +
  40. void clear();
  41. std::pair< iterator, bool > 
-insert(const value_type & value, command_queue & queue);
    42. -
  42. std::pair< iterator, bool > insert(const value_type & value);
    43. -
  43. iterator erase(const const_iterator & position, command_queue & queue);
    44. -
  44. iterator erase(const const_iterator & position);
    45. -
  45. iterator erase(const const_iterator & first, const const_iterator & last, 
+insert(const value_type & value, command_queue & queue);
    46. +
  46. std::pair< iterator, bool > insert(const value_type & value);
    47. +
  47. iterator erase(const const_iterator & position, command_queue & queue);
    48. +
  48. iterator erase(const const_iterator & position);
    49. +
  49. iterator erase(const const_iterator & first, const const_iterator & last, 
                command_queue & queue);
    50. -
  50. iterator erase(const const_iterator & first, const const_iterator & last);
    51. -
  51. size_type erase(const key_type & value, command_queue & queue);
    52. -
  52. iterator find(const key_type & value, command_queue & queue);
    53. -
  53. iterator find(const key_type & value);
    54. -
  54. const_iterator find(const key_type & value, command_queue & queue) const;
    55. -
  55. const_iterator find(const key_type & value) const;
    56. -
  56. size_type count(const key_type & value, command_queue & queue) const;
    57. -
  57. size_type count(const key_type & value) const;
    58. -
  58. iterator lower_bound(const key_type & value, command_queue & queue);
    59. -
  59. iterator lower_bound(const key_type & value);
    60. +
  60. iterator erase(const const_iterator & first, const const_iterator & last);
    61. +
  61. size_type erase(const key_type & value, command_queue & queue);
    62. +
  62. iterator find(const key_type & value, command_queue & queue);
    63. +
  63. iterator find(const key_type & value);
    64. +
  64. const_iterator find(const key_type & value, command_queue & queue) const;
    65. +
  65. const_iterator find(const key_type & value) const;
    66. +
  66. size_type count(const key_type & value, command_queue & queue) const;
    67. +
  67. size_type count(const key_type & value) const;
    68. +
  68. iterator lower_bound(const key_type & value, command_queue & queue);
    69. +
  69. iterator lower_bound(const key_type & value);
  70. const_iterator 
-lower_bound(const key_type & value, command_queue & queue) const;
    71. -
  71. const_iterator lower_bound(const key_type & value) const;
    72. -
  72. iterator upper_bound(const key_type & value, command_queue & queue);
    73. -
  73. iterator upper_bound(const key_type & value);
    74. +lower_bound(const key_type & value, command_queue & queue) const; +
  74. const_iterator lower_bound(const key_type & value) const;
    75. +
  75. iterator upper_bound(const key_type & value, command_queue & queue);
    76. +
  76. iterator upper_bound(const key_type & value);
  77. const_iterator 
-upper_bound(const key_type & value, command_queue & queue) const;
    78. -
  78. const_iterator upper_bound(const key_type & value) const;
    79. -
  79. const mapped_type at(const key_type & key) const;
    80. -
  80. unspecified operator[](const key_type & key);
    81. +upper_bound(const key_type & value, command_queue & queue) const; +
  81. const_iterator upper_bound(const key_type & value) const;
    82. +
  82. const mapped_type at(const key_type & key) const;
    83. +
  83. unspecified operator[](const key_type & key);
diff --git a/boost/compute/flat_set.html b/boost/compute/flat_set.html index 1b4b1ea8..df017c0b 100644 --- a/boost/compute/flat_set.html +++ b/boost/compute/flat_set.html @@ -40,120 +40,120 @@ typedef vector< T >::const_reverse_iterator const_reverse_iterator; // construct/copy/destruct - explicit flat_set(const context & = system::default_context()); - flat_set(const flat_set< T > &); - flat_set< T > & operator=(const flat_set< T > &); - ~flat_set(); + explicit flat_set(const context & = system::default_context()); + flat_set(const flat_set< T > &); + flat_set< T > & operator=(const flat_set< T > &); + ~flat_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - size_type size() const; - size_type max_size() const; - bool empty() const; - size_type capacity() const; - void reserve(size_type, command_queue &); - void reserve(size_type); - void shrink_to_fit(); - void clear(); - std::pair< iterator, bool > insert(const value_type &, command_queue &); - std::pair< iterator, bool > insert(const value_type &); - iterator erase(const const_iterator &, command_queue &); - iterator erase(const const_iterator &); - iterator erase(const const_iterator &, const const_iterator &, + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + size_type size() const; + size_type max_size() const; + bool empty() const; + size_type capacity() const; + void reserve(size_type, command_queue &); + void reserve(size_type); + void shrink_to_fit(); + void clear(); + std::pair< iterator, bool > insert(const value_type &, command_queue &); + std::pair< iterator, bool > insert(const value_type &); + iterator erase(const const_iterator &, command_queue &); + iterator erase(const const_iterator &); + iterator erase(const const_iterator &, const const_iterator &, command_queue &); - iterator erase(const const_iterator &, const const_iterator &); - size_type erase(const key_type &, command_queue &); - size_type erase(const key_type &); - iterator find(const key_type &, command_queue &); - iterator find(const key_type &); - const_iterator find(const key_type &, command_queue &) const; - const_iterator find(const key_type &) const; - size_type count(const key_type &, command_queue &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &, command_queue &); - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &, command_queue &) const; - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &, command_queue &); - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &, command_queue &) const; - const_iterator upper_bound(const key_type &) const; + iterator erase(const const_iterator &, const const_iterator &); + size_type erase(const key_type &, command_queue &); + size_type erase(const key_type &); + iterator find(const key_type &, command_queue &); + iterator find(const key_type &); + const_iterator find(const key_type &, command_queue &) const; + const_iterator find(const key_type &) const; + size_type count(const key_type &, command_queue &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &, command_queue &); + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &, command_queue &) const; + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &, command_queue &); + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &, command_queue &) const; + const_iterator upper_bound(const key_type &) const; };
-

Description

+

Description

-

+

flat_set public construct/copy/destruct

    -
  1. explicit flat_set(const context & context = system::default_context());
    2. -
  2. flat_set(const flat_set< T > & other);
    3. -
  3. flat_set< T > & operator=(const flat_set< T > & other);
    4. -
  4. ~flat_set();
    5. +
  5. explicit flat_set(const context & context = system::default_context());
    6. +
  6. flat_set(const flat_set< T > & other);
    7. +
  7. flat_set< T > & operator=(const flat_set< T > & other);
    8. +
  8. ~flat_set();
-

-flat_set public member functions

+

+flat_set public member functions

    -
  1. iterator begin();
    2. -
  2. const_iterator begin() const;
    3. -
  3. const_iterator cbegin() const;
    4. -
  4. iterator end();
    5. -
  5. const_iterator end() const;
    6. -
  6. const_iterator cend() const;
    7. -
  7. reverse_iterator rbegin();
    8. -
  8. const_reverse_iterator rbegin() const;
    9. -
  9. const_reverse_iterator crbegin() const;
    10. -
  10. reverse_iterator rend();
    11. -
  11. const_reverse_iterator rend() const;
    12. -
  12. const_reverse_iterator crend() const;
    13. -
  13. size_type size() const;
    14. -
  14. size_type max_size() const;
    15. -
  15. bool empty() const;
    16. -
  16. size_type capacity() const;
    17. -
  17. void reserve(size_type size, command_queue & queue);
    18. -
  18. void reserve(size_type size);
    19. -
  19. void shrink_to_fit();
    20. -
  20. void clear();
    21. +
  21. iterator begin();
    22. +
  22. const_iterator begin() const;
    23. +
  23. const_iterator cbegin() const;
    24. +
  24. iterator end();
    25. +
  25. const_iterator end() const;
    26. +
  26. const_iterator cend() const;
    27. +
  27. reverse_iterator rbegin();
    28. +
  28. const_reverse_iterator rbegin() const;
    29. +
  29. const_reverse_iterator crbegin() const;
    30. +
  30. reverse_iterator rend();
    31. +
  31. const_reverse_iterator rend() const;
    32. +
  32. const_reverse_iterator crend() const;
    33. +
  33. size_type size() const;
    34. +
  34. size_type max_size() const;
    35. +
  35. bool empty() const;
    36. +
  36. size_type capacity() const;
    37. +
  37. void reserve(size_type size, command_queue & queue);
    38. +
  38. void reserve(size_type size);
    39. +
  39. void shrink_to_fit();
    40. +
  40. void clear();
  41. std::pair< iterator, bool > 
-insert(const value_type & value, command_queue & queue);
    42. -
  42. std::pair< iterator, bool > insert(const value_type & value);
    43. -
  43. iterator erase(const const_iterator & position, command_queue & queue);
    44. -
  44. iterator erase(const const_iterator & position);
    45. -
  45. iterator erase(const const_iterator & first, const const_iterator & last, 
+insert(const value_type & value, command_queue & queue);
    46. +
  46. std::pair< iterator, bool > insert(const value_type & value);
    47. +
  47. iterator erase(const const_iterator & position, command_queue & queue);
    48. +
  48. iterator erase(const const_iterator & position);
    49. +
  49. iterator erase(const const_iterator & first, const const_iterator & last, 
                command_queue & queue);
    50. -
  50. iterator erase(const const_iterator & first, const const_iterator & last);
    51. -
  51. size_type erase(const key_type & value, command_queue & queue);
    52. -
  52. size_type erase(const key_type & value);
    53. -
  53. iterator find(const key_type & value, command_queue & queue);
    54. -
  54. iterator find(const key_type & value);
    55. -
  55. const_iterator find(const key_type & value, command_queue & queue) const;
    56. -
  56. const_iterator find(const key_type & value) const;
    57. -
  57. size_type count(const key_type & value, command_queue & queue) const;
    58. -
  58. size_type count(const key_type & value) const;
    59. -
  59. iterator lower_bound(const key_type & value, command_queue & queue);
    60. -
  60. iterator lower_bound(const key_type & value);
    61. +
  61. iterator erase(const const_iterator & first, const const_iterator & last);
    62. +
  62. size_type erase(const key_type & value, command_queue & queue);
    63. +
  63. size_type erase(const key_type & value);
    64. +
  64. iterator find(const key_type & value, command_queue & queue);
    65. +
  65. iterator find(const key_type & value);
    66. +
  66. const_iterator find(const key_type & value, command_queue & queue) const;
    67. +
  67. const_iterator find(const key_type & value) const;
    68. +
  68. size_type count(const key_type & value, command_queue & queue) const;
    69. +
  69. size_type count(const key_type & value) const;
    70. +
  70. iterator lower_bound(const key_type & value, command_queue & queue);
    71. +
  71. iterator lower_bound(const key_type & value);
  72. const_iterator 
-lower_bound(const key_type & value, command_queue & queue) const;
    73. -
  73. const_iterator lower_bound(const key_type & value) const;
    74. -
  74. iterator upper_bound(const key_type & value, command_queue & queue);
    75. -
  75. iterator upper_bound(const key_type & value);
    76. +lower_bound(const key_type & value, command_queue & queue) const; +
  76. const_iterator lower_bound(const key_type & value) const;
    77. +
  77. iterator upper_bound(const key_type & value, command_queue & queue);
    78. +
  78. iterator upper_bound(const key_type & value);
  79. const_iterator 
-upper_bound(const key_type & value, command_queue & queue) const;
    80. -
  80. const_iterator upper_bound(const key_type & value) const;
    81. +upper_bound(const key_type & value, command_queue & queue) const; +
  81. const_iterator upper_bound(const key_type & value) const;
diff --git a/boost/compute/function.html b/boost/compute/function.html index fa969456..611412ef 100644 --- a/boost/compute/function.html +++ b/boost/compute/function.html @@ -26,21 +26,21 @@ class function { public: // construct/copy/destruct - function(const std::string &); - ~function(); + function(const std::string &); + ~function(); };
-

Description

+

Description

-

+

function public construct/copy/destruct

  1. -
    function(const std::string & name);
    Creates a new function object with name.
    2. +
    function(const std::string & name);
    Creates a new function object with name.
  2. -
    ~function();
    Destroys the function object.
    3. +
    ~function();
    Destroys the function object.
diff --git a/boost/compute/function_input_iterator.html b/boost/compute/function_input_iterator.html index 0c4a2eaa..1ca3a270 100644 --- a/boost/compute/function_input_iterator.html +++ b/boost/compute/function_input_iterator.html @@ -32,59 +32,59 @@ typedef Function function; // construct/copy/destruct - function_input_iterator(const Function &, size_t = 0); - function_input_iterator(const function_input_iterator< Function > &); + function_input_iterator(const Function &, size_t = 0); + function_input_iterator(const function_input_iterator< Function > &); function_input_iterator< Function > & - operator=(const function_input_iterator< Function > &); - ~function_input_iterator(); + operator=(const function_input_iterator< Function > &); + ~function_input_iterator(); - // public member functions - size_t get_index() const; - template<typename Expr> unspecified operator[](const Expr &) const; + // public member functions + size_t get_index() const; + template<typename Expr> unspecified operator[](const Expr &) const; - // private member functions - reference dereference() const; - bool equal(const function_input_iterator< Function > &) const; - void increment(); - void decrement(); - void advance(difference_type); + // private member functions + reference dereference() const; + bool equal(const function_input_iterator< Function > &) const; + void increment(); + void decrement(); + void advance(difference_type); difference_type - distance_to(const function_input_iterator< Function > &) const; + distance_to(const function_input_iterator< Function > &) const; };
-

Description

+

Description

-

+

function_input_iterator public construct/copy/destruct

    -
  1. function_input_iterator(const Function & function, size_t index = 0);
    2. -
  2. function_input_iterator(const function_input_iterator< Function > & other);
    3. +
  3. function_input_iterator(const Function & function, size_t index = 0);
    4. +
  4. function_input_iterator(const function_input_iterator< Function > & other);
  5. function_input_iterator< Function > & 
-operator=(const function_input_iterator< Function > & other);
    6. -
  6. ~function_input_iterator();
    7. +operator=(const function_input_iterator< Function > & other); +
  7. ~function_input_iterator();
-

-function_input_iterator public member functions

+

+function_input_iterator public member functions

    -
  1. size_t get_index() const;
    2. -
  2. template<typename Expr> unspecified operator[](const Expr & expr) const;
    3. +
  3. size_t get_index() const;
    4. +
  4. template<typename Expr> unspecified operator[](const Expr & expr) const;
-

-function_input_iterator private member functions

+

+function_input_iterator private member functions

    -
  1. reference dereference() const;
    2. -
  2. bool equal(const function_input_iterator< Function > & other) const;
    3. -
  3. void increment();
    4. -
  4. void decrement();
    5. -
  5. void advance(difference_type n);
    6. +
  6. reference dereference() const;
    7. +
  7. bool equal(const function_input_iterator< Function > & other) const;
    8. +
  8. void increment();
    9. +
  9. void decrement();
    10. +
  10. void advance(difference_type n);
  11. difference_type 
-distance_to(const function_input_iterator< Function > & other) const;
    12. +distance_to(const function_input_iterator< Function > & other) const;
diff --git a/boost/compute/future.html b/boost/compute/future.html index 4cfa21ff..5f6102af 100644 --- a/boost/compute/future.html +++ b/boost/compute/future.html @@ -5,13 +5,13 @@ - - - + + +
-PrevUpHomeNext +PrevUpHomeNext
@@ -20,53 +20,53 @@

boost::compute::future — Holds the result of an asynchronous computation.

Synopsis

-
// In header: <boost/compute/async/future.hpp>
+
// In header: <boost/compute/wait_list.hpp>
 
 template<typename T> 
 class future {
 public:
   // construct/copy/destruct
-  future();
-  future(const T &, const event &);
-  future(const future< T > &);
-  future & operator=(const future< T > &);
-  ~future();
+  future();
+  future(const T &, const event &);
+  future(const future< T > &);
+  future & operator=(const future< T > &);
+  ~future();
 
-  // public member functions
-  T get();
-  bool valid() const;
-  void wait() const;
-  event get_event() const;
+  // public member functions
+  T get();
+  bool valid() const;
+  void wait() const;
+  event get_event() const;
 };

 

-
Description

+
Description

 

-

+

 future 
         public
        construct/copy/destruct

 
    
-
  1. future();
    2. 
-
  2. future(const T & result, const event & event);
    3. 
-
  3. future(const future< T > & other);
    4. 
-
  4. future & operator=(const future< T > & other);
    5. 
-
  5. ~future();
    6. 
+
  6. future();
    7. 
+
  7. future(const T & result, const event & event);
    8. 
+
  8. future(const future< T > & other);
    9. 
+
  9. future & operator=(const future< T > & other);
    10. 
+
  10. ~future();
    11. 
 

 

 

-

-future public member functions

+

+future public member functions

 
    
 
  1. 
-
    T get();
    
+
    T get();
    
 
    Returns the result of the computation. This will block until the result is ready. 
    
 
    2. 
 
  2. 
-
    bool valid() const;
    Returns true if the future is valid. 
    3. 
+
    bool valid() const;
    Returns true if the future is valid. 
 
  3. 
-
    void wait() const;
    Blocks until the computation is complete. 
    4. 
+
    void wait() const;
    Blocks until the computation is complete. 
 
  4. 
-
    event get_event() const;
    Returns the underlying event object. 
    5. 
+
    event get_event() const;
    Returns the underlying event object. 
 

 

 

@@ -81,7 +81,7 @@
 
 

 

-PrevUpHomeNext
+PrevUpHomeNext
 

 
 
diff --git a/boost/compute/gather.html b/boost/compute/gather.html
index 1f87f17b..9d32eae5 100644
--- a/boost/compute/gather.html
+++ b/boost/compute/gather.html
@@ -29,7 +29,7 @@
               OutputIterator result, 
               command_queue & queue = system::default_queue());
-

Description

+

Description

Copies the elements using the indices from the range [first, last) to the range beginning at result using the input values from the range beginning at input.

See Also:

scatter()

diff --git a/boost/compute/generate.html b/boost/compute/generate.html index 390f7877..5fc62f35 100644 --- a/boost/compute/generate.html +++ b/boost/compute/generate.html @@ -28,7 +28,7 @@ Generator generator, command_queue & queue = system::default_queue());
-

Description

+

Description

Stores the result of generator for each element in the range [first, last).

diff --git a/boost/compute/generate_n.html b/boost/compute/generate_n.html index 8e79c209..b0d9b3f0 100644 --- a/boost/compute/generate_n.html +++ b/boost/compute/generate_n.html @@ -27,7 +27,7 @@ void generate_n(OutputIterator first, Size count, Generator generator, command_queue & queue = system::default_queue());
-

Description

+

Description

Stores the result of generator for each element in the range [first, first + count).

diff --git a/boost/compute/get.html b/boost/compute/get.html index a9f9e33e..34181ed1 100644 --- a/boost/compute/get.html +++ b/boost/compute/get.html @@ -7,11 +7,11 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -25,16 +25,16 @@ template<size_t N> struct get { - // public member functions - template<typename Arg> unspecified operator()(const Arg &) const; + // public member functions + template<typename Arg> unspecified operator()(const Arg &) const; };
-

Description

+

Description

Returns the N'th element of an aggregate type (e.g. scalarN, pair, tuple, etc.).

-

-get public member functions

-
  1. template<typename Arg> unspecified operator()(const Arg & arg) const;
+

+get public member functions

+
  1. template<typename Arg> unspecified operator()(const Arg & arg) const;
@@ -48,7 +48,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/inclusive_scan.html b/boost/compute/inclusive_scan.html index b64f20c5..44887b43 100644 --- a/boost/compute/inclusive_scan.html +++ b/boost/compute/inclusive_scan.html @@ -7,11 +7,11 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -29,7 +29,7 @@ OutputIterator result, command_queue & queue = system::default_queue());
-

Description

+

Description

Performs an inclusive scan on the elements in the range [first, last) and stores the results in the range beginning at result.

See Also:

exclusive_scan()

@@ -47,7 +47,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/inner_product_idp19232816.html b/boost/compute/inner_product_idp19232816.html new file mode 100644 index 00000000..0b3867b8 --- /dev/null +++ b/boost/compute/inner_product_idp19232816.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp19241488.html b/boost/compute/inner_product_idp19241488.html new file mode 100644 index 00000000..84f0b701 --- /dev/null +++ b/boost/compute/inner_product_idp19241488.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp19272240.html b/boost/compute/inner_product_idp19272240.html new file mode 100644 index 00000000..6a195605 --- /dev/null +++ b/boost/compute/inner_product_idp19272240.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp19280912.html b/boost/compute/inner_product_idp19280912.html new file mode 100644 index 00000000..2040a5b2 --- /dev/null +++ b/boost/compute/inner_product_idp19280912.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp19684736.html b/boost/compute/inner_product_idp19684736.html new file mode 100644 index 00000000..922bbae6 --- /dev/null +++ b/boost/compute/inner_product_idp19684736.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp19693408.html b/boost/compute/inner_product_idp19693408.html new file mode 100644 index 00000000..f184363b --- /dev/null +++ b/boost/compute/inner_product_idp19693408.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp20100176.html b/boost/compute/inner_product_idp20100176.html new file mode 100644 index 00000000..3f3bacf9 --- /dev/null +++ b/boost/compute/inner_product_idp20100176.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp20108848.html b/boost/compute/inner_product_idp20108848.html new file mode 100644 index 00000000..fd9d3abe --- /dev/null +++ b/boost/compute/inner_product_idp20108848.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp22872800.html b/boost/compute/inner_product_idp22872800.html new file mode 100644 index 00000000..0604ab88 --- /dev/null +++ b/boost/compute/inner_product_idp22872800.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp22881472.html b/boost/compute/inner_product_idp22881472.html new file mode 100644 index 00000000..5cf0d403 --- /dev/null +++ b/boost/compute/inner_product_idp22881472.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp24079488.html b/boost/compute/inner_product_idp24079488.html new file mode 100644 index 00000000..76b35761 --- /dev/null +++ b/boost/compute/inner_product_idp24079488.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp24088160.html b/boost/compute/inner_product_idp24088160.html new file mode 100644 index 00000000..1fff9e73 --- /dev/null +++ b/boost/compute/inner_product_idp24088160.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp24321872.html b/boost/compute/inner_product_idp24321872.html new file mode 100644 index 00000000..a112b67f --- /dev/null +++ b/boost/compute/inner_product_idp24321872.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp24330544.html b/boost/compute/inner_product_idp24330544.html new file mode 100644 index 00000000..1b096baf --- /dev/null +++ b/boost/compute/inner_product_idp24330544.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp24519200.html b/boost/compute/inner_product_idp24519200.html new file mode 100644 index 00000000..a06681ed --- /dev/null +++ b/boost/compute/inner_product_idp24519200.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp24527872.html b/boost/compute/inner_product_idp24527872.html new file mode 100644 index 00000000..c61ca0b0 --- /dev/null +++ b/boost/compute/inner_product_idp24527872.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp25651904.html b/boost/compute/inner_product_idp25651904.html new file mode 100644 index 00000000..16671edf --- /dev/null +++ b/boost/compute/inner_product_idp25651904.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp25660576.html b/boost/compute/inner_product_idp25660576.html new file mode 100644 index 00000000..8edbb95f --- /dev/null +++ b/boost/compute/inner_product_idp25660576.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp27420160.html b/boost/compute/inner_product_idp27420160.html new file mode 100644 index 00000000..2e391a13 --- /dev/null +++ b/boost/compute/inner_product_idp27420160.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp27428832.html b/boost/compute/inner_product_idp27428832.html new file mode 100644 index 00000000..8889d7bb --- /dev/null +++ b/boost/compute/inner_product_idp27428832.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp28800384.html b/boost/compute/inner_product_idp28800384.html new file mode 100644 index 00000000..8315a02b --- /dev/null +++ b/boost/compute/inner_product_idp28800384.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp28809056.html b/boost/compute/inner_product_idp28809056.html new file mode 100644 index 00000000..49e97789 --- /dev/null +++ b/boost/compute/inner_product_idp28809056.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp29957760.html b/boost/compute/inner_product_idp29957760.html new file mode 100644 index 00000000..84b182fe --- /dev/null +++ b/boost/compute/inner_product_idp29957760.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp29966432.html b/boost/compute/inner_product_idp29966432.html new file mode 100644 index 00000000..9c50bc46 --- /dev/null +++ b/boost/compute/inner_product_idp29966432.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp31176976.html b/boost/compute/inner_product_idp31176976.html new file mode 100644 index 00000000..de0cc77c --- /dev/null +++ b/boost/compute/inner_product_idp31176976.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp31185648.html b/boost/compute/inner_product_idp31185648.html new file mode 100644 index 00000000..c4bb0d06 --- /dev/null +++ b/boost/compute/inner_product_idp31185648.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp35333712.html b/boost/compute/inner_product_idp35333712.html new file mode 100644 index 00000000..f25db51a --- /dev/null +++ b/boost/compute/inner_product_idp35333712.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp35342384.html b/boost/compute/inner_product_idp35342384.html new file mode 100644 index 00000000..56147bb9 --- /dev/null +++ b/boost/compute/inner_product_idp35342384.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp38324720.html b/boost/compute/inner_product_idp38324720.html new file mode 100644 index 00000000..b8af2367 --- /dev/null +++ b/boost/compute/inner_product_idp38324720.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp38333392.html b/boost/compute/inner_product_idp38333392.html new file mode 100644 index 00000000..3d080838 --- /dev/null +++ b/boost/compute/inner_product_idp38333392.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp39601776.html b/boost/compute/inner_product_idp39601776.html new file mode 100644 index 00000000..c14dda3f --- /dev/null +++ b/boost/compute/inner_product_idp39601776.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp39610448.html b/boost/compute/inner_product_idp39610448.html new file mode 100644 index 00000000..c5846a9b --- /dev/null +++ b/boost/compute/inner_product_idp39610448.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp43622752.html b/boost/compute/inner_product_idp43622752.html new file mode 100644 index 00000000..7a85d2cd --- /dev/null +++ b/boost/compute/inner_product_idp43622752.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp43631424.html b/boost/compute/inner_product_idp43631424.html new file mode 100644 index 00000000..0f0550e1 --- /dev/null +++ b/boost/compute/inner_product_idp43631424.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp44566576.html b/boost/compute/inner_product_idp44566576.html new file mode 100644 index 00000000..4513729f --- /dev/null +++ b/boost/compute/inner_product_idp44566576.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp44575248.html b/boost/compute/inner_product_idp44575248.html new file mode 100644 index 00000000..54e01c11 --- /dev/null +++ b/boost/compute/inner_product_idp44575248.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp46184768.html b/boost/compute/inner_product_idp46184768.html new file mode 100644 index 00000000..a19c87bf --- /dev/null +++ b/boost/compute/inner_product_idp46184768.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp46193440.html b/boost/compute/inner_product_idp46193440.html new file mode 100644 index 00000000..33ed311a --- /dev/null +++ b/boost/compute/inner_product_idp46193440.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp49244112.html b/boost/compute/inner_product_idp49244112.html new file mode 100644 index 00000000..ed248eb3 --- /dev/null +++ b/boost/compute/inner_product_idp49244112.html @@ -0,0 +1,48 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inner_product_idp49252784.html b/boost/compute/inner_product_idp49252784.html new file mode 100644 index 00000000..838cfb0e --- /dev/null +++ b/boost/compute/inner_product_idp49252784.html @@ -0,0 +1,51 @@ + + + +Function template inner_product + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template inner_product

+

boost::compute::inner_product

+
+

Synopsis

+
// In header: <boost/compute/algorithm/inner_product.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, typename T, 
+         typename BinaryAccumulateFunction, typename BinaryTransformFunction> 
+  T inner_product(InputIterator1 first1, InputIterator1 last1, 
+                  InputIterator2 first2, T init, 
+                  BinaryAccumulateFunction accumulate_function, 
+                  BinaryTransformFunction transform_function, 
+                  command_queue & queue = system::default_queue());
+
+

Description

+

Returns the inner product of the elements in the range [first1, last1) with the elements in the range beginning at first2 using accumulate_function and transform_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/inplace_merge.html b/boost/compute/inplace_merge.html index a228d024..7b4d26e7 100644 --- a/boost/compute/inplace_merge.html +++ b/boost/compute/inplace_merge.html @@ -6,12 +6,12 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -27,7 +27,7 @@ void inplace_merge(Iterator first, Iterator middle, Iterator last, command_queue & queue = system::default_queue());
-

Description

+

Description

Merges the sorted values in the range [first, middle) with the sorted values in the range [middle, last) in-place.

@@ -41,7 +41,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/iota.html b/boost/compute/iota.html index fca8751d..5462e180 100644 --- a/boost/compute/iota.html +++ b/boost/compute/iota.html @@ -27,7 +27,7 @@ void iota(BufferIterator first, BufferIterator last, const T & value, command_queue & queue = system::default_queue());
-

Description

+

Description

Fills the range [first, last) with sequential values starting at value.

diff --git a/boost/compute/is_fundamental.html b/boost/compute/is_fundamental.html index a95854fb..b49eb738 100644 --- a/boost/compute/is_fundamental.html +++ b/boost/compute/is_fundamental.html @@ -26,7 +26,7 @@ struct is_fundamental : public false_type { };
-

Description

+

Description

Meta-function returning true if T is a fundamental (i.e. built-in) type.

For example, 

is_fundamental<float>::value == true
diff --git a/boost/compute/is_partitioned.html b/boost/compute/is_partitioned.html
index 87936cc8..10d7d387 100644
--- a/boost/compute/is_partitioned.html
+++ b/boost/compute/is_partitioned.html
@@ -28,7 +28,7 @@
                       UnaryPredicate predicate, 
                       command_queue & queue = system::default_queue());
-

Description

+

Description

Returns true if the values in the range [first, last) are partitioned according to predicate.

diff --git a/boost/compute/is_sorted.html b/boost/compute/is_sorted.html index db233ebd..ce63c8cf 100644 --- a/boost/compute/is_sorted.html +++ b/boost/compute/is_sorted.html @@ -27,7 +27,7 @@ bool is_sorted(InputIterator first, InputIterator last, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns true if the values in the range [first, last) are in sorted order.

diff --git a/boost/compute/is_vector_type.html b/boost/compute/is_vector_type.html index 3f9eb0c7..b58b2fad 100644 --- a/boost/compute/is_vector_type.html +++ b/boost/compute/is_vector_type.html @@ -26,7 +26,7 @@ struct is_vector_type { };
-

Description

+

Description

Meta-function returning true if T is a vector type.

For example, 

is_vector_type<int>::value == false
diff --git a/boost/compute/kernel.html b/boost/compute/kernel.html
index ab5f79ca..397029a0 100644
--- a/boost/compute/kernel.html
+++ b/boost/compute/kernel.html
@@ -26,79 +26,79 @@
 class kernel {
 public:
   // construct/copy/destruct
-  kernel();
-  explicit kernel(cl_kernel, bool = true);
-  kernel(const program &, const std::string &);
-  kernel(const kernel &);
-  kernel(BOOST_RV_REF(kernel));
-  kernel & operator=(const kernel &);
-  kernel & operator=(BOOST_RV_REF(kernel));
-  ~kernel();
+  kernel();
+  explicit kernel(cl_kernel, bool = true);
+  kernel(const program &, const std::string &);
+  kernel(const kernel &);
+  kernel(BOOST_RV_REF(kernel));
+  kernel & operator=(const kernel &);
+  kernel & operator=(BOOST_RV_REF(kernel));
+  ~kernel();
 
-  // public member functions
-  cl_kernel & get() const;
-  std::string name() const;
-  size_t arity() const;
-  program get_program() const;
-  context get_context() const;
-  template<typename T> T get_info(cl_kernel_info) const;
-  template<typename T> T get_arg_info(size_t, cl_kernel_arg_info);
+  // public member functions
+  cl_kernel & get() const;
+  std::string name() const;
+  size_t arity() const;
+  program get_program() const;
+  context get_context() const;
+  template<typename T> T get_info(cl_kernel_info) const;
+  template<typename T> T get_arg_info(size_t, cl_kernel_arg_info);
   template<typename T> 
-    T get_work_group_info(const device &, cl_kernel_work_group_info);
-  void set_arg(size_t, size_t, const void *);
-  template<typename T> void set_arg(size_t, const T &);
-  template<class... T> void set_args(T &&...);
+    T get_work_group_info(const device &, cl_kernel_work_group_info);
+  void set_arg(size_t, size_t, const void *);
+  template<typename T> void set_arg(size_t, const T &);
+  template<class... T> void set_args(T &&...);
 };
-

Description

+

Description

See Also:

program

-

+

kernel public construct/copy/destruct

  1. -
    kernel();
    Creates a null kernel object.
    2. +
    kernel();
    Creates a null kernel object.
  2. -
    explicit kernel(cl_kernel kernel, bool retain = true);
    +
    explicit kernel(cl_kernel kernel, bool retain = true);

    Creates a new kernel object for kernel. If retain is true, the reference count for kernel will be incremented.

  3. -
    kernel(const program & program, const std::string & name);
    Creates a new kernel object with name from program.
    4. +
    kernel(const program & program, const std::string & name);
    Creates a new kernel object with name from program.
  4. -
    kernel(const kernel & other);
    Creates a new kernel object as a copy of other.
    5. -
  5. kernel(BOOST_RV_REF(kernel) other);
    6. -
  6. kernel & operator=(const kernel & other);
    7. -
  7. kernel & operator=(BOOST_RV_REF(kernel) other);
    8. +
    kernel(const kernel & other);
    Creates a new kernel object as a copy of other. +
  8. kernel(BOOST_RV_REF(kernel) other);
    9. +
  9. kernel & operator=(const kernel & other);
    10. +
  10. kernel & operator=(BOOST_RV_REF(kernel) other);
  11. -
    ~kernel();
    Destroys the kernel object.
    12. +
    ~kernel();
    Destroys the kernel object.
-

-kernel public member functions

+

+kernel public member functions

  1. -
    cl_kernel & get() const;
    Returns a reference to the underlying OpenCL kernel object.
    2. +
    cl_kernel & get() const;
    Returns a reference to the underlying OpenCL kernel object.
  2. -
    std::string name() const;
    Returns the function name for the kernel.
    3. +
    std::string name() const;
    Returns the function name for the kernel.
  3. -
    size_t arity() const;
    Returns the number of arguments for the kernel.
    4. +
    size_t arity() const;
    Returns the number of arguments for the kernel.
  4. -
    program get_program() const;
    Returns the program for the kernel.
    5. +
    program get_program() const;
    Returns the program for the kernel.
  5. -
    context get_context() const;
    Returns the context for the kernel.
    6. +
    context get_context() const;
    Returns the context for the kernel.
  6. -
    template<typename T> T get_info(cl_kernel_info info) const;
    +
    template<typename T> T get_info(cl_kernel_info info) const;

    Returns information about the kernel.

    See the documentation for clGetKernelInfo() for more information.

  7. -
    template<typename T> T get_arg_info(size_t index, cl_kernel_arg_info info);
    +
    template<typename T> T get_arg_info(size_t index, cl_kernel_arg_info info);

    Returns information about the argument at index.

    @@ -112,19 +112,19 @@ See the documentation for 
    template<typename T> 
-  T get_work_group_info(const device & device, cl_kernel_work_group_info info);
    + Tget_work_group_info(constdevice& device,cl_kernel_work_group_info info);

    Returns work-group information for the kernel with device.

    See the documentation for clGetKernelWorkGroupInfo() for more information.

  8. -
    void set_arg(size_t index, size_t size, const void * value);
    +
    void set_arg(size_t index, size_t size, const void * value);

    Sets the argument at index to value with size.

    See the documentation for clSetKernelArg() for more information.

  9. -
    template<typename T> void set_arg(size_t index, const T & value);
    Sets the argument at index to value.
    10. +
    template<typename T> void set_arg(size_t index, const T & value);
    Sets the argument at index to value.
  10. -
    template<class... T> void set_args(T &&... args);
    Sets the arguments for the kernel to args.
    11. +
    template<class... T> void set_args(T &&... args);
    Sets the arguments for the kernel to args. diff --git a/boost/compute/lower_bound.html b/boost/compute/lower_bound.html index 743fca3d..3838bd9b 100644 --- a/boost/compute/lower_bound.html +++ b/boost/compute/lower_bound.html @@ -28,7 +28,7 @@ lower_bound(InputIterator first,InputIterator last,constT& value,command_queue& queue =system::default_queue());
    -

    Description

    +

    Description

    Returns an iterator pointing to the first element in the sorted range [first, last) that is not less than value.

    See Also:

    upper_bound()

    diff --git a/boost/compute/make_function_from_source.html b/boost/compute/make_function_from_source.html index 17ff29cf..9e59bd37 100644 --- a/boost/compute/make_function_from_source.html +++ b/boost/compute/make_function_from_source.html @@ -28,7 +28,7 @@ make_function_from_source(const std::string & name, const std::string & source);
    -

    Description

    +

    Description

    Creates a function object given its name and source.

    diff --git a/boost/compute/make_vector_type.html b/boost/compute/make_vector_type.html index 58cec2c9..d928dee3 100644 --- a/boost/compute/make_vector_type.html +++ b/boost/compute/make_vector_type.html @@ -26,7 +26,7 @@ struct make_vector_type { };
    -

    Description

    +

    Description

    Meta-function which returns a vector type for Scalar with Size.

    For example, 

    make_vector_type<int, 2>::type == int2_
diff --git a/boost/compute/mapped_view.html b/boost/compute/mapped_view.html
index 0edf0954..5c301ac5 100644
--- a/boost/compute/mapped_view.html
+++ b/boost/compute/mapped_view.html
@@ -33,98 +33,98 @@
   typedef buffer_iterator< T > const_iterator; 
 
   // construct/copy/destruct
-  mapped_view();
-  mapped_view(T *, size_type, const context & = system::default_context());
-  mapped_view(const T *, size_type, 
+  mapped_view();
+  mapped_view(T *, size_type, const context & = system::default_context());
+  mapped_view(const T *, size_type, 
               const context & = system::default_context());
-  mapped_view(const mapped_view< T > &);
-  mapped_view< T > & operator=(const mapped_view< T > &);
-  ~mapped_view();
+  mapped_view(const mapped_view< T > &);
+  mapped_view< T > & operator=(const mapped_view< T > &);
+  ~mapped_view();
 
-  // public member functions
-  iterator begin();
-  const_iterator begin() const;
-  const_iterator cbegin() const;
-  iterator end();
-  const_iterator end() const;
-  const_iterator cend() const;
-  size_type size() const;
-  T * get_host_ptr();
-  const T * get_host_ptr() const;
-  void resize(size_type);
-  bool empty() const;
-  const buffer & get_buffer() const;
-  void map(cl_map_flags, command_queue &);
-  void map(command_queue &);
-  void unmap(command_queue &);
+  // public member functions
+  iterator begin();
+  const_iterator begin() const;
+  const_iterator cbegin() const;
+  iterator end();
+  const_iterator end() const;
+  const_iterator cend() const;
+  size_type size() const;
+  T * get_host_ptr();
+  const T * get_host_ptr() const;
+  void resize(size_type);
+  bool empty() const;
+  const buffer & get_buffer() const;
+  void map(cl_map_flags, command_queue &);
+  void map(command_queue &);
+  void unmap(command_queue &);
 
-  // private static functions
-  static buffer _make_mapped_buffer(T *, size_t, const context &);
-  static buffer _make_mapped_buffer(const T *, size_t, const context &);
+  // private static functions
+  static buffer _make_mapped_buffer(T *, size_t, const context &);
+  static buffer _make_mapped_buffer(const T *, size_t, const context &);
 };
    -

    Description

    +

    Description

    -

    +

    mapped_view public construct/copy/destruct

    1. -
      mapped_view();
      Creates a null mapped_view object.
      2. +
      mapped_view();
      Creates a null mapped_view object.
    2. -
      mapped_view(T * host_ptr, size_type n, 
+
      mapped_view(T * host_ptr, size_type n, 
             const context & context = system::default_context());
      
 
      Creates a mapped_view for host_ptr with n elements. After constructing a mapped_view the data is available for use by a compute device. Use the unmap() method to make the updated data available to the host.
    3. -
      mapped_view(const T * host_ptr, size_type n, 
+
      mapped_view(const T * host_ptr, size_type n, 
             const context & context = system::default_context());
      
 
      Creates a read-only mapped_view for host_ptr with n elements. After constructing a mapped_view the data is available for use by a compute device. Use the unmap() method to make the updated data available to the host.
    4. -
      mapped_view(const mapped_view< T > & other);
      Creates a copy of other.
      5. +
      mapped_view(const mapped_view< T > & other);
      Creates a copy of other.
    5. -
      mapped_view< T > & operator=(const mapped_view< T > & other);
      Copies the mapped buffer from other.
      6. +
      mapped_view< T > & operator=(const mapped_view< T > & other);
      Copies the mapped buffer from other.
    6. -
      ~mapped_view();
      Destroys the mapped_view object.
      7. +
      ~mapped_view();
      Destroys the mapped_view object.
    -

    -mapped_view public member functions

    +

    +mapped_view public member functions

    1. -
      iterator begin();
      Returns an iterator to the first element in the mapped_view.
      2. +
      iterator begin();
      Returns an iterator to the first element in the mapped_view.
    2. -
      const_iterator begin() const;
      Returns a const_iterator to the first element in the mapped_view.
      3. +
      const_iterator begin() const;
      Returns a const_iterator to the first element in the mapped_view.
    3. -
      const_iterator cbegin() const;
      Returns a const_iterator to the first element in the mapped_view.
      4. +
      const_iterator cbegin() const;
      Returns a const_iterator to the first element in the mapped_view.
    4. -
      iterator end();
      Returns an iterator to one past the last element in the mapped_view.
      5. +
      iterator end();
      Returns an iterator to one past the last element in the mapped_view.
    5. -
      const_iterator end() const;
      Returns a const_iterator to one past the last element in the mapped_view.
      6. +
      const_iterator end() const;
      Returns a const_iterator to one past the last element in the mapped_view.
    6. -
      const_iterator cend() const;
      Returns a const_iterator to one past the last element in the mapped_view.
      7. +
      const_iterator cend() const;
      Returns a const_iterator to one past the last element in the mapped_view.
    7. -
      size_type size() const;
      Returns the number of elements in the mapped_view.
      8. +
      size_type size() const;
      Returns the number of elements in the mapped_view.
    8. -
      T * get_host_ptr();
      Returns the host data pointer.
      9. +
      T * get_host_ptr();
      Returns the host data pointer.
    9. -
      const T * get_host_ptr() const;
      Returns the host data pointer.
      10. +
      const T * get_host_ptr() const;
      Returns the host data pointer.
    10. -
      void resize(size_type size);
      Resizes the mapped_view to size elements.
      11. +
      void resize(size_type size);
      Resizes the mapped_view to size elements.
    11. -
      bool empty() const;
      Returns true if the mapped_view is empty.
      12. +
      bool empty() const;
      Returns true if the mapped_view is empty.
    12. -
      const buffer & get_buffer() const;
      Returns the mapped buffer.
      13. +
      const buffer & get_buffer() const;
      Returns the mapped buffer.
    13. -
      void map(cl_map_flags flags, command_queue & queue);
      +
      void map(cl_map_flags flags, command_queue & queue);

      Maps the buffer into the host address space.

      See the documentation for clEnqueueMapBuffer() for more information.

    14. -
      void map(command_queue & queue);
      +
      void map(command_queue & queue);

      Maps the buffer into the host address space for reading and writing.

      Equivalent to: 

      map(CL_MAP_READ | CL_MAP_WRITE, queue);
@@ -132,20 +132,20 @@
    15. -
      void unmap(command_queue & queue);
      +
      void unmap(command_queue & queue);

      Unmaps the buffer from the host address space.

      See the documentation for clEnqueueUnmapMemObject() for more information.

    -

    -mapped_view private static functions

    +

    +mapped_view private static functions

    1. static buffer 
-_make_mapped_buffer(T * host_ptr, size_t n, const context & context);
      2. +_make_mapped_buffer(T * host_ptr, size_t n, const context & context); 
    2. static buffer 
-_make_mapped_buffer(const T * host_ptr, size_t n, const context & context);
      3. +_make_mapped_buffer(const T * host_ptr, size_t n, const context & context);
    diff --git a/boost/compute/max_element.html b/boost/compute/max_element.html index 2797adb2..fcd9a979 100644 --- a/boost/compute/max_element.html +++ b/boost/compute/max_element.html @@ -7,11 +7,11 @@ - +
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -28,7 +28,7 @@ max_element(InputIterator first, InputIterator last, command_queue & queue = system::default_queue());
    -

    Description

    +

    Description

    Returns an iterator pointing to the element in the range [first, last) with the maximum value.

    See Also:

    min_element()

    @@ -46,7 +46,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/boost/compute/memory_object.html b/boost/compute/memory_object.html index 82131b41..679abddc 100644 --- a/boost/compute/memory_object.html +++ b/boost/compute/memory_object.html @@ -34,52 +34,52 @@ alloc_host_ptr = = CL_MEM_ALLOC_HOST_PTR, copy_host_ptr = = CL_MEM_COPY_HOST_PTR }; - // public member functions - cl_mem & get() const; - size_t get_memory_size() const; - cl_mem_object_type get_memory_type() const; - cl_mem_flags get_memory_flags() const; - context get_context() const; - void * get_host_ptr() const; - uint_ reference_count() const; - template<typename T> T get_memory_info(cl_mem_info) const; - bool operator==(const memory_object &) const; - bool operator!=(const memory_object &) const; + // public member functions + cl_mem & get() const; + size_t get_memory_size() const; + cl_mem_object_type get_memory_type() const; + cl_mem_flags get_memory_flags() const; + context get_context() const; + void * get_host_ptr() const; + uint_ reference_count() const; + template<typename T> T get_memory_info(cl_mem_info) const; + bool operator==(const memory_object &) const; + bool operator!=(const memory_object &) const; };
    -

    Description

    +

    Description

    The memory_object class is the base-class for memory objects on compute devices.

    See Also:

    buffer, vector

    -

    -memory_object public member functions

    +

    +memory_object public member functions

    1. -
      cl_mem & get() const;
      Returns the underlying OpenCL memory object.
      2. +
      cl_mem & get() const;
      Returns the underlying OpenCL memory object.
    2. -
      size_t get_memory_size() const;
      Returns the size of the memory object in bytes.
      3. +
      size_t get_memory_size() const;
      Returns the size of the memory object in bytes.
    3. -
      cl_mem_object_type get_memory_type() const;
      Returns the type for the memory object.
      4. +
      cl_mem_object_type get_memory_type() const;
      Returns the type for the memory object.
    4. -
      cl_mem_flags get_memory_flags() const;
      Returns the flags for the memory object.
      5. +
      cl_mem_flags get_memory_flags() const;
      Returns the flags for the memory object.
    5. -
      context get_context() const;
      Returns the context for the memory object.
      6. +
      context get_context() const;
      Returns the context for the memory object.
    6. -
      void * get_host_ptr() const;
      Returns the host pointer associated with the memory object.
      7. +
      void * get_host_ptr() const;
      Returns the host pointer associated with the memory object.
    7. -
      uint_ reference_count() const;
      Returns the reference count for the memory object.
      8. +
      uint_ reference_count() const;
      Returns the reference count for the memory object.
    8. -
      template<typename T> T get_memory_info(cl_mem_info info) const;
      +
      template<typename T> T get_memory_info(cl_mem_info info) const;

      Returns information about the memory object.

      See the documentation for clGetMemObjectInfo() for more information.

    9. -
      bool operator==(const memory_object & other) const;
      Returns true if the memory object is the same as other.
      10. +
      bool operator==(const memory_object & other) const;
      Returns true if the memory object is the same as other.
    10. -
      bool operator!=(const memory_object & other) const;
      Returns true if the memory object is different from other.
      11. +
      bool operator!=(const memory_object & other) const;
      Returns true if the memory object is different from other.
    diff --git a/boost/compute/merge_idp19316736.html b/boost/compute/merge_idp19316736.html new file mode 100644 index 00000000..9240d8f2 --- /dev/null +++ b/boost/compute/merge_idp19316736.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp19326544.html b/boost/compute/merge_idp19326544.html new file mode 100644 index 00000000..64229f6a --- /dev/null +++ b/boost/compute/merge_idp19326544.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp19356160.html b/boost/compute/merge_idp19356160.html new file mode 100644 index 00000000..c3a7139f --- /dev/null +++ b/boost/compute/merge_idp19356160.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp19365968.html b/boost/compute/merge_idp19365968.html new file mode 100644 index 00000000..7167bf3a --- /dev/null +++ b/boost/compute/merge_idp19365968.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp19765376.html b/boost/compute/merge_idp19765376.html new file mode 100644 index 00000000..6f060a84 --- /dev/null +++ b/boost/compute/merge_idp19765376.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp19775184.html b/boost/compute/merge_idp19775184.html new file mode 100644 index 00000000..1a22e56d --- /dev/null +++ b/boost/compute/merge_idp19775184.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp20180864.html b/boost/compute/merge_idp20180864.html new file mode 100644 index 00000000..ee01ab9c --- /dev/null +++ b/boost/compute/merge_idp20180864.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp20190672.html b/boost/compute/merge_idp20190672.html new file mode 100644 index 00000000..a1cf7f8a --- /dev/null +++ b/boost/compute/merge_idp20190672.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp22956768.html b/boost/compute/merge_idp22956768.html new file mode 100644 index 00000000..9a3aba40 --- /dev/null +++ b/boost/compute/merge_idp22956768.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp22966576.html b/boost/compute/merge_idp22966576.html new file mode 100644 index 00000000..21eab78c --- /dev/null +++ b/boost/compute/merge_idp22966576.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp24163408.html b/boost/compute/merge_idp24163408.html new file mode 100644 index 00000000..ad5f30fe --- /dev/null +++ b/boost/compute/merge_idp24163408.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp24173216.html b/boost/compute/merge_idp24173216.html new file mode 100644 index 00000000..c788ea6e --- /dev/null +++ b/boost/compute/merge_idp24173216.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp24402560.html b/boost/compute/merge_idp24402560.html new file mode 100644 index 00000000..8a14b33e --- /dev/null +++ b/boost/compute/merge_idp24402560.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp24412368.html b/boost/compute/merge_idp24412368.html new file mode 100644 index 00000000..6f244ad8 --- /dev/null +++ b/boost/compute/merge_idp24412368.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp24603120.html b/boost/compute/merge_idp24603120.html new file mode 100644 index 00000000..ab086f68 --- /dev/null +++ b/boost/compute/merge_idp24603120.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp24612928.html b/boost/compute/merge_idp24612928.html new file mode 100644 index 00000000..a82aefa2 --- /dev/null +++ b/boost/compute/merge_idp24612928.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp25735872.html b/boost/compute/merge_idp25735872.html new file mode 100644 index 00000000..19dc54b5 --- /dev/null +++ b/boost/compute/merge_idp25735872.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp25745680.html b/boost/compute/merge_idp25745680.html new file mode 100644 index 00000000..b49b5611 --- /dev/null +++ b/boost/compute/merge_idp25745680.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp27500800.html b/boost/compute/merge_idp27500800.html new file mode 100644 index 00000000..ac7be915 --- /dev/null +++ b/boost/compute/merge_idp27500800.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp27510608.html b/boost/compute/merge_idp27510608.html new file mode 100644 index 00000000..5b1a6b12 --- /dev/null +++ b/boost/compute/merge_idp27510608.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp28884288.html b/boost/compute/merge_idp28884288.html new file mode 100644 index 00000000..cb50faa6 --- /dev/null +++ b/boost/compute/merge_idp28884288.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp28894096.html b/boost/compute/merge_idp28894096.html new file mode 100644 index 00000000..02896efe --- /dev/null +++ b/boost/compute/merge_idp28894096.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp30038448.html b/boost/compute/merge_idp30038448.html new file mode 100644 index 00000000..38916682 --- /dev/null +++ b/boost/compute/merge_idp30038448.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp30048256.html b/boost/compute/merge_idp30048256.html new file mode 100644 index 00000000..86943030 --- /dev/null +++ b/boost/compute/merge_idp30048256.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp31257616.html b/boost/compute/merge_idp31257616.html new file mode 100644 index 00000000..255df672 --- /dev/null +++ b/boost/compute/merge_idp31257616.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp31267424.html b/boost/compute/merge_idp31267424.html new file mode 100644 index 00000000..4d762051 --- /dev/null +++ b/boost/compute/merge_idp31267424.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp35417632.html b/boost/compute/merge_idp35417632.html new file mode 100644 index 00000000..2ee86549 --- /dev/null +++ b/boost/compute/merge_idp35417632.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp35427440.html b/boost/compute/merge_idp35427440.html new file mode 100644 index 00000000..7c0efe25 --- /dev/null +++ b/boost/compute/merge_idp35427440.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp38405408.html b/boost/compute/merge_idp38405408.html new file mode 100644 index 00000000..5971da80 --- /dev/null +++ b/boost/compute/merge_idp38405408.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp38415216.html b/boost/compute/merge_idp38415216.html new file mode 100644 index 00000000..55a6e257 --- /dev/null +++ b/boost/compute/merge_idp38415216.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp39682416.html b/boost/compute/merge_idp39682416.html new file mode 100644 index 00000000..99759d5b --- /dev/null +++ b/boost/compute/merge_idp39682416.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp39692224.html b/boost/compute/merge_idp39692224.html new file mode 100644 index 00000000..20e0070b --- /dev/null +++ b/boost/compute/merge_idp39692224.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp43703440.html b/boost/compute/merge_idp43703440.html new file mode 100644 index 00000000..c53c2693 --- /dev/null +++ b/boost/compute/merge_idp43703440.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp43713248.html b/boost/compute/merge_idp43713248.html new file mode 100644 index 00000000..68647ac1 --- /dev/null +++ b/boost/compute/merge_idp43713248.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp44647264.html b/boost/compute/merge_idp44647264.html new file mode 100644 index 00000000..f74c3f8a --- /dev/null +++ b/boost/compute/merge_idp44647264.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp44657072.html b/boost/compute/merge_idp44657072.html new file mode 100644 index 00000000..d1ac7f21 --- /dev/null +++ b/boost/compute/merge_idp44657072.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp46265456.html b/boost/compute/merge_idp46265456.html new file mode 100644 index 00000000..f70d07f6 --- /dev/null +++ b/boost/compute/merge_idp46265456.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp46275264.html b/boost/compute/merge_idp46275264.html new file mode 100644 index 00000000..351ce54f --- /dev/null +++ b/boost/compute/merge_idp46275264.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp49324800.html b/boost/compute/merge_idp49324800.html new file mode 100644 index 00000000..5c8fc922 --- /dev/null +++ b/boost/compute/merge_idp49324800.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/merge_idp49334608.html b/boost/compute/merge_idp49334608.html new file mode 100644 index 00000000..31b8a6d3 --- /dev/null +++ b/boost/compute/merge_idp49334608.html @@ -0,0 +1,50 @@ + + + +Function template merge + + + + + + + + +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template merge

    +

    boost::compute::merge

    +
    +

    Synopsis

    +
    // In header: <boost/compute/algorithm/merge.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename Compare> 
+  OutputIterator 
+  merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
+        InputIterator2 last2, OutputIterator result, Compare comp, 
+        command_queue & queue = system::default_queue());
    +
    +

    Description

    +

    Merges the sorted values in the range [first1, last1) with the sorted values in the range [first2, last2) and stores the result in the range beginning at result. Values are compared using the comp function.

    +
    +
    + + + +
    Copyright © 2013 Kyle Lutz

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/boost/compute/mersenne_twister_engine.html b/boost/compute/mersenne_twister_engine.html index 0d987d45..deb00259 100644 --- a/boost/compute/mersenne_twister_engine.html +++ b/boost/compute/mersenne_twister_engine.html @@ -29,20 +29,20 @@ typedef T result_type; // construct/copy/destruct - mersenne_twister_engine(const context &); - mersenne_twister_engine(const mersenne_twister_engine< T > &); + mersenne_twister_engine(const context &); + mersenne_twister_engine(const mersenne_twister_engine< T > &); mersenne_twister_engine< T > & - operator=(const mersenne_twister_engine< T > &); - ~mersenne_twister_engine(); + operator=(const mersenne_twister_engine< T > &); + ~mersenne_twister_engine(); - // public member functions - void seed(result_type = default_seed); + // public member functions + void seed(result_type = default_seed); template<typename OutputIterator> - void fill(OutputIterator, OutputIterator, command_queue &); + void fill(OutputIterator, OutputIterator, command_queue &); - // private member functions - void generate_state(command_queue &); - void load_program(); + // private member functions + void generate_state(command_queue &); + void load_program(); // public data members static const T default_seed; @@ -50,35 +50,35 @@ static const T m; };
-

Description

+

Description

-

+

mersenne_twister_engine public construct/copy/destruct

    -
  1. mersenne_twister_engine(const context & context);
    2. -
  2. mersenne_twister_engine(const mersenne_twister_engine< T > & other);
    3. +
  3. mersenne_twister_engine(const context & context);
    4. +
  4. mersenne_twister_engine(const mersenne_twister_engine< T > & other);
  5. mersenne_twister_engine< T > & 
-operator=(const mersenne_twister_engine< T > & other);
    6. -
  6. ~mersenne_twister_engine();
    7. +operator=(const mersenne_twister_engine< T > & other); +
  7. ~mersenne_twister_engine();
-

-mersenne_twister_engine public member functions

+

+mersenne_twister_engine public member functions

    -
  1. void seed(result_type value = default_seed);
    2. +
  2. void seed(result_type value = default_seed);
  3. template<typename OutputIterator> 
-  void fill(OutputIterator first, OutputIterator last, command_queue & queue);
    4. + void fill(OutputIterator first, OutputIterator last, command_queue & queue);
-

-mersenne_twister_engine private member functions

+

+mersenne_twister_engine private member functions

    -
  1. void generate_state(command_queue & queue);
    2. -
  2. void load_program();
    3. +
  3. void generate_state(command_queue & queue);
    4. +
  4. void load_program();
diff --git a/boost/compute/min_element.html b/boost/compute/min_element.html index 61290a4c..3f75168f 100644 --- a/boost/compute/min_element.html +++ b/boost/compute/min_element.html @@ -6,12 +6,12 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -28,7 +28,7 @@ min_element(InputIterator first, InputIterator last, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns an iterator pointing to the element in range [first, last) with the minumum value.

See Also:

max_element()

@@ -46,7 +46,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/minmax_element.html b/boost/compute/minmax_element.html index ca69c638..e8f75c3a 100644 --- a/boost/compute/minmax_element.html +++ b/boost/compute/minmax_element.html @@ -28,7 +28,7 @@ minmax_element(InputIterator first, InputIterator last, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns a pair of iterators with the first pointing to the minimum element and the second pointing to the maximum element in the range [first, last).

See Also:

max_element(), min_element()

diff --git a/boost/compute/mismatch.html b/boost/compute/mismatch.html index 891b1654..c67d9c04 100644 --- a/boost/compute/mismatch.html +++ b/boost/compute/mismatch.html @@ -28,7 +28,7 @@ mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns a pair of iterators pointing to the first position where the range [first1, last1) and the range starting at first2 differ.

diff --git a/boost/compute/none_of.html b/boost/compute/none_of.html index 77734455..91a0c877 100644 --- a/boost/compute/none_of.html +++ b/boost/compute/none_of.html @@ -7,11 +7,11 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -28,7 +28,7 @@ UnaryPredicate predicate, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns true if predicate returns true for none of the elements in the range [first, last).

See Also:

all_of(), any_of()

@@ -46,7 +46,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/nth_element_idp19380208.html b/boost/compute/nth_element_idp19380208.html new file mode 100644 index 00000000..acb70d72 --- /dev/null +++ b/boost/compute/nth_element_idp19380208.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp19387056.html b/boost/compute/nth_element_idp19387056.html new file mode 100644 index 00000000..95e1ca31 --- /dev/null +++ b/boost/compute/nth_element_idp19387056.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp19419632.html b/boost/compute/nth_element_idp19419632.html new file mode 100644 index 00000000..8f727e79 --- /dev/null +++ b/boost/compute/nth_element_idp19419632.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp19426480.html b/boost/compute/nth_element_idp19426480.html new file mode 100644 index 00000000..539a8afc --- /dev/null +++ b/boost/compute/nth_element_idp19426480.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp19828848.html b/boost/compute/nth_element_idp19828848.html new file mode 100644 index 00000000..4840798c --- /dev/null +++ b/boost/compute/nth_element_idp19828848.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp19835696.html b/boost/compute/nth_element_idp19835696.html new file mode 100644 index 00000000..59fa3ee4 --- /dev/null +++ b/boost/compute/nth_element_idp19835696.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp20244384.html b/boost/compute/nth_element_idp20244384.html new file mode 100644 index 00000000..f54c6e8b --- /dev/null +++ b/boost/compute/nth_element_idp20244384.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp20251232.html b/boost/compute/nth_element_idp20251232.html new file mode 100644 index 00000000..a59e9a7d --- /dev/null +++ b/boost/compute/nth_element_idp20251232.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp23020288.html b/boost/compute/nth_element_idp23020288.html new file mode 100644 index 00000000..17c826ce --- /dev/null +++ b/boost/compute/nth_element_idp23020288.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp23027136.html b/boost/compute/nth_element_idp23027136.html new file mode 100644 index 00000000..1df7bef5 --- /dev/null +++ b/boost/compute/nth_element_idp23027136.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp24226880.html b/boost/compute/nth_element_idp24226880.html new file mode 100644 index 00000000..a1ac648c --- /dev/null +++ b/boost/compute/nth_element_idp24226880.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp24233728.html b/boost/compute/nth_element_idp24233728.html new file mode 100644 index 00000000..65be6846 --- /dev/null +++ b/boost/compute/nth_element_idp24233728.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp24466080.html b/boost/compute/nth_element_idp24466080.html new file mode 100644 index 00000000..8ce8e665 --- /dev/null +++ b/boost/compute/nth_element_idp24466080.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp24472928.html b/boost/compute/nth_element_idp24472928.html new file mode 100644 index 00000000..5d95fe5a --- /dev/null +++ b/boost/compute/nth_element_idp24472928.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp24666592.html b/boost/compute/nth_element_idp24666592.html new file mode 100644 index 00000000..e57b962d --- /dev/null +++ b/boost/compute/nth_element_idp24666592.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp24673440.html b/boost/compute/nth_element_idp24673440.html new file mode 100644 index 00000000..0667a6b5 --- /dev/null +++ b/boost/compute/nth_element_idp24673440.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp25799392.html b/boost/compute/nth_element_idp25799392.html new file mode 100644 index 00000000..5828e446 --- /dev/null +++ b/boost/compute/nth_element_idp25799392.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp25806240.html b/boost/compute/nth_element_idp25806240.html new file mode 100644 index 00000000..5a176313 --- /dev/null +++ b/boost/compute/nth_element_idp25806240.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp27564272.html b/boost/compute/nth_element_idp27564272.html new file mode 100644 index 00000000..64a0f64c --- /dev/null +++ b/boost/compute/nth_element_idp27564272.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp27571120.html b/boost/compute/nth_element_idp27571120.html new file mode 100644 index 00000000..80eb63a1 --- /dev/null +++ b/boost/compute/nth_element_idp27571120.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp28947760.html b/boost/compute/nth_element_idp28947760.html new file mode 100644 index 00000000..c6818d8f --- /dev/null +++ b/boost/compute/nth_element_idp28947760.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp28954608.html b/boost/compute/nth_element_idp28954608.html new file mode 100644 index 00000000..34d36fee --- /dev/null +++ b/boost/compute/nth_element_idp28954608.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp30101968.html b/boost/compute/nth_element_idp30101968.html new file mode 100644 index 00000000..8c0f073b --- /dev/null +++ b/boost/compute/nth_element_idp30101968.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp30108816.html b/boost/compute/nth_element_idp30108816.html new file mode 100644 index 00000000..ed4513eb --- /dev/null +++ b/boost/compute/nth_element_idp30108816.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp31321088.html b/boost/compute/nth_element_idp31321088.html new file mode 100644 index 00000000..2e310349 --- /dev/null +++ b/boost/compute/nth_element_idp31321088.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp31327936.html b/boost/compute/nth_element_idp31327936.html new file mode 100644 index 00000000..38c2598f --- /dev/null +++ b/boost/compute/nth_element_idp31327936.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp35481104.html b/boost/compute/nth_element_idp35481104.html new file mode 100644 index 00000000..0ab87030 --- /dev/null +++ b/boost/compute/nth_element_idp35481104.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp35487952.html b/boost/compute/nth_element_idp35487952.html new file mode 100644 index 00000000..be844857 --- /dev/null +++ b/boost/compute/nth_element_idp35487952.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp38468928.html b/boost/compute/nth_element_idp38468928.html new file mode 100644 index 00000000..8a12cdcf --- /dev/null +++ b/boost/compute/nth_element_idp38468928.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp38475776.html b/boost/compute/nth_element_idp38475776.html new file mode 100644 index 00000000..9a1d0414 --- /dev/null +++ b/boost/compute/nth_element_idp38475776.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp39745888.html b/boost/compute/nth_element_idp39745888.html new file mode 100644 index 00000000..7c2239df --- /dev/null +++ b/boost/compute/nth_element_idp39745888.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp39752736.html b/boost/compute/nth_element_idp39752736.html new file mode 100644 index 00000000..c120a93e --- /dev/null +++ b/boost/compute/nth_element_idp39752736.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp43766960.html b/boost/compute/nth_element_idp43766960.html new file mode 100644 index 00000000..32625ffd --- /dev/null +++ b/boost/compute/nth_element_idp43766960.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp43773808.html b/boost/compute/nth_element_idp43773808.html new file mode 100644 index 00000000..f1962092 --- /dev/null +++ b/boost/compute/nth_element_idp43773808.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp44710784.html b/boost/compute/nth_element_idp44710784.html new file mode 100644 index 00000000..08715bbf --- /dev/null +++ b/boost/compute/nth_element_idp44710784.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp44717632.html b/boost/compute/nth_element_idp44717632.html new file mode 100644 index 00000000..dd492159 --- /dev/null +++ b/boost/compute/nth_element_idp44717632.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp46328976.html b/boost/compute/nth_element_idp46328976.html new file mode 100644 index 00000000..3924da0d --- /dev/null +++ b/boost/compute/nth_element_idp46328976.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp46335824.html b/boost/compute/nth_element_idp46335824.html new file mode 100644 index 00000000..f238b030 --- /dev/null +++ b/boost/compute/nth_element_idp46335824.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp49388320.html b/boost/compute/nth_element_idp49388320.html new file mode 100644 index 00000000..a325f13e --- /dev/null +++ b/boost/compute/nth_element_idp49388320.html @@ -0,0 +1,47 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/nth_element_idp49395168.html b/boost/compute/nth_element_idp49395168.html new file mode 100644 index 00000000..858940cc --- /dev/null +++ b/boost/compute/nth_element_idp49395168.html @@ -0,0 +1,48 @@ + + + +Function template nth_element + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template nth_element

+

boost::compute::nth_element

+
+

Synopsis

+
// In header: <boost/compute/algorithm/nth_element.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void nth_element(Iterator first, Iterator nth, Iterator last, 
+                   Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Rearranges the elements in the range [first, last) such that the nth element would be in that position in a sorted sequence. Uses compare to compare the elements.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_buffer.html b/boost/compute/opengl_buffer.html new file mode 100644 index 00000000..c9c55670 --- /dev/null +++ b/boost/compute/opengl_buffer.html @@ -0,0 +1,98 @@ + + + +Class opengl_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class opengl_buffer

+

boost::compute::opengl_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/opengl_buffer.hpp>
+
+
+class opengl_buffer : public boost::compute::buffer {
+public:
+  // construct/copy/destruct
+  opengl_buffer();
+  explicit opengl_buffer(cl_mem, bool = true);
+  opengl_buffer(const context &, GLuint, cl_mem_flags = read_write);
+  opengl_buffer(const opengl_buffer &);
+  opengl_buffer & operator=(const opengl_buffer &);
+  ~opengl_buffer();
+
+  // public member functions
+  GLuint get_opengl_object() const;
+  cl_gl_object_type get_opengl_type() const;
+};
+
+

Description

+

A OpenCL buffer for accessing an OpenGL memory object.

+
+

+opengl_buffer + public + construct/copy/destruct

+
    +
  1. +
    opengl_buffer();
    Creates a null OpenGL buffer object.
    2. +
  2. +
    explicit opengl_buffer(cl_mem mem, bool retain = true);
    Creates a new OpenGL buffer object for mem.
    3. +
  3. +
    opengl_buffer(const context & context, GLuint bufobj, 
+              cl_mem_flags flags = read_write);
    +

    Creates a new OpenGL buffer object in context for bufobj with flags.

    +

    See the documentation for clCreateFromGLBuffer() for more information.

    +
    4. +
  4. +
    opengl_buffer(const opengl_buffer & other);
    Creates a new OpenGL buffer object as a copy of other.
    5. +
  5. +
    opengl_buffer & operator=(const opengl_buffer & other);
    Copies the OpenGL buffer object from other.
    6. +
  6. +
    ~opengl_buffer();
    Destroys the OpenGL buffer object.
    7. +
+
+
+

+opengl_buffer public member functions

+
    +
  1. +
    GLuint get_opengl_object() const;
    +

    Returns the OpenGL memory object ID.

    +

    See the documentation for clGetGLObjectInfo() for more information.

    +
    2. +
  2. +
    cl_gl_object_type get_opengl_type() const;
    +

    Returns the OpenGL memory object type.

    +

    See the documentation for clGetGLObjectInfo() for more information.

    +
    3. +
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_create__idp21517904.html b/boost/compute/opengl_create__idp21517904.html new file mode 100644 index 00000000..bde3d3a6 --- /dev/null +++ b/boost/compute/opengl_create__idp21517904.html @@ -0,0 +1,46 @@ + + + +Function opengl_create_shared_context + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_create_shared_context

+

boost::compute::opengl_create_shared_context

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/context.hpp>
+
+
+context opengl_create_shared_context();
+
+

Description

+

Creates an OpenCL/OpenGL sharing context for the currently active OpenGL context.

+

Throws an extension_unsupported_exception if no CL-GL sharing capable devices are found.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_create__idp24295024.html b/boost/compute/opengl_create__idp24295024.html new file mode 100644 index 00000000..5a11593e --- /dev/null +++ b/boost/compute/opengl_create__idp24295024.html @@ -0,0 +1,46 @@ + + + +Function opengl_create_shared_context + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_create_shared_context

+

boost::compute::opengl_create_shared_context

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/context.hpp>
+
+
+context opengl_create_shared_context();
+
+

Description

+

Creates a OpenCL/OpenGL sharing context for the currently active OpenGL context.

+

Throws a extension_unsupported_exception if no CL-GL sharing capable devices are found.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_create__idp25739600.html b/boost/compute/opengl_create__idp25739600.html new file mode 100644 index 00000000..cd4b0e54 --- /dev/null +++ b/boost/compute/opengl_create__idp25739600.html @@ -0,0 +1,46 @@ + + + +Function opengl_create_shared_context + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_create_shared_context

+

boost::compute::opengl_create_shared_context

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/context.hpp>
+
+
+context opengl_create_shared_context();
+
+

Description

+

Creates an OpenCL/OpenGL sharing context for the currently active OpenGL context.

+

Throws an extension_unsupported_exception if no CL-GL sharing capable devices are found.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_create__idp27074128.html b/boost/compute/opengl_create__idp27074128.html new file mode 100644 index 00000000..1ef8c049 --- /dev/null +++ b/boost/compute/opengl_create__idp27074128.html @@ -0,0 +1,46 @@ + + + +Function opengl_create_shared_context + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_create_shared_context

+

boost::compute::opengl_create_shared_context

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/context.hpp>
+
+
+context opengl_create_shared_context();
+
+

Description

+

Creates a OpenCL/OpenGL sharing context for the currently active OpenGL context.

+

Throws a extension_unsupported_exception if no CL-GL sharing capable devices are found.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_create__idp31389344.html b/boost/compute/opengl_create__idp31389344.html new file mode 100644 index 00000000..77638509 --- /dev/null +++ b/boost/compute/opengl_create__idp31389344.html @@ -0,0 +1,46 @@ + + + +Function opengl_create_shared_context + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_create_shared_context

+

boost::compute::opengl_create_shared_context

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/context.hpp>
+
+
+context opengl_create_shared_context();
+
+

Description

+

Creates an OpenCL/OpenGL sharing context for the currently active OpenGL context.

+

Throws an extension_unsupported_exception if no CL-GL sharing capable devices are found.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_create__idp39756304.html b/boost/compute/opengl_create__idp39756304.html new file mode 100644 index 00000000..6f5d102d --- /dev/null +++ b/boost/compute/opengl_create__idp39756304.html @@ -0,0 +1,46 @@ + + + +Function opengl_create_shared_context + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_create_shared_context

+

boost::compute::opengl_create_shared_context

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/context.hpp>
+
+
+context opengl_create_shared_context();
+
+

Description

+

Creates an OpenCL/OpenGL sharing context for the currently active OpenGL context.

+

Throws an extension_unsupported_exception if no CL-GL sharing capable devices are found.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_create__idp45054336.html b/boost/compute/opengl_create__idp45054336.html new file mode 100644 index 00000000..ed2985ce --- /dev/null +++ b/boost/compute/opengl_create__idp45054336.html @@ -0,0 +1,46 @@ + + + +Function opengl_create_shared_context + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_create_shared_context

+

boost::compute::opengl_create_shared_context

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/context.hpp>
+
+
+context opengl_create_shared_context();
+
+

Description

+

Creates an OpenCL/OpenGL sharing context for the currently active OpenGL context.

+

Throws an extension_unsupported_exception if no CL-GL sharing capable devices are found.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_create__idp45984304.html b/boost/compute/opengl_create__idp45984304.html new file mode 100644 index 00000000..15e963c7 --- /dev/null +++ b/boost/compute/opengl_create__idp45984304.html @@ -0,0 +1,46 @@ + + + +Function opengl_create_shared_context + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_create_shared_context

+

boost::compute::opengl_create_shared_context

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/context.hpp>
+
+
+context opengl_create_shared_context();
+
+

Description

+

Creates an OpenCL/OpenGL sharing context for the currently active OpenGL context.

+

Throws an extension_unsupported_exception if no CL-GL sharing capable devices are found.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_create__idp47602496.html b/boost/compute/opengl_create__idp47602496.html new file mode 100644 index 00000000..60f75f5a --- /dev/null +++ b/boost/compute/opengl_create__idp47602496.html @@ -0,0 +1,46 @@ + + + +Function opengl_create_shared_context + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_create_shared_context

+

boost::compute::opengl_create_shared_context

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/context.hpp>
+
+
+context opengl_create_shared_context();
+
+

Description

+

Creates an OpenCL/OpenGL sharing context for the currently active OpenGL context.

+

Throws an extension_unsupported_exception if no CL-GL sharing capable devices are found.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_create__idp50675696.html b/boost/compute/opengl_create__idp50675696.html new file mode 100644 index 00000000..3f48e385 --- /dev/null +++ b/boost/compute/opengl_create__idp50675696.html @@ -0,0 +1,46 @@ + + + +Function opengl_create_shared_context + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_create_shared_context

+

boost::compute::opengl_create_shared_context

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/context.hpp>
+
+
+context opengl_create_shared_context();
+
+

Description

+

Creates a OpenCL/OpenGL sharing context for the currently active OpenGL context.

+

Throws a extension_unsupported_exception if no CL-GL sharing capable devices are found.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp21705296.html b/boost/compute/opengl_enqueue_idp21705296.html new file mode 100644 index 00000000..d7ae2ba3 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp21705296.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_acquire_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_gl_objects

+

boost::compute::opengl_enqueue_acquire_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL memory objects.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp21710096.html b/boost/compute/opengl_enqueue_idp21710096.html new file mode 100644 index 00000000..cf444964 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp21710096.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_release_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_gl_objects

+

boost::compute::opengl_enqueue_release_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL memory objects.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp21714896.html b/boost/compute/opengl_enqueue_idp21714896.html new file mode 100644 index 00000000..38473c3c --- /dev/null +++ b/boost/compute/opengl_enqueue_idp21714896.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_acquire_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_buffer

+

boost::compute::opengl_enqueue_acquire_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL buffer.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp21719456.html b/boost/compute/opengl_enqueue_idp21719456.html new file mode 100644 index 00000000..65f0525b --- /dev/null +++ b/boost/compute/opengl_enqueue_idp21719456.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_release_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_buffer

+

boost::compute::opengl_enqueue_release_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL buffer.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp24482416.html b/boost/compute/opengl_enqueue_idp24482416.html new file mode 100644 index 00000000..53b863df --- /dev/null +++ b/boost/compute/opengl_enqueue_idp24482416.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_acquire_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_gl_objects

+

boost::compute::opengl_enqueue_acquire_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL memory objects.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp24487216.html b/boost/compute/opengl_enqueue_idp24487216.html new file mode 100644 index 00000000..bf55a5f1 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp24487216.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_release_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_gl_objects

+

boost::compute::opengl_enqueue_release_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL memory objects.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp25926992.html b/boost/compute/opengl_enqueue_idp25926992.html new file mode 100644 index 00000000..bc477b50 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp25926992.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_acquire_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_gl_objects

+

boost::compute::opengl_enqueue_acquire_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL memory objects.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp25931792.html b/boost/compute/opengl_enqueue_idp25931792.html new file mode 100644 index 00000000..5cc7727f --- /dev/null +++ b/boost/compute/opengl_enqueue_idp25931792.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_release_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_gl_objects

+

boost::compute::opengl_enqueue_release_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL memory objects.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp25936592.html b/boost/compute/opengl_enqueue_idp25936592.html new file mode 100644 index 00000000..85ae28ce --- /dev/null +++ b/boost/compute/opengl_enqueue_idp25936592.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_acquire_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_buffer

+

boost::compute::opengl_enqueue_acquire_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL buffer.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp25941152.html b/boost/compute/opengl_enqueue_idp25941152.html new file mode 100644 index 00000000..5f60054d --- /dev/null +++ b/boost/compute/opengl_enqueue_idp25941152.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_release_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_buffer

+

boost::compute::opengl_enqueue_release_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL buffer.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp27261184.html b/boost/compute/opengl_enqueue_idp27261184.html new file mode 100644 index 00000000..22657c39 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp27261184.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_acquire_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_gl_objects

+

boost::compute::opengl_enqueue_acquire_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL memory objects.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp27265984.html b/boost/compute/opengl_enqueue_idp27265984.html new file mode 100644 index 00000000..ba59a0ed --- /dev/null +++ b/boost/compute/opengl_enqueue_idp27265984.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_release_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_gl_objects

+

boost::compute::opengl_enqueue_release_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL memory objects.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp31576736.html b/boost/compute/opengl_enqueue_idp31576736.html new file mode 100644 index 00000000..92af3ee8 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp31576736.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_acquire_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_gl_objects

+

boost::compute::opengl_enqueue_acquire_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL memory objects.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp31581536.html b/boost/compute/opengl_enqueue_idp31581536.html new file mode 100644 index 00000000..b70d667a --- /dev/null +++ b/boost/compute/opengl_enqueue_idp31581536.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_release_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_gl_objects

+

boost::compute::opengl_enqueue_release_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL memory objects.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp31586336.html b/boost/compute/opengl_enqueue_idp31586336.html new file mode 100644 index 00000000..5a58e77e --- /dev/null +++ b/boost/compute/opengl_enqueue_idp31586336.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_acquire_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_buffer

+

boost::compute::opengl_enqueue_acquire_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL buffer.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp31590896.html b/boost/compute/opengl_enqueue_idp31590896.html new file mode 100644 index 00000000..0853568b --- /dev/null +++ b/boost/compute/opengl_enqueue_idp31590896.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_release_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_buffer

+

boost::compute::opengl_enqueue_release_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL buffer.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp39943696.html b/boost/compute/opengl_enqueue_idp39943696.html new file mode 100644 index 00000000..2acb6611 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp39943696.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_acquire_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_gl_objects

+

boost::compute::opengl_enqueue_acquire_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL memory objects.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp39948496.html b/boost/compute/opengl_enqueue_idp39948496.html new file mode 100644 index 00000000..71388267 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp39948496.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_release_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_gl_objects

+

boost::compute::opengl_enqueue_release_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL memory objects.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp39953296.html b/boost/compute/opengl_enqueue_idp39953296.html new file mode 100644 index 00000000..30eecaca --- /dev/null +++ b/boost/compute/opengl_enqueue_idp39953296.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_acquire_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_buffer

+

boost::compute::opengl_enqueue_acquire_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL buffer.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp39957856.html b/boost/compute/opengl_enqueue_idp39957856.html new file mode 100644 index 00000000..63ef353b --- /dev/null +++ b/boost/compute/opengl_enqueue_idp39957856.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_release_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_buffer

+

boost::compute::opengl_enqueue_release_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL buffer.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp45241728.html b/boost/compute/opengl_enqueue_idp45241728.html new file mode 100644 index 00000000..08a29c27 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp45241728.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_acquire_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_gl_objects

+

boost::compute::opengl_enqueue_acquire_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL memory objects.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp45246528.html b/boost/compute/opengl_enqueue_idp45246528.html new file mode 100644 index 00000000..e03722ea --- /dev/null +++ b/boost/compute/opengl_enqueue_idp45246528.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_release_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_gl_objects

+

boost::compute::opengl_enqueue_release_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL memory objects.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp45251328.html b/boost/compute/opengl_enqueue_idp45251328.html new file mode 100644 index 00000000..c0659268 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp45251328.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_acquire_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_buffer

+

boost::compute::opengl_enqueue_acquire_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL buffer.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp45255888.html b/boost/compute/opengl_enqueue_idp45255888.html new file mode 100644 index 00000000..cda10618 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp45255888.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_release_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_buffer

+

boost::compute::opengl_enqueue_release_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL buffer.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp46171696.html b/boost/compute/opengl_enqueue_idp46171696.html new file mode 100644 index 00000000..2a8d5810 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp46171696.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_acquire_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_gl_objects

+

boost::compute::opengl_enqueue_acquire_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL memory objects.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp46176496.html b/boost/compute/opengl_enqueue_idp46176496.html new file mode 100644 index 00000000..8b3bba72 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp46176496.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_release_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_gl_objects

+

boost::compute::opengl_enqueue_release_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL memory objects.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp46181296.html b/boost/compute/opengl_enqueue_idp46181296.html new file mode 100644 index 00000000..322b91ba --- /dev/null +++ b/boost/compute/opengl_enqueue_idp46181296.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_acquire_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_buffer

+

boost::compute::opengl_enqueue_acquire_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL buffer.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp46185856.html b/boost/compute/opengl_enqueue_idp46185856.html new file mode 100644 index 00000000..ea5976c1 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp46185856.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_release_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_buffer

+

boost::compute::opengl_enqueue_release_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL buffer.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp47789888.html b/boost/compute/opengl_enqueue_idp47789888.html new file mode 100644 index 00000000..52509115 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp47789888.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_acquire_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_gl_objects

+

boost::compute::opengl_enqueue_acquire_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL memory objects.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp47794688.html b/boost/compute/opengl_enqueue_idp47794688.html new file mode 100644 index 00000000..f212b56d --- /dev/null +++ b/boost/compute/opengl_enqueue_idp47794688.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_release_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_gl_objects

+

boost::compute::opengl_enqueue_release_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL memory objects.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp47799488.html b/boost/compute/opengl_enqueue_idp47799488.html new file mode 100644 index 00000000..23ff2366 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp47799488.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_acquire_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_buffer

+

boost::compute::opengl_enqueue_acquire_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL buffer.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp47804048.html b/boost/compute/opengl_enqueue_idp47804048.html new file mode 100644 index 00000000..0e7d84ae --- /dev/null +++ b/boost/compute/opengl_enqueue_idp47804048.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_release_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_buffer

+

boost::compute::opengl_enqueue_release_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL buffer.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp50863088.html b/boost/compute/opengl_enqueue_idp50863088.html new file mode 100644 index 00000000..fc9551f2 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp50863088.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_acquire_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_gl_objects

+

boost::compute::opengl_enqueue_acquire_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL memory objects.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp50867888.html b/boost/compute/opengl_enqueue_idp50867888.html new file mode 100644 index 00000000..e1d682d6 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp50867888.html @@ -0,0 +1,48 @@ + + + +Function opengl_enqueue_release_gl_objects + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_gl_objects

+

boost::compute::opengl_enqueue_release_gl_objects

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_gl_objects(size_t num_objects, 
+                                       const cl_mem * mem_objects, 
+                                       command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL memory objects.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp50872688.html b/boost/compute/opengl_enqueue_idp50872688.html new file mode 100644 index 00000000..8c3f4bfe --- /dev/null +++ b/boost/compute/opengl_enqueue_idp50872688.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_acquire_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_acquire_buffer

+

boost::compute::opengl_enqueue_acquire_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_acquire_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to acquire the specified OpenGL buffer.

+

See the documentation for clEnqueueAcquireGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_enqueue_idp50877248.html b/boost/compute/opengl_enqueue_idp50877248.html new file mode 100644 index 00000000..30b4d7c5 --- /dev/null +++ b/boost/compute/opengl_enqueue_idp50877248.html @@ -0,0 +1,47 @@ + + + +Function opengl_enqueue_release_buffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function opengl_enqueue_release_buffer

+

boost::compute::opengl_enqueue_release_buffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/acquire.hpp>
+
+
+void opengl_enqueue_release_buffer(const opengl_buffer & buffer, 
+                                   command_queue & queue);
+
+

Description

+

Enqueues a command to release the specified OpenGL buffer.

+

See the documentation for clEnqueueReleaseGLObjects() for more information.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_renderbuffer.html b/boost/compute/opengl_renderbuffer.html new file mode 100644 index 00000000..950147be --- /dev/null +++ b/boost/compute/opengl_renderbuffer.html @@ -0,0 +1,98 @@ + + + +Class opengl_renderbuffer + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class opengl_renderbuffer

+

boost::compute::opengl_renderbuffer

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/opengl_renderbuffer.hpp>
+
+
+class opengl_renderbuffer : public boost::compute::memory_object {
+public:
+  // construct/copy/destruct
+  opengl_renderbuffer();
+  explicit opengl_renderbuffer(cl_mem, bool = true);
+  opengl_renderbuffer(const context &, GLuint, cl_mem_flags = read_write);
+  opengl_renderbuffer(const opengl_renderbuffer &);
+  opengl_renderbuffer & operator=(const opengl_renderbuffer &);
+  ~opengl_renderbuffer();
+
+  // public member functions
+  GLuint get_opengl_object() const;
+  cl_gl_object_type get_opengl_type() const;
+};
+
+

Description

+

A OpenCL buffer for accessing an OpenGL renderbuffer object.

+
+

+opengl_renderbuffer + public + construct/copy/destruct

+
    +
  1. +
    opengl_renderbuffer();
    Creates a null OpenGL renderbuffer object.
    2. +
  2. +
    explicit opengl_renderbuffer(cl_mem mem, bool retain = true);
    Creates a new OpenGL renderbuffer object for mem.
    3. +
  3. +
    opengl_renderbuffer(const context & context, GLuint renderbuffer, 
+                    cl_mem_flags flags = read_write);
    +

    Creates a new OpenGL renderbuffer object in context for renderbuffer with flags.

    +

    See the documentation for clCreateFromGLRenderbuffer() for more information.

    +
    4. +
  4. +
    opengl_renderbuffer(const opengl_renderbuffer & other);
    Creates a new OpenGL renderbuffer object as a copy of other.
    5. +
  5. +
    opengl_renderbuffer & operator=(const opengl_renderbuffer & other);
    Copies the OpenGL renderbuffer object from other.
    6. +
  6. +
    ~opengl_renderbuffer();
    Destroys the OpenGL buffer object.
    7. +
+
+
+

+opengl_renderbuffer public member functions

+
    +
  1. +
    GLuint get_opengl_object() const;
    +

    Returns the OpenGL memory object ID.

    +

    See the documentation for clGetGLObjectInfo() for more information.

    +
    2. +
  2. +
    cl_gl_object_type get_opengl_type() const;
    +

    Returns the OpenGL memory object type.

    +

    See the documentation for clGetGLObjectInfo() for more information.

    +
    3. +
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/opengl_texture.html b/boost/compute/opengl_texture.html new file mode 100644 index 00000000..1a13d178 --- /dev/null +++ b/boost/compute/opengl_texture.html @@ -0,0 +1,91 @@ + + + +Class opengl_texture + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Class opengl_texture

+

boost::compute::opengl_texture

+
+

Synopsis

+
// In header: <boost/compute/interop/opengl/opengl_texture.hpp>
+
+
+class opengl_texture : public boost::compute::memory_object {
+public:
+  // construct/copy/destruct
+  opengl_texture();
+  explicit opengl_texture(cl_mem, bool = true);
+  opengl_texture(const context &, GLenum, GLint, GLuint, 
+                 cl_mem_flags = read_write);
+  opengl_texture(const opengl_texture &);
+  opengl_texture & operator=(const opengl_texture &);
+  ~opengl_texture();
+
+  // public member functions
+  template<typename T> T get_texture_info(cl_gl_texture_info) const;
+};
+
+

Description

+

A OpenCL image2d for accessing an OpenGL texture object.

+
+

+opengl_texture + public + construct/copy/destruct

+
    +
  1. +
    opengl_texture();
    Creates a null OpenGL texture object.
    2. +
  2. +
    explicit opengl_texture(cl_mem mem, bool retain = true);
    Creates a new OpenGL texture object for mem.
    3. +
  3. +
    opengl_texture(const context & context, GLenum texture_target, GLint miplevel, 
+               GLuint texture, cl_mem_flags flags = read_write);
    +

    Creates a new OpenGL texture object in context for texture with flags.

    +

    See the documentation for clCreateFromGLTexture() for more information.

    +
    4. +
  4. +
    opengl_texture(const opengl_texture & other);
    Creates a new OpenGL texture object as a copy of other.
    5. +
  5. +
    opengl_texture & operator=(const opengl_texture & other);
    Copies the OpenGL texture object from other.
    6. +
  6. +
    ~opengl_texture();
    Destroys the texture object.
    7. +
+
+
+

+opengl_texture public member functions

+
  1. +
    template<typename T> T get_texture_info(cl_gl_texture_info info) const;
    +

    Returns information about the texture.

    +

    See the documentation for clGetGLTextureInfo() for more information.

    +
+
+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/partial_sum.html b/boost/compute/partial_sum.html index c305a6de..dcb94c20 100644 --- a/boost/compute/partial_sum.html +++ b/boost/compute/partial_sum.html @@ -6,12 +6,12 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -28,7 +28,7 @@ partial_sum(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue = system::default_queue());
-

Description

+

Description

Calculates the cumulative sum of the elements in the range [first, last) and writes the resulting values to the range beginning at result.

@@ -42,7 +42,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/partition.html b/boost/compute/partition.html index c02783a3..75501dbc 100644 --- a/boost/compute/partition.html +++ b/boost/compute/partition.html @@ -27,7 +27,7 @@ Iterator partition(Iterator first, Iterator last, UnaryPredicate predicate, command_queue & queue = system::default_queue());
-

Description

+

Description

Partitions the elements in the range [first, last) according to predicate.

See Also:

is_partitioned()

diff --git a/boost/compute/partition_copy.html b/boost/compute/partition_copy.html index 292bcf2f..dcce8f15 100644 --- a/boost/compute/partition_copy.html +++ b/boost/compute/partition_copy.html @@ -7,11 +7,11 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -31,7 +31,7 @@ UnaryPredicate predicate, command_queue & queue = system::default_queue());
-

Description

+

Description

Copies all of the elements in the range [first, last) for which predicate returns true to the range beginning at first_true and all of the elements for which predicate returns false to the range beginning at first_false.

See Also:

partition()

@@ -49,7 +49,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/permutation_iterator.html b/boost/compute/permutation_iterator.html index 19f48ffa..09ad7f2b 100644 --- a/boost/compute/permutation_iterator.html +++ b/boost/compute/permutation_iterator.html @@ -34,49 +34,49 @@ typedef IndexIterator index_iterator; // construct/copy/destruct - permutation_iterator(ElementIterator, IndexIterator); - permutation_iterator(const permutation_iterator< ElementIterator, IndexIterator > &); + permutation_iterator(ElementIterator, IndexIterator); + permutation_iterator(const permutation_iterator< ElementIterator, IndexIterator > &); permutation_iterator< ElementIterator, IndexIterator > & - operator=(const permutation_iterator< ElementIterator, IndexIterator > &); - ~permutation_iterator(); + operator=(const permutation_iterator< ElementIterator, IndexIterator > &); + ~permutation_iterator(); - // public member functions - size_t get_index() const; - const buffer & get_buffer() const; - template<typename IndexExpr> unspecified operator[](const IndexExpr &) const; + // public member functions + size_t get_index() const; + const buffer & get_buffer() const; + template<typename IndexExpr> unspecified operator[](const IndexExpr &) const; - // private member functions - reference dereference() const; + // private member functions + reference dereference() const; };
-

Description

+

Description

-

+

permutation_iterator public construct/copy/destruct

    -
  1. permutation_iterator(ElementIterator e, IndexIterator i);
    2. -
  2. permutation_iterator(const permutation_iterator< ElementIterator, IndexIterator > & other);
    3. +
  3. permutation_iterator(ElementIterator e, IndexIterator i);
    4. +
  4. permutation_iterator(const permutation_iterator< ElementIterator, IndexIterator > & other);
  5. permutation_iterator< ElementIterator, IndexIterator > & 
-operator=(const permutation_iterator< ElementIterator, IndexIterator > & other);
    6. -
  6. ~permutation_iterator();
    7. +operator=(const permutation_iterator< ElementIterator, IndexIterator > & other); +
  7. ~permutation_iterator();
-

-permutation_iterator public member functions

+

+permutation_iterator public member functions

    -
  1. size_t get_index() const;
    2. -
  2. const buffer & get_buffer() const;
    3. +
  3. size_t get_index() const;
    4. +
  4. const buffer & get_buffer() const;
  5. template<typename IndexExpr> 
-  unspecified operator[](const IndexExpr & expr) const;
    6. + unspecified operator[](const IndexExpr & expr) const;
-

-permutation_iterator private member functions

-
  1. reference dereference() const;
+

+permutation_iterator private member functions

+
  1. reference dereference() const;
diff --git a/boost/compute/pinned_allocator.html b/boost/compute/pinned_allocator.html index 0cfd8151..c571f036 100644 --- a/boost/compute/pinned_allocator.html +++ b/boost/compute/pinned_allocator.html @@ -26,23 +26,23 @@ class pinned_allocator : public boost::compute::allocator< T > { public: // construct/copy/destruct - pinned_allocator(const context &); - pinned_allocator(const pinned_allocator< T > &); - pinned_allocator< T > & operator=(const pinned_allocator< T > &); - ~pinned_allocator(); + pinned_allocator(const context &); + pinned_allocator(const pinned_allocator< T > &); + pinned_allocator< T > & operator=(const pinned_allocator< T > &); + ~pinned_allocator(); };
-

Description

+

Description

-

+

pinned_allocator public construct/copy/destruct

    -
  1. pinned_allocator(const context & context);
    2. -
  2. pinned_allocator(const pinned_allocator< T > & other);
    3. -
  3. pinned_allocator< T > & operator=(const pinned_allocator< T > & other);
    4. -
  4. ~pinned_allocator();
    5. +
  5. pinned_allocator(const context & context);
    6. +
  6. pinned_allocator(const pinned_allocator< T > & other);
    7. +
  7. pinned_allocator< T > & operator=(const pinned_allocator< T > & other);
    8. +
  8. ~pinned_allocator();
diff --git a/boost/compute/platform.html b/boost/compute/platform.html index a9690f77..89d21559 100644 --- a/boost/compute/platform.html +++ b/boost/compute/platform.html @@ -26,27 +26,27 @@ class platform { public: // construct/copy/destruct - explicit platform(cl_platform_id); - platform(const platform &); - platform & operator=(const platform &); - ~platform(); + explicit platform(cl_platform_id); + platform(const platform &); + platform & operator=(const platform &); + ~platform(); - // public member functions - cl_platform_id id() const; - std::string name() const; - std::string vendor() const; - std::string profile() const; - std::string version() const; - std::vector< std::string > extensions() const; - bool supports_extension(const std::string &) const; - std::vector< device > devices(cl_device_type = CL_DEVICE_TYPE_ALL) const; - size_t device_count(cl_device_type = CL_DEVICE_TYPE_ALL) const; - template<typename T> T get_info(cl_platform_info) const; - void * get_extension_function_address(const char *) const; - void unload_compiler(); + // public member functions + cl_platform_id id() const; + std::string name() const; + std::string vendor() const; + std::string profile() const; + std::string version() const; + std::vector< std::string > extensions() const; + bool supports_extension(const std::string &) const; + std::vector< device > devices(cl_device_type = CL_DEVICE_TYPE_ALL) const; + size_t device_count(cl_device_type = CL_DEVICE_TYPE_ALL) const; + template<typename T> T get_info(cl_platform_info) const; + void * get_extension_function_address(const char *) const; + void unload_compiler(); };
-

Description

+

Description

The platform class provides an interface to an OpenCL platform.

To obtain a list of all platforms on the system use the system::platforms() method.

See Also:

@@ -54,56 +54,56 @@

-

+

platform public construct/copy/destruct

  1. -
    explicit platform(cl_platform_id id);
    Creates a new platform object for id.
    2. +
    explicit platform(cl_platform_id id);
    Creates a new platform object for id.
  2. -
    platform(const platform & other);
    Creates a new platform as a copy of other.
    3. +
    platform(const platform & other);
    Creates a new platform as a copy of other.
  3. -
    platform & operator=(const platform & other);
    Copies the platform id from other.
    4. +
    platform & operator=(const platform & other);
    Copies the platform id from other.
  4. -
    ~platform();
    Destroys the platform object.
    5. +
    ~platform();
    Destroys the platform object.
-

-platform public member functions

+

+platform public member functions

  1. -
    cl_platform_id id() const;
    Returns the ID of the platform.
    2. +
    cl_platform_id id() const;
    Returns the ID of the platform.
  2. -
    std::string name() const;
    Returns the name of the platform.
    3. +
    std::string name() const;
    Returns the name of the platform.
  3. -
    std::string vendor() const;
    Returns the name of the vendor for the platform.
    4. +
    std::string vendor() const;
    Returns the name of the vendor for the platform.
  4. -
    std::string profile() const;
    Returns the profile string for the platform.
    5. +
    std::string profile() const;
    Returns the profile string for the platform.
  5. -
    std::string version() const;
    Returns the version string for the platform.
    6. +
    std::string version() const;
    Returns the version string for the platform.
  6. -
    std::vector< std::string > extensions() const;
    Returns a list of extensions supported by the platform.
    7. +
    std::vector< std::string > extensions() const;
    Returns a list of extensions supported by the platform.
  7. -
    bool supports_extension(const std::string & name) const;
    +
    bool supports_extension(const std::string & name) const;

    Returns true if the platform supports the extension with name.

  8. -
    std::vector< device > devices(cl_device_type type = CL_DEVICE_TYPE_ALL) const;
    Returns a list of devices on the platform.
    9. +
    std::vector< device > devices(cl_device_type type = CL_DEVICE_TYPE_ALL) const;
    Returns a list of devices on the platform.
  9. -
    size_t device_count(cl_device_type type = CL_DEVICE_TYPE_ALL) const;
    Returns the number of devices on the platform.
    10. +
    size_t device_count(cl_device_type type = CL_DEVICE_TYPE_ALL) const;
    Returns the number of devices on the platform.
  10. -
    template<typename T> T get_info(cl_platform_info info) const;
    +
    template<typename T> T get_info(cl_platform_info info) const;

    Returns information about the platform.

    See the documentation for clGetPlatformInfo() for more information.

  11. -
    void * get_extension_function_address(const char * function_name) const;
    +
    void * get_extension_function_address(const char * function_name) const;

    Returns the address of the function_name extension function. Returns 0 if function_name is invalid.

  12. -
    void unload_compiler();
    Requests that the platform unload any compiler resources.
    13. +
    void unload_compiler();
    Requests that the platform unload any compiler resources.
diff --git a/boost/compute/program.html b/boost/compute/program.html index 7d2b8bd8..0acc06ca 100644 --- a/boost/compute/program.html +++ b/boost/compute/program.html @@ -26,130 +26,130 @@ class program { public: // construct/copy/destruct - program(); - explicit program(cl_program, bool = true); - program(const program &); - program(BOOST_RV_REF(program)); - program & operator=(const program &); - program & operator=(BOOST_RV_REF(program)); - ~program(); + program(); + explicit program(cl_program, bool = true); + program(const program &); + program(BOOST_RV_REF(program)); + program & operator=(const program &); + program & operator=(BOOST_RV_REF(program)); + ~program(); - // public member functions - cl_program & get() const; - std::string source() const; - std::vector< unsigned char > binary() const; - std::vector< device > get_devices() const; - context get_context() const; - template<typename T> T get_info(cl_program_info) const; - cl_int build(const std::string & = std::string()); - std::string build_log() const; - kernel create_kernel(const std::string &) const; + // public member functions + cl_program & get() const; + std::string source() const; + std::vector< unsigned char > binary() const; + std::vector< device > get_devices() const; + context get_context() const; + template<typename T> T get_info(cl_program_info) const; + cl_int build(const std::string & = std::string()); + std::string build_log() const; + kernel create_kernel(const std::string &) const; - // public static functions - static program create_with_source(const std::string &, const context &); - static program create_with_source_file(const std::string &, const context &); + // public static functions + static program create_with_source(const std::string &, const context &); + static program create_with_source_file(const std::string &, const context &); static program - create_with_binary(const unsigned char *, size_t, const context &); + create_with_binary(const unsigned char *, size_t, const context &); static program - create_with_binary(const std::vector< unsigned char > &, const context &); - static program create_with_binary_file(const std::string &, const context &); + create_with_binary(const std::vector< unsigned char > &, const context &); + static program create_with_binary_file(const std::string &, const context &); static program - build_with_source(const std::string &, const context &, + build_with_source(const std::string &, const context &, const std::string & = std::string()); };
-

Description

+

Description

The program class represents a compute program.

See Also:

kernel

-

+

program public construct/copy/destruct

  1. -
    program();
    Creates a null program object.
    2. +
    program();
    Creates a null program object.
  2. -
    explicit program(cl_program program, bool retain = true);
    +
    explicit program(cl_program program, bool retain = true);

    Creates a program object for program. If retain is true, the reference count for program will be incremented.

  3. -
    program(const program & other);
    Creates a new program object as a copy of other.
    4. -
  4. program(BOOST_RV_REF(program) other);
    5. -
  5. program & operator=(const program & other);
    6. -
  6. program & operator=(BOOST_RV_REF(program) other);
    7. +
    program(const program & other);
    Creates a new program object as a copy of other. +
  7. program(BOOST_RV_REF(program) other);
    8. +
  8. program & operator=(const program & other);
    9. +
  9. program & operator=(BOOST_RV_REF(program) other);
  10. -
    ~program();
    Destroys the program object.
    11. +
    ~program();
    Destroys the program object.
-

-program public member functions

+

+program public member functions

  1. -
    cl_program & get() const;
    Returns the underlying OpenCL program.
    2. +
    cl_program & get() const;
    Returns the underlying OpenCL program.
  2. -
    std::string source() const;
    Returns the source code for the program.
    3. +
    std::string source() const;
    Returns the source code for the program.
  3. -
    std::vector< unsigned char > binary() const;
    Returns the binary for the program.
    4. -
  4. std::vector< device > get_devices() const;
    5. +
    std::vector< unsigned char > binary() const;
    Returns the binary for the program. +
  5. std::vector< device > get_devices() const;
  6. -
    context get_context() const;
    Returns the context for the program.
    7. +
    context get_context() const;
    Returns the context for the program.
  7. -
    template<typename T> T get_info(cl_program_info info) const;
    +
    template<typename T> T get_info(cl_program_info info) const;

    Returns information about the program.

    See the documentation for clGetProgramInfo() for more information.

  8. -
    cl_int build(const std::string & options = std::string());
    Builds the program with options.
    9. +
    cl_int build(const std::string & options = std::string());
    Builds the program with options.
  9. -
    std::string build_log() const;
    Returns the build log.
    10. +
    std::string build_log() const;
    Returns the build log.
  10. -
    kernel create_kernel(const std::string & name) const;
    Creates and returns a new kernel object for name.
    11. +
    kernel create_kernel(const std::string & name) const;
    Creates and returns a new kernel object for name.
-

-program public static functions

+

+program public static functions

  1. static program 
-create_with_source(const std::string & source, const context & context);
    +create_with_source(const std::string & source, const context & context);

    Creates a new program with source in context.

    See the documentation for clCreateProgramWithSource() for more information. 

  2. static program 
-create_with_source_file(const std::string & file, const context & context);
    +create_with_source_file(const std::string & file, const context & context);

    Creates a new program with file in context.

    See the documentation for clCreateProgramWithSource() for more information. 

  3. static program 
-create_with_binary(const unsigned char * binary, size_t binary_size, 
+create_with_binary(const unsigned char * binary, size_t binary_size, 
                    const context & context);

    Creates a new program with binary of binary_size in context.

    See the documentation for clCreateProgramWithBinary() for more information. 

  4. static program 
-create_with_binary(const std::vector< unsigned char > & binary, 
+create_with_binary(const std::vector< unsigned char > & binary, 
                    const context & context);

    Creates a new program with binary in context.

    See the documentation for clCreateProgramWithBinary() for more information. 

  5. static program 
-create_with_binary_file(const std::string & file, const context & context);
    +create_with_binary_file(const std::string & file, const context & context);

    Creates a new program with file in context.

    See the documentation for clCreateProgramWithBinary() for more information. 

  6. static program 
-build_with_source(const std::string & source, const context & context, 
+build_with_source(const std::string & source, const context & context, 
                   const std::string & options = std::string());
    Create a new program with source in context and builds it with options.

    In case BOOST_COMPUTE_USE_OFFLINE_CACHE macro is defined, the compiled binary is stored for reuse in the offline cache located in $HOME/.boost_compute on UNIX-like systems and in APPDATA%/boost_compute on Windows.

diff --git a/boost/compute/reduce_idp19441888.html b/boost/compute/reduce_idp19441888.html new file mode 100644 index 00000000..7802918b --- /dev/null +++ b/boost/compute/reduce_idp19441888.html @@ -0,0 +1,54 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+

For example, to calculate the sum of a vector of int's:

+
boost:compute::vector<int> vec = ...
+
+int sum = 0;
+boost::compute::reduce(vec.begin(), vec.end(), &sum, queue);
+
+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp19450448.html b/boost/compute/reduce_idp19450448.html new file mode 100644 index 00000000..e91d43e9 --- /dev/null +++ b/boost/compute/reduce_idp19450448.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp19481312.html b/boost/compute/reduce_idp19481312.html new file mode 100644 index 00000000..c0a640fc --- /dev/null +++ b/boost/compute/reduce_idp19481312.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp19488720.html b/boost/compute/reduce_idp19488720.html new file mode 100644 index 00000000..e8226d64 --- /dev/null +++ b/boost/compute/reduce_idp19488720.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp19890528.html b/boost/compute/reduce_idp19890528.html new file mode 100644 index 00000000..6c9c39e3 --- /dev/null +++ b/boost/compute/reduce_idp19890528.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp19897936.html b/boost/compute/reduce_idp19897936.html new file mode 100644 index 00000000..8f22d8df --- /dev/null +++ b/boost/compute/reduce_idp19897936.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp20306064.html b/boost/compute/reduce_idp20306064.html new file mode 100644 index 00000000..c6888abc --- /dev/null +++ b/boost/compute/reduce_idp20306064.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp20313472.html b/boost/compute/reduce_idp20313472.html new file mode 100644 index 00000000..f897865e --- /dev/null +++ b/boost/compute/reduce_idp20313472.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp23081968.html b/boost/compute/reduce_idp23081968.html new file mode 100644 index 00000000..f86945f2 --- /dev/null +++ b/boost/compute/reduce_idp23081968.html @@ -0,0 +1,56 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+

For example, to calculate the sum of a vector of int's:

+
// get/create vector of int's on the device
+boost:compute::vector<int> vec = ...
+
+// compute the sum
+int sum = 0;
+boost::compute::reduce(vec.begin(), vec.end(), &sum, queue);
+
+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp23090592.html b/boost/compute/reduce_idp23090592.html new file mode 100644 index 00000000..988fd40b --- /dev/null +++ b/boost/compute/reduce_idp23090592.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp24288560.html b/boost/compute/reduce_idp24288560.html new file mode 100644 index 00000000..c6d2debc --- /dev/null +++ b/boost/compute/reduce_idp24288560.html @@ -0,0 +1,56 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+

For example, to calculate the sum of a vector of int's:

+
// get/create vector of int's on the device
+boost:compute::vector<int> vec = ...
+
+// compute the sum
+int sum = 0;
+boost::compute::reduce(vec.begin(), vec.end(), &sum, queue);
+
+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp24297184.html b/boost/compute/reduce_idp24297184.html new file mode 100644 index 00000000..a28b835b --- /dev/null +++ b/boost/compute/reduce_idp24297184.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp24527760.html b/boost/compute/reduce_idp24527760.html new file mode 100644 index 00000000..c6f1b469 --- /dev/null +++ b/boost/compute/reduce_idp24527760.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp24535168.html b/boost/compute/reduce_idp24535168.html new file mode 100644 index 00000000..950e9687 --- /dev/null +++ b/boost/compute/reduce_idp24535168.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp24728272.html b/boost/compute/reduce_idp24728272.html new file mode 100644 index 00000000..ade84b17 --- /dev/null +++ b/boost/compute/reduce_idp24728272.html @@ -0,0 +1,57 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+

For example, to calculate the sum of a vector of int's:

+
// get/create vector of int's
+boost:compute::vector<int> vec = ...
+
+// compute and print the sum
+int sum = 0;
+boost::compute::reduce(vec.begin(), vec.end(), &sum, queue);
+std::cout << "sum: " << sum << std::endl;
+
+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp24736928.html b/boost/compute/reduce_idp24736928.html new file mode 100644 index 00000000..22b53cc5 --- /dev/null +++ b/boost/compute/reduce_idp24736928.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp25861072.html b/boost/compute/reduce_idp25861072.html new file mode 100644 index 00000000..bc912e58 --- /dev/null +++ b/boost/compute/reduce_idp25861072.html @@ -0,0 +1,56 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+

For example, to calculate the sum of a vector of int's:

+
// get/create vector of int's on the device
+boost:compute::vector<int> vec = ...
+
+// compute the sum
+int sum = 0;
+boost::compute::reduce(vec.begin(), vec.end(), &sum, queue);
+
+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp25869696.html b/boost/compute/reduce_idp25869696.html new file mode 100644 index 00000000..487f071f --- /dev/null +++ b/boost/compute/reduce_idp25869696.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp27625952.html b/boost/compute/reduce_idp27625952.html new file mode 100644 index 00000000..638cea94 --- /dev/null +++ b/boost/compute/reduce_idp27625952.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp27633360.html b/boost/compute/reduce_idp27633360.html new file mode 100644 index 00000000..6cdcbac9 --- /dev/null +++ b/boost/compute/reduce_idp27633360.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp29009440.html b/boost/compute/reduce_idp29009440.html new file mode 100644 index 00000000..a84a8334 --- /dev/null +++ b/boost/compute/reduce_idp29009440.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp29016848.html b/boost/compute/reduce_idp29016848.html new file mode 100644 index 00000000..c14a5ab2 --- /dev/null +++ b/boost/compute/reduce_idp29016848.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp30163648.html b/boost/compute/reduce_idp30163648.html new file mode 100644 index 00000000..89b69d43 --- /dev/null +++ b/boost/compute/reduce_idp30163648.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp30171056.html b/boost/compute/reduce_idp30171056.html new file mode 100644 index 00000000..a355e807 --- /dev/null +++ b/boost/compute/reduce_idp30171056.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp31382768.html b/boost/compute/reduce_idp31382768.html new file mode 100644 index 00000000..9b20412b --- /dev/null +++ b/boost/compute/reduce_idp31382768.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp31390176.html b/boost/compute/reduce_idp31390176.html new file mode 100644 index 00000000..029c182b --- /dev/null +++ b/boost/compute/reduce_idp31390176.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp35542784.html b/boost/compute/reduce_idp35542784.html new file mode 100644 index 00000000..d3699fe7 --- /dev/null +++ b/boost/compute/reduce_idp35542784.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp35550192.html b/boost/compute/reduce_idp35550192.html new file mode 100644 index 00000000..6eeadf21 --- /dev/null +++ b/boost/compute/reduce_idp35550192.html @@ -0,0 +1,61 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+

For example, to calculate the sum of a vector of int's:

+
// get/create vector of int's on the device
+boost:compute::vector<int> vec = ...
+
+// compute and print the sum
+int sum = 0;
+boost::compute::reduce(vec.begin(), vec.end(), &sum, queue);
+std::cout << "sum: " << sum << std::endl;
+
+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp38530608.html b/boost/compute/reduce_idp38530608.html new file mode 100644 index 00000000..f87766ee --- /dev/null +++ b/boost/compute/reduce_idp38530608.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp38538016.html b/boost/compute/reduce_idp38538016.html new file mode 100644 index 00000000..ccd7017f --- /dev/null +++ b/boost/compute/reduce_idp38538016.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp39807568.html b/boost/compute/reduce_idp39807568.html new file mode 100644 index 00000000..c5f8cbcd --- /dev/null +++ b/boost/compute/reduce_idp39807568.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp39814976.html b/boost/compute/reduce_idp39814976.html new file mode 100644 index 00000000..19e60ee2 --- /dev/null +++ b/boost/compute/reduce_idp39814976.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp43828640.html b/boost/compute/reduce_idp43828640.html new file mode 100644 index 00000000..8200a4ed --- /dev/null +++ b/boost/compute/reduce_idp43828640.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp43836048.html b/boost/compute/reduce_idp43836048.html new file mode 100644 index 00000000..d2b64e7a --- /dev/null +++ b/boost/compute/reduce_idp43836048.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp44772464.html b/boost/compute/reduce_idp44772464.html new file mode 100644 index 00000000..24d1ccdd --- /dev/null +++ b/boost/compute/reduce_idp44772464.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp44779872.html b/boost/compute/reduce_idp44779872.html new file mode 100644 index 00000000..dcd502bf --- /dev/null +++ b/boost/compute/reduce_idp44779872.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp46390656.html b/boost/compute/reduce_idp46390656.html new file mode 100644 index 00000000..eca13be2 --- /dev/null +++ b/boost/compute/reduce_idp46390656.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp46398064.html b/boost/compute/reduce_idp46398064.html new file mode 100644 index 00000000..8d885686 --- /dev/null +++ b/boost/compute/reduce_idp46398064.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp49450000.html b/boost/compute/reduce_idp49450000.html new file mode 100644 index 00000000..3a92a6b2 --- /dev/null +++ b/boost/compute/reduce_idp49450000.html @@ -0,0 +1,47 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the sum of the elements in the range [first, last). This is equivalent to calling reduce() with the plus<T>() function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/reduce_idp49457408.html b/boost/compute/reduce_idp49457408.html new file mode 100644 index 00000000..ca1a691c --- /dev/null +++ b/boost/compute/reduce_idp49457408.html @@ -0,0 +1,51 @@ + + + +Function template reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template reduce

+

boost::compute::reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename BinaryFunction> 
+  void reduce(InputIterator first, InputIterator last, OutputIterator result, 
+              BinaryFunction function, 
+              command_queue & queue = system::default_queue());
+
+

Description

+

Returns the result of applying function to the elements in the range [first, last).

+

The difference between the reduce() function and the accumulate() function is that reduce() requires the binary operator to be commutative.

+

This algorithm supports both host and device iterators for the result argument. This allows for values to be reduced and copied to the host all with a single function call.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/remove.html b/boost/compute/remove.html index 7baa52ff..68a28baf 100644 --- a/boost/compute/remove.html +++ b/boost/compute/remove.html @@ -6,12 +6,12 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -27,7 +27,7 @@ Iterator remove(Iterator first, Iterator last, const T & value, command_queue & queue = system::default_queue());
-

Description

+

Description

Removes each element equal to value in the range [first, last).

See Also:

remove_if()

@@ -45,7 +45,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/remove_if.html b/boost/compute/remove_if.html index c887e328..d30dee4a 100644 --- a/boost/compute/remove_if.html +++ b/boost/compute/remove_if.html @@ -27,7 +27,7 @@ Iterator remove_if(Iterator first, Iterator last, Predicate predicate, command_queue & queue = system::default_queue());
-

Description

+

Description

Removes each element for which predicate returns true in the range [first, last).

See Also:

remove()

diff --git a/boost/compute/replace.html b/boost/compute/replace.html index 3f9d9274..e0e1e46e 100644 --- a/boost/compute/replace.html +++ b/boost/compute/replace.html @@ -28,7 +28,7 @@ const T & new_value, command_queue & queue = system::default_queue());
-

Description

+

Description

Replaces each instance of old_value in the range [first, last) with new_value.

diff --git a/boost/compute/replace_copy.html b/boost/compute/replace_copy.html index 47f3a333..d6161399 100644 --- a/boost/compute/replace_copy.html +++ b/boost/compute/replace_copy.html @@ -29,7 +29,7 @@ const T & old_value, const T & new_value, command_queue & queue = system::default_queue());
-

Description

+

Description

Copies the value in the range [first, last) to the range beginning at result while replacing each instance of old_value with new_value.

See Also:

replace()

diff --git a/boost/compute/reverse_copy.html b/boost/compute/reverse_copy.html index 113cb608..058151b0 100644 --- a/boost/compute/reverse_copy.html +++ b/boost/compute/reverse_copy.html @@ -28,7 +28,7 @@ reverse_copy(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue = system::default_queue());
-

Description

+

Description

Copies the elements in the range [first, last) in reversed order to the range beginning at result.

diff --git a/boost/compute/runtime_exception.html b/boost/compute/runtime_exception.html index 9a87d250..c6ec42a9 100644 --- a/boost/compute/runtime_exception.html +++ b/boost/compute/runtime_exception.html @@ -6,12 +6,12 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -26,31 +26,31 @@ class runtime_exception : public exception { public: // construct/copy/destruct - explicit runtime_exception(cl_int); - ~runtime_exception(); + explicit runtime_exception(cl_int); + ~runtime_exception(); - // public member functions - cl_int get_error() const; - const char * what() const; + // public member functions + cl_int get_error() const; + const char * what() const; };
-

Description

+

Description

-

+

runtime_exception public construct/copy/destruct

    -
  1. explicit runtime_exception(cl_int error);
    2. -
  2. ~runtime_exception();
    3. +
  3. explicit runtime_exception(cl_int error);
    4. +
  4. ~runtime_exception();
-

-runtime_exception public member functions

+

+runtime_exception public member functions

    -
  1. cl_int get_error() const;
    2. -
  2. const char * what() const;
    3. +
  3. cl_int get_error() const;
    4. +
  4. const char * what() const;
@@ -65,7 +65,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/scalar_type.html b/boost/compute/scalar_type.html index adaff376..24f46ef8 100644 --- a/boost/compute/scalar_type.html +++ b/boost/compute/scalar_type.html @@ -26,7 +26,7 @@ struct scalar_type { };
-

Description

+

Description

Meta-function returning the scalar type for a vector type.

For example, 

scalar_type<float4_>::type == float
diff --git a/boost/compute/scatter.html b/boost/compute/scatter.html
index 4e9d9bb0..9c02fbc5 100644
--- a/boost/compute/scatter.html
+++ b/boost/compute/scatter.html
@@ -7,11 +7,11 @@
 
 
 
-
+
 
 
 

-PrevUpHomeNext
+PrevUpHomeNext
 

 

 

@@ -29,7 +29,7 @@
                OutputIterator result, 
                command_queue & queue = system::default_queue());
-

Description

+

Description

Copies the elements from the range [first, last) to the range beginning at result using the output indices from the range beginning at map.

See Also:

gather()

@@ -47,7 +47,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/sort_by_key_idp19553824.html b/boost/compute/sort_by_key_idp19553824.html new file mode 100644 index 00000000..b936028e --- /dev/null +++ b/boost/compute/sort_by_key_idp19553824.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp19565152.html b/boost/compute/sort_by_key_idp19565152.html new file mode 100644 index 00000000..8db22bce --- /dev/null +++ b/boost/compute/sort_by_key_idp19565152.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp19592096.html b/boost/compute/sort_by_key_idp19592096.html new file mode 100644 index 00000000..6aeecee0 --- /dev/null +++ b/boost/compute/sort_by_key_idp19592096.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp19603424.html b/boost/compute/sort_by_key_idp19603424.html new file mode 100644 index 00000000..6af4f408 --- /dev/null +++ b/boost/compute/sort_by_key_idp19603424.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp20001312.html b/boost/compute/sort_by_key_idp20001312.html new file mode 100644 index 00000000..0803e3ad --- /dev/null +++ b/boost/compute/sort_by_key_idp20001312.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp20012640.html b/boost/compute/sort_by_key_idp20012640.html new file mode 100644 index 00000000..3ab80ec8 --- /dev/null +++ b/boost/compute/sort_by_key_idp20012640.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp20416880.html b/boost/compute/sort_by_key_idp20416880.html new file mode 100644 index 00000000..5d5c60e6 --- /dev/null +++ b/boost/compute/sort_by_key_idp20416880.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp20428208.html b/boost/compute/sort_by_key_idp20428208.html new file mode 100644 index 00000000..f9b73c30 --- /dev/null +++ b/boost/compute/sort_by_key_idp20428208.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp23194000.html b/boost/compute/sort_by_key_idp23194000.html new file mode 100644 index 00000000..4e554c7b --- /dev/null +++ b/boost/compute/sort_by_key_idp23194000.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp23205328.html b/boost/compute/sort_by_key_idp23205328.html new file mode 100644 index 00000000..957ea1f7 --- /dev/null +++ b/boost/compute/sort_by_key_idp23205328.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp24400560.html b/boost/compute/sort_by_key_idp24400560.html new file mode 100644 index 00000000..778701a2 --- /dev/null +++ b/boost/compute/sort_by_key_idp24400560.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp24411888.html b/boost/compute/sort_by_key_idp24411888.html new file mode 100644 index 00000000..b071cb8c --- /dev/null +++ b/boost/compute/sort_by_key_idp24411888.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp24638576.html b/boost/compute/sort_by_key_idp24638576.html new file mode 100644 index 00000000..8289dbe4 --- /dev/null +++ b/boost/compute/sort_by_key_idp24638576.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp24649904.html b/boost/compute/sort_by_key_idp24649904.html new file mode 100644 index 00000000..6ef96d0c --- /dev/null +++ b/boost/compute/sort_by_key_idp24649904.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp24840304.html b/boost/compute/sort_by_key_idp24840304.html new file mode 100644 index 00000000..c20d3b5b --- /dev/null +++ b/boost/compute/sort_by_key_idp24840304.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp24851632.html b/boost/compute/sort_by_key_idp24851632.html new file mode 100644 index 00000000..992fdf01 --- /dev/null +++ b/boost/compute/sort_by_key_idp24851632.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp25973104.html b/boost/compute/sort_by_key_idp25973104.html new file mode 100644 index 00000000..cd516832 --- /dev/null +++ b/boost/compute/sort_by_key_idp25973104.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp25984432.html b/boost/compute/sort_by_key_idp25984432.html new file mode 100644 index 00000000..2c0024ca --- /dev/null +++ b/boost/compute/sort_by_key_idp25984432.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp27736736.html b/boost/compute/sort_by_key_idp27736736.html new file mode 100644 index 00000000..edcd45cb --- /dev/null +++ b/boost/compute/sort_by_key_idp27736736.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp27748064.html b/boost/compute/sort_by_key_idp27748064.html new file mode 100644 index 00000000..592ce9c7 --- /dev/null +++ b/boost/compute/sort_by_key_idp27748064.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp29120224.html b/boost/compute/sort_by_key_idp29120224.html new file mode 100644 index 00000000..73df0987 --- /dev/null +++ b/boost/compute/sort_by_key_idp29120224.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp29131552.html b/boost/compute/sort_by_key_idp29131552.html new file mode 100644 index 00000000..8b405758 --- /dev/null +++ b/boost/compute/sort_by_key_idp29131552.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp30274464.html b/boost/compute/sort_by_key_idp30274464.html new file mode 100644 index 00000000..6f5e3436 --- /dev/null +++ b/boost/compute/sort_by_key_idp30274464.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp30285792.html b/boost/compute/sort_by_key_idp30285792.html new file mode 100644 index 00000000..e53c9b8a --- /dev/null +++ b/boost/compute/sort_by_key_idp30285792.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp31493552.html b/boost/compute/sort_by_key_idp31493552.html new file mode 100644 index 00000000..76adfaf0 --- /dev/null +++ b/boost/compute/sort_by_key_idp31493552.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp31504880.html b/boost/compute/sort_by_key_idp31504880.html new file mode 100644 index 00000000..0026c547 --- /dev/null +++ b/boost/compute/sort_by_key_idp31504880.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp35654832.html b/boost/compute/sort_by_key_idp35654832.html new file mode 100644 index 00000000..5478c1e6 --- /dev/null +++ b/boost/compute/sort_by_key_idp35654832.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp35666160.html b/boost/compute/sort_by_key_idp35666160.html new file mode 100644 index 00000000..5d79272c --- /dev/null +++ b/boost/compute/sort_by_key_idp35666160.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp38641424.html b/boost/compute/sort_by_key_idp38641424.html new file mode 100644 index 00000000..0b565c83 --- /dev/null +++ b/boost/compute/sort_by_key_idp38641424.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp38652752.html b/boost/compute/sort_by_key_idp38652752.html new file mode 100644 index 00000000..6f465890 --- /dev/null +++ b/boost/compute/sort_by_key_idp38652752.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp39918352.html b/boost/compute/sort_by_key_idp39918352.html new file mode 100644 index 00000000..caa5d5c1 --- /dev/null +++ b/boost/compute/sort_by_key_idp39918352.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp39929680.html b/boost/compute/sort_by_key_idp39929680.html new file mode 100644 index 00000000..443dce4f --- /dev/null +++ b/boost/compute/sort_by_key_idp39929680.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp43939456.html b/boost/compute/sort_by_key_idp43939456.html new file mode 100644 index 00000000..92cf6988 --- /dev/null +++ b/boost/compute/sort_by_key_idp43939456.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp43950784.html b/boost/compute/sort_by_key_idp43950784.html new file mode 100644 index 00000000..d6663cd8 --- /dev/null +++ b/boost/compute/sort_by_key_idp43950784.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp44883280.html b/boost/compute/sort_by_key_idp44883280.html new file mode 100644 index 00000000..7df6d7cc --- /dev/null +++ b/boost/compute/sort_by_key_idp44883280.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp44894608.html b/boost/compute/sort_by_key_idp44894608.html new file mode 100644 index 00000000..c763152a --- /dev/null +++ b/boost/compute/sort_by_key_idp44894608.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp46501472.html b/boost/compute/sort_by_key_idp46501472.html new file mode 100644 index 00000000..e07668d1 --- /dev/null +++ b/boost/compute/sort_by_key_idp46501472.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp46512800.html b/boost/compute/sort_by_key_idp46512800.html new file mode 100644 index 00000000..9259506b --- /dev/null +++ b/boost/compute/sort_by_key_idp46512800.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp49560816.html b/boost/compute/sort_by_key_idp49560816.html new file mode 100644 index 00000000..b9288232 --- /dev/null +++ b/boost/compute/sort_by_key_idp49560816.html @@ -0,0 +1,48 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator, typename Compare> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)) using compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_by_key_idp49572144.html b/boost/compute/sort_by_key_idp49572144.html new file mode 100644 index 00000000..90308331 --- /dev/null +++ b/boost/compute/sort_by_key_idp49572144.html @@ -0,0 +1,49 @@ + + + +Function template sort_by_key + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort_by_key

+

boost::compute::sort_by_key

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort_by_key.hpp>
+
+
+template<typename KeyIterator, typename ValueIterator> 
+  void sort_by_key(KeyIterator keys_first, KeyIterator keys_last, 
+                   ValueIterator values_first, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Performs a key-value sort using the keys in the range [keys_first, keys_last) on the values in the range [values_first, values_first + (keys_last - keys_first)).

+

Uses less<> as the comparison operator for the keys.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp19538704.html b/boost/compute/sort_idp19538704.html new file mode 100644 index 00000000..a3be4ffe --- /dev/null +++ b/boost/compute/sort_idp19538704.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp19576976.html b/boost/compute/sort_idp19576976.html new file mode 100644 index 00000000..f6e8a07c --- /dev/null +++ b/boost/compute/sort_idp19576976.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp19986192.html b/boost/compute/sort_idp19986192.html new file mode 100644 index 00000000..9c48c9ea --- /dev/null +++ b/boost/compute/sort_idp19986192.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp20401744.html b/boost/compute/sort_idp20401744.html new file mode 100644 index 00000000..d9f5812b --- /dev/null +++ b/boost/compute/sort_idp20401744.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp23178864.html b/boost/compute/sort_idp23178864.html new file mode 100644 index 00000000..00fc8a1e --- /dev/null +++ b/boost/compute/sort_idp23178864.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp24385440.html b/boost/compute/sort_idp24385440.html new file mode 100644 index 00000000..c0a68fce --- /dev/null +++ b/boost/compute/sort_idp24385440.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp24623440.html b/boost/compute/sort_idp24623440.html new file mode 100644 index 00000000..f2b65a9a --- /dev/null +++ b/boost/compute/sort_idp24623440.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp24825184.html b/boost/compute/sort_idp24825184.html new file mode 100644 index 00000000..46a8bf1b --- /dev/null +++ b/boost/compute/sort_idp24825184.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp25957968.html b/boost/compute/sort_idp25957968.html new file mode 100644 index 00000000..1dccea38 --- /dev/null +++ b/boost/compute/sort_idp25957968.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp27721616.html b/boost/compute/sort_idp27721616.html new file mode 100644 index 00000000..97c2fc14 --- /dev/null +++ b/boost/compute/sort_idp27721616.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp29105104.html b/boost/compute/sort_idp29105104.html new file mode 100644 index 00000000..df8168e7 --- /dev/null +++ b/boost/compute/sort_idp29105104.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp30259328.html b/boost/compute/sort_idp30259328.html new file mode 100644 index 00000000..80c0fec7 --- /dev/null +++ b/boost/compute/sort_idp30259328.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp31478432.html b/boost/compute/sort_idp31478432.html new file mode 100644 index 00000000..1b785c4b --- /dev/null +++ b/boost/compute/sort_idp31478432.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp35639712.html b/boost/compute/sort_idp35639712.html new file mode 100644 index 00000000..0f551a4b --- /dev/null +++ b/boost/compute/sort_idp35639712.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp38626288.html b/boost/compute/sort_idp38626288.html new file mode 100644 index 00000000..15df7d15 --- /dev/null +++ b/boost/compute/sort_idp38626288.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp39903232.html b/boost/compute/sort_idp39903232.html new file mode 100644 index 00000000..58b6c059 --- /dev/null +++ b/boost/compute/sort_idp39903232.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp43924320.html b/boost/compute/sort_idp43924320.html new file mode 100644 index 00000000..76224818 --- /dev/null +++ b/boost/compute/sort_idp43924320.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp44868144.html b/boost/compute/sort_idp44868144.html new file mode 100644 index 00000000..001c0178 --- /dev/null +++ b/boost/compute/sort_idp44868144.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp46486336.html b/boost/compute/sort_idp46486336.html new file mode 100644 index 00000000..0f23fa25 --- /dev/null +++ b/boost/compute/sort_idp46486336.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/sort_idp49545680.html b/boost/compute/sort_idp49545680.html new file mode 100644 index 00000000..967abdf2 --- /dev/null +++ b/boost/compute/sort_idp49545680.html @@ -0,0 +1,47 @@ + + + +Function template sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void sort(Iterator first, Iterator last, Compare compare, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp19577344.html b/boost/compute/stable_sort_idp19577344.html new file mode 100644 index 00000000..b29fe615 --- /dev/null +++ b/boost/compute/stable_sort_idp19577344.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp19586000.html b/boost/compute/stable_sort_idp19586000.html new file mode 100644 index 00000000..17a20803 --- /dev/null +++ b/boost/compute/stable_sort_idp19586000.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp19615616.html b/boost/compute/stable_sort_idp19615616.html new file mode 100644 index 00000000..db70e266 --- /dev/null +++ b/boost/compute/stable_sort_idp19615616.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp19624272.html b/boost/compute/stable_sort_idp19624272.html new file mode 100644 index 00000000..0366f013 --- /dev/null +++ b/boost/compute/stable_sort_idp19624272.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp20024832.html b/boost/compute/stable_sort_idp20024832.html new file mode 100644 index 00000000..7d8eca0c --- /dev/null +++ b/boost/compute/stable_sort_idp20024832.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp20033488.html b/boost/compute/stable_sort_idp20033488.html new file mode 100644 index 00000000..7c77cc23 --- /dev/null +++ b/boost/compute/stable_sort_idp20033488.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp20440400.html b/boost/compute/stable_sort_idp20440400.html new file mode 100644 index 00000000..972739e8 --- /dev/null +++ b/boost/compute/stable_sort_idp20440400.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp20449056.html b/boost/compute/stable_sort_idp20449056.html new file mode 100644 index 00000000..17c1f967 --- /dev/null +++ b/boost/compute/stable_sort_idp20449056.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp23217520.html b/boost/compute/stable_sort_idp23217520.html new file mode 100644 index 00000000..538684ff --- /dev/null +++ b/boost/compute/stable_sort_idp23217520.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp23226176.html b/boost/compute/stable_sort_idp23226176.html new file mode 100644 index 00000000..d803afa5 --- /dev/null +++ b/boost/compute/stable_sort_idp23226176.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp24424080.html b/boost/compute/stable_sort_idp24424080.html new file mode 100644 index 00000000..9835e61e --- /dev/null +++ b/boost/compute/stable_sort_idp24424080.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp24432736.html b/boost/compute/stable_sort_idp24432736.html new file mode 100644 index 00000000..08a74c58 --- /dev/null +++ b/boost/compute/stable_sort_idp24432736.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp24662096.html b/boost/compute/stable_sort_idp24662096.html new file mode 100644 index 00000000..77f0971c --- /dev/null +++ b/boost/compute/stable_sort_idp24662096.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp24670752.html b/boost/compute/stable_sort_idp24670752.html new file mode 100644 index 00000000..ebf9bc12 --- /dev/null +++ b/boost/compute/stable_sort_idp24670752.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp24863824.html b/boost/compute/stable_sort_idp24863824.html new file mode 100644 index 00000000..eedc7de1 --- /dev/null +++ b/boost/compute/stable_sort_idp24863824.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp24872480.html b/boost/compute/stable_sort_idp24872480.html new file mode 100644 index 00000000..b76e6cf6 --- /dev/null +++ b/boost/compute/stable_sort_idp24872480.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp25996624.html b/boost/compute/stable_sort_idp25996624.html new file mode 100644 index 00000000..df422a95 --- /dev/null +++ b/boost/compute/stable_sort_idp25996624.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp26005280.html b/boost/compute/stable_sort_idp26005280.html new file mode 100644 index 00000000..aa2af672 --- /dev/null +++ b/boost/compute/stable_sort_idp26005280.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp27760256.html b/boost/compute/stable_sort_idp27760256.html new file mode 100644 index 00000000..c32055b5 --- /dev/null +++ b/boost/compute/stable_sort_idp27760256.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp27768912.html b/boost/compute/stable_sort_idp27768912.html new file mode 100644 index 00000000..23b542ec --- /dev/null +++ b/boost/compute/stable_sort_idp27768912.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp29143744.html b/boost/compute/stable_sort_idp29143744.html new file mode 100644 index 00000000..fb11ca72 --- /dev/null +++ b/boost/compute/stable_sort_idp29143744.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp29152400.html b/boost/compute/stable_sort_idp29152400.html new file mode 100644 index 00000000..5a46d536 --- /dev/null +++ b/boost/compute/stable_sort_idp29152400.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp30297984.html b/boost/compute/stable_sort_idp30297984.html new file mode 100644 index 00000000..5286f332 --- /dev/null +++ b/boost/compute/stable_sort_idp30297984.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp30306640.html b/boost/compute/stable_sort_idp30306640.html new file mode 100644 index 00000000..4b2825ae --- /dev/null +++ b/boost/compute/stable_sort_idp30306640.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp31517072.html b/boost/compute/stable_sort_idp31517072.html new file mode 100644 index 00000000..21e2d59d --- /dev/null +++ b/boost/compute/stable_sort_idp31517072.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp31525728.html b/boost/compute/stable_sort_idp31525728.html new file mode 100644 index 00000000..7e739478 --- /dev/null +++ b/boost/compute/stable_sort_idp31525728.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp35678352.html b/boost/compute/stable_sort_idp35678352.html new file mode 100644 index 00000000..fcb77ee0 --- /dev/null +++ b/boost/compute/stable_sort_idp35678352.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp35687008.html b/boost/compute/stable_sort_idp35687008.html new file mode 100644 index 00000000..a9d53e3b --- /dev/null +++ b/boost/compute/stable_sort_idp35687008.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp38664944.html b/boost/compute/stable_sort_idp38664944.html new file mode 100644 index 00000000..059550cd --- /dev/null +++ b/boost/compute/stable_sort_idp38664944.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp38673600.html b/boost/compute/stable_sort_idp38673600.html new file mode 100644 index 00000000..84a40e8a --- /dev/null +++ b/boost/compute/stable_sort_idp38673600.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp39941872.html b/boost/compute/stable_sort_idp39941872.html new file mode 100644 index 00000000..858b7f53 --- /dev/null +++ b/boost/compute/stable_sort_idp39941872.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp39950528.html b/boost/compute/stable_sort_idp39950528.html new file mode 100644 index 00000000..9f9f9dcb --- /dev/null +++ b/boost/compute/stable_sort_idp39950528.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp43962976.html b/boost/compute/stable_sort_idp43962976.html new file mode 100644 index 00000000..c6ea064f --- /dev/null +++ b/boost/compute/stable_sort_idp43962976.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp43971632.html b/boost/compute/stable_sort_idp43971632.html new file mode 100644 index 00000000..bb16b04d --- /dev/null +++ b/boost/compute/stable_sort_idp43971632.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp44906800.html b/boost/compute/stable_sort_idp44906800.html new file mode 100644 index 00000000..f7fdbee3 --- /dev/null +++ b/boost/compute/stable_sort_idp44906800.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp44915456.html b/boost/compute/stable_sort_idp44915456.html new file mode 100644 index 00000000..05403998 --- /dev/null +++ b/boost/compute/stable_sort_idp44915456.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp46524992.html b/boost/compute/stable_sort_idp46524992.html new file mode 100644 index 00000000..c5f6d055 --- /dev/null +++ b/boost/compute/stable_sort_idp46524992.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp46533648.html b/boost/compute/stable_sort_idp46533648.html new file mode 100644 index 00000000..4765bfe8 --- /dev/null +++ b/boost/compute/stable_sort_idp46533648.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp49584336.html b/boost/compute/stable_sort_idp49584336.html new file mode 100644 index 00000000..5b79775b --- /dev/null +++ b/boost/compute/stable_sort_idp49584336.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator, typename Compare> 
+  void stable_sort(Iterator first, Iterator last, Compare compare, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last) according to compare. The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stable_sort_idp49592992.html b/boost/compute/stable_sort_idp49592992.html new file mode 100644 index 00000000..7680284b --- /dev/null +++ b/boost/compute/stable_sort_idp49592992.html @@ -0,0 +1,51 @@ + + + +Function template stable_sort + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template stable_sort

+

boost::compute::stable_sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void stable_sort(Iterator first, Iterator last, 
+                   command_queue & queue = system::default_queue());
+
+

Description

+

Sorts the values in the range [first, last). The relative order of identical values is preserved.

+

See Also:

+

sort(), is_sorted()

+

+

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/stack.html b/boost/compute/stack.html index fb7ebe54..ae24a757 100644 --- a/boost/compute/stack.html +++ b/boost/compute/stack.html @@ -31,41 +31,41 @@ typedef container_type::value_type value_type; // construct/copy/destruct - stack(); - stack(const stack< T > &); - stack< T > & operator=(const stack< T > &); - ~stack(); + stack(); + stack(const stack< T > &); + stack< T > & operator=(const stack< T > &); + ~stack(); - // public member functions - bool empty() const; - size_type size() const; - value_type top() const; - void push(const T &); - void pop(); + // public member functions + bool empty() const; + size_type size() const; + value_type top() const; + void push(const T &); + void pop(); };
-

Description

+

Description

-

+

stack public construct/copy/destruct

    -
  1. stack();
    2. -
  2. stack(const stack< T > & other);
    3. -
  3. stack< T > & operator=(const stack< T > & other);
    4. -
  4. ~stack();
    5. +
  5. stack();
    6. +
  6. stack(const stack< T > & other);
    7. +
  7. stack< T > & operator=(const stack< T > & other);
    8. +
  8. ~stack();
-

-stack public member functions

+

+stack public member functions

    -
  1. bool empty() const;
    2. -
  2. size_type size() const;
    3. -
  3. value_type top() const;
    4. -
  4. void push(const T & value);
    5. -
  5. void pop();
    6. +
  6. bool empty() const;
    7. +
  7. size_type size() const;
    8. +
  8. value_type top() const;
    9. +
  9. void push(const T & value);
    10. +
  10. void pop();
diff --git a/boost/compute/swap_ranges.html b/boost/compute/swap_ranges.html index 1799d512..b08ab24e 100644 --- a/boost/compute/swap_ranges.html +++ b/boost/compute/swap_ranges.html @@ -6,12 +6,12 @@ - - + +
-PrevUpHomeNext +PrevUpHomeNext
@@ -27,7 +27,7 @@ Iterator2 swap_ranges(Iterator1 first1, Iterator1 last1, Iterator2 first2, command_queue & queue = system::default_queue());
-

Description

+

Description

Swaps the elements in the range [first1, last1) with the elements in the range beginning at first2.

@@ -41,7 +41,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/system.html b/boost/compute/system.html index dca5533f..78ba72db 100644 --- a/boost/compute/system.html +++ b/boost/compute/system.html @@ -26,49 +26,49 @@ class system { public: - // public static functions - static device default_device(); - static device find_device(const std::string &); - static std::vector< device > devices(); - static size_t device_count(); - static context default_context(); - static command_queue & default_queue(); - static void finish(); - static std::vector< platform > platforms(); - static size_t platform_count(); + // public static functions + static device default_device(); + static device find_device(const std::string &); + static std::vector< device > devices(); + static size_t device_count(); + static context default_context(); + static command_queue & default_queue(); + static void finish(); + static std::vector< platform > platforms(); + static size_t platform_count(); };
-

Description

+

Description

See Also:

platform, device, context

-

-system public static functions

+

+system public static functions

  1. -
    static device default_device();
    Returns the default compute device for the system.
    2. +
    static device default_device();
    Returns the default compute device for the system.
  2. -
    static device find_device(const std::string & name);
    Returns the device with name.
    3. +
    static device find_device(const std::string & name);
    Returns the device with name.
  3. -
    static std::vector< device > devices();
    +
    static std::vector< device > devices();

    Returns a vector containing all of the compute devices on the system.

  4. -
    static size_t device_count();
    Returns the number of compute devices on the system.
    5. +
    static size_t device_count();
    Returns the number of compute devices on the system.
  5. -
    static context default_context();
    Returns the default context for the system.
    6. +
    static context default_context();
    Returns the default context for the system.
  6. -
    static command_queue & default_queue();
    Returns the default command queue for the system.
    7. +
    static command_queue & default_queue();
    Returns the default command queue for the system.
  7. -
    static void finish();
    +
    static void finish();

    Blocks until all outstanding computations on the default command queue are complete.

  8. -
    static std::vector< platform > platforms();
    Returns a vector of all the compute platforms on the system.
    9. +
    static std::vector< platform > platforms();
    Returns a vector of all the compute platforms on the system.
  9. -
    static size_t platform_count();
    Returns the number of compute platforms on the system.
    10. +
    static size_t platform_count();
    Returns the number of compute platforms on the system.
diff --git a/boost/compute/transform_idp19604800.html b/boost/compute/transform_idp19604800.html new file mode 100644 index 00000000..942eeebd --- /dev/null +++ b/boost/compute/transform_idp19604800.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp19613888.html b/boost/compute/transform_idp19613888.html new file mode 100644 index 00000000..efdb474d --- /dev/null +++ b/boost/compute/transform_idp19613888.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp19643072.html b/boost/compute/transform_idp19643072.html new file mode 100644 index 00000000..9d99a6b6 --- /dev/null +++ b/boost/compute/transform_idp19643072.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp19652160.html b/boost/compute/transform_idp19652160.html new file mode 100644 index 00000000..3ec3c1dd --- /dev/null +++ b/boost/compute/transform_idp19652160.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp20052288.html b/boost/compute/transform_idp20052288.html new file mode 100644 index 00000000..942bddf0 --- /dev/null +++ b/boost/compute/transform_idp20052288.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp20061376.html b/boost/compute/transform_idp20061376.html new file mode 100644 index 00000000..9515c3c0 --- /dev/null +++ b/boost/compute/transform_idp20061376.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp20467856.html b/boost/compute/transform_idp20467856.html new file mode 100644 index 00000000..3dfe759e --- /dev/null +++ b/boost/compute/transform_idp20467856.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp20476944.html b/boost/compute/transform_idp20476944.html new file mode 100644 index 00000000..261d1e47 --- /dev/null +++ b/boost/compute/transform_idp20476944.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp23244976.html b/boost/compute/transform_idp23244976.html new file mode 100644 index 00000000..f0e20a78 --- /dev/null +++ b/boost/compute/transform_idp23244976.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp23254064.html b/boost/compute/transform_idp23254064.html new file mode 100644 index 00000000..955c4052 --- /dev/null +++ b/boost/compute/transform_idp23254064.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp24451536.html b/boost/compute/transform_idp24451536.html new file mode 100644 index 00000000..5f53518c --- /dev/null +++ b/boost/compute/transform_idp24451536.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp24460624.html b/boost/compute/transform_idp24460624.html new file mode 100644 index 00000000..8a32cb5b --- /dev/null +++ b/boost/compute/transform_idp24460624.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp24689552.html b/boost/compute/transform_idp24689552.html new file mode 100644 index 00000000..422ac4f5 --- /dev/null +++ b/boost/compute/transform_idp24689552.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp24698640.html b/boost/compute/transform_idp24698640.html new file mode 100644 index 00000000..abb2b63f --- /dev/null +++ b/boost/compute/transform_idp24698640.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp24891280.html b/boost/compute/transform_idp24891280.html new file mode 100644 index 00000000..8c54cf3a --- /dev/null +++ b/boost/compute/transform_idp24891280.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp24900368.html b/boost/compute/transform_idp24900368.html new file mode 100644 index 00000000..1a094e94 --- /dev/null +++ b/boost/compute/transform_idp24900368.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp26024080.html b/boost/compute/transform_idp26024080.html new file mode 100644 index 00000000..e270b32c --- /dev/null +++ b/boost/compute/transform_idp26024080.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp26033168.html b/boost/compute/transform_idp26033168.html new file mode 100644 index 00000000..77b5e1fe --- /dev/null +++ b/boost/compute/transform_idp26033168.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp27787712.html b/boost/compute/transform_idp27787712.html new file mode 100644 index 00000000..c1d91fe7 --- /dev/null +++ b/boost/compute/transform_idp27787712.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp27796800.html b/boost/compute/transform_idp27796800.html new file mode 100644 index 00000000..c2b880dd --- /dev/null +++ b/boost/compute/transform_idp27796800.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp29171200.html b/boost/compute/transform_idp29171200.html new file mode 100644 index 00000000..8b665a0f --- /dev/null +++ b/boost/compute/transform_idp29171200.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp29180288.html b/boost/compute/transform_idp29180288.html new file mode 100644 index 00000000..79b467de --- /dev/null +++ b/boost/compute/transform_idp29180288.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp30325440.html b/boost/compute/transform_idp30325440.html new file mode 100644 index 00000000..1eb115e7 --- /dev/null +++ b/boost/compute/transform_idp30325440.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp30334528.html b/boost/compute/transform_idp30334528.html new file mode 100644 index 00000000..9644642a --- /dev/null +++ b/boost/compute/transform_idp30334528.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp31544528.html b/boost/compute/transform_idp31544528.html new file mode 100644 index 00000000..634358c1 --- /dev/null +++ b/boost/compute/transform_idp31544528.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp31553616.html b/boost/compute/transform_idp31553616.html new file mode 100644 index 00000000..eb03ab1d --- /dev/null +++ b/boost/compute/transform_idp31553616.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp35705808.html b/boost/compute/transform_idp35705808.html new file mode 100644 index 00000000..50b8ed9b --- /dev/null +++ b/boost/compute/transform_idp35705808.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp35714896.html b/boost/compute/transform_idp35714896.html new file mode 100644 index 00000000..020a3896 --- /dev/null +++ b/boost/compute/transform_idp35714896.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp38692400.html b/boost/compute/transform_idp38692400.html new file mode 100644 index 00000000..8e4fc8cc --- /dev/null +++ b/boost/compute/transform_idp38692400.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp38701488.html b/boost/compute/transform_idp38701488.html new file mode 100644 index 00000000..512cf052 --- /dev/null +++ b/boost/compute/transform_idp38701488.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp39969328.html b/boost/compute/transform_idp39969328.html new file mode 100644 index 00000000..a43be999 --- /dev/null +++ b/boost/compute/transform_idp39969328.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp39978416.html b/boost/compute/transform_idp39978416.html new file mode 100644 index 00000000..114d7251 --- /dev/null +++ b/boost/compute/transform_idp39978416.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp43990432.html b/boost/compute/transform_idp43990432.html new file mode 100644 index 00000000..6da46b6b --- /dev/null +++ b/boost/compute/transform_idp43990432.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp43999520.html b/boost/compute/transform_idp43999520.html new file mode 100644 index 00000000..a377c731 --- /dev/null +++ b/boost/compute/transform_idp43999520.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp44934256.html b/boost/compute/transform_idp44934256.html new file mode 100644 index 00000000..2b964a33 --- /dev/null +++ b/boost/compute/transform_idp44934256.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp44943344.html b/boost/compute/transform_idp44943344.html new file mode 100644 index 00000000..83bd3d67 --- /dev/null +++ b/boost/compute/transform_idp44943344.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp46552448.html b/boost/compute/transform_idp46552448.html new file mode 100644 index 00000000..c6563d1a --- /dev/null +++ b/boost/compute/transform_idp46552448.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp46561536.html b/boost/compute/transform_idp46561536.html new file mode 100644 index 00000000..ef3eeb06 --- /dev/null +++ b/boost/compute/transform_idp46561536.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp49611792.html b/boost/compute/transform_idp49611792.html new file mode 100644 index 00000000..83dfa22d --- /dev/null +++ b/boost/compute/transform_idp49611792.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryOperator> 
+  OutputIterator 
+  transform(InputIterator first, InputIterator last, OutputIterator result, 
+            UnaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first, last) using transform and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_idp49620880.html b/boost/compute/transform_idp49620880.html new file mode 100644 index 00000000..aec99eb1 --- /dev/null +++ b/boost/compute/transform_idp49620880.html @@ -0,0 +1,50 @@ + + + +Function template transform + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform

+

boost::compute::transform

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryOperator> 
+  OutputIterator 
+  transform(InputIterator1 first1, InputIterator1 last1, 
+            InputIterator2 first2, OutputIterator result, BinaryOperator op, 
+            command_queue & queue = system::default_queue());
+
+

Description

+

Transforms the elements in the range [first1, last1) and first2 using op and stores the results in the range beginning at result.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_iterator.html b/boost/compute/transform_iterator.html index c3ca641f..0347dd6d 100644 --- a/boost/compute/transform_iterator.html +++ b/boost/compute/transform_iterator.html @@ -34,50 +34,50 @@ typedef UnaryFunction unary_function; // construct/copy/destruct - transform_iterator(InputIterator, UnaryFunction); - transform_iterator(const transform_iterator< InputIterator, UnaryFunction > &); + transform_iterator(InputIterator, UnaryFunction); + transform_iterator(const transform_iterator< InputIterator, UnaryFunction > &); transform_iterator< InputIterator, UnaryFunction > & - operator=(const transform_iterator< InputIterator, UnaryFunction > &); - ~transform_iterator(); + operator=(const transform_iterator< InputIterator, UnaryFunction > &); + ~transform_iterator(); - // public member functions - size_t get_index() const; - const buffer & get_buffer() const; + // public member functions + size_t get_index() const; + const buffer & get_buffer() const; template<typename IndexExpression> - unspecified operator[](const IndexExpression &) const; + unspecified operator[](const IndexExpression &) const; - // private member functions - reference dereference() const; + // private member functions + reference dereference() const; };
-

Description

+

Description

-

+

transform_iterator public construct/copy/destruct

    -
  1. transform_iterator(InputIterator iterator, UnaryFunction transform);
    2. -
  2. transform_iterator(const transform_iterator< InputIterator, UnaryFunction > & other);
    3. +
  3. transform_iterator(InputIterator iterator, UnaryFunction transform);
    4. +
  4. transform_iterator(const transform_iterator< InputIterator, UnaryFunction > & other);
  5. transform_iterator< InputIterator, UnaryFunction > & 
-operator=(const transform_iterator< InputIterator, UnaryFunction > & other);
    6. -
  6. ~transform_iterator();
    7. +operator=(const transform_iterator< InputIterator, UnaryFunction > & other); +
  7. ~transform_iterator();
-

-transform_iterator public member functions

+

+transform_iterator public member functions

    -
  1. size_t get_index() const;
    2. -
  2. const buffer & get_buffer() const;
    3. +
  3. size_t get_index() const;
    4. +
  4. const buffer & get_buffer() const;
  5. template<typename IndexExpression> 
-  unspecified operator[](const IndexExpression & expr) const;
    6. + unspecified operator[](const IndexExpression & expr) const;
-

-transform_iterator private member functions

-
  1. reference dereference() const;
+

+transform_iterator private member functions

+
  1. reference dereference() const;
diff --git a/boost/compute/transform_redu_idp19636944.html b/boost/compute/transform_redu_idp19636944.html new file mode 100644 index 00000000..2a522cd3 --- /dev/null +++ b/boost/compute/transform_redu_idp19636944.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp19647280.html b/boost/compute/transform_redu_idp19647280.html new file mode 100644 index 00000000..54050898 --- /dev/null +++ b/boost/compute/transform_redu_idp19647280.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp19675216.html b/boost/compute/transform_redu_idp19675216.html new file mode 100644 index 00000000..5edb39e6 --- /dev/null +++ b/boost/compute/transform_redu_idp19675216.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp19685552.html b/boost/compute/transform_redu_idp19685552.html new file mode 100644 index 00000000..cd2025f4 --- /dev/null +++ b/boost/compute/transform_redu_idp19685552.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp20084432.html b/boost/compute/transform_redu_idp20084432.html new file mode 100644 index 00000000..e23873f1 --- /dev/null +++ b/boost/compute/transform_redu_idp20084432.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp20094768.html b/boost/compute/transform_redu_idp20094768.html new file mode 100644 index 00000000..3f721014 --- /dev/null +++ b/boost/compute/transform_redu_idp20094768.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp20500016.html b/boost/compute/transform_redu_idp20500016.html new file mode 100644 index 00000000..e1edf531 --- /dev/null +++ b/boost/compute/transform_redu_idp20500016.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp20510352.html b/boost/compute/transform_redu_idp20510352.html new file mode 100644 index 00000000..16817b19 --- /dev/null +++ b/boost/compute/transform_redu_idp20510352.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp23277136.html b/boost/compute/transform_redu_idp23277136.html new file mode 100644 index 00000000..7d6d6c9c --- /dev/null +++ b/boost/compute/transform_redu_idp23277136.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp23287472.html b/boost/compute/transform_redu_idp23287472.html new file mode 100644 index 00000000..f0e42c49 --- /dev/null +++ b/boost/compute/transform_redu_idp23287472.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp24483680.html b/boost/compute/transform_redu_idp24483680.html new file mode 100644 index 00000000..9526f605 --- /dev/null +++ b/boost/compute/transform_redu_idp24483680.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp24494016.html b/boost/compute/transform_redu_idp24494016.html new file mode 100644 index 00000000..bae9de99 --- /dev/null +++ b/boost/compute/transform_redu_idp24494016.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp24721712.html b/boost/compute/transform_redu_idp24721712.html new file mode 100644 index 00000000..da46bed1 --- /dev/null +++ b/boost/compute/transform_redu_idp24721712.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp24732048.html b/boost/compute/transform_redu_idp24732048.html new file mode 100644 index 00000000..9e856960 --- /dev/null +++ b/boost/compute/transform_redu_idp24732048.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp24923424.html b/boost/compute/transform_redu_idp24923424.html new file mode 100644 index 00000000..90db28c4 --- /dev/null +++ b/boost/compute/transform_redu_idp24923424.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp24933760.html b/boost/compute/transform_redu_idp24933760.html new file mode 100644 index 00000000..ac1ce260 --- /dev/null +++ b/boost/compute/transform_redu_idp24933760.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp26056240.html b/boost/compute/transform_redu_idp26056240.html new file mode 100644 index 00000000..052e1d23 --- /dev/null +++ b/boost/compute/transform_redu_idp26056240.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp26066576.html b/boost/compute/transform_redu_idp26066576.html new file mode 100644 index 00000000..7cd4bb2c --- /dev/null +++ b/boost/compute/transform_redu_idp26066576.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp27819856.html b/boost/compute/transform_redu_idp27819856.html new file mode 100644 index 00000000..b2727889 --- /dev/null +++ b/boost/compute/transform_redu_idp27819856.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp27830192.html b/boost/compute/transform_redu_idp27830192.html new file mode 100644 index 00000000..a24aa5ee --- /dev/null +++ b/boost/compute/transform_redu_idp27830192.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp29203344.html b/boost/compute/transform_redu_idp29203344.html new file mode 100644 index 00000000..014b5f07 --- /dev/null +++ b/boost/compute/transform_redu_idp29203344.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp29213680.html b/boost/compute/transform_redu_idp29213680.html new file mode 100644 index 00000000..f4164732 --- /dev/null +++ b/boost/compute/transform_redu_idp29213680.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp30357600.html b/boost/compute/transform_redu_idp30357600.html new file mode 100644 index 00000000..b49f3a58 --- /dev/null +++ b/boost/compute/transform_redu_idp30357600.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp30367936.html b/boost/compute/transform_redu_idp30367936.html new file mode 100644 index 00000000..0b92a3eb --- /dev/null +++ b/boost/compute/transform_redu_idp30367936.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp31576672.html b/boost/compute/transform_redu_idp31576672.html new file mode 100644 index 00000000..62bfcf77 --- /dev/null +++ b/boost/compute/transform_redu_idp31576672.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp31587008.html b/boost/compute/transform_redu_idp31587008.html new file mode 100644 index 00000000..3d7cc9ff --- /dev/null +++ b/boost/compute/transform_redu_idp31587008.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp35737952.html b/boost/compute/transform_redu_idp35737952.html new file mode 100644 index 00000000..9038b4db --- /dev/null +++ b/boost/compute/transform_redu_idp35737952.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp35748288.html b/boost/compute/transform_redu_idp35748288.html new file mode 100644 index 00000000..abb7c1eb --- /dev/null +++ b/boost/compute/transform_redu_idp35748288.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp38724560.html b/boost/compute/transform_redu_idp38724560.html new file mode 100644 index 00000000..d5ebc352 --- /dev/null +++ b/boost/compute/transform_redu_idp38724560.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp38734896.html b/boost/compute/transform_redu_idp38734896.html new file mode 100644 index 00000000..13640216 --- /dev/null +++ b/boost/compute/transform_redu_idp38734896.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp40001472.html b/boost/compute/transform_redu_idp40001472.html new file mode 100644 index 00000000..4d8231b0 --- /dev/null +++ b/boost/compute/transform_redu_idp40001472.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp40011808.html b/boost/compute/transform_redu_idp40011808.html new file mode 100644 index 00000000..b4d05a12 --- /dev/null +++ b/boost/compute/transform_redu_idp40011808.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp44022592.html b/boost/compute/transform_redu_idp44022592.html new file mode 100644 index 00000000..2c0db638 --- /dev/null +++ b/boost/compute/transform_redu_idp44022592.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp44032928.html b/boost/compute/transform_redu_idp44032928.html new file mode 100644 index 00000000..bcd31a27 --- /dev/null +++ b/boost/compute/transform_redu_idp44032928.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp44966416.html b/boost/compute/transform_redu_idp44966416.html new file mode 100644 index 00000000..165f0e1f --- /dev/null +++ b/boost/compute/transform_redu_idp44966416.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp44976752.html b/boost/compute/transform_redu_idp44976752.html new file mode 100644 index 00000000..85ebbdb4 --- /dev/null +++ b/boost/compute/transform_redu_idp44976752.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp46584608.html b/boost/compute/transform_redu_idp46584608.html new file mode 100644 index 00000000..7f47352c --- /dev/null +++ b/boost/compute/transform_redu_idp46584608.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp46594944.html b/boost/compute/transform_redu_idp46594944.html new file mode 100644 index 00000000..b342cab9 --- /dev/null +++ b/boost/compute/transform_redu_idp46594944.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp49643952.html b/boost/compute/transform_redu_idp49643952.html new file mode 100644 index 00000000..7c371342 --- /dev/null +++ b/boost/compute/transform_redu_idp49643952.html @@ -0,0 +1,51 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator, typename OutputIterator, 
+         typename UnaryTransformFunction, typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator first, InputIterator last, 
+                        OutputIterator result, 
+                        UnaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first, last) with the unary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/transform_redu_idp49654288.html b/boost/compute/transform_redu_idp49654288.html new file mode 100644 index 00000000..869591c2 --- /dev/null +++ b/boost/compute/transform_redu_idp49654288.html @@ -0,0 +1,52 @@ + + + +Function template transform_reduce + + + + + + + + +
+PrevUpHomeNext +
+
+
+
+

Function template transform_reduce

+

boost::compute::transform_reduce

+
+

Synopsis

+
// In header: <boost/compute/algorithm/transform_reduce.hpp>
+
+
+template<typename InputIterator1, typename InputIterator2, 
+         typename OutputIterator, typename BinaryTransformFunction, 
+         typename BinaryReduceFunction> 
+  void transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                        InputIterator2 first2, OutputIterator result, 
+                        BinaryTransformFunction transform_function, 
+                        BinaryReduceFunction reduce_function, 
+                        command_queue & queue = system::default_queue());
+
+

Description

+

Transforms each value in the range [first1, last1) and the range beginning at first2 with the binary transform_function and then reduces each transformed value with reduce_function.

+
+
+ + + +
Copyright © 2013 Kyle Lutz

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/boost/compute/type_name.html b/boost/compute/type_name.html index 689c2a5e..3f9462f9 100644 --- a/boost/compute/type_name.html +++ b/boost/compute/type_name.html @@ -25,7 +25,7 @@ template<typename T> const char * type_name();
-

Description

+

Description

Returns the OpenCL type name for the type T as a string.

For example: 

type_name<float>() == "float"
diff --git a/boost/compute/uniform_real_distribution.html b/boost/compute/uniform_real_distribution.html
index fb86d30e..18089726 100644
--- a/boost/compute/uniform_real_distribution.html
+++ b/boost/compute/uniform_real_distribution.html
@@ -29,35 +29,35 @@
   typedef RealType result_type;
 
   // construct/copy/destruct
-  uniform_real_distribution(RealType = 0.f, RealType = 1.f);
-  ~uniform_real_distribution();
+  uniform_real_distribution(RealType = 0.f, RealType = 1.f);
+  ~uniform_real_distribution();
 
-  // public member functions
-  result_type a() const;
-  result_type b() const;
+  // public member functions
+  result_type a() const;
+  result_type b() const;
   template<typename OutputIterator, typename Generator> 
-    void fill(OutputIterator, OutputIterator, Generator &, command_queue &);
+    void fill(OutputIterator, OutputIterator, Generator &, command_queue &);
 };
-

Description

+

Description

-

+

uniform_real_distribution public construct/copy/destruct

    -
  1. uniform_real_distribution(RealType a = 0.f, RealType b = 1.f);
    2. -
  2. ~uniform_real_distribution();
    3. +
  3. uniform_real_distribution(RealType a = 0.f, RealType b = 1.f);
    4. +
  4. ~uniform_real_distribution();
-

-uniform_real_distribution public member functions

+

+uniform_real_distribution public member functions

    -
  1. result_type a() const;
    2. -
  2. result_type b() const;
    3. +
  3. result_type a() const;
    4. +
  4. result_type b() const;
  5. template<typename OutputIterator, typename Generator> 
-  void fill(OutputIterator first, OutputIterator last, Generator & g, 
+  void fill(OutputIterator first, OutputIterator last, Generator & g, 
             command_queue & queue);
diff --git a/boost/compute/upper_bound.html b/boost/compute/upper_bound.html index bd0e6fb4..76d190a6 100644 --- a/boost/compute/upper_bound.html +++ b/boost/compute/upper_bound.html @@ -6,12 +6,12 @@ - - + +
-PrevUpHomeNext +PrevUpHomeNext
@@ -28,7 +28,7 @@ upper_bound(InputIterator first, InputIterator last, const T & value, command_queue & queue = system::default_queue());
-

Description

+

Description

Returns an iterator pointing to the first element in the sorted range [first, last) that is not less than or equal to value.

@@ -42,7 +42,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/valarray.html b/boost/compute/valarray.html index 02d5da88..9b7bdc01 100644 --- a/boost/compute/valarray.html +++ b/boost/compute/valarray.html @@ -26,77 +26,77 @@ class valarray { public: // construct/copy/destruct - explicit valarray(const context & = system::default_context()); - explicit valarray(size_t, const context & = system::default_context()); - valarray(const T &, size_t, const context & = system::default_context()); - valarray(const T *, size_t, const context & = system::default_context()); - valarray(const valarray< T > &); - valarray(const std::valarray< T > &, + explicit valarray(const context & = system::default_context()); + explicit valarray(size_t, const context & = system::default_context()); + valarray(const T &, size_t, const context & = system::default_context()); + valarray(const T *, size_t, const context & = system::default_context()); + valarray(const valarray< T > &); + valarray(const std::valarray< T > &, const context & = system::default_context()); - valarray< T > & operator=(const valarray< T > &); - valarray< T > & operator=(const std::valarray< T > &); - ~valarray(); + valarray< T > & operator=(const valarray< T > &); + valarray< T > & operator=(const std::valarray< T > &); + ~valarray(); - // public member functions - size_t size() const; - void resize(size_t, T = T()); - unspecified operator[](size_t); - unspecified operator[](size_t) const; - T() min() const; - T() max() const; - T sum() const; - template<typename UnaryFunction> valarray< T > apply(UnaryFunction) const; - const buffer & get_buffer() const; + // public member functions + size_t size() const; + void resize(size_t, T = T()); + unspecified operator[](size_t); + unspecified operator[](size_t) const; + T() min() const; + T() max() const; + T sum() const; + template<typename UnaryFunction> valarray< T > apply(UnaryFunction) const; + const buffer & get_buffer() const; - // private member functions - buffer_iterator< T > begin() const; - buffer_iterator< T > end() const; + // private member functions + buffer_iterator< T > begin() const; + buffer_iterator< T > end() const; };
-

Description

+

Description

-

+

valarray public construct/copy/destruct

    -
  1. explicit valarray(const context & context = system::default_context());
    2. -
  2. explicit valarray(size_t size, 
+
  3. explicit valarray(const context & context = system::default_context());
    4. 
+
  4. explicit valarray(size_t size, 
                   const context & context = system::default_context());
    5. 
-
  5. valarray(const T & value, size_t size, 
+
  6. valarray(const T & value, size_t size, 
          const context & context = system::default_context());
    7. 
-
  7. valarray(const T * values, size_t size, 
+
  8. valarray(const T * values, size_t size, 
          const context & context = system::default_context());
    9. 
-
  9. valarray(const valarray< T > & other);
    10. 
-
  10. valarray(const std::valarray< T > & valarray, 
+
  11. valarray(const valarray< T > & other);
    12. 
+
  12. valarray(const std::valarray< T > & valarray, 
          const context & context = system::default_context());
    13. 
-
  13. valarray< T > & operator=(const valarray< T > & other);
    14. 
-
  14. valarray< T > & operator=(const std::valarray< T > & valarray);
    15. 
-
  15. ~valarray();
    16. 
+
  16. valarray< T > & operator=(const valarray< T > & other);
    17. 
+
  17. valarray< T > & operator=(const std::valarray< T > & valarray);
    18. 
+
  18. ~valarray();
    19.
-

-valarray public member functions

+

+valarray public member functions

    -
  1. size_t size() const;
    2. -
  2. void resize(size_t size, T value = T());
    3. -
  3. unspecified operator[](size_t index);
    4. -
  4. unspecified operator[](size_t index) const;
    5. -
  5. T() min() const;
    6. -
  6. T() max() const;
    7. -
  7. T sum() const;
    8. +
  8. size_t size() const;
    9. +
  9. void resize(size_t size, T value = T());
    10. +
  10. unspecified operator[](size_t index);
    11. +
  11. unspecified operator[](size_t index) const;
    12. +
  12. T() min() const;
    13. +
  13. T() max() const;
    14. +
  14. T sum() const;
  15. template<typename UnaryFunction> 
-  valarray< T > apply(UnaryFunction function) const;
    16. -
  16. const buffer & get_buffer() const;
    17. + valarray< T > apply(UnaryFunction function) const; +
  17. const buffer & get_buffer() const;
-

-valarray private member functions

+

+valarray private member functions

    -
  1. buffer_iterator< T > begin() const;
    2. -
  2. buffer_iterator< T > end() const;
    3. +
  3. buffer_iterator< T > begin() const;
    4. +
  4. buffer_iterator< T > end() const;
diff --git a/boost/compute/vector.html b/boost/compute/vector.html index 62f323bb..8c1c20d5 100644 --- a/boost/compute/vector.html +++ b/boost/compute/vector.html @@ -40,173 +40,173 @@ typedef std::reverse_iterator< const_iterator > const_reverse_iterator; // construct/copy/destruct - explicit vector(const context & = system::default_context()); - explicit vector(size_type, const context & = system::default_context()); - vector(size_type, const T &, command_queue & = system::default_queue()); + explicit vector(const context & = system::default_context()); + explicit vector(size_type, const context & = system::default_context()); + vector(size_type, const T &, command_queue & = system::default_queue()); template<typename InputIterator> - vector(InputIterator, InputIterator, + vector(InputIterator, InputIterator, command_queue & = system::default_queue()); - vector(const vector< T > &); - vector(vector< T > &&); + vector(const vector< T > &); + vector(vector< T > &&); template<typename OtherAlloc> - vector(const std::vector< T, OtherAlloc > &, + vector(const std::vector< T, OtherAlloc > &, command_queue & = system::default_queue()); - vector(std::initializer_list< T >, + vector(std::initializer_list< T >, command_queue & = system::default_queue()); - vector< T > & operator=(const vector< T > &); + vector< T > & operator=(const vector< T > &); template<typename OtherAlloc> - vector< T > & operator=(const std::vector< T, OtherAlloc > &); - ~vector(); + vector< T > & operator=(const std::vector< T, OtherAlloc > &); + ~vector(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - size_type size() const; - size_type max_size() const; - void resize(size_type, command_queue &); - void resize(size_type); - bool empty() const; - size_type capacity() const; - void reserve(size_type, command_queue &); - void reserve(size_type); - void shrink_to_fit(command_queue &); - void shrink_to_fit(); - reference operator[](size_type); - const_reference operator[](size_type) const; - reference at(size_type); - const_reference at(size_type) const; - reference front(); - const_reference front() const; - reference back(); - const_reference back() const; + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + size_type size() const; + size_type max_size() const; + void resize(size_type, command_queue &); + void resize(size_type); + bool empty() const; + size_type capacity() const; + void reserve(size_type, command_queue &); + void reserve(size_type); + void shrink_to_fit(command_queue &); + void shrink_to_fit(); + reference operator[](size_type); + const_reference operator[](size_type) const; + reference at(size_type); + const_reference at(size_type) const; + reference front(); + const_reference front() const; + reference back(); + const_reference back() const; template<typename InputIterator> - void assign(InputIterator, InputIterator, command_queue &); - template<typename InputIterator> void assign(InputIterator, InputIterator); - void assign(size_type, const T &, command_queue &); - void assign(size_type, const T &); - void push_back(const T &, command_queue &); - void push_back(const T &); - void pop_back(command_queue &); - void pop_back(); - iterator insert(iterator, const T &, command_queue &); - iterator insert(iterator, const T &); - void insert(iterator, size_type, const T &, command_queue &); - void insert(iterator, size_type, const T &); + void assign(InputIterator, InputIterator, command_queue &); + template<typename InputIterator> void assign(InputIterator, InputIterator); + void assign(size_type, const T &, command_queue &); + void assign(size_type, const T &); + void push_back(const T &, command_queue &); + void push_back(const T &); + void pop_back(command_queue &); + void pop_back(); + iterator insert(iterator, const T &, command_queue &); + iterator insert(iterator, const T &); + void insert(iterator, size_type, const T &, command_queue &); + void insert(iterator, size_type, const T &); template<typename InputIterator> - void insert(iterator, InputIterator, InputIterator, command_queue &); + void insert(iterator, InputIterator, InputIterator, command_queue &); template<typename InputIterator> - void insert(iterator, InputIterator, InputIterator); - iterator erase(iterator, command_queue &); - iterator erase(iterator); - iterator erase(iterator, iterator, command_queue &); - iterator erase(iterator, iterator); - void swap(vector< T > &); - void clear(); - allocator_type get_allocator() const; - const buffer & get_buffer() const; + void insert(iterator, InputIterator, InputIterator); + iterator erase(iterator, command_queue &); + iterator erase(iterator); + iterator erase(iterator, iterator, command_queue &); + iterator erase(iterator, iterator); + void swap(vector< T > &); + void clear(); + allocator_type get_allocator() const; + const buffer & get_buffer() const; };
-

Description

+

Description

-

+

vector public construct/copy/destruct

    -
  1. explicit vector(const context & context = system::default_context());
    2. -
  2. explicit vector(size_type count, 
+
  3. explicit vector(const context & context = system::default_context());
    4. 
+
  4. explicit vector(size_type count, 
                 const context & context = system::default_context());
    5. 
-
  5. vector(size_type count, const T & value, 
+
  6. vector(size_type count, const T & value, 
        command_queue & queue = system::default_queue());
    7. 
 
  7. template<typename InputIterator> 
-  vector(InputIterator first, InputIterator last, 
+  vector(InputIterator first, InputIterator last, 
          command_queue & queue = system::default_queue());
    8. 
-
  8. vector(const vector< T > & other);
    9. 
-
  9. vector(vector< T > && vector);
    10. 
+
  10. vector(const vector< T > & other);
    11. 
+
  11. vector(vector< T > && vector);
    12. 
 
  12. template<typename OtherAlloc> 
-  vector(const std::vector< T, OtherAlloc > & vector, 
+  vector(const std::vector< T, OtherAlloc > & vector, 
          command_queue & queue = system::default_queue());
    13. 
-
  13. vector(std::initializer_list< T > list, 
+
  14. vector(std::initializer_list< T > list, 
        command_queue & queue = system::default_queue());
    15. 
-
  15. vector< T > & operator=(const vector< T > & other);
    16. 
+
  16. vector< T > & operator=(const vector< T > & other);
    17. 
 
  17. template<typename OtherAlloc> 
-  vector< T > & operator=(const std::vector< T, OtherAlloc > & vector);
    18. 
-
  18. ~vector();
    19. 
+  vector< T > & operator=(const std::vector< T, OtherAlloc > & vector);
    19. 
+
  19. ~vector();
    20.
-

-vector public member functions

+

+vector public member functions

    -
  1. iterator begin();
    2. -
  2. const_iterator begin() const;
    3. -
  3. const_iterator cbegin() const;
    4. -
  4. iterator end();
    5. -
  5. const_iterator end() const;
    6. -
  6. const_iterator cend() const;
    7. -
  7. reverse_iterator rbegin();
    8. -
  8. const_reverse_iterator rbegin() const;
    9. -
  9. const_reverse_iterator crbegin() const;
    10. -
  10. reverse_iterator rend();
    11. -
  11. const_reverse_iterator rend() const;
    12. -
  12. const_reverse_iterator crend() const;
    13. -
  13. size_type size() const;
    14. -
  14. size_type max_size() const;
    15. -
  15. void resize(size_type size, command_queue & queue);
    16. -
  16. void resize(size_type size);
    17. -
  17. bool empty() const;
    18. -
  18. size_type capacity() const;
    19. -
  19. void reserve(size_type size, command_queue & queue);
    20. -
  20. void reserve(size_type size);
    21. -
  21. void shrink_to_fit(command_queue & queue);
    22. -
  22. void shrink_to_fit();
    23. -
  23. reference operator[](size_type index);
    24. -
  24. const_reference operator[](size_type index) const;
    25. -
  25. reference at(size_type index);
    26. -
  26. const_reference at(size_type index) const;
    27. -
  27. reference front();
    28. -
  28. const_reference front() const;
    29. -
  29. reference back();
    30. -
  30. const_reference back() const;
    31. +
  31. iterator begin();
    32. +
  32. const_iterator begin() const;
    33. +
  33. const_iterator cbegin() const;
    34. +
  34. iterator end();
    35. +
  35. const_iterator end() const;
    36. +
  36. const_iterator cend() const;
    37. +
  37. reverse_iterator rbegin();
    38. +
  38. const_reverse_iterator rbegin() const;
    39. +
  39. const_reverse_iterator crbegin() const;
    40. +
  40. reverse_iterator rend();
    41. +
  41. const_reverse_iterator rend() const;
    42. +
  42. const_reverse_iterator crend() const;
    43. +
  43. size_type size() const;
    44. +
  44. size_type max_size() const;
    45. +
  45. void resize(size_type size, command_queue & queue);
    46. +
  46. void resize(size_type size);
    47. +
  47. bool empty() const;
    48. +
  48. size_type capacity() const;
    49. +
  49. void reserve(size_type size, command_queue & queue);
    50. +
  50. void reserve(size_type size);
    51. +
  51. void shrink_to_fit(command_queue & queue);
    52. +
  52. void shrink_to_fit();
    53. +
  53. reference operator[](size_type index);
    54. +
  54. const_reference operator[](size_type index) const;
    55. +
  55. reference at(size_type index);
    56. +
  56. const_reference at(size_type index) const;
    57. +
  57. reference front();
    58. +
  58. const_reference front() const;
    59. +
  59. reference back();
    60. +
  60. const_reference back() const;
  61. template<typename InputIterator> 
-  void assign(InputIterator first, InputIterator last, command_queue & queue);
    62. + void assign(InputIterator first, InputIterator last, command_queue & queue); 
  62. template<typename InputIterator> 
-  void assign(InputIterator first, InputIterator last);
    63. -
  63. void assign(size_type n, const T & value, command_queue & queue);
    64. -
  64. void assign(size_type n, const T & value);
    65. -
  65. void push_back(const T & value, command_queue & queue);
    66. -
  66. void push_back(const T & value);
    67. -
  67. void pop_back(command_queue & queue);
    68. -
  68. void pop_back();
    69. -
  69. iterator insert(iterator position, const T & value, command_queue & queue);
    70. -
  70. iterator insert(iterator position, const T & value);
    71. -
  71. void insert(iterator position, size_type count, const T & value, 
+  void assign(InputIterator first, InputIterator last);
    72. +
  72. void assign(size_type n, const T & value, command_queue & queue);
    73. +
  73. void assign(size_type n, const T & value);
    74. +
  74. void push_back(const T & value, command_queue & queue);
    75. +
  75. void push_back(const T & value);
    76. +
  76. void pop_back(command_queue & queue);
    77. +
  77. void pop_back();
    78. +
  78. iterator insert(iterator position, const T & value, command_queue & queue);
    79. +
  79. iterator insert(iterator position, const T & value);
    80. +
  80. void insert(iterator position, size_type count, const T & value, 
             command_queue & queue);
    81. -
  81. void insert(iterator position, size_type count, const T & value);
    82. +
  82. void insert(iterator position, size_type count, const T & value);
  83. template<typename InputIterator> 
-  void insert(iterator position, InputIterator first, InputIterator last, 
+  void insert(iterator position, InputIterator first, InputIterator last, 
               command_queue & queue);
  84. template<typename InputIterator> 
-  void insert(iterator position, InputIterator first, InputIterator last);
    85. -
  85. iterator erase(iterator position, command_queue & queue);
    86. -
  86. iterator erase(iterator position);
    87. -
  87. iterator erase(iterator first, iterator last, command_queue & queue);
    88. -
  88. iterator erase(iterator first, iterator last);
    89. -
  89. void swap(vector< T > & other);
    90. -
  90. void clear();
    91. -
  91. allocator_type get_allocator() const;
    92. + void insert(iterator position, InputIterator first, InputIterator last); +
  92. iterator erase(iterator position, command_queue & queue);
    93. +
  93. iterator erase(iterator position);
    94. +
  94. iterator erase(iterator first, iterator last, command_queue & queue);
    95. +
  95. iterator erase(iterator first, iterator last);
    96. +
  96. void swap(vector< T > & other);
    97. +
  97. void clear();
    98. +
  98. allocator_type get_allocator() const;
  99. -
    const buffer & get_buffer() const;
    Returns the buffer.
    100. +
    const buffer & get_buffer() const;
    Returns the buffer.
diff --git a/boost/compute/vector_size.html b/boost/compute/vector_size.html index 2d4adee5..efdccc31 100644 --- a/boost/compute/vector_size.html +++ b/boost/compute/vector_size.html @@ -26,7 +26,7 @@ struct vector_size { };
-

Description

+

Description

Meta-function returning the size (number of components) of a vector type T. For scalar types this function returns 1.

For example, 

vector_size<float>::value == 1
diff --git a/boost/compute/wait_list.html b/boost/compute/wait_list.html
new file mode 100644
index 00000000..8efbc17b
--- /dev/null
+++ b/boost/compute/wait_list.html
@@ -0,0 +1,106 @@
+
+
+
+Class wait_list
+
+
+
+
+
+
+
+
+

+PrevUpHomeNext
+

+

+

+

+
Class wait_list

+
boost::compute::wait_list — Stores a list of events. 

+

+
Synopsis

+
// In header: <boost/compute/wait_list.hpp>
+
+
+class wait_list {
+public:
+  // construct/copy/destruct
+  wait_list();
+  wait_list(const wait_list &);
+  wait_list & operator=(const wait_list &);
+  ~wait_list();
+
+  // public member functions
+  bool empty() const;
+  uint_ size() const;
+  void clear();
+  const cl_event * get_event_ptr() const;
+  void insert(const event &);
+  template<typename T> void insert(const future< T > &);
+  void wait();
+};

+

+
Description

+
See Also:

+
event, future<T> 

+

+

+

+

+wait_list 
+        public
+       construct/copy/destruct

+
    
+
  1. 
+
    wait_list();
    Creates an empty wait-list. 
    2. 
+
  2. 
+
    wait_list(const wait_list & other);
    Creates a new wait-list as a copy of other. 
    3. 
+
  3. 
+
    wait_list & operator=(const wait_list & other);
    Copies the events in the wait-list from other. 
    4. 
+
  4. 
+
    ~wait_list();
    Destroys the wait-list. 
    5. 
+

+

+

+

+wait_list public member functions

+
    
+
  1. 
+
    bool empty() const;
    Returns true if the wait-list is empty. 
    2. 
+
  2. 
+
    uint_ size() const;
    Returns the number of events in the wait-list. 
    3. 
+
  3. 
+
    void clear();
    Removes all of the events from the wait-list. 
    4. 
+
  4. 
+
    const cl_event * get_event_ptr() const;
    
+
    Returns a cl_event pointer to the first event in the wait-list. Returns 0 if the wait-list is empty.
    
+
    This can be used to pass the wait-list to OpenCL C functions which expect a cl_event pointer to refer to a list of events. 
    
+
    5. 
+
  5. 
+
    void insert(const event & event);
    Inserts event into the wait-list. 
    6. 
+
  6. 
+
    template<typename T> void insert(const future< T > & future);
    Inserts the event from future into the wait-list. 
    7. 
+
  7. 
+
    void wait();
    
+
    Blocks until the events in the wait-list have completed.
    
+
    Does nothing if the wait-list is empty. 
    
+
    8. 
+

+

+

+

+
+
+
+
Copyright © 2013 Kyle Lutz

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/boost/compute/zip_iterator.html b/boost/compute/zip_iterator.html
index b85d2cd8..a6b91d14 100644
--- a/boost/compute/zip_iterator.html
+++ b/boost/compute/zip_iterator.html
@@ -33,59 +33,59 @@
   typedef IteratorTuple               iterator_tuple; 
 
   // construct/copy/destruct
-  zip_iterator(IteratorTuple);
-  zip_iterator(const zip_iterator< IteratorTuple > &);
+  zip_iterator(IteratorTuple);
+  zip_iterator(const zip_iterator< IteratorTuple > &);
   zip_iterator< IteratorTuple > & 
-  operator=(const zip_iterator< IteratorTuple > &);
-  ~zip_iterator();
+  operator=(const zip_iterator< IteratorTuple > &);
+  ~zip_iterator();
 
-  // public member functions
-  const IteratorTuple & get_iterator_tuple() const;
+  // public member functions
+  const IteratorTuple & get_iterator_tuple() const;
   template<typename IndexExpression> 
-    unspecified operator[](const IndexExpression &) const;
+    unspecified operator[](const IndexExpression &) const;
 
-  // private member functions
-  reference dereference() const;
-  bool equal(const zip_iterator< IteratorTuple > &) const;
-  void increment();
-  void decrement();
-  void advance(difference_type);
-  difference_type distance_to(const zip_iterator< IteratorTuple > &) const;
+  // private member functions
+  reference dereference() const;
+  bool equal(const zip_iterator< IteratorTuple > &) const;
+  void increment();
+  void decrement();
+  void advance(difference_type);
+  difference_type distance_to(const zip_iterator< IteratorTuple > &) const;
 };
-

Description

+

Description

-

+

zip_iterator public construct/copy/destruct

    -
  1. zip_iterator(IteratorTuple iterators);
    2. -
  2. zip_iterator(const zip_iterator< IteratorTuple > & other);
    3. +
  3. zip_iterator(IteratorTuple iterators);
    4. +
  4. zip_iterator(const zip_iterator< IteratorTuple > & other);
  5. zip_iterator< IteratorTuple > & 
-operator=(const zip_iterator< IteratorTuple > & other);
    6. -
  6. ~zip_iterator();
    7. +operator=(const zip_iterator< IteratorTuple > & other); +
  7. ~zip_iterator();
-

-zip_iterator public member functions

+

+zip_iterator public member functions

    -
  1. const IteratorTuple & get_iterator_tuple() const;
    2. +
  2. const IteratorTuple & get_iterator_tuple() const;
  3. template<typename IndexExpression> 
-  unspecified operator[](const IndexExpression & expr) const;
    4. + unspecified operator[](const IndexExpression & expr) const;
-

-zip_iterator private member functions

+

+zip_iterator private member functions

    -
  1. reference dereference() const;
    2. -
  2. bool equal(const zip_iterator< IteratorTuple > & other) const;
    3. -
  3. void increment();
    4. -
  4. void decrement();
    5. -
  5. void advance(difference_type n);
    6. -
  6. difference_type distance_to(const zip_iterator< IteratorTuple > & other) const;
    7. +
  7. reference dereference() const;
    8. +
  8. bool equal(const zip_iterator< IteratorTuple > & other) const;
    9. +
  9. void increment();
    10. +
  10. void decrement();
    11. +
  11. void advance(difference_type n);
    12. +
  12. difference_type distance_to(const zip_iterator< IteratorTuple > & other) const;
diff --git a/boost_compute/advanced_topics.html b/boost_compute/advanced_topics.html index a9166bce..09e48618 100644 --- a/boost_compute/advanced_topics.html +++ b/boost_compute/advanced_topics.html @@ -46,7 +46,7 @@

The Boost Compute library provides a few different ways to create custom - functions that can be passed to the provided algorithms such as transform() and reduce(). + functions that can be passed to the provided algorithms such as transform() and reduce().

The most basic method is to provide the raw source code for a function: diff --git a/boost_compute/faq.html b/boost_compute/faq.html index 7422123a..2a72c54c 100644 --- a/boost_compute/faq.html +++ b/boost_compute/faq.html @@ -6,11 +6,11 @@ - +

-PrevUpHome +PrevUpHome

@@ -170,7 +170,7 @@
-PrevUpHome +PrevUpHome
diff --git a/boost_compute/gettingstarted.html b/boost_compute/gettingstarted.html index 1e48ab26..9e101c49 100644 --- a/boost_compute/gettingstarted.html +++ b/boost_compute/gettingstarted.html @@ -97,8 +97,8 @@ On top of the core layer is a partial implementation of the C++ standard library providing common containers (e.g. vector<T>, array<T, N>) along - with common algorithms (e.g. transform() - and sort()). + with common algorithms (e.g. transform() + and sort()).

The library also provides number of "fancy" iterators (e.g. transform_iterator and diff --git a/boost_compute/porting_guide.html b/boost_compute/porting_guide.html index d16deb81..1f061ac7 100644 --- a/boost_compute/porting_guide.html +++ b/boost_compute/porting_guide.html @@ -82,7 +82,7 @@

- buffer::get_info<T>() + buffer::get_info<T>()

@@ -126,7 +126,7 @@

- command_queue::get_info<T>() + command_queue::get_info<T>()

@@ -138,7 +138,7 @@

- command_queue::enqueue_read_buffer() + command_queue::enqueue_read_buffer()

@@ -150,7 +150,7 @@

- command_queue::enqueue_write_buffer() + command_queue::enqueue_write_buffer()

@@ -162,7 +162,7 @@

- command_queue::enqueue_copy_buffer() + command_queue::enqueue_copy_buffer()

@@ -174,7 +174,7 @@

- command_queue::enqueue_nd_range_kernel() + command_queue::enqueue_nd_range_kernel()

@@ -186,7 +186,7 @@

- command_queue::enqueue_task() + command_queue::enqueue_task()

@@ -198,7 +198,7 @@

- command_queue::enqueue_barrier() + command_queue::enqueue_barrier()

@@ -210,7 +210,7 @@

- command_queue::enqueue_marker() + command_queue::enqueue_marker()

@@ -222,7 +222,7 @@

- command_queue::flush() + command_queue::flush()

@@ -234,7 +234,7 @@

- command_queue::finish() + command_queue::finish()

@@ -278,7 +278,7 @@

- context::get_info<T>() + context::get_info<T>()

@@ -298,7 +298,7 @@

- device::get_info<T>() + device::get_info<T>()

@@ -330,7 +330,7 @@

- event::get_info<T>() + event::get_info<T>()

@@ -342,7 +342,7 @@

- event::get_profiling_info<T>() + event::get_profiling_info<T>()

@@ -354,7 +354,7 @@

- boost::compute::wait_list::wait() + wait_list::wait()

@@ -398,7 +398,7 @@

- kernel::get_info<T>() + kernel::get_info<T>()

@@ -410,7 +410,7 @@

- kernel::get_arg_info<T>() + kernel::get_arg_info<T>()

@@ -422,7 +422,7 @@

- kernel::get_work_group_info<T>() + kernel::get_work_group_info<T>()

@@ -434,7 +434,7 @@

- kernel::set_arg() + kernel::set_arg()

@@ -454,7 +454,7 @@

- platform::devices() + platform::devices()

@@ -466,7 +466,7 @@

- platform::get_info<T>() + platform::get_info<T>()

@@ -478,7 +478,7 @@

- platform::get_extension_function_address() + platform::get_extension_function_address()

@@ -490,7 +490,7 @@

- platform::unload_compiler() + platform::unload_compiler()

@@ -510,7 +510,7 @@

- program::create_with_source() + program::create_with_source()

@@ -522,7 +522,7 @@

- program::create_with_binary() + program::create_with_binary()

@@ -546,7 +546,7 @@

- program::get_info<T>() + program::get_info<T>()

@@ -558,7 +558,7 @@

- program::build() + program::build()

@@ -578,7 +578,87 @@

- system::platforms() + system::platforms() +

+ + + + +

+ OpenGL Sharing +

+ +  + + + +

+ clCreateFromGLBuffer() +

+ + +

+ opengl_buffer::opengl_buffer() +

+ + + + +

+ clCreateFromGLRenderbuffer() +

+ + +

+ opengl_renderbuffer::opengl_renderbuffer() +

+ + + + +

+ clCreateFromGLTexture() +

+ + +

+ opengl_texture::opengl_texture() +

+ + + + +

+ clGetGLTextureInfo() +

+ + +

+ opengl_texture::get_texture_info<T>() +

+ + + + +

+ clEnqueueAcquireGLObjects() +

+ + +

+ opengl_enqueue_acquire_gl_objects() +

+ + + + +

+ clEnqueueReleaseGLObjects() +

+ + +

+ opengl_enqueue_release_gl_objects()

diff --git a/boost_compute/tutorial.html b/boost_compute/tutorial.html index 68ed25c8..20afa9ec 100644 --- a/boost_compute/tutorial.html +++ b/boost_compute/tutorial.html @@ -125,7 +125,7 @@

The following example shows how to calculate the square-root of a vector of floats on a compute device - using the transform() + using the transform() function.

@@ -188,7 +188,7 @@ The following example shows how to transfer a set of 3D points stored as an array of floats on the host the device and then calculate the sum of the point coordinates using the - accumulate() + accumulate() function. The sum is transferred to the host and the centroid computed by dividing by the total number of points.

diff --git a/compute/reference.html b/compute/reference.html index 24784760..b5cf83e8 100644 --- a/compute/reference.html +++ b/compute/reference.html @@ -7,11 +7,11 @@ - +
-PrevUpHomeNext +PrevUpHomeNext

@@ -99,6 +99,7 @@
Header <boost/compute/container/valarray.hpp>
Header <boost/compute/container/vector.hpp>
Header <boost/compute/context.hpp>
+
Header <boost/compute/interop/opengl/context.hpp>
Header <boost/compute/device.hpp>
Header <boost/compute/event.hpp>
Header <boost/compute/exception.hpp>
@@ -109,6 +110,11 @@
Header <boost/compute/functional.hpp>
Header <boost/compute/functional/field.hpp>
Header <boost/compute/functional/get.hpp>
+
Header <boost/compute/interop/opengl.hpp>
+
Header <boost/compute/interop/opengl/acquire.hpp>
+
Header <boost/compute/interop/opengl/opengl_buffer.hpp>
+
Header <boost/compute/interop/opengl/opengl_renderbuffer.hpp>
+
Header <boost/compute/interop/opengl/opengl_texture.hpp>
Header <boost/compute/iterator.hpp>
Header <boost/compute/iterator/buffer_iterator.hpp>
Header <boost/compute/iterator/constant_buffer_iterator.hpp>
@@ -138,6 +144,7 @@
Header <boost/compute/types.hpp>
Header <boost/compute/types/struct.hpp>
Header <boost/compute/version.hpp>
+
Header <boost/compute/wait_list.hpp>

@@ -153,10 +160,10 @@ 
namespace boost {
   namespace compute {
     template<typename InputIterator, typename T> 
-      T accumulate(InputIterator, InputIterator, T, 
+      T accumulate(InputIterator, InputIterator, T, 
                    command_queue & = system::default_queue());
     template<typename InputIterator, typename T, typename BinaryFunction> 
-      T accumulate(InputIterator, InputIterator, T, BinaryFunction, 
+      T accumulate(InputIterator, InputIterator, T, BinaryFunction, 
                    command_queue & = system::default_queue());
   }
 }
@@ -445,12 +452,12 @@ 
namespace boost {
   namespace compute {
     template<typename InputIterator1, typename InputIterator2, typename T> 
-      T inner_product(InputIterator1, InputIterator1, InputIterator2, T, 
+      T inner_product(InputIterator1, InputIterator1, InputIterator2, T, 
                       command_queue & = system::default_queue());
     template<typename InputIterator1, typename InputIterator2, typename T, 
              typename BinaryAccumulateFunction, 
              typename BinaryTransformFunction> 
-      T inner_product(InputIterator1, InputIterator1, InputIterator2, T, 
+      T inner_product(InputIterator1, InputIterator1, InputIterator2, T, 
                       BinaryAccumulateFunction, BinaryTransformFunction, 
                       command_queue & = system::default_queue());
   }
@@ -532,12 +539,12 @@
     template<typename InputIterator1, typename InputIterator2, 
              typename OutputIterator> 
       OutputIterator 
-      merge(InputIterator1, InputIterator1, InputIterator2, InputIterator2, 
+      merge(InputIterator1, InputIterator1, InputIterator2, InputIterator2, 
             OutputIterator, command_queue & = system::default_queue());
     template<typename InputIterator1, typename InputIterator2, 
              typename OutputIterator, typename Compare> 
       OutputIterator 
-      merge(InputIterator1, InputIterator1, InputIterator2, InputIterator2, 
+      merge(InputIterator1, InputIterator1, InputIterator2, InputIterator2, 
             OutputIterator, Compare, 
             command_queue & = system::default_queue());
   }
@@ -596,10 +603,10 @@
 
namespace boost {
   namespace compute {
     template<typename Iterator> 
-      void nth_element(Iterator, Iterator, Iterator, 
+      void nth_element(Iterator, Iterator, Iterator, 
                        command_queue & = system::default_queue());
     template<typename Iterator, typename Compare> 
-      void nth_element(Iterator, Iterator, Iterator, Compare, 
+      void nth_element(Iterator, Iterator, Iterator, Compare, 
                        command_queue & = system::default_queue());
   }
 }

@@ -660,11 +667,11 @@
 
namespace boost {
   namespace compute {
     template<typename InputIterator, typename OutputIterator> 
-      void reduce(InputIterator, InputIterator, OutputIterator, 
+      void reduce(InputIterator, InputIterator, OutputIterator, 
                   command_queue & = system::default_queue());
     template<typename InputIterator, typename OutputIterator, 
              typename BinaryFunction> 
-      void reduce(InputIterator, InputIterator, OutputIterator, 
+      void reduce(InputIterator, InputIterator, OutputIterator, 
                   BinaryFunction, command_queue & = system::default_queue());
   }
 }

@@ -757,12 +764,12 @@
 
namespace boost {
   namespace compute {
     template<typename Iterator, typename Compare> 
-      void sort(Iterator, Iterator, Compare, 
+      void sort(Iterator, Iterator, Compare, 
                 command_queue & = system::default_queue());
 
     // Sorts the values in the range [first, last). 
     template<typename Iterator> 
-      void sort(Iterator first, Iterator last, 
+      void sort(Iterator first, Iterator last, 
                 command_queue & queue = system::default_queue());
   }
 }

@@ -773,10 +780,10 @@
 
namespace boost {
   namespace compute {
     template<typename KeyIterator, typename ValueIterator, typename Compare> 
-      void sort_by_key(KeyIterator, KeyIterator, ValueIterator, Compare, 
+      void sort_by_key(KeyIterator, KeyIterator, ValueIterator, Compare, 
                        command_queue & = system::default_queue());
     template<typename KeyIterator, typename ValueIterator> 
-      void sort_by_key(KeyIterator, KeyIterator, ValueIterator, 
+      void sort_by_key(KeyIterator, KeyIterator, ValueIterator, 
                        command_queue & = system::default_queue());
   }
 }

@@ -787,10 +794,10 @@
 
namespace boost {
   namespace compute {
     template<typename Iterator, typename Compare> 
-      void stable_sort(Iterator, Iterator, Compare, 
+      void stable_sort(Iterator, Iterator, Compare, 
                        command_queue & = system::default_queue());
     template<typename Iterator> 
-      void stable_sort(Iterator, Iterator, 
+      void stable_sort(Iterator, Iterator, 
                        command_queue & = system::default_queue());
   }
 }

@@ -814,12 +821,12 @@
     template<typename InputIterator, typename OutputIterator, 
              typename UnaryOperator> 
       OutputIterator 
-      transform(InputIterator, InputIterator, OutputIterator, UnaryOperator, 
+      transform(InputIterator, InputIterator, OutputIterator, UnaryOperator, 
                 command_queue & = system::default_queue());
     template<typename InputIterator1, typename InputIterator2, 
              typename OutputIterator, typename BinaryOperator> 
       OutputIterator 
-      transform(InputIterator1, InputIterator1, InputIterator2, 
+      transform(InputIterator1, InputIterator1, InputIterator2, 
                 OutputIterator, BinaryOperator, 
                 command_queue & = system::default_queue());
   }
@@ -846,13 +853,13 @@
   namespace compute {
     template<typename InputIterator, typename OutputIterator, 
              typename UnaryTransformFunction, typename BinaryReduceFunction> 
-      void transform_reduce(InputIterator, InputIterator, OutputIterator, 
+      void transform_reduce(InputIterator, InputIterator, OutputIterator, 
                             UnaryTransformFunction, BinaryReduceFunction, 
                             command_queue & = system::default_queue());
     template<typename InputIterator1, typename InputIterator2, 
              typename OutputIterator, typename BinaryTransformFunction, 
              typename BinaryReduceFunction> 
-      void transform_reduce(InputIterator1, InputIterator1, InputIterator2, 
+      void transform_reduce(InputIterator1, InputIterator1, InputIterator2, 
                             OutputIterator, BinaryTransformFunction, 
                             BinaryReduceFunction, 
                             command_queue & = system::default_queue());
@@ -876,15 +883,8 @@
 Header <boost/compute/async.hpp>

Meta-header to include all Boost.Compute async headers.

-
-
-
namespace boost {
-  namespace compute {
-    template<typename T> class future;
-  }
-}
-
+
@@ -1034,6 +1034,15 @@
+
namespace boost {
+  namespace compute {
+    context opengl_create_shared_context();
+  }
+}
+
+
+
namespace boost {
   namespace compute {
@@ -1069,7 +1078,7 @@
 Header <boost/compute/exception/extension_unsupported_exception.hpp>

namespace boost {
   namespace compute {
-    class extension_unsupported_exception;
+    class extension_unsupported_exception;
   }
 }
@@ -1122,6 +1131,52 @@

+Header <boost/compute/interop/opengl.hpp>

+

Meta-header to include all Boost.Compute OpenGL interop headers.

+
+
+

+Header <boost/compute/interop/opengl/acquire.hpp>

+
namespace boost {
+  namespace compute {
+    void opengl_enqueue_acquire_gl_objects(size_t, const cl_mem *, 
+                                           command_queue &);
+    void opengl_enqueue_release_gl_objects(size_t, const cl_mem *, 
+                                           command_queue &);
+    void opengl_enqueue_acquire_buffer(const opengl_buffer &, command_queue &);
+    void opengl_enqueue_release_buffer(const opengl_buffer &, command_queue &);
+  }
+}
+
+
+

+Header <boost/compute/interop/opengl/opengl_buffer.hpp>

+
namespace boost {
+  namespace compute {
+    class opengl_buffer;
+  }
+}
+
+
+

+Header <boost/compute/interop/opengl/opengl_renderbuffer.hpp>

+
namespace boost {
+  namespace compute {
+    class opengl_renderbuffer;
+  }
+}
+
+
+

+Header <boost/compute/interop/opengl/opengl_texture.hpp>

+
namespace boost {
+  namespace compute {
+    class opengl_texture;
+  }
+}
+
+
+

Header <boost/compute/iterator.hpp>

Meta-header to include all Boost.Compute iterator headers.

@@ -1147,7 +1202,7 @@ template<typename T> class constant_buffer_iterator; template<typename T> constant_buffer_iterator< T > - make_constant_buffer_iterator(const buffer & buffer, size_t index = 0); + make_constant_buffer_iterator(const buffer & buffer, size_t index = 0); } } @@ -1184,7 +1239,7 @@ template<typename Function> class function_input_iterator; template<typename Function> function_input_iterator< Function > - make_function_input_iterator(const Function & function, + make_function_input_iterator(const Function & function, size_t index = 0); } } @@ -1402,6 +1457,16 @@ BOOST_COMPUTE_VERSION_MINOR BOOST_COMPUTE_VERSION_PATCH +
+

+Header <boost/compute/wait_list.hpp>

+
namespace boost {
+  namespace compute {
+    template<typename T> class future;
+    class wait_list;
+  }
+}
+
@@ -1414,7 +1479,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/index.html b/index.html index 0e9dd891..2e021209 100644 --- a/index.html +++ b/index.html @@ -95,7 +95,7 @@ - +

Last revised: March 09, 2014 at 03:58:33 GMT

Last revised: March 10, 2014 at 05:17:06 GMT
diff --git a/standalone_HTML.manifest b/standalone_HTML.manifest index 45dd9a76..fbd08780 100644 --- a/standalone_HTML.manifest +++ b/standalone_HTML.manifest @@ -5,8 +5,8 @@ boost_compute/advanced_topics.html boost_compute/porting_guide.html boost_compute/platforms_and_compilers.html compute/reference.html -boost/compute/accumulate_idp30960128.html -boost/compute/accumulate_idp30928336.html +boost/compute/accumulate_idp11236832.html +boost/compute/accumulate_idp11204240.html BOOST_COMPUTE_DETAIL_DECLARE_CAN_ACCUMULATE_WITH_REDUCE.html boost/compute/adjacent_difference.html boost/compute/adjacent_find.html @@ -31,45 +31,44 @@ boost/compute/gather.html boost/compute/generate.html boost/compute/generate_n.html boost/compute/inclusive_scan.html -boost/compute/inner_product_idp39615376.html -boost/compute/inner_product_idp39624048.html +boost/compute/inner_product_idp20100176.html +boost/compute/inner_product_idp20108848.html boost/compute/inplace_merge.html boost/compute/iota.html boost/compute/is_partitioned.html boost/compute/is_sorted.html boost/compute/lower_bound.html boost/compute/max_element.html -boost/compute/merge_idp39696016.html -boost/compute/merge_idp39705824.html +boost/compute/merge_idp20180864.html +boost/compute/merge_idp20190672.html boost/compute/min_element.html boost/compute/minmax_element.html boost/compute/mismatch.html boost/compute/none_of.html -boost/compute/nth_element_idp39759488.html -boost/compute/nth_element_idp39766336.html +boost/compute/nth_element_idp20244384.html +boost/compute/nth_element_idp20251232.html boost/compute/partial_sum.html boost/compute/partition.html boost/compute/partition_copy.html -boost/compute/reduce_idp39821168.html -boost/compute/reduce_idp39828576.html +boost/compute/reduce_idp20306064.html +boost/compute/reduce_idp20313472.html boost/compute/remove.html boost/compute/remove_if.html boost/compute/replace.html boost/compute/replace_copy.html boost/compute/reverse_copy.html boost/compute/scatter.html -boost/compute/sort_idp39916832.html -boost/compute/sort_by_key_idp39931952.html -boost/compute/sort_by_key_idp39943280.html -boost/compute/stable_sort_idp39955472.html -boost/compute/stable_sort_idp39964128.html +boost/compute/sort_idp20401744.html +boost/compute/sort_by_key_idp20416880.html +boost/compute/sort_by_key_idp20428208.html +boost/compute/stable_sort_idp20440400.html +boost/compute/stable_sort_idp20449056.html boost/compute/swap_ranges.html -boost/compute/transform_idp39982928.html -boost/compute/transform_idp39992016.html -boost/compute/transform_redu_idp40015072.html -boost/compute/transform_redu_idp40025408.html +boost/compute/transform_idp20467856.html +boost/compute/transform_idp20476944.html +boost/compute/transform_redu_idp20500016.html +boost/compute/transform_redu_idp20510352.html boost/compute/upper_bound.html -boost/compute/future.html boost/compute/buffer.html BOOST_COMPUTE_CLOSURE.html boost/compute/command_queue.html @@ -86,16 +85,24 @@ boost/compute/stack.html boost/compute/valarray.html boost/compute/vector.html boost/compute/context.html +boost/compute/opengl_create__idp21517904.html boost/compute/device.html boost/compute/event.html boost/compute/context_error.html -boost/compute/extension_unsu_idp41161888.html +boost/compute/extension_unsu_idp21637808.html boost/compute/runtime_exception.html boost/compute/function.html boost/compute/make_function_from_source.html BOOST_COMPUTE_FUNCTION.html boost/compute/field.html boost/compute/get.html +boost/compute/opengl_enqueue_idp21705296.html +boost/compute/opengl_enqueue_idp21710096.html +boost/compute/opengl_enqueue_idp21714896.html +boost/compute/opengl_enqueue_idp21719456.html +boost/compute/opengl_buffer.html +boost/compute/opengl_renderbuffer.html +boost/compute/opengl_texture.html boost/compute/buffer_iterator.html boost/compute/constant_buffer_iterator.html boost/compute/constant_iterator.html @@ -127,4 +134,6 @@ BOOST_COMPUTE_ADAPT_STRUCT.html BOOST_COMPUTE_VERSION_MAJOR.html BOOST_COMPUTE_VERSION_MINOR.html BOOST_COMPUTE_VERSION_PATCH.html +boost/compute/future.html +boost/compute/wait_list.html boost_compute/faq.html