diff --git a/boost/compute/accumulate_idp7023616.html b/boost/compute/accumulate_idp7023616.html new file mode 100644 index 00000000..e03d887f --- /dev/null +++ b/boost/compute/accumulate_idp7023616.html @@ -0,0 +1,61 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The sum of 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/accumulate_idp7032592.html b/boost/compute/accumulate_idp7032592.html new file mode 100644 index 00000000..6131e3d3 --- /dev/null +++ b/boost/compute/accumulate_idp7032592.html @@ -0,0 +1,62 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The result of applying function to 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/accumulate_idp7337360.html b/boost/compute/accumulate_idp7337360.html new file mode 100644 index 00000000..27308976 --- /dev/null +++ b/boost/compute/accumulate_idp7337360.html @@ -0,0 +1,61 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The sum of 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/accumulate_idp7346336.html b/boost/compute/accumulate_idp7346336.html new file mode 100644 index 00000000..82e660d6 --- /dev/null +++ b/boost/compute/accumulate_idp7346336.html @@ -0,0 +1,62 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The result of applying function to 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/accumulate_idp7946384.html b/boost/compute/accumulate_idp7946384.html new file mode 100644 index 00000000..4632a32e --- /dev/null +++ b/boost/compute/accumulate_idp7946384.html @@ -0,0 +1,61 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The sum of 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/accumulate_idp7951488.html b/boost/compute/accumulate_idp7951488.html new file mode 100644 index 00000000..e113af9f --- /dev/null +++ b/boost/compute/accumulate_idp7951488.html @@ -0,0 +1,61 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The sum of 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/accumulate_idp7956928.html b/boost/compute/accumulate_idp7956928.html new file mode 100644 index 00000000..969689b1 --- /dev/null +++ b/boost/compute/accumulate_idp7956928.html @@ -0,0 +1,62 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The result of applying function to 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/accumulate_idp7962032.html b/boost/compute/accumulate_idp7962032.html new file mode 100644 index 00000000..a1e9dcaf --- /dev/null +++ b/boost/compute/accumulate_idp7962032.html @@ -0,0 +1,62 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The result of applying function to 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/accumulate_idp7996160.html b/boost/compute/accumulate_idp7996160.html new file mode 100644 index 00000000..7c5d4edf --- /dev/null +++ b/boost/compute/accumulate_idp7996160.html @@ -0,0 +1,61 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The sum of 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/accumulate_idp7997392.html b/boost/compute/accumulate_idp7997392.html new file mode 100644 index 00000000..7caa3f8a --- /dev/null +++ b/boost/compute/accumulate_idp7997392.html @@ -0,0 +1,61 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The sum of 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/accumulate_idp8006704.html b/boost/compute/accumulate_idp8006704.html new file mode 100644 index 00000000..ed0dd6a9 --- /dev/null +++ b/boost/compute/accumulate_idp8006704.html @@ -0,0 +1,62 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The result of applying function to 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/accumulate_idp8007936.html b/boost/compute/accumulate_idp8007936.html new file mode 100644 index 00000000..eed6ce1a --- /dev/null +++ b/boost/compute/accumulate_idp8007936.html @@ -0,0 +1,62 @@ + + + +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);
+
+

Description

+

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

+
++ + + + +

Returns:

 + The result of applying function to 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/adjacent_difference.html b/boost/compute/adjacent_difference.html index 31687a43..8a05a7aa 100644 --- a/boost/compute/adjacent_difference.html +++ b/boost/compute/adjacent_difference.html @@ -6,14 +6,14 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -30,7 +30,7 @@ adjacent_difference(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue);
-

Description

+

Description

Stored the difference of each pair of consecutive values in the range [first, last) to the range @@ -57,7 +57,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/adjacent_find.html b/boost/compute/adjacent_find.html index bf200acd..b45849f2 100644 --- a/boost/compute/adjacent_find.html +++ b/boost/compute/adjacent_find.html @@ -30,7 +30,7 @@ adjacent_find(InputIterator first, InputIterator last, command_queue & queue);
-

Description

+

Description

Searches the range [first, last) for two identical adjacent elements and returns an iterator pointing to the diff --git a/boost/compute/all_of.html b/boost/compute/all_of.html index e1789e1a..f9801e7c 100644 --- a/boost/compute/all_of.html +++ b/boost/compute/all_of.html @@ -29,7 +29,7 @@ bool all_of(InputIterator first, InputIterator last, UnaryPredicate predicate, command_queue & queue);

-

Description

+

Description

Returns true if predicate returns true for all of the elements in the range diff --git a/boost/compute/any_of.html b/boost/compute/any_of.html index 50d98ee8..02d2b93d 100644 --- a/boost/compute/any_of.html +++ b/boost/compute/any_of.html @@ -29,7 +29,7 @@ bool any_of(InputIterator first, InputIterator last, UnaryPredicate predicate, command_queue & queue);

-

Description

+

Description

Returns true if predicate returns true for any of the elements in the range diff --git a/boost/compute/array.html b/boost/compute/array.html index 32e7a7a6..f2498a0d 100644 --- a/boost/compute/array.html +++ b/boost/compute/array.html @@ -30,7 +30,7 @@ class array { };

-

Description

+

Description

See also: vector

diff --git a/boost/compute/basic_string.html b/boost/compute/basic_string.html index fd036528..9ad0bfb9 100644 --- a/boost/compute/basic_string.html +++ b/boost/compute/basic_string.html @@ -30,7 +30,7 @@ class basic_string { };
-

Description

+

Description

See also: string

diff --git a/boost/compute/binary_search.html b/boost/compute/binary_search.html index 78df93e8..88ee4ca0 100644 --- a/boost/compute/binary_search.html +++ b/boost/compute/binary_search.html @@ -29,7 +29,7 @@ bool binary_search(InputIterator first, InputIterator last, const T& value, command_queue & 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 f3501290..21044d36 100644 --- a/boost/compute/buffer.html +++ b/boost/compute/buffer.html @@ -28,17 +28,18 @@ class buffer { public: // construct/copy/destruct - buffer(const context&, size_t, cl_mem_flags = read_write, void * = 0); - buffer(const buffer &); - buffer& operator=(const buffer &); - ~buffer(); + buffer(const context&, size_t, cl_mem_flags = read_write, void * = 0); + explicit buffer(cl_buffer, bool = true); + buffer(const buffer &); + buffer& operator=(const buffer &); + ~buffer(); - // public member functions - size_t size() size; - template<typename T> T get_info(cl_mem_info) const; + // public member functions + size_t size() size; + template<typename T> T get_info(cl_mem_info) const; };

-

Description

+

Description

The buffer class represents a memory buffer on a compute device. @@ -48,13 +49,13 @@ command_queue

-

+

buffer public construct/copy/destruct

  1. -
    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);
    
 
    
               Creates a new compute buffer in context containing
@@ -62,19 +63,27 @@
  2. -
    buffer(const buffer & other);
    +
    explicit buffer(cl_buffer buffer, bool retain = true);
    +

    + Creates a new buffer object for buffer. If + retain is true (the default) the + reference count for buffer will be incremented. +

    +
    3. +
  3. +
    buffer(const buffer & other);

    Creates a new buffer object as a copy of other.

  4. -
    buffer& operator=(const buffer & other);
    +
    buffer& operator=(const buffer & other);

    Copies the buffer from other.

  5. -
    ~buffer();
    +
    ~buffer();

    Destroys the buffer object.

    @@ -82,17 +91,17 @@
-

-buffer public member functions

+

+buffer public member functions

  1. -
    size_t size() size;
    +
    size_t size() size;

    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.

    diff --git a/boost/compute/buffer_iterator.html b/boost/compute/buffer_iterator.html index 9fa6b0b3..93d6882e 100644 --- a/boost/compute/buffer_iterator.html +++ b/boost/compute/buffer_iterator.html @@ -28,7 +28,7 @@ class buffer_iterator { };
-

Description

+

Description

The buffer_iterator class provides a random-access iterator for buffer objects. diff --git a/boost/compute/command_queue.html b/boost/compute/command_queue.html index bb2a468a..d7a5ff65 100644 --- a/boost/compute/command_queue.html +++ b/boost/compute/command_queue.html @@ -28,32 +28,32 @@ class command_queue { public: // construct/copy/destruct - command_queue(const context&, const device&, + command_queue(const context&, const device&, const cl_command_queue_properties* = 0); - command_queue(const command_queue &); - command_queue& operator=(const command_queue &); - ~command_queue(); + explicit command_queue(cl_command_queue, bool = true); + command_queue(const command_queue &); + command_queue& operator=(const command_queue &); + ~command_queue(); - // public member functions - device get_device() const; - context get_context() const; - cl_command_queue_properties get_properties() const; - template<typename T> T get_info(cl_command_queue_info) const; - void enqueue_read_buffer(const buffer&, size_t, size_t, void *); - void enqueue_write_buffer(const buffer&, size_t, size_t, const void *); - void enqueue_copy_buffer(const buffer&, const buffer&, size_t, size_t, + // public member functions + device get_device() const; + context get_context() const; + cl_command_queue_properties get_properties() const; + template<typename T> T get_info(cl_command_queue_info) const; + void enqueue_read_buffer(const buffer&, size_t, size_t, void *); + void enqueue_write_buffer(const buffer&, size_t, size_t, const void *); + void enqueue_copy_buffer(const buffer&, const buffer&, size_t, size_t, size_t); - void enqueue_nd_range_kernel(const kernel&, size_t, const size_t*, - const size_t*, const size_t*); - void enqueue_task(const kernel&); - void flush(); - void finish(); - void enqueue_barrier(); - event enqueue_marker(); - void enqueue_wait_for_event(const event&); + event enqueue_nd_range_kernel(const kernel&, size_t, const size_t*, + const size_t*, const size_t*); + event enqueue_task(const kernel&); + void flush(); + void finish(); + void enqueue_barrier(); + event enqueue_marker(); };

-

Description

+

Description

Command queues provide the interface for interacting with compute devices. The command_queue class provides @@ -67,7 +67,7 @@ 

 // get the default GPU device
-boost::compute::device gpu = boost::compute::system::default_gpu_device();
+boost::compute::device gpu = boost::compute::system::default_gpu_device();
 
 // create a context for the GPU device
 boost::compute::context context(gpu);
@@ -95,13 +95,13 @@
                       kernel
           

 

-

+

 command_queue 
         public
        construct/copy/destruct

 
    
 
  1. 
-
    command_queue(const context& context, const device& device, 
+
    command_queue(const context& context, const device& device, 
               const cl_command_queue_properties* properties = 0);
    
 
    
               Creates a new command queue object in context for
@@ -109,20 +109,28 @@
             
    
 
    2. 
 
  2. 
-
    command_queue(const command_queue & other);
    
+
    explicit command_queue(cl_command_queue queue, bool retain = true);
    
+
    
+              Creates a new command queue object for queue. If
+              retain is true (the default) the
+              reference count for queue will be incremented.
+            
    
+
    3. 
+
  3. 
+
    command_queue(const command_queue & other);
    
 
    
               Creates a new command queue object as a copy of
               other.
             
    
 
    4. 
 
  4. 
-
    command_queue& operator=(const command_queue & other);
    
+
    command_queue& operator=(const command_queue & other);
    
 
    
               Copies the command queue from other.
             
    
 
    5. 
 
  5. 
-
    ~command_queue();
    
+
    ~command_queue();
    
 
    
               Destroys the command queue object.
             
    
@@ -130,24 +138,24 @@
 

 

 

-

-command_queue public member functions

+

+command_queue public member functions

 
    
 
  1. 
-
    device get_device() const;
    
+
    device get_device() const;
    
 
    
                 Returns the device that the command queue issues instructions
                 to.
               
    
 
    2. 
 
  2. 
-
    context get_context() const;
    
+
    context get_context() const;
    
 
    
                 Returns the context for the command queue.
               
    
 
    3. 
 
  3. 
-
    cl_command_queue_properties get_properties() const;
    
+
    cl_command_queue_properties get_properties() const;
    
 
    
                 Returns the properties for the command queue.
               
    
@@ -168,13 +176,13 @@ if(queue.get_properties() & command_queue::enable_profiling){
               
    
 
    4. 
 
  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.
               
    
 
    5. 
 
  5. 
-
    void enqueue_read_buffer(const buffer& buffer, size_t offset, size_t size, 
+
    void enqueue_read_buffer(const buffer& buffer, size_t offset, size_t size, 
                          void * host_ptr);
    
 
    
                 Enqueues a command to read from a device buffer to host memory.
@@ -184,7 +192,7 @@ if(queue.get_properties() & command_queue::enable_profiling){
               
    
 
    6. 
 
  6. 
-
    void enqueue_write_buffer(const buffer& buffer, size_t offset, size_t size, 
+
    void enqueue_write_buffer(const buffer& buffer, size_t offset, size_t size, 
                           const void * host_ptr);
    
 
    
                 Enqueues a command to write to a device buffer from host memory.
@@ -194,7 +202,7 @@ if(queue.get_properties() & command_queue::enable_profiling){
               
    
 
    7. 
 
  7. 
-
    void enqueue_copy_buffer(const buffer& src_buffer, const buffer& dst_buffer, 
+
    void 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
@@ -205,52 +213,45 @@ if(queue.get_properties() & command_queue::enable_profiling){
               
    
 
    8. 
 
  8. 
-
    void 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);
    
+
    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);
    
 
    
                 Enqueues kernel for execution on the device.
               
    
 
    9. 
 
  9. 
-
    void enqueue_task(const kernel& kernel);
    
+
    event enqueue_task(const kernel& kernel);
    
 
    
                 Enqueues kernel for serial execution on the
                 device using a single work-item.
               
    
 
    10. 
 
  10. 
-
    void flush();
    
+
    void flush();
    
 
    
                 Flushes the command queue.
               
    
 
    11. 
 
  11. 
-
    void finish();
    
+
    void finish();
    
 
    
                 Blocks until all outstanding operations are completed.
               
    
 
    12. 
 
  12. 
-
    void enqueue_barrier();
    
+
    void enqueue_barrier();
    
 
    
                 Enqueues a barrier in the command queue.
               
    
 
    13. 
 
  13. 
-
    event enqueue_marker();
    
+
    event enqueue_marker();
    
 
    
                 Enqueues a marker in the command queue.
               
    
 
    14. 
-
  14. 
-
    void enqueue_wait_for_event(const event& event);
    
-
    
-                Enqueues a wait for event to complete before
-                executing any future commands.
-              
    
-
    15.
diff --git a/boost/compute/constant_iterator.html b/boost/compute/constant_iterator.html index d973df6c..4d174625 100644 --- a/boost/compute/constant_iterator.html +++ b/boost/compute/constant_iterator.html @@ -28,7 +28,7 @@ class constant_iterator { };
-

Description

+

Description

The constant_iterator class provides an iterator that always returns the same value when dereferenced. diff --git a/boost/compute/context.html b/boost/compute/context.html index 080fa3e3..a7406788 100644 --- a/boost/compute/context.html +++ b/boost/compute/context.html @@ -28,27 +28,28 @@ class context { public: // construct/copy/destruct - explicit context(const device&, const cl_context_properties* = 0); - context(const context &); - context& operator=(const context &); - ~context(); + explicit context(const device&, const cl_context_properties* = 0); + explicit context(cl_context, bool = true); + context(const context &); + context& operator=(const context &); + ~context(); - // public member functions - template<typename T> T get_info(cl_context_info) const; + // public member functions + template<typename T> T get_info(cl_context_info) const; };

-

Description

+

Description

The context class represents a compute context.

-

+

context public construct/copy/destruct

  1. -
    explicit context(const device& device, 
+
    explicit context(const device& device, 
                  const cl_context_properties* properties = 0);
    
 
    
               Creates a new context object for device with
@@ -56,28 +57,36 @@
  2. -
    context(const context & other);
    +
    explicit context(cl_context context, bool retain = true);
    +

    + Creates a new context object for context. If + retain is true (the default) the + reference count for context will be incremented. +

    +
    3. +
  3. +
    context(const context & other);

    Creates a new context object as a copy of other.

  4. -
    context& operator=(const context & other);
    +
    context& operator=(const context & other);

    Copies the context from other.

  5. -
    ~context();
    +
    ~context();

    Destroys the context object.

-

-context public member functions

+

+context public member functions

  1. -
    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.

    diff --git a/boost/compute/copy.html b/boost/compute/copy.html index 664e8956..204727f8 100644 --- a/boost/compute/copy.html +++ b/boost/compute/copy.html @@ -30,7 +30,7 @@ copy(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue);
-

Description

+

Description

Copies the values from the range [first, last) to the range beginning at result. diff --git a/boost/compute/copy_async.html b/boost/compute/copy_async.html index a55f4783..778c2bf9 100644 --- a/boost/compute/copy_async.html +++ b/boost/compute/copy_async.html @@ -30,7 +30,7 @@ copy_async(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue);

-

Description

+

Description

Copies the values from the range [first, last) to the range beginning at result. diff --git a/boost/compute/copy_if.html b/boost/compute/copy_if.html index 8652d474..cf61d673 100644 --- a/boost/compute/copy_if.html +++ b/boost/compute/copy_if.html @@ -30,7 +30,7 @@ copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate predicate, command_queue & queue);

-

Description

+

Description

Copies each element in the range [first, last) for which predicate returns diff --git a/boost/compute/copy_n.html b/boost/compute/copy_n.html index b9c62ab1..128ec85d 100644 --- a/boost/compute/copy_n.html +++ b/boost/compute/copy_n.html @@ -30,7 +30,7 @@ copy_n(InputIterator first, Size count, OutputIterator result, command_queue & queue);

-

Description

+

Description

Copies the values from the range [first, first + count) to the range beginning at diff --git a/boost/compute/count.html b/boost/compute/count.html index c546d5d7..f7a6a41f 100644 --- a/boost/compute/count.html +++ b/boost/compute/count.html @@ -29,7 +29,7 @@ size_t count(InputIterator first, InputIterator last, const T& value, command_queue & queue);

-

Description

+

Description

Returns the number of occurrences of value in the range [first, last). diff --git a/boost/compute/count_if.html b/boost/compute/count_if.html index dcac2923..0578442e 100644 --- a/boost/compute/count_if.html +++ b/boost/compute/count_if.html @@ -29,7 +29,7 @@ size_t count_if(InputIterator first, InputIterator last, UnaryPredicate predicate, command_queue & queue);

-

Description

+

Description

Returns the number of elements in the range [first, last) for which predicate returns diff --git a/boost/compute/counting_iterator.html b/boost/compute/counting_iterator.html index 60171baf..a88755ce 100644 --- a/boost/compute/counting_iterator.html +++ b/boost/compute/counting_iterator.html @@ -28,7 +28,7 @@ class counting_iterator { };

-

Description

+

Description

The counting_iterator class provides a random-access iterator that returns sequential values when dereferenced. diff --git a/boost/compute/device.html b/boost/compute/device.html index c077605e..42cdd469 100644 --- a/boost/compute/device.html +++ b/boost/compute/device.html @@ -28,41 +28,41 @@ class device { public: // construct/copy/destruct - device(); - explicit device(cl_device_id); - device(const device &); - device& operator=(const device &); - ~device(); + device(); + explicit device(cl_device_id, bool = true); + device(const device &); + device& operator=(const device &); + ~device(); - // public member functions - cl_device_id id() const; - cl_device_type type() const; - std::string name() const; - std::string vendor() const; - uint_ address_bits() const; - ulong_ global_memory_size() const; - ulong_ local_memory_size() const; - uint_ clock_frequency() const; - uint_ compute_units() const; - size_t profiling_timer_resolution() const; - template<typename T> T preferred_vector_width() const; - template<typename T> T get_info(cl_device_info) const; + // public member functions + cl_device_id id() const; + cl_device_type type() const; + std::string name() const; + std::string vendor() const; + uint_ address_bits() const; + ulong_ global_memory_size() const; + ulong_ local_memory_size() const; + uint_ clock_frequency() const; + uint_ compute_units() const; + size_t profiling_timer_resolution() const; + template<typename T> T preferred_vector_width() const; + template<typename T> T get_info(cl_device_info) 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 platform::devices() method.

A default device can be easily created with the one of the following convenience methods:

@@ -71,42 +71,42 @@ 

 // get the default GPU device
-boost::compute::device gpu = boost::compute::system::default_gpu_device();
+boost::compute::device gpu = boost::compute::system::default_gpu_device();

-

+

device public construct/copy/destruct

  1. -
    device();
    +
    device();

    Creates a null device object.

  2. -
    explicit device(cl_device_id id);
    +
    explicit device(cl_device_id id, bool retain = true);

    Creates a new device object for id.

  3. -
    device(const device & other);
    +
    device(const device & other);

    Creates a new device object as a copy of other.

  4. -
    device& operator=(const device & other);
    +
    device& operator=(const device & other);

    Copies the device from other.

  5. -
    ~device();
    +
    ~device();

    Destroys the device object.

    @@ -114,77 +114,77 @@
-

-device public member functions

+

+device public member functions

  1. -
    cl_device_id id() const;
    +
    cl_device_id id() const;

    Returns the device's ID.

  2. -
    cl_device_type type() const;
    +
    cl_device_type type() const;

    Returns the type of the device.

  3. -
    std::string name() const;
    +
    std::string name() const;

    Returns the name of the device.

  4. -
    std::string vendor() const;
    +
    std::string vendor() const;

    Returns the name of the vendor of the device.

  5. -
    uint_ address_bits() const;
    +
    uint_ address_bits() const;

    Returns the device's address size in bits.

  6. -
    ulong_ global_memory_size() const;
    +
    ulong_ global_memory_size() const;

    Returns the size of the global memory in bytes.

  7. -
    ulong_ local_memory_size() const;
    +
    ulong_ local_memory_size() const;

    Returns the size of the local memory in bytes.

  8. -
    uint_ clock_frequency() const;
    +
    uint_ clock_frequency() const;

    Returns the clock frequency for the device.

  9. -
    uint_ compute_units() const;
    +
    uint_ compute_units() const;

    Returns the number of compute units.

  10. -
    size_t profiling_timer_resolution() const;
    +
    size_t profiling_timer_resolution() const;

    Returns the profiling timer resolution in nanoseconds.

  11. -
    template<typename T> T preferred_vector_width() const;
    +
    template<typename T> T preferred_vector_width() const;

    Returns the preferred vector width for type T.

  12. -
    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.

    diff --git a/boost/compute/equal.html b/boost/compute/equal.html index 8e8461a5..47cb4e5f 100644 --- a/boost/compute/equal.html +++ b/boost/compute/equal.html @@ -29,7 +29,7 @@ bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, command_queue & queue);
-

Description

+

Description

Returns true if the range [first1, last1) and the range beginning at first2 diff --git a/boost/compute/equal_range.html b/boost/compute/equal_range.html index fcc4b9bb..d5679d97 100644 --- a/boost/compute/equal_range.html +++ b/boost/compute/equal_range.html @@ -30,7 +30,7 @@ equal_range(InputIterator first, InputIterator last, const T& value, command_queue & queue);

-

Description

+

Description

Returns a pair of iterators containing the range of values equal to value in the sorted range [first, diff --git a/boost/compute/event.html b/boost/compute/event.html index f8a55c0f..584581d2 100644 --- a/boost/compute/event.html +++ b/boost/compute/event.html @@ -28,46 +28,55 @@ class event { public: // construct/copy/destruct - explicit event(cl_event); - event(const event &); - event& operator=(const event &); - ~event(); + explicit event(cl_event); + event(const event &); + explicit event(cl_event, bool = true); + event& operator=(const event &); + ~event(); - // public member functions - template<typename T> T get_info(cl_event_info) const; - template<typename T> T get_profiling_info(cl_profiling_info) const; + // public member functions + template<typename T> T get_info(cl_event_info) const; + template<typename T> T get_profiling_info(cl_profiling_info) const; };

-

Description

+

Description

The event class represents an OpenCL event.

-

+

event public construct/copy/destruct

  1. -
    explicit event(cl_event event);
    +
    explicit event(cl_event event);

    Creates a new compute event for event.

  2. -
    event(const event & other);
    +
    event(const event & other);

    Creates a new event object as a copy of other.

  3. -
    event& operator=(const event & other);
    +
    explicit event(cl_event event, bool retain = true);
    +

    + Creates a new event object for event. If + retain is true (the default) the + reference count for event will be incremented. +

    +
    4. +
  4. +
    event& operator=(const event & other);

    Copies the event from other.

  5. -
    ~event();
    +
    ~event();

    Destroys the event object.

    @@ -75,17 +84,17 @@
-

-event public member functions

+

+event public member functions

  1. -
    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.

  2. -
    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.

    diff --git a/boost/compute/exclusive_scan.html b/boost/compute/exclusive_scan.html index 036ca4bd..ee4d6bf4 100644 --- a/boost/compute/exclusive_scan.html +++ b/boost/compute/exclusive_scan.html @@ -30,7 +30,7 @@ exclusive_scan(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue);
-

Description

+

Description

Performs an exclusive scan on the elements in the range [first, last) and stores the results in diff --git a/boost/compute/fill.html b/boost/compute/fill.html index 7cb67cc6..376c9240 100644 --- a/boost/compute/fill.html +++ b/boost/compute/fill.html @@ -29,7 +29,7 @@ Iterator fill(Iterator first, Iterator last, const T& value, command_queue & queue);

-

Description

+

Description

Fills the range [first, last) with value. diff --git a/boost/compute/fill_n.html b/boost/compute/fill_n.html index 1b2d0de1..de6c33c4 100644 --- a/boost/compute/fill_n.html +++ b/boost/compute/fill_n.html @@ -29,7 +29,7 @@ Iterator fill_n(Iterator first, Size count, const T& value, command_queue & queue);

-

Description

+

Description

Fills the range [first, first + count) with value. diff --git a/boost/compute/find.html b/boost/compute/find.html index f3497154..abbbfb38 100644 --- a/boost/compute/find.html +++ b/boost/compute/find.html @@ -30,7 +30,7 @@ find(InputIterator first, InputIterator last, const T& value, command_queue & queue);

-

Description

+

Description

Returns an iterator pointing to the first element in the range [first, last) that equals diff --git a/boost/compute/find_if.html b/boost/compute/find_if.html index 9b2b3624..041932f4 100644 --- a/boost/compute/find_if.html +++ b/boost/compute/find_if.html @@ -30,7 +30,7 @@ find_if(InputIterator first, InputIterator last, UnaryPredicate predicate, command_queue & queue);

-

Description

+

Description

Returns an iterator pointing to the first element in the range [first, last) for which diff --git a/boost/compute/find_if_not.html b/boost/compute/find_if_not.html index cd1e8141..55154d35 100644 --- a/boost/compute/find_if_not.html +++ b/boost/compute/find_if_not.html @@ -30,7 +30,7 @@ find_if_not(InputIterator first, InputIterator last, UnaryPredicate predicate, command_queue & queue);

-

Description

+

Description

Returns an iterator pointing to the first element in the range [first, last) for which diff --git a/boost/compute/flat_map.html b/boost/compute/flat_map.html index eb578dd5..b687b353 100644 --- a/boost/compute/flat_map.html +++ b/boost/compute/flat_map.html @@ -30,7 +30,7 @@ class flat_map { };

-

Description

+

Description

See also: flat_set

diff --git a/boost/compute/flat_set.html b/boost/compute/flat_set.html index b74cc5d7..ddde5941 100644 --- a/boost/compute/flat_set.html +++ b/boost/compute/flat_set.html @@ -29,7 +29,7 @@ class flat_set { };
-

Description

+

Description

See also: flat_map

diff --git a/boost/compute/for_each.html b/boost/compute/for_each.html index 34c7b193..88855d0b 100644 --- a/boost/compute/for_each.html +++ b/boost/compute/for_each.html @@ -30,7 +30,7 @@ for_each(InputIterator first, InputIterator last, UnaryFunction function, command_queue & queue);
-

Description

+

Description

Calls function on each element in the range [first, last). diff --git a/boost/compute/future.html b/boost/compute/future.html index 696b6048..7f815ace 100644 --- a/boost/compute/future.html +++ b/boost/compute/future.html @@ -29,49 +29,49 @@ class future { public: // construct/copy/destruct - future(); - future(const future<T> &); - future& operator=(const future<T> &); - ~future(); + future(); + 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

The future class represents the result of an asynchronous computation.

-

+

future public construct/copy/destruct

  1. -
    future();
    +
    future();

    Creates a null future.

  2. -
    future(const future<T> & other);
    +
    future(const future<T> & other);

    Creates a new future object as a copy of other.

  3. -
    future& operator=(const future<T> & other);
    +
    future& operator=(const future<T> & other);

    Copies the future from other.

  4. -
    ~future();
    +
    ~future();

    Destroys the future object.

    @@ -79,30 +79,30 @@
-

-future public member functions

+

+future public member functions

  1. -
    T get();
    +
    T get();

    Returns the result stored in the future. This will block until the computation is completed and the result is ready.

  2. -
    bool valid() const;
    +
    bool valid() const;

    Returns true if the future is valid.

  3. -
    void wait() const;
    +
    void wait() const;

    Blocks until the asynchronous computation is complete.

  4. -
    event get_event() const;
    +
    event get_event() const;

    Returns the event associated with the future.

    diff --git a/boost/compute/gather.html b/boost/compute/gather.html index 58762274..540787db 100644 --- a/boost/compute/gather.html +++ b/boost/compute/gather.html @@ -30,7 +30,7 @@ void gather(InputIterator first, InputIterator last, MapIterator map, OutputIterator result, command_queue & queue);
-

Description

+

Description

Copies the elements from the range [first, last) to the range beginning at result diff --git a/boost/compute/generate.html b/boost/compute/generate.html index fdc9472f..a9636f19 100644 --- a/boost/compute/generate.html +++ b/boost/compute/generate.html @@ -29,7 +29,7 @@ void generate(OutputIterator first, OutputIterator last, Generator generator, command_queue & 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 f2c38ed8..af27f652 100644 --- a/boost/compute/generate_n.html +++ b/boost/compute/generate_n.html @@ -29,7 +29,7 @@ void generate_n(OutputIterator first, Size count, Generator generator, command_queue & queue);

-

Description

+

Description

Stores the result of generator for each element in the range [first, first + count). diff --git a/boost/compute/inclusive_scan.html b/boost/compute/inclusive_scan.html index bb62942a..c9a38eb6 100644 --- a/boost/compute/inclusive_scan.html +++ b/boost/compute/inclusive_scan.html @@ -7,13 +7,13 @@ - +

-PrevUpHomeNext +PrevUpHomeNext
@@ -30,7 +30,7 @@ inclusive_scan(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue);
-

Description

+

Description

Performs an inclusive scan on the elements in the range [first, last) and stores the results in @@ -60,7 +60,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/inner_product_idp7351296.html b/boost/compute/inner_product_idp7351296.html new file mode 100644 index 00000000..5b4bb18d --- /dev/null +++ b/boost/compute/inner_product_idp7351296.html @@ -0,0 +1,53 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp7363440.html b/boost/compute/inner_product_idp7363440.html new file mode 100644 index 00000000..4aa60901 --- /dev/null +++ b/boost/compute/inner_product_idp7363440.html @@ -0,0 +1,59 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp7658352.html b/boost/compute/inner_product_idp7658352.html new file mode 100644 index 00000000..72d30a14 --- /dev/null +++ b/boost/compute/inner_product_idp7658352.html @@ -0,0 +1,53 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp7670496.html b/boost/compute/inner_product_idp7670496.html new file mode 100644 index 00000000..1152a990 --- /dev/null +++ b/boost/compute/inner_product_idp7670496.html @@ -0,0 +1,59 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp8319056.html b/boost/compute/inner_product_idp8319056.html new file mode 100644 index 00000000..1441d916 --- /dev/null +++ b/boost/compute/inner_product_idp8319056.html @@ -0,0 +1,53 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp8324160.html b/boost/compute/inner_product_idp8324160.html new file mode 100644 index 00000000..1734e411 --- /dev/null +++ b/boost/compute/inner_product_idp8324160.html @@ -0,0 +1,53 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp8331200.html b/boost/compute/inner_product_idp8331200.html new file mode 100644 index 00000000..577bc92a --- /dev/null +++ b/boost/compute/inner_product_idp8331200.html @@ -0,0 +1,59 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp8336304.html b/boost/compute/inner_product_idp8336304.html new file mode 100644 index 00000000..b68e0617 --- /dev/null +++ b/boost/compute/inner_product_idp8336304.html @@ -0,0 +1,59 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp8368832.html b/boost/compute/inner_product_idp8368832.html new file mode 100644 index 00000000..90b0821e --- /dev/null +++ b/boost/compute/inner_product_idp8368832.html @@ -0,0 +1,53 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp8370064.html b/boost/compute/inner_product_idp8370064.html new file mode 100644 index 00000000..4edfa21f --- /dev/null +++ b/boost/compute/inner_product_idp8370064.html @@ -0,0 +1,53 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp8380976.html b/boost/compute/inner_product_idp8380976.html new file mode 100644 index 00000000..62c0b2fc --- /dev/null +++ b/boost/compute/inner_product_idp8380976.html @@ -0,0 +1,59 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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_idp8382208.html b/boost/compute/inner_product_idp8382208.html new file mode 100644 index 00000000..0395afb1 --- /dev/null +++ b/boost/compute/inner_product_idp8382208.html @@ -0,0 +1,59 @@ + + + +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);
+
+

Description

+

+ Returns the inner product of the elements in the range + [first1, last1) with the elements in the + range starting 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/iota.html b/boost/compute/iota.html index 18a8f17e..54d590a8 100644 --- a/boost/compute/iota.html +++ b/boost/compute/iota.html @@ -6,14 +6,14 @@ - +
-PrevUpHomeNext +PrevUpHomeNext
@@ -29,7 +29,7 @@ Iterator iota(Iterator first, Iterator last, const T& value, command_queue & queue);
-

Description

+

Description

Fills the range [first, last) with sequential values starting at value. @@ -55,7 +55,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/is_partitioned.html b/boost/compute/is_partitioned.html index 908e2191..0f4d7470 100644 --- a/boost/compute/is_partitioned.html +++ b/boost/compute/is_partitioned.html @@ -29,7 +29,7 @@ bool is_partitioned(InputIterator first, InputIterator last, UnaryPredicate predicate, command_queue & queue);
-

Description

+

Description

Returns true if the values in the range [first, last) are in partitioned diff --git a/boost/compute/is_sorted.html b/boost/compute/is_sorted.html index 85accd68..b19b7ad4 100644 --- a/boost/compute/is_sorted.html +++ b/boost/compute/is_sorted.html @@ -29,13 +29,13 @@ bool is_sorted(InputIterator first, InputIterator last, command_queue & queue);

-

Description

+

Description

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

- See also: sort() + See also: sort()

diff --git a/boost/compute/iter_swap.html b/boost/compute/iter_swap.html index 6d0def9e..10055c0f 100644 --- a/boost/compute/iter_swap.html +++ b/boost/compute/iter_swap.html @@ -28,7 +28,7 @@ template<typename Iterator1, typename Iterator2> void iter_swap(Iterator1 a, Iterator2 b, command_queue & queue);
-

Description

+

Description

Swaps the elements pointed to by the the iterators a and b. diff --git a/boost/compute/kernel.html b/boost/compute/kernel.html index ee258966..020fc15e 100644 --- a/boost/compute/kernel.html +++ b/boost/compute/kernel.html @@ -28,30 +28,31 @@ class kernel { public: // construct/copy/destruct - kernel(const program&, const std::string&); - kernel(const kernel &); - kernel& operator=(const kernel &); - ~kernel(); + kernel(const program&, const std::string&); + explicit kernel(cl_kernel, bool = true); + kernel(const kernel &); + kernel& operator=(const kernel &); + ~kernel(); - // public member functions - std::string name() const; - size_t num_args() const; - program get_program() const; - context get_context() const; - template<typename T> T get_info(cl_kernel_info) const; - void set_arg(size_t, size_t, const void*); - template<typename T> void set_arg(size_t, const T&); - operator cl_kernel() const; + // public member functions + std::string name() const; + size_t num_args() const; + program get_program() const; + context get_context() const; + template<typename T> T get_info(cl_kernel_info) const; + void set_arg(size_t, size_t, const void*); + template<typename T> void set_arg(size_t, const T&); + operator cl_kernel() const; };

-

Description

+

Description

Once created, kernels are executed on a compute device using one of the following methods:

@@ -60,32 +61,40 @@ command_queue

-

+

kernel public construct/copy/destruct

  1. -
    kernel(const program& program, const std::string& name);
    +
    kernel(const program& program, const std::string& name);

    Creates a new kernel object from program with name.

  2. -
    kernel(const kernel & other);
    +
    explicit kernel(cl_kernel kernel, bool retain = true);
    +

    + Creates a new kernel object for kernel. If + retain is true (the default) the + reference count for kernel will be incremented. +

    +
    3. +
  3. +
    kernel(const kernel & other);

    Creates a new kernel object as a copy of other.

  4. -
    kernel& operator=(const kernel & other);
    +
    kernel& operator=(const kernel & other);

    Copies the kernel from other.

  5. -
    ~kernel();
    +
    ~kernel();

    Destroys the kernel object.

    @@ -93,42 +102,42 @@
-

-kernel public member functions

+

+kernel public member functions

  1. -
    std::string name() const;
    +
    std::string name() const;

    Returns the name of the kernel.

  2. -
    size_t num_args() const;
    +
    size_t num_args() const;

    Returns the number of arguments that the kernel function expects.

  3. -
    program get_program() const;
    +
    program get_program() const;

    Returns the program for the kernel.

  4. -
    context get_context() const;
    +
    context get_context() const;

    Returns the context for the kernel.

  5. -
    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.

    For example, to get the name of the kernel (without using the - name() method): + name() method): 

     std::string function_name = kernel.get_info<std::string>(CL_KERNEL_FUNCTION_NAME);
@@ -137,20 +146,20 @@ std::string function_name = kernel.get_info<std::string>(CL_KERNEL_FUNCTIO
  6. -
    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.

  7. -
    template<typename T> void set_arg(size_t index, const T& value);
    +
    template<typename T> void set_arg(size_t index, const T& value);

    Sets the argument at index to value.

  8. -
     operator cl_kernel() const;
    +
     operator cl_kernel() const;

    Converts the kernel object to a cl_kernel.

    diff --git a/boost/compute/lower_bound.html b/boost/compute/lower_bound.html index 3cff2375..4ae2f085 100644 --- a/boost/compute/lower_bound.html +++ b/boost/compute/lower_bound.html @@ -30,7 +30,7 @@ lower_bound(InputIterator first, InputIterator last, const T& value, command_queue & queue);
-

Description

+

Description

Returns an iterator pointing to the first element in the range sorted range [first, last) that is not diff --git a/boost/compute/make_buffer_iterator.html b/boost/compute/make_buffer_iterator.html index 744d980d..d7b72fe0 100644 --- a/boost/compute/make_buffer_iterator.html +++ b/boost/compute/make_buffer_iterator.html @@ -29,7 +29,7 @@ buffer_iterator<T> make_buffer_iterator(const buffer& buffer, size_t index = 0);

-

Description

+

Description

Returns a new buffer_iterator for buffer at index. diff --git a/boost/compute/make_constant_iterator.html b/boost/compute/make_constant_iterator.html index ac6426db..5f1e8e55 100644 --- a/boost/compute/make_constant_iterator.html +++ b/boost/compute/make_constant_iterator.html @@ -29,7 +29,7 @@ constant_iterator<T> make_constant_iterator(const T& value, size_t index = 0);

-

Description

+

Description

Returns a new constant_iterator with value at index. diff --git a/boost/compute/make_counting_iterator.html b/boost/compute/make_counting_iterator.html index 8f3afda6..84a89b76 100644 --- a/boost/compute/make_counting_iterator.html +++ b/boost/compute/make_counting_iterator.html @@ -28,7 +28,7 @@ template<typename T> counting_iterator<T> make_counting_iterator(const T& init);

-

Description

+

Description

Returns a new counting_iterator starting at init. diff --git a/boost/compute/make_permutation_iterator.html b/boost/compute/make_permutation_iterator.html index 4140a81a..ac094e7b 100644 --- a/boost/compute/make_permutation_iterator.html +++ b/boost/compute/make_permutation_iterator.html @@ -29,7 +29,7 @@ permutation_iterator<ElementIterator, IndexIterator> make_permutation_iterator(ElementIterator e, IndexIterator i);

-

Description

+

Description

Returns a new permutation_iterator for element iterator e and index iterator i. diff --git a/boost/compute/make_transform_iterator.html b/boost/compute/make_transform_iterator.html index 7ba021d5..2b2e9f4c 100644 --- a/boost/compute/make_transform_iterator.html +++ b/boost/compute/make_transform_iterator.html @@ -29,7 +29,7 @@ transform_iterator<InputIterator, UnaryFunction> make_transform_iterator(InputIterator iterator, UnaryFunction function);

-

Description

+

Description

Returns a new transform_iterator with iterator and transform. diff --git a/boost/compute/make_zip_iterator.html b/boost/compute/make_zip_iterator.html index c1b8d433..7ab1a4e9 100644 --- a/boost/compute/make_zip_iterator.html +++ b/boost/compute/make_zip_iterator.html @@ -27,7 +27,7 @@ template<typename IteratorTuple> zip_iterator<IteratorTuple> make_zip_iterator(IteratorTuple iterators);

-

Description

+

Description

Returns a new zip_iterator with iterators. diff --git a/boost/compute/max_element.html b/boost/compute/max_element.html index bb8767ca..36644688 100644 --- a/boost/compute/max_element.html +++ b/boost/compute/max_element.html @@ -29,7 +29,7 @@ InputIterator max_element(InputIterator first, InputIterator last, command_queue & queue);

-

Description

+

Description

Returns an iterator pointing the the element in the range [first, last) with the maximum value. diff --git a/boost/compute/merge.html b/boost/compute/merge.html index af510034..ee54955d 100644 --- a/boost/compute/merge.html +++ b/boost/compute/merge.html @@ -31,7 +31,7 @@ merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, command_queue & queue);

-

Description

+

Description

Merges the sorted values in the range [first1, last1) with the sorted values in the range diff --git a/boost/compute/min_element.html b/boost/compute/min_element.html index 19c27452..d1b3a9e2 100644 --- a/boost/compute/min_element.html +++ b/boost/compute/min_element.html @@ -29,7 +29,7 @@ InputIterator min_element(InputIterator first, InputIterator last, command_queue & queue);

-

Description

+

Description

Returns an iterator pointing the the element in the range [first, last) with the minimum value. diff --git a/boost/compute/minmax_element.html b/boost/compute/minmax_element.html index b3563292..af804bc9 100644 --- a/boost/compute/minmax_element.html +++ b/boost/compute/minmax_element.html @@ -30,7 +30,7 @@ minmax_element(InputIterator first, InputIterator last, command_queue & 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 diff --git a/boost/compute/mismatch.html b/boost/compute/mismatch.html index 736cb2f3..f1a35748 100644 --- a/boost/compute/mismatch.html +++ b/boost/compute/mismatch.html @@ -30,7 +30,7 @@ mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, command_queue & queue);

-

Description

+

Description

Returns a pair of iterators pointing to the first position where the range [first1, last1) and the range diff --git a/boost/compute/none_of.html b/boost/compute/none_of.html index 4874b1e9..e485ea13 100644 --- a/boost/compute/none_of.html +++ b/boost/compute/none_of.html @@ -29,7 +29,7 @@ bool none_of(InputIterator first, InputIterator last, UnaryPredicate predicate, command_queue & queue);

-

Description

+

Description

Returns true if predicate returns true for none of the elements in the range diff --git a/boost/compute/partial_sum.html b/boost/compute/partial_sum.html index 3b43d10c..9b5313d7 100644 --- a/boost/compute/partial_sum.html +++ b/boost/compute/partial_sum.html @@ -30,7 +30,7 @@ partial_sum(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue);

-

Description

+

Description

Calculates the partial sum of the elements in the range [first, last) and writes the resulting diff --git a/boost/compute/partition.html b/boost/compute/partition.html index 2d1aace9..cd0ebb04 100644 --- a/boost/compute/partition.html +++ b/boost/compute/partition.html @@ -29,7 +29,7 @@ Iterator partition(Iterator first, Iterator last, UnaryPredicate predicate, command_queue & queue);

-

Description

+

Description

Partitions the values in the range [first, last) according to predicate. diff --git a/boost/compute/partition_copy.html b/boost/compute/partition_copy.html index b377f8be..cfa3fd75 100644 --- a/boost/compute/partition_copy.html +++ b/boost/compute/partition_copy.html @@ -32,7 +32,7 @@ OutputIterator1 first_true, OutputIterator2 first_false, UnaryPredicate predicate, command_queue & queue);

-

Description

+

Description

Copies all the elements in the range [first, last) for which predicate returns diff --git a/boost/compute/permutation_iterator.html b/boost/compute/permutation_iterator.html index 03f4563b..386ff500 100644 --- a/boost/compute/permutation_iterator.html +++ b/boost/compute/permutation_iterator.html @@ -28,7 +28,7 @@ class permutation_iterator { };

-

Description

+

Description

The permutation_iterator class provides an iterator which returns the value at a position determined by a separate diff --git a/boost/compute/pinned_allocator.html b/boost/compute/pinned_allocator.html index da0c4817..453971bd 100644 --- a/boost/compute/pinned_allocator.html +++ b/boost/compute/pinned_allocator.html @@ -29,7 +29,7 @@ class pinned_allocator { };

-

Description

+

Description

See also: allocator

diff --git a/boost/compute/platform.html b/boost/compute/platform.html index e54f6bcc..c29954e5 100644 --- a/boost/compute/platform.html +++ b/boost/compute/platform.html @@ -28,54 +28,54 @@ 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; - template<typename T> T get_info(cl_platform_info) 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; + // public member functions + cl_platform_id id() const; + std::string name() const; + std::string vendor() const; + template<typename T> T get_info(cl_platform_info) 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; - // public static functions - static std::vector<platform> platforms(); - static size_t platform_count(); + // public static functions + static std::vector<platform> platforms(); + static size_t platform_count(); };
-

Description

+

Description

The platform class provides an interface to an OpenCL platform.

-

+

platform public construct/copy/destruct

  1. -
    explicit platform(cl_platform_id id);
    +
    explicit platform(cl_platform_id id);

    Creates a new platform object for id.

  2. -
    platform(const platform & other);
    +
    platform(const platform & other);

    Creates a new platform object as a copy of other.

  3. -
    platform& operator=(const platform & other);
    +
    platform& operator=(const platform & other);

    Copies the platform from other.

  4. -
    ~platform();
    +
    ~platform();

    Destroys the platform object.

    @@ -83,41 +83,41 @@
-

-platform public member functions

+

+platform public member functions

  1. -
    cl_platform_id id() const;
    +
    cl_platform_id id() const;

    Returns the ID of the platform.

  2. -
    std::string name() const;
    +
    std::string name() const;

    Returns the name of the platform.

  3. -
    std::string vendor() const;
    +
    std::string vendor() const;

    Returns the name of the vendor of the platform.

  4. -
    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.

  5. -
    std::vector<device> devices(cl_device_type type = CL_DEVICE_TYPE_ALL) const;
    +
    std::vector<device> devices(cl_device_type type = CL_DEVICE_TYPE_ALL) const;

    Returns a vector of devices for the platform.

  6. -
    size_t device_count(cl_device_type type = CL_DEVICE_TYPE_ALL) const;
    +
    size_t device_count(cl_device_type type = CL_DEVICE_TYPE_ALL) const;

    Returns the number of devices on the platform.

    @@ -125,18 +125,18 @@
-

-platform public static functions

+

+platform public static functions

  1. -
    static std::vector<platform> platforms();
    +
    static std::vector<platform> platforms();

    Returns a vector of all the OpenCL platforms available on the system.

  2. -
    static size_t platform_count();
    +
    static size_t platform_count();

    Returns the total number of OpenCL platforms available on the system. diff --git a/boost/compute/program.html b/boost/compute/program.html index 12362206..a217f38a 100644 --- a/boost/compute/program.html +++ b/boost/compute/program.html @@ -28,52 +28,61 @@ class program { public: // construct/copy/destruct - program(); - program(const program&); - program& operator=(const program&); - ~program(); + program(); + explicit program(cl_program, bool = true); + program(const program&); + program& operator=(const program&); + ~program(); - // public member functions - std::string source() const; - template<typename T> T get_info(cl_program_info) const; - void build(const std::string& = std::string()); - operator cl_program() const; + // public member functions + std::string source() const; + template<typename T> T get_info(cl_program_info) const; + void build(const std::string& = std::string()); + operator cl_program() 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&); };

-

Description

+

Description

See also: kernel

-

+

program public construct/copy/destruct

  1. -
    program();
    +
    program();

    Creates a null program object.

  2. -
    program(const program& other);
    +
    explicit program(cl_program program, bool retain = true);
    +

    + Creates a new program object for program. If + retain is true (the default) the + reference count for program will be incremented. +

    +
    3. +
  3. +
    program(const program& other);

    Creates a new program object as a copy of other.

  4. -
    program& operator=(const program& other);
    +
    program& operator=(const program& other);

    Copies the program from other.

  5. -
    ~program();
    +
    ~program();

    Destroys the program object.

    @@ -81,29 +90,29 @@
-

-program public member functions

+

+program public member functions

  1. -
    std::string source() const;
    +
    std::string source() const;

    Returns the source code for the program.

  2. -
    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.

  3. -
    void build(const std::string& options = std::string());
    +
    void build(const std::string& options = std::string());

    Builds the program with options.

  4. -
     operator cl_program() const;
    +
     operator cl_program() const;

    Converts the program object to a cl_program.

    @@ -111,12 +120,12 @@
-

-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 object with source in context. @@ -124,7 +133,7 @@ 

  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 object with file in context. diff --git a/boost/compute/random_shuffle.html b/boost/compute/random_shuffle.html index a3b449e9..ec3ec703 100644 --- a/boost/compute/random_shuffle.html +++ b/boost/compute/random_shuffle.html @@ -28,7 +28,7 @@ template<typename Iterator> void random_shuffle(Iterator first, Iterator last, command_queue & queue);

-

Description

+

Description

Randomly shuffles the values in the range [first, last). diff --git a/boost/compute/reduce.html b/boost/compute/reduce.html index 6a257802..c8989519 100644 --- a/boost/compute/reduce.html +++ b/boost/compute/reduce.html @@ -29,7 +29,7 @@ T reduce(InputIterator first, InputIterator last, T init, BinaryFunction function, command_queue & queue);

-

Description

+

Description

Returns the result of applying function to the elements in the range [first, last) @@ -37,7 +37,7 @@

The difference between the reduce() function and the - accumulate() function is that + accumulate() function is that reduce() requires the binary operator to be commutative.

diff --git a/boost/compute/remove.html b/boost/compute/remove.html index 7c0db5e5..1df7f888 100644 --- a/boost/compute/remove.html +++ b/boost/compute/remove.html @@ -29,7 +29,7 @@ Iterator remove(Iterator first, Iterator last, const T& value, command_queue & queue);
-

Description

+

Description

Removes each element equal to value in the range [first, last). diff --git a/boost/compute/remove_if.html b/boost/compute/remove_if.html index bf53650f..88bd1055 100644 --- a/boost/compute/remove_if.html +++ b/boost/compute/remove_if.html @@ -29,7 +29,7 @@ Iterator remove_if(Iterator first, Iterator last, UnaryPredicate predicate, command_queue & queue);

-

Description

+

Description

Removes each element for which predicate returns true in the range [first, diff --git a/boost/compute/replace.html b/boost/compute/replace.html index da7d4aa2..2b12930f 100644 --- a/boost/compute/replace.html +++ b/boost/compute/replace.html @@ -29,7 +29,7 @@ void replace(Iterator first, Iterator last, const T& old_value, const T& new_value, command_queue & queue);

-

Description

+

Description

Replaces each instance of old_value in the range [first, last) with diff --git a/boost/compute/replace_copy.html b/boost/compute/replace_copy.html index d797cc1a..45079de0 100644 --- a/boost/compute/replace_copy.html +++ b/boost/compute/replace_copy.html @@ -30,7 +30,7 @@ OutputIterator result, const T& old_value, const T& new_value, command_queue & queue);

-

Description

+

Description

Copies the values in the range [first, last) to the range beginning at result diff --git a/boost/compute/reverse.html b/boost/compute/reverse.html index f78c2773..bf427c04 100644 --- a/boost/compute/reverse.html +++ b/boost/compute/reverse.html @@ -28,7 +28,7 @@ template<typename Iterator> void reverse(Iterator first, Iterator last, command_queue & queue);

-

Description

+

Description

Reverses the values in the range [first, last). diff --git a/boost/compute/reverse_copy.html b/boost/compute/reverse_copy.html index ecd975ea..f12664dc 100644 --- a/boost/compute/reverse_copy.html +++ b/boost/compute/reverse_copy.html @@ -30,7 +30,7 @@ reverse_copy(InputIterator first, InputIterator last, OutputIterator result, command_queue & queue);

-

Description

+

Description

Copies the values in the range [first, last) in reversed order to the range beginning at diff --git a/boost/compute/scatter.html b/boost/compute/scatter.html index 91b22ba2..d0aeee19 100644 --- a/boost/compute/scatter.html +++ b/boost/compute/scatter.html @@ -7,13 +7,13 @@ - +

-PrevUpHomeNext +PrevUpHomeNext
@@ -30,7 +30,7 @@ void scatter(InputIterator first, InputIterator last, MapIterator map, OutputIterator result, command_queue & queue);
-

Description

+

Description

Copies the elements from the range [first, last) to the range beginning at result @@ -52,7 +52,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/sort_idp7710096.html b/boost/compute/sort_idp7710096.html new file mode 100644 index 00000000..d97ad0e7 --- /dev/null +++ b/boost/compute/sort_idp7710096.html @@ -0,0 +1,54 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). +

+

+ See also: 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/sort_idp7721856.html b/boost/compute/sort_idp7721856.html new file mode 100644 index 00000000..6ed1d993 --- /dev/null +++ b/boost/compute/sort_idp7721856.html @@ -0,0 +1,56 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). The relative order of identical values is + preserved. +

+

+ See also: copy() + 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/sort_idp8017152.html b/boost/compute/sort_idp8017152.html new file mode 100644 index 00000000..ccca25f5 --- /dev/null +++ b/boost/compute/sort_idp8017152.html @@ -0,0 +1,54 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). +

+

+ See also: 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/sort_idp8028912.html b/boost/compute/sort_idp8028912.html new file mode 100644 index 00000000..4ca68642 --- /dev/null +++ b/boost/compute/sort_idp8028912.html @@ -0,0 +1,56 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). The relative order of identical values is + preserved. +

+

+ See also: copy() + 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/sort_idp8677856.html b/boost/compute/sort_idp8677856.html new file mode 100644 index 00000000..436a8da0 --- /dev/null +++ b/boost/compute/sort_idp8677856.html @@ -0,0 +1,54 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). +

+

+ See also: 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/sort_idp8682960.html b/boost/compute/sort_idp8682960.html new file mode 100644 index 00000000..892d4084 --- /dev/null +++ b/boost/compute/sort_idp8682960.html @@ -0,0 +1,54 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). +

+

+ See also: 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/sort_idp8689616.html b/boost/compute/sort_idp8689616.html new file mode 100644 index 00000000..5822be81 --- /dev/null +++ b/boost/compute/sort_idp8689616.html @@ -0,0 +1,56 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). The relative order of identical values is + preserved. +

+

+ See also: copy() + 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/sort_idp8694720.html b/boost/compute/sort_idp8694720.html new file mode 100644 index 00000000..924f0c12 --- /dev/null +++ b/boost/compute/sort_idp8694720.html @@ -0,0 +1,56 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). The relative order of identical values is + preserved. +

+

+ See also: copy() + 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/sort_idp8727632.html b/boost/compute/sort_idp8727632.html new file mode 100644 index 00000000..f4d07933 --- /dev/null +++ b/boost/compute/sort_idp8727632.html @@ -0,0 +1,54 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). +

+

+ See also: 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/sort_idp8728864.html b/boost/compute/sort_idp8728864.html new file mode 100644 index 00000000..bb36a019 --- /dev/null +++ b/boost/compute/sort_idp8728864.html @@ -0,0 +1,54 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). +

+

+ See also: 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/sort_idp8739392.html b/boost/compute/sort_idp8739392.html new file mode 100644 index 00000000..4d60185b --- /dev/null +++ b/boost/compute/sort_idp8739392.html @@ -0,0 +1,56 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). The relative order of identical values is + preserved. +

+

+ See also: copy() + 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/sort_idp8740624.html b/boost/compute/sort_idp8740624.html new file mode 100644 index 00000000..489e9890 --- /dev/null +++ b/boost/compute/sort_idp8740624.html @@ -0,0 +1,56 @@ + + + +Function template sort + + + + + + + + +
+
+
+PrevUpHomeNext +
+
+
+
+

Function template sort

+

boost::compute::sort

+
+

Synopsis

+
// In header: <boost/compute/algorithm/stable_sort.hpp>
+
+
+template<typename Iterator> 
+  void sort(Iterator first, Iterator last, command_queue & queue);
+
+

Description

+

+ Sorts the values in the range [first, + last). The relative order of identical values is + preserved. +

+

+ See also: copy() + 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/string.html b/boost/compute/string.html index 12bc676f..efd0029b 100644 --- a/boost/compute/string.html +++ b/boost/compute/string.html @@ -27,7 +27,7 @@ typedef basic_string<char> string;
-

Description

+

Description

Typedef for a string containing ASCII characters.

diff --git a/boost/compute/swap_ranges.html b/boost/compute/swap_ranges.html index cc9929b0..d0cd7086 100644 --- a/boost/compute/swap_ranges.html +++ b/boost/compute/swap_ranges.html @@ -6,14 +6,14 @@ - - + +
-PrevUpHomeNext +PrevUpHomeNext
@@ -29,7 +29,7 @@ Iterator2 swap_ranges(Iterator1 first1, Iterator1 last1, Iterator2 first2, command_queue & queue);
-

Description

+

Description

Swaps the elements in the range [first1, last1) with the elements in the range beginning at @@ -56,7 +56,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/boost/compute/system.html b/boost/compute/system.html index ba1dbbbd..e244e9c7 100644 --- a/boost/compute/system.html +++ b/boost/compute/system.html @@ -28,25 +28,25 @@ class system { public: - // public static functions - static device default_device(); - static device default_gpu_device(); - static device default_cpu_device(); - static context default_context(); - static std::vector<platform> platforms(); - static size_t platform_count(); + // public static functions + static device default_device(); + static device default_gpu_device(); + static device default_cpu_device(); + static context default_context(); + static std::vector<platform> platforms(); + static size_t platform_count(); };
-

Description

+

Description

The system class provides an interface to an OpenCL system.

-

-system public static functions

+

+system public static functions

  1. -
    static device default_device();
    +
    static device default_device();

    Returns the default compute device for the system. The default device returned is the first GPU device found. If no GPU devices @@ -56,32 +56,32 @@

  2. -
    static device default_gpu_device();
    +
    static device default_gpu_device();

    Returns the default GPU compute device for the system.

  3. -
    static device default_cpu_device();
    +
    static device default_cpu_device();

    Returns the default CPU compute device for the system.

  4. -
    static context default_context();
    +
    static context default_context();

    Returns the default compute context for the system.

  5. -
    static std::vector<platform> platforms();
    +
    static std::vector<platform> platforms();

    Returns a vector of all the OpenCL platforms available on the system.

  6. -
    static size_t platform_count();
    +
    static size_t platform_count();

    Returns the total number of OpenCL platforms available on the system. diff --git a/boost/compute/timer.html b/boost/compute/timer.html index 8d0bf300..e66f61c4 100644 --- a/boost/compute/timer.html +++ b/boost/compute/timer.html @@ -7,13 +7,13 @@ - +

    -PrevUpHomeNext +PrevUpHomeNext
    @@ -28,19 +28,19 @@ class timer { public: // construct/copy/destruct - timer(const command_queue &); - timer(const timer<T> &); - timer& operator=(const timer<T> &); - ~timer(); + timer(const command_queue &); + timer(const timer<T> &); + timer& operator=(const timer<T> &); + ~timer(); - // public member functions - void start(); - void stop(); - bool is_stopped() const; - ulong_ elapsed() const; + // public member functions + void start(); + void stop(); + bool is_stopped() const; + ulong_ elapsed() const; };
    -

    Description

    +

    Description

    The timer class represents a timer.

    @@ -49,31 +49,31 @@ data from the host to the device:

    -

    +

    timer public construct/copy/destruct

    1. -
      timer(const command_queue & queue);
      +
      timer(const command_queue & queue);

      Creates a new timer for queue.

    2. -
      timer(const timer<T> & other);
      +
      timer(const timer<T> & other);

      Creates a new timer object as a copy of other.

    3. -
      timer& operator=(const timer<T> & other);
      +
      timer& operator=(const timer<T> & other);

      Copies the timer from other.

    4. -
      ~timer();
      +
      ~timer();

      Destroys the timer object.

      @@ -81,29 +81,29 @@
    -

    -timer public member functions

    +

    +timer public member functions

    1. -
      void start();
      +
      void start();

      Starts the timer.

    2. -
      void stop();
      +
      void stop();

      Stops the timer.

    3. -
      bool is_stopped() const;
      +
      bool is_stopped() const;

      Returns true if the timer is stopped.

    4. -
      ulong_ elapsed() const;
      +
      ulong_ elapsed() const;

      Returns the elapsed time in nanoseconds.

      @@ -122,7 +122,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/boost/compute/transform_idp7747760.html b/boost/compute/transform_idp7747760.html new file mode 100644 index 00000000..5c60c08e --- /dev/null +++ b/boost/compute/transform_idp7747760.html @@ -0,0 +1,64 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first, + last) using op and stores the results + in the range beginning at result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp7760544.html b/boost/compute/transform_idp7760544.html new file mode 100644 index 00000000..76b4357d --- /dev/null +++ b/boost/compute/transform_idp7760544.html @@ -0,0 +1,66 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first1, + last1) and first2 using op + and stores the results in the range beginning at + result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp8054816.html b/boost/compute/transform_idp8054816.html new file mode 100644 index 00000000..6bf25d61 --- /dev/null +++ b/boost/compute/transform_idp8054816.html @@ -0,0 +1,64 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first, + last) using op and stores the results + in the range beginning at result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp8067600.html b/boost/compute/transform_idp8067600.html new file mode 100644 index 00000000..316e75d8 --- /dev/null +++ b/boost/compute/transform_idp8067600.html @@ -0,0 +1,66 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first1, + last1) and first2 using op + and stores the results in the range beginning at + result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp8715520.html b/boost/compute/transform_idp8715520.html new file mode 100644 index 00000000..bdb91b10 --- /dev/null +++ b/boost/compute/transform_idp8715520.html @@ -0,0 +1,64 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first, + last) using op and stores the results + in the range beginning at result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp8720624.html b/boost/compute/transform_idp8720624.html new file mode 100644 index 00000000..360f8e92 --- /dev/null +++ b/boost/compute/transform_idp8720624.html @@ -0,0 +1,64 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first, + last) using op and stores the results + in the range beginning at result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp8728304.html b/boost/compute/transform_idp8728304.html new file mode 100644 index 00000000..4487edd5 --- /dev/null +++ b/boost/compute/transform_idp8728304.html @@ -0,0 +1,66 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first1, + last1) and first2 using op + and stores the results in the range beginning at + result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp8733408.html b/boost/compute/transform_idp8733408.html new file mode 100644 index 00000000..11b5db17 --- /dev/null +++ b/boost/compute/transform_idp8733408.html @@ -0,0 +1,66 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first1, + last1) and first2 using op + and stores the results in the range beginning at + result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp8765296.html b/boost/compute/transform_idp8765296.html new file mode 100644 index 00000000..7cae4629 --- /dev/null +++ b/boost/compute/transform_idp8765296.html @@ -0,0 +1,64 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first, + last) using op and stores the results + in the range beginning at result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp8766528.html b/boost/compute/transform_idp8766528.html new file mode 100644 index 00000000..2ca018f7 --- /dev/null +++ b/boost/compute/transform_idp8766528.html @@ -0,0 +1,64 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first, + last) using op and stores the results + in the range beginning at result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp8778080.html b/boost/compute/transform_idp8778080.html new file mode 100644 index 00000000..5bb9ed25 --- /dev/null +++ b/boost/compute/transform_idp8778080.html @@ -0,0 +1,66 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first1, + last1) and first2 using op + and stores the results in the range beginning at + result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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_idp8779312.html b/boost/compute/transform_idp8779312.html new file mode 100644 index 00000000..9c41c4ac --- /dev/null +++ b/boost/compute/transform_idp8779312.html @@ -0,0 +1,66 @@ + + + +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);
      +
      +

      Description

      +

      + Transforms the elements in the range [first1, + last1) and first2 using op + and stores the results in the range beginning at + result. +

      +
      ++ + + + +

      Returns:

      		 + An iterator pointing to the end of the result range. +
      +
      +
      + + + +
      Copyright © 2013 Kyle Lutz

      + Distributed under the Boost Software License, Version 1.0. (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 4c404771..05bb406b 100644 --- a/boost/compute/transform_iterator.html +++ b/boost/compute/transform_iterator.html @@ -28,7 +28,7 @@ class transform_iterator { };
    -

    Description

    +

    Description

    The transform_iterator class provides an adaptor for an input iterator which transforms each value with a unary function diff --git a/boost/compute/transform_reduce_idp7778832.html b/boost/compute/transform_reduce_idp7778832.html new file mode 100644 index 00000000..8441f7a7 --- /dev/null +++ b/boost/compute/transform_reduce_idp7778832.html @@ -0,0 +1,57 @@ + + + +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 UnaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator first, InputIterator last, 
+                     UnaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & queue);
    +
    +

    Description

    +

    + Transforms each value in the range [first, + last) with the unary transform_function + and then reduces each transformed value and init 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_reduce_idp7793584.html b/boost/compute/transform_reduce_idp7793584.html new file mode 100644 index 00000000..ae28116f --- /dev/null +++ b/boost/compute/transform_reduce_idp7793584.html @@ -0,0 +1,60 @@ + + + +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 BinaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                     InputIterator2 first2, 
+                     BinaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & 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 and init 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_reduce_idp8085888.html b/boost/compute/transform_reduce_idp8085888.html new file mode 100644 index 00000000..83f45f0e --- /dev/null +++ b/boost/compute/transform_reduce_idp8085888.html @@ -0,0 +1,57 @@ + + + +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 UnaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator first, InputIterator last, 
+                     UnaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & queue);
    +
    +

    Description

    +

    + Transforms each value in the range [first, + last) with the unary transform_function + and then reduces each transformed value and init 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_reduce_idp8100640.html b/boost/compute/transform_reduce_idp8100640.html new file mode 100644 index 00000000..09c3b102 --- /dev/null +++ b/boost/compute/transform_reduce_idp8100640.html @@ -0,0 +1,60 @@ + + + +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 BinaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                     InputIterator2 first2, 
+                     BinaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & 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 and init 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_reduce_idp8746592.html b/boost/compute/transform_reduce_idp8746592.html new file mode 100644 index 00000000..99e04a86 --- /dev/null +++ b/boost/compute/transform_reduce_idp8746592.html @@ -0,0 +1,57 @@ + + + +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 UnaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator first, InputIterator last, 
+                     UnaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & queue);
    +
    +

    Description

    +

    + Transforms each value in the range [first, + last) with the unary transform_function + and then reduces each transformed value and init 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_reduce_idp8751696.html b/boost/compute/transform_reduce_idp8751696.html new file mode 100644 index 00000000..b3f52274 --- /dev/null +++ b/boost/compute/transform_reduce_idp8751696.html @@ -0,0 +1,57 @@ + + + +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 UnaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator first, InputIterator last, 
+                     UnaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & queue);
    +
    +

    Description

    +

    + Transforms each value in the range [first, + last) with the unary transform_function + and then reduces each transformed value and init 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_reduce_idp8761344.html b/boost/compute/transform_reduce_idp8761344.html new file mode 100644 index 00000000..fa69c0e8 --- /dev/null +++ b/boost/compute/transform_reduce_idp8761344.html @@ -0,0 +1,60 @@ + + + +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 BinaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                     InputIterator2 first2, 
+                     BinaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & 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 and init 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_reduce_idp8766448.html b/boost/compute/transform_reduce_idp8766448.html new file mode 100644 index 00000000..6f60a50e --- /dev/null +++ b/boost/compute/transform_reduce_idp8766448.html @@ -0,0 +1,60 @@ + + + +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 BinaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                     InputIterator2 first2, 
+                     BinaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & 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 and init 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_reduce_idp8796368.html b/boost/compute/transform_reduce_idp8796368.html new file mode 100644 index 00000000..1907a2de --- /dev/null +++ b/boost/compute/transform_reduce_idp8796368.html @@ -0,0 +1,57 @@ + + + +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 UnaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator first, InputIterator last, 
+                     UnaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & queue);
    +
    +

    Description

    +

    + Transforms each value in the range [first, + last) with the unary transform_function + and then reduces each transformed value and init 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_reduce_idp8797600.html b/boost/compute/transform_reduce_idp8797600.html new file mode 100644 index 00000000..e6d9261e --- /dev/null +++ b/boost/compute/transform_reduce_idp8797600.html @@ -0,0 +1,57 @@ + + + +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 UnaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator first, InputIterator last, 
+                     UnaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & queue);
    +
    +

    Description

    +

    + Transforms each value in the range [first, + last) with the unary transform_function + and then reduces each transformed value and init 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_reduce_idp8811120.html b/boost/compute/transform_reduce_idp8811120.html new file mode 100644 index 00000000..6c95afa9 --- /dev/null +++ b/boost/compute/transform_reduce_idp8811120.html @@ -0,0 +1,60 @@ + + + +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 BinaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                     InputIterator2 first2, 
+                     BinaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & 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 and init 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_reduce_idp8812352.html b/boost/compute/transform_reduce_idp8812352.html new file mode 100644 index 00000000..bc605be8 --- /dev/null +++ b/boost/compute/transform_reduce_idp8812352.html @@ -0,0 +1,60 @@ + + + +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 BinaryTransformFunction, typename T, 
+         typename BinaryReduceFunction> 
+  T transform_reduce(InputIterator1 first1, InputIterator1 last1, 
+                     InputIterator2 first2, 
+                     BinaryTransformFunction transform_function, T init, 
+                     BinaryReduceFunction reduce_function, 
+                     command_queue & 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 and init 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/upper_bound.html b/boost/compute/upper_bound.html index f74139ed..8d8a550c 100644 --- a/boost/compute/upper_bound.html +++ b/boost/compute/upper_bound.html @@ -6,14 +6,14 @@ - +
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,7 +30,7 @@ upper_bound(InputIterator first, InputIterator last, const T& value, command_queue & queue);
    -

    Description

    +

    Description

    Returns an iterator pointing to the first element in the range sorted range [first, last) that is not @@ -51,7 +51,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/boost/compute/zip_iterator.html b/boost/compute/zip_iterator.html index 6359a1da..fc4f3da2 100644 --- a/boost/compute/zip_iterator.html +++ b/boost/compute/zip_iterator.html @@ -28,7 +28,7 @@ class zip_iterator { };
    -

    Description

    +

    Description

    The zip_iterator class combines one or more iterators into a single iterator object. diff --git a/boost_compute/advanced_topics.html b/boost_compute/advanced_topics.html index 316e38e1..650c5923 100644 --- a/boost_compute/advanced_topics.html +++ b/boost_compute/advanced_topics.html @@ -61,7 +61,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/gettingstarted.html b/boost_compute/gettingstarted.html index f970d00b..8ed1631c 100644 --- a/boost_compute/gettingstarted.html +++ b/boost_compute/gettingstarted.html @@ -89,8 +89,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 1976c8c3..869c4f91 100644 --- a/boost_compute/porting_guide.html +++ b/boost_compute/porting_guide.html @@ -84,7 +84,7 @@

    - buffer::get_info<T>() + buffer::get_info<T>()

    @@ -128,7 +128,7 @@

    - command_queue::get_info<T>() + command_queue::get_info<T>()

    @@ -140,7 +140,7 @@

    - command_queue::enqueue_read_buffer() + command_queue::enqueue_read_buffer()

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

    - command_queue::enqueue_write_buffer() + command_queue::enqueue_write_buffer()

    @@ -164,7 +164,7 @@

    - command_queue::enqueue_copy_buffer() + command_queue::enqueue_copy_buffer()

    @@ -176,7 +176,7 @@

    - command_queue::enqueue_nd_range_kernel() + command_queue::enqueue_nd_range_kernel()

    @@ -188,7 +188,7 @@

    - command_queue::enqueue_task() + command_queue::enqueue_task()

    @@ -200,7 +200,7 @@

    - command_queue::enqueue_barrier() + command_queue::enqueue_barrier()

    @@ -212,7 +212,7 @@

    - command_queue::enqueue_marker() + command_queue::enqueue_marker()

    @@ -224,7 +224,7 @@

    - command_queue::flush() + command_queue::flush()

    @@ -236,7 +236,7 @@

    - command_queue::finish() + command_queue::finish()

    @@ -280,7 +280,7 @@

    - context::get_info<T>() + context::get_info<T>()

    @@ -300,7 +300,7 @@

    - device::get_info<T>() + device::get_info<T>()

    @@ -332,7 +332,7 @@

    - event::get_info<T>() + event::get_info<T>()

    @@ -344,7 +344,7 @@

    - event::get_profiling_info<T>() + event::get_profiling_info<T>()

    @@ -388,7 +388,7 @@

    - kernel::get_info<T>() + kernel::get_info<T>()

    @@ -424,7 +424,7 @@

    - kernel::set_arg() + kernel::set_arg()

    @@ -444,7 +444,7 @@

    - platform::devices() + platform::devices()

    @@ -456,7 +456,31 @@

    - platform::get_info<T>() + platform::get_info<T>() +

    + + + + +

    + clGetExtensionFunctionAddress() +

    + + +

    + platform::get_extension_function_address() +

    + + + + +

    + clUnloadCompiler() +

    + + +

    + platform::unload_compiler()

    @@ -476,7 +500,7 @@

    - program::create_with_source() + program::create_with_source()

    @@ -512,7 +536,7 @@

    - program::get_info<T>() + program::get_info<T>()

    @@ -524,7 +548,7 @@

    - program::build() + program::build()

    @@ -544,31 +568,7 @@

    - system::platforms() -

    - - - - -

    - clUnloadCompiler() -

    - - -

    - system::unload_compiler() -

    - - - - -

    - clGetExtensionFunctionAddress() -

    - - -

    - system::get_extension_function_address() + system::platforms()

    diff --git a/boost_compute/tutorial.html b/boost_compute/tutorial.html index 174d9532..bc336e46 100644 --- a/boost_compute/tutorial.html +++ b/boost_compute/tutorial.html @@ -47,12 +47,12 @@ int main() { - // get the default GPU device - boost::compute::device gpu = - boost::compute::system::default_gpu_device(); + // get the default device + boost::compute::device device = + boost::compute::system::default_device(); - // print the GPU's name - std::cout << "hello from " << gpu.name() << std::endl; + // print the device's name + std::cout << "hello from " << device.name() << std::endl; return 0; } @@ -120,7 +120,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.

    @@ -178,7 +178,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 82374f1b..f91fd02a 100644 --- a/compute/reference.html +++ b/compute/reference.html @@ -249,9 +249,9 @@ 
    namespace boost {
   namespace compute {
     template<typename InputIterator, typename T> 
-      T accumulate(InputIterator, InputIterator, T, command_queue &);
+      T accumulate(InputIterator, InputIterator, T, command_queue &);
     template<typename InputIterator, typename T, typename BinaryFunction> 
-      T accumulate(InputIterator, InputIterator, T, BinaryFunction, 
+      T accumulate(InputIterator, InputIterator, T, BinaryFunction, 
                    command_queue &);
   }
 }
    @@ -522,12 +522,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 &);
     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 &);
   }
@@ -788,7 +788,7 @@
 Header <boost/compute/algorithm/sort.hpp>
    namespace boost {
   namespace compute {
-    template<typename Iterator> void sort(Iterator, Iterator, command_queue &);
+    template<typename Iterator> void sort(Iterator, Iterator, command_queue &);
   }
 }
    @@ -797,7 +797,7 @@ Header <boost/compute/algorithm/stable_sort.hpp>
namespace boost {
   namespace compute {
-    template<typename Iterator> void sort(Iterator, Iterator, command_queue &);
+    template<typename Iterator> void sort(Iterator, Iterator, command_queue &);
   }
 }
@@ -819,12 +819,12 @@ template<typename InputIterator, typename OutputIterator, typename UnaryOperator> OutputIterator - transform(InputIterator, InputIterator, OutputIterator, UnaryOperator, + transform(InputIterator, InputIterator, OutputIterator, UnaryOperator, command_queue &); template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename BinaryOperator> OutputIterator - transform(InputIterator1, InputIterator1, InputIterator2, + transform(InputIterator1, InputIterator1, InputIterator2, OutputIterator, BinaryOperator, command_queue &); } } @@ -836,12 +836,12 @@ namespace compute { template<typename InputIterator, typename UnaryTransformFunction, typename T, typename BinaryReduceFunction> - T transform_reduce(InputIterator, InputIterator, UnaryTransformFunction, + T transform_reduce(InputIterator, InputIterator, UnaryTransformFunction, T, BinaryReduceFunction, command_queue &); template<typename InputIterator1, typename InputIterator2, typename BinaryTransformFunction, typename T, typename BinaryReduceFunction> - T transform_reduce(InputIterator1, InputIterator1, InputIterator2, + T transform_reduce(InputIterator1, InputIterator1, InputIterator2, BinaryTransformFunction, T, BinaryReduceFunction, command_queue &); } diff --git a/index.html b/index.html index dba85e50..7b772326 100644 --- a/index.html +++ b/index.html @@ -191,7 +191,7 @@
- +

Last revised: March 18, 2013 at 03:47:17 GMT

Last revised: April 13, 2013 at 14:21:20 GMT
diff --git a/standalone_HTML.manifest b/standalone_HTML.manifest index b78adde7..c4e42174 100644 --- a/standalone_HTML.manifest +++ b/standalone_HTML.manifest @@ -15,8 +15,8 @@ boost/compute/platform.html boost/compute/program.html boost/compute/system.html boost/compute/timer.html -boost/compute/accumulate_idp7575216.html -boost/compute/accumulate_idp7584192.html +boost/compute/accumulate_idp7997392.html +boost/compute/accumulate_idp8007936.html boost/compute/adjacent_difference.html boost/compute/adjacent_find.html boost/compute/all_of.html @@ -41,8 +41,8 @@ boost/compute/gather.html boost/compute/generate.html boost/compute/generate_n.html boost/compute/inclusive_scan.html -boost/compute/inner_product_idp7940752.html -boost/compute/inner_product_idp7952896.html +boost/compute/inner_product_idp8370064.html +boost/compute/inner_product_idp8382208.html boost/compute/iota.html boost/compute/is_partitioned.html boost/compute/is_sorted.html @@ -66,13 +66,13 @@ boost/compute/replace_copy.html boost/compute/reverse.html boost/compute/reverse_copy.html boost/compute/scatter.html -boost/compute/sort_idp8299552.html -boost/compute/sort_idp8311312.html +boost/compute/sort_idp8728864.html +boost/compute/sort_idp8740624.html boost/compute/swap_ranges.html -boost/compute/transform_idp8337216.html -boost/compute/transform_idp8350000.html -boost/compute/transform_reduce_idp8368288.html -boost/compute/transform_reduce_idp8383040.html +boost/compute/transform_idp8766528.html +boost/compute/transform_idp8779312.html +boost/compute/transform_reduce_idp8797600.html +boost/compute/transform_reduce_idp8812352.html boost/compute/upper_bound.html boost/compute/allocator.html boost/compute/array.html