-
Returns true if empty, false otherwise.
-
Returned value may not reflect results of pending operations. This operation reads shared data and will trigger a race condition.
+
Return number of pushes minus number of pops.
+
Note that the result can be negative if there are pops waiting for the corresponding pushes. The result can also exceed capacity() if there are push operations in flight.
-
+
-template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+template<typename T , class A = cache_aligned_allocator<T>>
-
Assignment operator.
-
This operation is unsafe if there are pending concurrent operations on the src queue.
-
-
-
-
-
-
-
-template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
-
-
-
-
Move assignment operator.
-
This operation is unsafe if there are pending concurrent operations on the src queue.
-
-
-
-
-
-
-
-template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
-
-
-
-
Pushes elem onto the queue, increasing capacity of queue if necessary.
-
This operation can be safely used concurrently with other push, try_pop or emplace operations.
-
-
-
-
-
-
-
-template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
-
-
-
-
Pushes elem onto the queue, increasing capacity of queue if necessary.
-
This operation can be safely used concurrently with other push, try_pop or emplace operations.
-
-
-
-
-
-
-
-template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
-
-
-
-
Returns the current number of elements contained in the queue.
-
Returned value may not reflect results of pending operations. This operation reads shared data and will trigger a race condition.
+
Attempt to dequeue an item from head of queue.
+
Does not wait for item to become available. Returns true if successful; false otherwise.
-
+
-template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+template<typename T , class A = cache_aligned_allocator<T>>
-
Swap this queue with another; not thread-safe.
-
This operation is unsafe if there are pending concurrent operations on the queue.
+
Enqueue an item at tail of queue if queue is not already full.
+
Does not wait for queue to become not full. Returns true if item is pushed; false if queue was already full.
-
+
-template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+template<typename T , class A = cache_aligned_allocator<T>>
-
Gets a reference to and removes highest priority element.
-
If a highest priority element was found, sets elem and returns true, otherwise returns false. This operation can be safely used concurrently with other push, try_pop or emplace operations.
+
Move an item at tail of queue if queue is not already full.
+
Does not wait for queue to become not full. Returns true if item is pushed; false if queue was already full.
The documentation for this class was generated from the following file:
-concurrent_priority_queue.h
+concurrent_queue.h
diff --git a/doc/html/a00047.png b/doc/html/a00047.png
new file mode 100644
index 0000000000..3dc03c3337
Binary files /dev/null and b/doc/html/a00047.png differ
diff --git a/doc/html/a00048.html b/doc/html/a00048.html
index 687d6e1a2d..7395eb8723 100644
--- a/doc/html/a00048.html
+++ b/doc/html/a00048.html
@@ -4,7 +4,7 @@
-tbb::strict_ppl::concurrent_queue< T, A > Class Template Reference
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > Class Template Reference
@@ -33,168 +33,804 @@
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > Class Template Reference
-
A high-performance thread-safe non-blocking concurrent queue.
+
Unordered map from Key to T.
More...
-
#include <concurrent_queue.h>
+
#include <concurrent_hash_map.h>
+Inheritance diagram for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >:
-
-
+
+
-
-typedef T value_type
- Element type in the queue.
-
-
-typedef T & reference
- Reference type.
-
-
-typedef const T & const_reference
- Const reference type.
-
-
-typedef size_t size_type
- Integral type for representing size of the queue.
-
-
-typedef ptrdiff_t difference_type
- Difference type for iterator.
-
-
-typedef A allocator_type
- Allocator type.
-
-
+
+typedef Key key_type
+
+
+typedef T mapped_type
+
+
+typedef std::pair< const Key, T > value_type
+
+
+typedef hash_map_base::size_type size_type
+
+
+typedef ptrdiff_t difference_type
+
+
+typedef value_type * pointer
+
+
+typedef const value_type * const_pointer
+
+
+typedef value_type & reference
+
+
+typedef const value_type & const_reference
+
+
+typedef
+internal::hash_map_iterator
+< concurrent_hash_map ,
+value_type > iterator
+
+
typedef
-internal::concurrent_queue_iterator
-< concurrent_queue , T > iterator
-
-
+internal::hash_map_iterator
+< concurrent_hash_map , const
+value_type > const_iterator
+
+
typedef
-internal::concurrent_queue_iterator
-< concurrent_queue , const T > const_iterator
-
+internal::hash_map_range
+< iterator > range_type
+
+
+typedef
+internal::hash_map_range
+< const_iterator > const_range_type
+
+
+typedef Allocator allocator_type
+
-
- concurrent_queue (const allocator_type &a=allocator_type ())
- Construct empty queue.
-
-
-template<typename InputIterator >
- concurrent_queue (InputIterator begin, InputIterator end, const allocator_type &a=allocator_type ())
- [begin,end) constructor
-
-
- concurrent_queue (const concurrent_queue &src, const allocator_type &a=allocator_type ())
- Copy constructor.
-
-
- concurrent_queue (concurrent_queue &&src)
- Move constructors.
-
-
- concurrent_queue (concurrent_queue &&src, const allocator_type &a)
-
-
- ~concurrent_queue ()
- Destroy queue.
-
-
-void push (const T &source)
- Enqueue an item at tail of queue.
-
-
-void push (T &&source)
-
-
-template<typename... Arguments>
-void emplace (Arguments &&...args)
-
-bool try_pop (T &result)
- Attempt to dequeue an item from head of queue. More...
-
-
-size_type unsafe_size () const
- Return the number of items in the queue; thread unsafe.
-
-
-bool empty () const
- Equivalent to size()==0.
-
-
-void clear ()
- Clear the queue. not thread-safe.
-
-
-allocator_type get_allocator () const
- Return allocator object.
-
-
-iterator unsafe_begin ()
-
-
-iterator unsafe_end ()
-
-
-const_iterator unsafe_begin () const
-
-
-const_iterator unsafe_end () const
-
+
+ concurrent_hash_map (const allocator_type &a=allocator_type())
+ Construct empty table.
+
+
+ concurrent_hash_map (size_type n, const allocator_type &a=allocator_type())
+ Construct empty table with n preallocated buckets. This number serves also as initial concurrency level.
+
+
+ concurrent_hash_map (const concurrent_hash_map &table, const allocator_type &a=allocator_type())
+ Copy constructor.
+
+
+ concurrent_hash_map (concurrent_hash_map &&table)
+ Move constructor.
+
+
+ concurrent_hash_map (concurrent_hash_map &&table, const allocator_type &a)
+ Move constructor.
+
+
+template<typename I >
+ concurrent_hash_map (I first, I last, const allocator_type &a=allocator_type())
+ Construction with copying iteration range and given allocator instance.
+
+
+ concurrent_hash_map (std::initializer_list< value_type > il, const allocator_type &a=allocator_type())
+ Construct empty table with n preallocated buckets. This number serves also as initial concurrency level.
+
+
+concurrent_hash_map & operator= (const concurrent_hash_map &table)
+ Assignment.
+
+
+concurrent_hash_map & operator= (concurrent_hash_map &&table)
+ Move Assignment.
+
+
+concurrent_hash_map & operator= (std::initializer_list< value_type > il)
+ Assignment.
+
+void rehash (size_type n=0)
+ Rehashes and optionally resizes the whole table. More...
+
+
+void clear ()
+ Clear table.
+
+
+ ~concurrent_hash_map ()
+ Clear table and destroy it.
+
+
+range_type range (size_type grainsize=1)
+
+
+const_range_type range (size_type grainsize=1) const
+
+
+iterator begin ()
+
+
+iterator end ()
+
+
+const_iterator begin () const
+
+
+const_iterator end () const
+
+
+std::pair< iterator, iterator > equal_range (const Key &key)
+
+
+std::pair< const_iterator,
+const_iterator > equal_range (const Key &key) const
+
+
+size_type size () const
+ Number of items in table.
+
+
+bool empty () const
+ True if size() ==0.
+
+
+size_type max_size () const
+ Upper bound on size.
+
+
+size_type bucket_count () const
+ Returns the current number of buckets.
+
+
+allocator_type get_allocator () const
+ return allocator object
+
+
+void swap (concurrent_hash_map &table)
+ swap two instances. Iterators are invalidated
+
+
+size_type count (const Key &key) const
+ Return count of items (0 or 1)
+
+bool find (const_accessor &result, const Key &key) const
+ Find item and acquire a read lock on the item. More...
+
+bool find (accessor &result, const Key &key)
+ Find item and acquire a write lock on the item. More...
+
+bool insert (const_accessor &result, const Key &key)
+ Insert item (if not already present) and acquire a read lock on the item. More...
+
+bool insert (accessor &result, const Key &key)
+ Insert item (if not already present) and acquire a write lock on the item. More...
+
+bool insert (const_accessor &result, const value_type &value)
+ Insert item by copying if there is no such key present already and acquire a read lock on the item. More...
+
+bool insert (accessor &result, const value_type &value)
+ Insert item by copying if there is no such key present already and acquire a write lock on the item. More...
+
+bool insert (const value_type &value)
+ Insert item by copying if there is no such key present already. More...
+
+bool insert (const_accessor &result, value_type &&value)
+ Insert item by copying if there is no such key present already and acquire a read lock on the item. More...
+
+bool insert (accessor &result, value_type &&value)
+ Insert item by copying if there is no such key present already and acquire a write lock on the item. More...
+
+bool insert (value_type &&value)
+ Insert item by copying if there is no such key present already. More...
+
+template<typename... Args>
+bool emplace (const_accessor &result, Args &&...args)
+ Insert item by copying if there is no such key present already and acquire a read lock on the item. More...
+
+template<typename... Args>
+bool emplace (accessor &result, Args &&...args)
+ Insert item by copying if there is no such key present already and acquire a write lock on the item. More...
+
+template<typename... Args>
+bool emplace (Args &&...args)
+ Insert item by copying if there is no such key present already. More...
+
+
+template<typename I >
+void insert (I first, I last)
+ Insert range [first, last)
+
+
+void insert (std::initializer_list< value_type > il)
+ Insert initializer list.
+
+bool erase (const Key &key)
+ Erase item. More...
+
+bool erase (const_accessor &item_accessor)
+ Erase item by const_accessor . More...
+
+bool erase (accessor &item_accessor)
+ Erase item by accessor. More...
+
+
+
+
+typedef Allocator::template
+rebind< node >::other node_allocator_type
+
+
+
+
+void delete_node (node_base *n)
+
+
+node * search_bucket (const key_type &key, bucket *b) const
+
+
+void rehash_bucket (bucket *b_new, const hashcode_t h)
+
+
+bool lookup (bool op_insert, const Key &key, const T *t, const_accessor *result, bool write, node *(*allocate_node)(node_allocator_type &, const Key &, const T *), node *tmp_n=0)
+ Insert or find item and optionally acquire a lock on the item.
+
+
+template<typename Accessor >
+bool generic_move_insert (Accessor &&result, value_type &&value)
+
+
+template<typename Accessor , typename... Args>
+bool generic_emplace (Accessor &&result, Args &&...args)
+
+
+bool exclude (const_accessor &item_accessor)
+ delete item by accessor
+
+
+template<typename I >
+std::pair< I, I > internal_equal_range (const Key &key, I end) const
+ Returns an iterator for an item defined by the key, or for the next item after it (if upper==true)
+
+
+void internal_copy (const concurrent_hash_map &source)
+ Copy "source" to *this, where *this must start out empty.
+
+
+template<typename I >
+void internal_copy (I first, I last)
+
+const_pointer internal_fast_find (const Key &key) const
+ Fast find when no concurrent erasure is used. For internal use inside TBB only! More...
+
+
+
+
+static node * allocate_node_copy_construct (node_allocator_type &allocator, const Key &key, const T *t)
+
+
+static node * allocate_node_move_construct (node_allocator_type &allocator, const Key &key, const T *t)
+
+
+template<typename... Args>
+static node * allocate_node_emplace_construct (node_allocator_type &allocator, Args &&...args)
+
+
+static node * allocate_node_default_construct (node_allocator_type &allocator, const Key &key, const T *)
+
+
+static node * do_not_allocate_node (node_allocator_type &, const Key &, const T *)
+
+
+
+
+node_allocator_type my_allocator
+
+
+HashCompare my_hash_compare
+
-
+
template<typename Container , typename Value >
-class internal::concurrent_queue_iterator
-
+class internal::hash_map_iterator
+
+
+template<typename I >
+class internal::hash_map_range
+
+
+class const_accessor
+
+
+const_accessor * accessor_location (accessor_not_used const &)
+
+
+const_accessor * accessor_location (const_accessor &a)
+
+
+bool is_write_access_needed (accessor const &)
+
+
+bool is_write_access_needed (const_accessor const &)
+
+
+bool is_write_access_needed (accessor_not_used const &)
+
-template<typename T, typename A = cache_aligned_allocator<T>>
-class tbb::strict_ppl::concurrent_queue< T, A >
+
template<typename Key, typename T, typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+class tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-
A high-performance thread-safe non-blocking concurrent queue.
-
Multiple threads may each push and pop concurrently. Assignment construction is not allowed.
+
Unordered map from Key to T.
+
concurrent_hash_map is associative container with concurrent access.
+ Compatibility The class meets all Container Requirements from C++ Standard (See ISO/IEC 14882:2003(E), clause 23.1).
+
Exception Safety
+Hash function is not permitted to throw an exception. User-defined types Key and T are forbidden from throwing an exception in destructors.
+If exception happens during insert() operations, it has no effect (unless exception raised by HashCompare::hash() function during grow_segment).
+If exception happens during operator=() operation, the container can have a part of source items, and methods size() and empty() can return wrong results.
+
+
+
Changes since TBB 2.1
+Replaced internal algorithm and data structure. Patent is pending.
+Added buckets number argument for constructor
+
+
+
Changes since TBB 2.0
+Fixed exception-safety
+Added template argument for allocator
+Added allocator argument in constructors
+Added constructor from a range of iterators
+Added several new overloaded insert() methods
+Added get_allocator()
+Added swap()
+Added count()
+Added overloaded erase(accessor &) and erase(const_accessor&)
+Added equal_range() [const]
+Added [const_]pointer, [const_]reference, and allocator_type types
+Added global functions: operator==(), operator!=(), and swap()
+
+
-
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+template<typename... Args>
+
+
+
+
Insert item by copying if there is no such key present already and acquire a read lock on the item.
+
Returns true if item is new.
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+template<typename... Args>
+
+
+
+
Insert item by copying if there is no such key present already and acquire a write lock on the item.
+
Returns true if item is new.
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+template<typename... Args>
+
+
+
+
Insert item by copying if there is no such key present already.
+
Returns true if item is inserted.
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare , typename A >
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
Erase item by const_accessor .
+
Return true if item was erased by particularly this call.
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
Erase item by accessor.
+
Return true if item was erased by particularly this call.
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
-template<typename T , typename A = cache_aligned_allocator<T>>
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
Insert item by copying if there is no such key present already.
+
Returns true if item is inserted.
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
Insert item by copying if there is no such key present already and acquire a read lock on the item.
+
Returns true if item is new.
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
Insert item by copying if there is no such key present already and acquire a write lock on the item.
+
Returns true if item is new.
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
Insert item by copying if there is no such key present already.
+
Returns true if item is inserted.
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+
+
+
+
+
+
+inline protected
+
+
+
+
+
Fast find when no concurrent erasure is used. For internal use inside TBB only!
+
Return pointer to item with given key, or NULL if no such item exists. Must not be called concurrently with erasure operations.
+
+
+
+
+
+
+
+template<typename Key , typename T , typename HashCompare , typename A >
+
+
+
+
Rehashes and optionally resizes the whole table.
+
Useful to optimize performance before or after concurrent operations. Also enables using of find() and count() concurrent methods in serial context.
The documentation for this class was generated from the following file:
-concurrent_queue.h
+concurrent_hash_map.h
diff --git a/doc/html/a00048.png b/doc/html/a00048.png
index c7a9a4dd8a..3f0a8f2647 100644
Binary files a/doc/html/a00048.png and b/doc/html/a00048.png differ
diff --git a/doc/html/a00049.html b/doc/html/a00049.html
index 31ec901a35..8ae60d6fa1 100644
--- a/doc/html/a00049.html
+++ b/doc/html/a00049.html
@@ -4,7 +4,7 @@
-tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > Class Template Reference
+tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > Class Template Reference
@@ -33,127 +33,52 @@
+tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > Class Template Reference
+Inheritance diagram for tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type >:
-
-
+
+
-
-typedef Key key_type
-
-
-typedef base_type::value_type value_type
-
-
-typedef T mapped_type
-
-
-typedef Hasher hasher
-
-
-typedef Key_equality key_equal
-
-
-typedef hash_compare key_compare
-
-
-typedef base_type::allocator_type allocator_type
-
-
-typedef base_type::pointer pointer
-
-
-typedef base_type::const_pointer const_pointer
-
-
-typedef base_type::reference reference
-
-
-typedef base_type::const_reference const_reference
-
-
-typedef base_type::size_type size_type
-
-
-typedef base_type::difference_type difference_type
-
-
-typedef base_type::iterator iterator
-
-
-typedef base_type::const_iterator const_iterator
-
-
-typedef base_type::iterator local_iterator
-
-
-typedef base_type::const_iterator const_local_iterator
-
+
+typedef handle_object handle
+
-
- concurrent_unordered_map (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
-
-
- concurrent_unordered_map (const Allocator &a)
-
-
-template<typename Iterator >
- concurrent_unordered_map (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
-
-
- concurrent_unordered_map (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
- Constructor from initializer_list.
-
-
- concurrent_unordered_map (const concurrent_unordered_map &table)
-
-
-concurrent_unordered_map & operator= (const concurrent_unordered_map &table)
-
-
- concurrent_unordered_map (concurrent_unordered_map &&table)
-
-
-concurrent_unordered_map & operator= (concurrent_unordered_map &&table)
-
-
- concurrent_unordered_map (const concurrent_unordered_map &table, const Allocator &a)
-
-
- concurrent_unordered_map (concurrent_unordered_map &&table, const Allocator &a)
-
-
-mapped_type & operator[] (const key_type &key)
-
-
-mapped_type & at (const key_type &key)
-
-
-const mapped_type & at (const key_type &key) const
-
+
+ concurrent_lru_cache (value_function_type f, std::size_t number_of_lru_history_items)
+
+
+handle_object operator[] (key_type k)
+
+
+
+
+class tbb::internal::aggregating_functor< self_type, aggregated_operation_type >
+
The documentation for this class was generated from the following file:
-concurrent_unordered_map.h
+concurrent_lru_cache.h
diff --git a/doc/html/a00049.png b/doc/html/a00049.png
index 0e3c40436b..856b3afbc6 100644
Binary files a/doc/html/a00049.png and b/doc/html/a00049.png differ
diff --git a/doc/html/a00050.html b/doc/html/a00050.html
index 094d29423b..c6bbe0776e 100644
--- a/doc/html/a00050.html
+++ b/doc/html/a00050.html
@@ -4,7 +4,7 @@
-tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > Class Template Reference
+tbb::interface5::concurrent_priority_queue< T, Compare, A > Class Template Reference
@@ -33,67 +33,566 @@
+tbb::interface5::concurrent_priority_queue< T, Compare, A > Class Template Reference
+
+
Concurrent priority queue.
+ More...
+
+
#include <concurrent_priority_queue.h>
-
-enum { allow_multimapping = Allow_multimapping
- }
-
-
-typedef std::pair< const Key, T > value_type
-
-
-typedef Key key_type
-
-
-typedef Hash_compare hash_compare
-
-
-typedef Allocator::template
-rebind< value_type >::other allocator_type
-
-
-
-
- concurrent_unordered_map_traits (const hash_compare &hc)
-
-
-
-
-template<class Type1 , class Type2 >
-static const Key & get_key (const std::pair< Type1, Type2 > &value)
-
-
-
-
-hash_compare my_hash_compare
-
+
+
+ concurrent_priority_queue (const allocator_type &a=allocator_type ())
+ Constructs a new concurrent_priority_queue with default capacity.
+
+
+ concurrent_priority_queue (size_type init_capacity, const allocator_type &a=allocator_type ())
+ Constructs a new concurrent_priority_queue with init_sz capacity.
+
+
+template<typename InputIterator >
+ concurrent_priority_queue (InputIterator begin, InputIterator end, const allocator_type &a=allocator_type ())
+ [begin,end) constructor
+
+
+ concurrent_priority_queue (std::initializer_list< T > init_list, const allocator_type &a=allocator_type ())
+ Constructor from std::initializer_list.
+
+ concurrent_priority_queue (const concurrent_priority_queue &src)
+ Copy constructor. More...
+
+ concurrent_priority_queue (const concurrent_priority_queue &src, const allocator_type &a)
+ Copy constructor with specific allocator. More...
+
+concurrent_priority_queue & operator= (const concurrent_priority_queue &src)
+ Assignment operator. More...
+
+ concurrent_priority_queue (concurrent_priority_queue &&src)
+ Move constructor. More...
+
+ concurrent_priority_queue (concurrent_priority_queue &&src, const allocator_type &a)
+ Move constructor with specific allocator. More...
+
+concurrent_priority_queue & operator= (concurrent_priority_queue &&src)
+ Move assignment operator. More...
+
+
+template<typename InputIterator >
+void assign (InputIterator begin, InputIterator end)
+ Assign the queue from [begin,end) range, not thread-safe.
+
+
+void assign (std::initializer_list< T > il)
+ Assign the queue from std::initializer_list, not thread-safe.
+
+
+concurrent_priority_queue & operator= (std::initializer_list< T > il)
+ Assign from std::initializer_list, not thread-safe.
+
+bool empty () const
+ Returns true if empty, false otherwise. More...
+
+size_type size () const
+ Returns the current number of elements contained in the queue. More...
+
+void push (const_reference elem)
+ Pushes elem onto the queue, increasing capacity of queue if necessary. More...
+
+void push (value_type &&elem)
+ Pushes elem onto the queue, increasing capacity of queue if necessary. More...
+
+template<typename... Args>
+void emplace (Args &&...args)
+ Constructs a new element using args as the arguments for its construction and pushes it onto the queue */. More...
+
+bool try_pop (reference elem)
+ Gets a reference to and removes highest priority element. More...
+
+void clear ()
+ Clear the queue; not thread-safe. More...
+
+void swap (concurrent_priority_queue &q)
+ Swap this queue with another; not thread-safe. More...
+
+
+allocator_type get_allocator () const
+ Return allocator object.
+
+
+
+
template<typename T, typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+class tbb::interface5::concurrent_priority_queue< T, Compare, A >
+
+
Concurrent priority queue.
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
+
+
+inline explicit
+
+
+
+
+
Copy constructor.
+
This operation is unsafe if there are pending concurrent operations on the src queue.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Copy constructor with specific allocator.
+
This operation is unsafe if there are pending concurrent operations on the src queue.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Move constructor.
+
This operation is unsafe if there are pending concurrent operations on the src queue.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Move constructor with specific allocator.
+
This operation is unsafe if there are pending concurrent operations on the src queue.
+
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Clear the queue; not thread-safe.
+
This operation is unsafe if there are pending concurrent operations on the queue. Resets size, effectively emptying queue; does not free space. May not clear elements added in pending operations.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+template<typename... Args>
+
+
+
+
Constructs a new element using args as the arguments for its construction and pushes it onto the queue */.
+
This operation can be safely used concurrently with other push, try_pop or emplace operations.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Returns true if empty, false otherwise.
+
Returned value may not reflect results of pending operations. This operation reads shared data and will trigger a race condition.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Assignment operator.
+
This operation is unsafe if there are pending concurrent operations on the src queue.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Move assignment operator.
+
This operation is unsafe if there are pending concurrent operations on the src queue.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Pushes elem onto the queue, increasing capacity of queue if necessary.
+
This operation can be safely used concurrently with other push, try_pop or emplace operations.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Pushes elem onto the queue, increasing capacity of queue if necessary.
+
This operation can be safely used concurrently with other push, try_pop or emplace operations.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Returns the current number of elements contained in the queue.
+
Returned value may not reflect results of pending operations. This operation reads shared data and will trigger a race condition.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Swap this queue with another; not thread-safe.
+
This operation is unsafe if there are pending concurrent operations on the queue.
+
+
+
+
+
+
+
+template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+
+
+
+
Gets a reference to and removes highest priority element.
+
If a highest priority element was found, sets elem and returns true, otherwise returns false. This operation can be safely used concurrently with other push, try_pop or emplace operations.
+
+
+
The documentation for this class was generated from the following file:
-concurrent_unordered_map.h
+concurrent_priority_queue.h
diff --git a/doc/html/a00051.html b/doc/html/a00051.html
index 2c841eb146..e0b2c6ccca 100644
--- a/doc/html/a00051.html
+++ b/doc/html/a00051.html
@@ -4,7 +4,7 @@
-tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > Class Template Reference
+tbb::strict_ppl::concurrent_queue< T, A > Class Template Reference
@@ -33,118 +33,184 @@
+tbb::strict_ppl::concurrent_queue< T, A > Class Template Reference
+
+
A high-performance thread-safe non-blocking concurrent queue.
+ More...
+
+
#include <concurrent_queue.h>
+Inheritance diagram for tbb::strict_ppl::concurrent_queue< T, A >:
-
-
+
+
-
-typedef Key key_type
-
-
-typedef base_type::value_type value_type
-
-
-typedef T mapped_type
-
-
-typedef Hasher hasher
-
-
-typedef Key_equality key_equal
-
-
-typedef hash_compare key_compare
-
-
-typedef base_type::allocator_type allocator_type
-
-
-typedef base_type::pointer pointer
-
-
-typedef base_type::const_pointer const_pointer
-
-
-typedef base_type::reference reference
-
-
-typedef base_type::const_reference const_reference
-
-
-typedef base_type::size_type size_type
-
-
-typedef base_type::difference_type difference_type
-
-
-typedef base_type::iterator iterator
-
-
-typedef base_type::const_iterator const_iterator
-
-
-typedef base_type::iterator local_iterator
-
-
-typedef base_type::const_iterator const_local_iterator
-
+
+typedef T value_type
+ Element type in the queue.
+
+
+typedef T & reference
+ Reference type.
+
+
+typedef const T & const_reference
+ Const reference type.
+
+
+typedef size_t size_type
+ Integral type for representing size of the queue.
+
+
+typedef ptrdiff_t difference_type
+ Difference type for iterator.
+
+
+typedef A allocator_type
+ Allocator type.
+
+
+typedef
+internal::concurrent_queue_iterator
+< concurrent_queue , T > iterator
+
+
+typedef
+internal::concurrent_queue_iterator
+< concurrent_queue , const T > const_iterator
+
-
- concurrent_unordered_multimap (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
-
-
- concurrent_unordered_multimap (const Allocator &a)
-
-
-template<typename Iterator >
- concurrent_unordered_multimap (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
-
-
- concurrent_unordered_multimap (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
- Constructor from initializer_list.
-
-
- concurrent_unordered_multimap (const concurrent_unordered_multimap &table)
-
-
-concurrent_unordered_multimap & operator= (const concurrent_unordered_multimap &table)
-
-
- concurrent_unordered_multimap (concurrent_unordered_multimap &&table)
-
-
-concurrent_unordered_multimap & operator= (concurrent_unordered_multimap &&table)
-
-
- concurrent_unordered_multimap (const concurrent_unordered_multimap &table, const Allocator &a)
-
-
- concurrent_unordered_multimap (concurrent_unordered_multimap &&table, const Allocator &a)
-
+
+ concurrent_queue (const allocator_type &a=allocator_type ())
+ Construct empty queue.
+
+
+template<typename InputIterator >
+ concurrent_queue (InputIterator begin, InputIterator end, const allocator_type &a=allocator_type ())
+ [begin,end) constructor
+
+
+ concurrent_queue (const concurrent_queue &src, const allocator_type &a=allocator_type ())
+ Copy constructor.
+
+
+ concurrent_queue (concurrent_queue &&src)
+ Move constructors.
+
+
+ concurrent_queue (concurrent_queue &&src, const allocator_type &a)
+
+
+ ~concurrent_queue ()
+ Destroy queue.
+
+
+void push (const T &source)
+ Enqueue an item at tail of queue.
+
+
+void push (T &&source)
+
+
+template<typename... Arguments>
+void emplace (Arguments &&...args)
+
+bool try_pop (T &result)
+ Attempt to dequeue an item from head of queue. More...
+
+
+size_type unsafe_size () const
+ Return the number of items in the queue; thread unsafe.
+
+
+bool empty () const
+ Equivalent to size()==0.
+
+
+void clear ()
+ Clear the queue. not thread-safe.
+
+
+allocator_type get_allocator () const
+ Return allocator object.
+
+
+iterator unsafe_begin ()
+
+
+iterator unsafe_end ()
+
+
+const_iterator unsafe_begin () const
+
+
+const_iterator unsafe_end () const
+
+
+
+
+template<typename Container , typename Value >
+class internal::concurrent_queue_iterator
+
+
+
+template<typename T, typename A = cache_aligned_allocator<T>>
+class tbb::strict_ppl::concurrent_queue< T, A >
+
+
A high-performance thread-safe non-blocking concurrent queue.
+
Multiple threads may each push and pop concurrently. Assignment construction is not allowed.
+
+
+
+
+
+template<typename T , typename A = cache_aligned_allocator<T>>
+
+
+
+
Attempt to dequeue an item from head of queue.
+
Does not wait for item to become available. Returns true if successful; false otherwise.
+
+
+
The documentation for this class was generated from the following file:
-concurrent_unordered_map.h
+concurrent_queue.h
diff --git a/doc/html/a00051.png b/doc/html/a00051.png
index 6fa3b58c9a..c7a9a4dd8a 100644
Binary files a/doc/html/a00051.png and b/doc/html/a00051.png differ
diff --git a/doc/html/a00052.html b/doc/html/a00052.html
index 6bc200d140..6c96c886f0 100644
--- a/doc/html/a00052.html
+++ b/doc/html/a00052.html
@@ -4,7 +4,7 @@
-tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > Class Template Reference
+tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > Class Template Reference
@@ -33,118 +33,127 @@
+tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > Class Template Reference
+Inheritance diagram for tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >:
-
-
+
+
-
+
typedef Key key_type
-
-
+
+
typedef base_type::value_type value_type
-
-
-typedef Key mapped_type
-
-
+
+
+typedef T mapped_type
+
+
typedef Hasher hasher
-
-
+
+
typedef Key_equality key_equal
-
-
+
+
typedef hash_compare key_compare
-
-
+
+
typedef base_type::allocator_type allocator_type
-
-
+
+
typedef base_type::pointer pointer
-
-
+
+
typedef base_type::const_pointer const_pointer
-
-
+
+
typedef base_type::reference reference
-
-
+
+
typedef base_type::const_reference const_reference
-
-
+
+
typedef base_type::size_type size_type
-
-
+
+
typedef base_type::difference_type difference_type
-
-
+
+
typedef base_type::iterator iterator
-
-
+
+
typedef base_type::const_iterator const_iterator
-
-
+
+
typedef base_type::iterator local_iterator
-
-
+
+
typedef base_type::const_iterator const_local_iterator
-
+
-
- concurrent_unordered_multiset (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
-
-
- concurrent_unordered_multiset (const Allocator &a)
-
-
+
+ concurrent_unordered_map (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
+
+
+ concurrent_unordered_map (const Allocator &a)
+
+
template<typename Iterator >
- concurrent_unordered_multiset (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
-
-
- concurrent_unordered_multiset (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
- Constructor from initializer_list.
-
-
- concurrent_unordered_multiset (const concurrent_unordered_multiset &table)
-
-
-concurrent_unordered_multiset & operator= (const concurrent_unordered_multiset &table)
-
-
- concurrent_unordered_multiset (concurrent_unordered_multiset &&table)
-
-
-concurrent_unordered_multiset & operator= (concurrent_unordered_multiset &&table)
-
-
- concurrent_unordered_multiset (const concurrent_unordered_multiset &table, const Allocator &a)
-
-
- concurrent_unordered_multiset (concurrent_unordered_multiset &&table, const Allocator &a)
-
+ concurrent_unordered_map (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
+
+
+ concurrent_unordered_map (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
+ Constructor from initializer_list.
+
+
+ concurrent_unordered_map (const concurrent_unordered_map &table)
+
+
+concurrent_unordered_map & operator= (const concurrent_unordered_map &table)
+
+
+ concurrent_unordered_map (concurrent_unordered_map &&table)
+
+
+concurrent_unordered_map & operator= (concurrent_unordered_map &&table)
+
+
+ concurrent_unordered_map (const concurrent_unordered_map &table, const Allocator &a)
+
+
+ concurrent_unordered_map (concurrent_unordered_map &&table, const Allocator &a)
+
+
+mapped_type & operator[] (const key_type &key)
+
+
+mapped_type & at (const key_type &key)
+
+
+const mapped_type & at (const key_type &key) const
+
The documentation for this class was generated from the following file:
-concurrent_unordered_set.h
+concurrent_unordered_map.h
diff --git a/doc/html/a00052.png b/doc/html/a00052.png
index 3ef6d19042..0e3c40436b 100644
Binary files a/doc/html/a00052.png and b/doc/html/a00052.png differ
diff --git a/doc/html/a00053.html b/doc/html/a00053.html
index 827a0aa33e..5e3ddf525a 100644
--- a/doc/html/a00053.html
+++ b/doc/html/a00053.html
@@ -4,7 +4,7 @@
-tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > Class Template Reference
+tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > Class Template Reference
@@ -33,118 +33,67 @@
+tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > Class Template Reference
-
-
-
-
-
-
-
+
+enum { allow_multimapping = Allow_multimapping
+ }
+
+
+typedef std::pair< const Key, T > value_type
+
+
typedef Key key_type
-
-
-typedef base_type::value_type value_type
-
-
-typedef Key mapped_type
-
-
-typedef Hasher hasher
-
-
-typedef Key_equality key_equal
-
-
-typedef hash_compare key_compare
-
-
-typedef base_type::allocator_type allocator_type
-
-
-typedef base_type::pointer pointer
-
-
-typedef base_type::const_pointer const_pointer
-
-
-typedef base_type::reference reference
-
-
-typedef base_type::const_reference const_reference
-
-
-typedef base_type::size_type size_type
-
-
-typedef base_type::difference_type difference_type
-
-
-typedef base_type::iterator iterator
-
-
-typedef base_type::const_iterator const_iterator
-
-
-typedef base_type::iterator local_iterator
-
-
-typedef base_type::const_iterator const_local_iterator
-
+
+
+typedef Hash_compare hash_compare
+
+
+typedef Allocator::template
+rebind< value_type >::other allocator_type
+
+
+
+
+ concurrent_unordered_map_traits (const hash_compare &hc)
+
+
+
+
+template<class Type1 , class Type2 >
+static const Key & get_key (const std::pair< Type1, Type2 > &value)
+
-
-
- concurrent_unordered_set (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
-
-
- concurrent_unordered_set (const Allocator &a)
-
-
-template<typename Iterator >
- concurrent_unordered_set (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
-
-
- concurrent_unordered_set (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
- Constructor from initializer_list.
-
-
- concurrent_unordered_set (const concurrent_unordered_set &table)
-
-
-concurrent_unordered_set & operator= (const concurrent_unordered_set &table)
-
-
- concurrent_unordered_set (concurrent_unordered_set &&table)
-
-
-concurrent_unordered_set & operator= (concurrent_unordered_set &&table)
-
-
- concurrent_unordered_set (const concurrent_unordered_set &table, const Allocator &a)
-
-
- concurrent_unordered_set (concurrent_unordered_set &&table, const Allocator &a)
-
+
+
+hash_compare my_hash_compare
+
The documentation for this class was generated from the following file:
-concurrent_unordered_set.h
+concurrent_unordered_map.h
diff --git a/doc/html/a00053.png b/doc/html/a00053.png
deleted file mode 100644
index 9f9a099251..0000000000
Binary files a/doc/html/a00053.png and /dev/null differ
diff --git a/doc/html/a00054.html b/doc/html/a00054.html
index f0478f52ee..bf5c466cfe 100644
--- a/doc/html/a00054.html
+++ b/doc/html/a00054.html
@@ -4,7 +4,7 @@
-tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > Class Template Reference
+tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > Class Template Reference
@@ -33,63 +33,118 @@
+tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > Class Template Reference
+
+
+
+
+
+
+
-
-enum { allow_multimapping = Allow_multimapping
- }
-
-
-typedef Key value_type
-
-
+
+
typedef Key key_type
-
-
-typedef Hash_compare hash_compare
-
-
-typedef Allocator::template
-rebind< value_type >::other allocator_type
-
-
-typedef hash_compare value_compare
-
+
+
+typedef base_type::value_type value_type
+
+
+typedef T mapped_type
+
+
+typedef Hasher hasher
+
+
+typedef Key_equality key_equal
+
+
+typedef hash_compare key_compare
+
+
+typedef base_type::allocator_type allocator_type
+
+
+typedef base_type::pointer pointer
+
+
+typedef base_type::const_pointer const_pointer
+
+
+typedef base_type::reference reference
+
+
+typedef base_type::const_reference const_reference
+
+
+typedef base_type::size_type size_type
+
+
+typedef base_type::difference_type difference_type
+
+
+typedef base_type::iterator iterator
+
+
+typedef base_type::const_iterator const_iterator
+
+
+typedef base_type::iterator local_iterator
+
+
+typedef base_type::const_iterator const_local_iterator
+
-
-
- concurrent_unordered_set_traits (const hash_compare &hc)
-
-
-
-
-static const Key & get_key (const value_type &value)
-
-
-
-
-hash_compare my_hash_compare
-
+
+
+ concurrent_unordered_multimap (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
+
+
+ concurrent_unordered_multimap (const Allocator &a)
+
+
+template<typename Iterator >
+ concurrent_unordered_multimap (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
+
+
+ concurrent_unordered_multimap (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
+ Constructor from initializer_list.
+
+
+ concurrent_unordered_multimap (const concurrent_unordered_multimap &table)
+
+
+concurrent_unordered_multimap & operator= (const concurrent_unordered_multimap &table)
+
+
+ concurrent_unordered_multimap (concurrent_unordered_multimap &&table)
+
+
+concurrent_unordered_multimap & operator= (concurrent_unordered_multimap &&table)
+
+
+ concurrent_unordered_multimap (const concurrent_unordered_multimap &table, const Allocator &a)
+
+
+ concurrent_unordered_multimap (concurrent_unordered_multimap &&table, const Allocator &a)
+
The documentation for this class was generated from the following file:
-concurrent_unordered_set.h
+concurrent_unordered_map.h
diff --git a/doc/html/a00054.png b/doc/html/a00054.png
new file mode 100644
index 0000000000..6fa3b58c9a
Binary files /dev/null and b/doc/html/a00054.png differ
diff --git a/doc/html/a00055.html b/doc/html/a00055.html
index 4f147626a8..4832f73092 100644
--- a/doc/html/a00055.html
+++ b/doc/html/a00055.html
@@ -4,7 +4,7 @@
-tbb::concurrent_vector< T, A > Class Template Reference
+tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > Class Template Reference
@@ -33,770 +33,118 @@
+tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > Class Template Reference
-
-
Concurrent vector container.
- More...
-
-
#include <concurrent_vector.h>
+Inheritance diagram for tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >:
-
-
+
+
-
-typedef
-internal::concurrent_vector_base_v3::size_type size_type
-
-
-typedef
-internal::allocator_base< T, A >
-::allocator_type allocator_type
-
-
-typedef T value_type
-
-
-typedef ptrdiff_t difference_type
-
-
-typedef T & reference
-
-
-typedef const T & const_reference
-
-
-typedef T * pointer
-
-
-typedef const T * const_pointer
-
-
-typedef
-internal::vector_iterator
-< concurrent_vector , T > iterator
-
-
-typedef
-internal::vector_iterator
-< concurrent_vector , const T > const_iterator
-
-
-typedef std::reverse_iterator
-< iterator > reverse_iterator
-
-
-typedef std::reverse_iterator
-< const_iterator > const_reverse_iterator
-
-
-typedef std::reverse_iterator
-< iterator, T, T &, T * > reverse_iterator
-
-
-typedef std::reverse_iterator
-< const_iterator, T, const T
-&, const T * > const_reverse_iterator
-
-
-typedef generic_range_type
-< iterator > range_type
-
-
-typedef generic_range_type
-< const_iterator > const_range_type
-
+
+typedef Key key_type
+
+
+typedef base_type::value_type value_type
+
+
+typedef Key mapped_type
+
+
+typedef Hasher hasher
+
+
+typedef Key_equality key_equal
+
+
+typedef hash_compare key_compare
+
+
+typedef base_type::allocator_type allocator_type
+
+
+typedef base_type::pointer pointer
+
+
+typedef base_type::const_pointer const_pointer
+
+
+typedef base_type::reference reference
+
+
+typedef base_type::const_reference const_reference
+
+
+typedef base_type::size_type size_type
+
+
+typedef base_type::difference_type difference_type
+
+
+typedef base_type::iterator iterator
+
+
+typedef base_type::const_iterator const_iterator
+
+
+typedef base_type::iterator local_iterator
+
+
+typedef base_type::const_iterator const_local_iterator
+
-
- concurrent_vector (const allocator_type &a=allocator_type())
- Construct empty vector.
-
-
- concurrent_vector (std::initializer_list< T > init_list, const allocator_type &a=allocator_type())
- Constructor from initializer_list.
-
-
- concurrent_vector (const concurrent_vector &vector, const allocator_type &a=allocator_type())
- Copying constructor.
-
-
- concurrent_vector (concurrent_vector &&source)
- Move constructor.
-
-
- concurrent_vector (concurrent_vector &&source, const allocator_type &a)
-
-
-template<class M >
- concurrent_vector (const concurrent_vector < T, M > &vector, const allocator_type &a=allocator_type())
- Copying constructor for vector with different allocator type.
-
-
- concurrent_vector (size_type n)
- Construction with initial size specified by argument n.
-
-
- concurrent_vector (size_type n, const_reference t, const allocator_type &a=allocator_type())
- Construction with initial size specified by argument n, initialization by copying of t, and given allocator instance.
-
-
-template<class I >
- concurrent_vector (I first, I last, const allocator_type &a=allocator_type())
- Construction with copying iteration range and given allocator instance.
-
-
-concurrent_vector & operator= (const concurrent_vector &vector)
- Assignment.
-
-
-concurrent_vector & operator= (concurrent_vector &&other)
- Move assignment.
-
-
-template<class M >
-concurrent_vector & operator= (const concurrent_vector < T, M > &vector)
- Assignment for vector with different allocator type.
-
-
-concurrent_vector & operator= (std::initializer_list< T > init_list)
- Assignment for initializer_list.
-
-iterator grow_by (size_type delta)
- Grow by "delta" elements. More...
-
-iterator grow_by (size_type delta, const_reference t)
- Grow by "delta" elements using copying constructor. More...
-
-template<typename I >
-iterator grow_by (I first, I last)
-
-iterator grow_by (std::initializer_list< T > init_list)
-
-iterator grow_to_at_least (size_type n)
- Append minimal sequence of elements such that size() >=n. More...
-
-iterator grow_to_at_least (size_type n, const_reference t)
-
-iterator push_back (const_reference item)
- Push item. More...
-
-iterator push_back (T &&item)
- Push item, move-aware. More...
-
-template<typename... Args>
-iterator emplace_back (Args &&...args)
- Push item, create item "in place" with provided arguments. More...
-
-reference operator[] (size_type index)
- Get reference to element at given index. More...
-
-
-const_reference operator[] (size_type index) const
- Get const reference to element at given index.
-
-
-reference at (size_type index)
- Get reference to element at given index. Throws exceptions on errors.
-
-
-const_reference at (size_type index) const
- Get const reference to element at given index. Throws exceptions on errors.
-
-
-range_type range (size_t grainsize=1)
- Get range for iterating with parallel algorithms.
-
-
-const_range_type range (size_t grainsize=1) const
- Get const range for iterating with parallel algorithms.
-
-
-size_type size () const
- Return size of vector. It may include elements under construction.
-
-
-bool empty () const
- Return false if vector is not empty or has elements under construction at least.
-
-
-size_type capacity () const
- Maximum size to which array can grow without allocating more memory. Concurrent allocations are not included in the value.
-
-void reserve (size_type n)
- Allocate enough space to grow to size n without having to allocate more memory later. More...
-
-
-void resize (size_type n)
- Resize the vector. Not thread-safe.
-
-
-void resize (size_type n, const_reference t)
- Resize the vector, copy t for new elements. Not thread-safe.
-
-
-void shrink_to_fit ()
- Optimize memory usage and fragmentation.
-
-
-size_type max_size () const
- Upper bound on argument to reserve.
-
-
-iterator begin ()
- start iterator
-
-
-iterator end ()
- end iterator
-
-
-const_iterator begin () const
- start const iterator
-
-
-const_iterator end () const
- end const iterator
-
-
-const_iterator cbegin () const
- start const iterator
-
-
-const_iterator cend () const
- end const iterator
-
-
-reverse_iterator rbegin ()
- reverse start iterator
-
-
-reverse_iterator rend ()
- reverse end iterator
-
-
-const_reverse_iterator rbegin () const
- reverse start const iterator
-
-
-const_reverse_iterator rend () const
- reverse end const iterator
-
-
-const_reverse_iterator crbegin () const
- reverse start const iterator
-
-
-const_reverse_iterator crend () const
- reverse end const iterator
-
-
-reference front ()
- the first item
-
-
-const_reference front () const
- the first item const
-
-
-reference back ()
- the last item
-
-
-const_reference back () const
- the last item const
-
-
-allocator_type get_allocator () const
- return allocator object
-
-
-void assign (size_type n, const_reference t)
- assign n items by copying t item
-
-
-template<class I >
-void assign (I first, I last)
- assign range [first, last)
-
-
-void assign (std::initializer_list< T > init_list)
- assigns an initializer list
-
-
-void swap (concurrent_vector &vector)
- swap two instances
-
-void clear ()
- Clear container while keeping memory allocated. More...
-
-
- ~concurrent_vector ()
- Clear and destroy vector.
-
-
-const
-internal::concurrent_vector_base_v3 & internal_vector_base () const
-
-
-template<typename I >
-void copy_range (void *dst, const void *p_type_erased_iterator, size_type n)
-
-
-
-
-template<typename C , typename U >
-class internal::vector_iterator
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-class tbb::concurrent_vector< T, A >
-
-
Concurrent vector container.
-
concurrent_vector is a container having the following main properties:
-- It provides random indexed access to its elements. The index of the first element is 0.
-- It ensures safe concurrent growing its size (different threads can safely append new elements).
-- Adding new elements does not invalidate existing iterators and does not change indices of existing items.
- Compatibility The class meets all Container Requirements and Reversible Container Requirements from C++ Standard (See ISO/IEC 14882:2003(E), clause 23.1). But it doesn't meet Sequence Requirements due to absence of insert() and erase() methods.
-
Exception Safety Methods working with memory allocation and/or new elements construction can throw an exception if allocator fails to allocate memory or element's default constructor throws one. Concurrent vector's element of type T must conform to the following requirements:
-Throwing an exception is forbidden for destructor of T.
-Default constructor of T must not throw an exception OR its non-virtual destructor must safely work when its object memory is zero-initialized.
-
-Otherwise, the program's behavior is undefined.
-
If an exception happens inside growth or assignment operation, an instance of the vector becomes invalid unless it is stated otherwise in the method documentation. Invalid state means:
-There are no guarantees that all items were initialized by a constructor. The rest of items is zero-filled, including item where exception happens.
-An invalid vector instance cannot be repaired; it is unable to grow anymore.
-Size and capacity reported by the vector are incorrect, and calculated as if the failed operation were successful.
-Attempt to access not allocated elements using operator[] or iterators results in access violation or segmentation fault exception, and in case of using at() method a C++ exception is thrown.
-
-If a concurrent grow operation successfully completes, all the elements it has added to the vector will remain valid and accessible even if one of subsequent grow operations fails.
-
Fragmentation Unlike an STL vector, a concurrent_vector does not move existing elements if it needs to allocate more memory. The container is divided into a series of contiguous arrays of elements. The first reservation, growth, or assignment operation determines the size of the first array. Using small number of elements as initial size incurs fragmentation that may increase element access time. Internal layout can be optimized by method compact() that merges several smaller arrays into one solid.
-
Changes since TBB 2.1
-Fixed guarantees of concurrent_vector::size() and grow_to_at_least() methods to assure elements are allocated.
-Methods end() /rbegin()/back() are partly thread-safe since they use size() to get the end of vector
-Added resize() methods (not thread-safe)
-Added cbegin/cend/crbegin/crend methods
-Changed return type of methods grow* and push_back to iterator
-
-
-
Changes since TBB 2.0
-Implemented exception-safety guarantees
-Added template argument for allocator
-Added allocator argument in constructors
-Faster index calculation
-First growth call specifies a number of segments to be merged in the first allocation.
-Fixed memory blow up for swarm of vector's instances of small size
-Added grow_by(size_type n, const_reference t) growth using copying constructor to init new items.
-Added STL-like constructors.
-Added operators ==, < and derivatives
-Added at() method, approved for using after an exception was thrown inside the vector
-Added get_allocator() method.
-Added assign() methods
-Added compact() method to defragment first segments
-Added swap() method
-range() defaults on grainsize = 1 supporting auto grainsize algorithms.
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-
-
-
Clear container while keeping memory allocated.
-
To free up the memory, use in conjunction with method compact(). Not thread safe
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-template<typename... Args>
-
-
-
-
Push item, create item "in place" with provided arguments.
-
Returns iterator pointing to the new element.
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-
-
-
Grow by "delta" elements.
-
Returns iterator pointing to the first new element.
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-
-
-
-
- iterator tbb::concurrent_vector < T, A >::grow_by
- (
- size_type
- delta ,
-
-
-
-
- const_reference
- t
-
-
-
- )
-
-
-
-
-
-inline
-
-
-
-
-
Grow by "delta" elements using copying constructor.
-
Returns iterator pointing to the first new element.
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-template<typename I >
-
-
-
Returns iterator pointing to the first new element.
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-
-
-
-
-
-inline
-
+
+ concurrent_unordered_multiset (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
+
+
+ concurrent_unordered_multiset (const Allocator &a)
+
+
+template<typename Iterator >
+ concurrent_unordered_multiset (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())
+
+
+ concurrent_unordered_multiset (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
+ Constructor from initializer_list.
+
+
+ concurrent_unordered_multiset (const concurrent_unordered_multiset &table)
+
+
+concurrent_unordered_multiset & operator= (const concurrent_unordered_multiset &table)
+
+
+ concurrent_unordered_multiset (concurrent_unordered_multiset &&table)
+
+
+concurrent_unordered_multiset & operator= (concurrent_unordered_multiset &&table)
+
+
+ concurrent_unordered_multiset (const concurrent_unordered_multiset &table, const Allocator &a)
+
+
+ concurrent_unordered_multiset (concurrent_unordered_multiset &&table, const Allocator &a)
+
-
-
Returns iterator pointing to the first new element.
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-
-
-
Append minimal sequence of elements such that size() >=n.
-
The new elements are default constructed. Blocks until all elements in range [0..n) are allocated. May return while other elements are being constructed by other threads. Returns iterator that points to beginning of appended sequence. If no elements were appended, returns iterator pointing to nth element.
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-
-
-
-
- iterator tbb::concurrent_vector < T, A >::grow_to_at_least
- (
- size_type
- n ,
-
-
-
-
- const_reference
- t
-
-
-
- )
-
-
-
-
-
-inline
-
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-
-
-
Get reference to element at given index.
-
This method is thread-safe for concurrent reads, and also while growing the vector, as long as the calling thread has checked that index < size() .
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-
-
-
Push item.
-
Returns iterator pointing to the new element.
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-
-
-
Push item, move-aware.
-
Returns iterator pointing to the new element.
-
-
-
-
-
-
-
-template<typename T, class A = cache_aligned_allocator<T>>
-
-
-
-
Allocate enough space to grow to size n without having to allocate more memory later.
-
Like most of the methods provided for STL compatibility, this method is not thread safe. The capacity afterwards may be bigger than the requested reservation.
-
-
-
The documentation for this class was generated from the following file:
-concurrent_vector.h
+concurrent_unordered_set.h
diff --git a/doc/html/a00055.png b/doc/html/a00055.png
index 4ffff4fb10..3ef6d19042 100644
Binary files a/doc/html/a00055.png and b/doc/html/a00055.png differ
diff --git a/doc/html/a00056.html b/doc/html/a00056.html
index 6258c8609b..cd93034d4f 100644
--- a/doc/html/a00056.html
+++ b/doc/html/a00056.html
@@ -4,7 +4,7 @@
-tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor Class Reference
+tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > Class Template Reference
@@ -33,102 +33,118 @@
+tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > Class Template Reference
-
-
Combines data access, locking, and garbage collection.
- More...
-
-
#include <concurrent_hash_map.h>
+Inheritance diagram for tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >:
-
-
-
+
+
-
-typedef const
-concurrent_hash_map::value_type value_type
- Type of value.
-
+
+typedef Key key_type
+
+
+typedef base_type::value_type value_type
+
+
+typedef Key mapped_type
+
+
+typedef Hasher hasher
+
+
+typedef Key_equality key_equal
+
+
+typedef hash_compare key_compare
+
+
+typedef base_type::allocator_type allocator_type
+
+
+typedef base_type::pointer pointer
+
+
+typedef base_type::const_pointer const_pointer
+
+
+typedef base_type::reference reference
+
+
+typedef base_type::const_reference const_reference
+
+
+typedef base_type::size_type size_type
+
+
+typedef base_type::difference_type difference_type
+
+
+typedef base_type::iterator iterator
+
+
+typedef base_type::const_iterator const_iterator
+
+
+typedef base_type::iterator local_iterator
+
+
+typedef base_type::const_iterator const_local_iterator
+
-
-bool empty () const
- True if result is empty.
-
-
-void release ()
- Set to null.
-
-
-const_reference operator* () const
- Return reference to associated value in hash table.
-
-
-const_pointer operator-> () const
- Return pointer to associated value in hash table.
-
-
- const_accessor ()
- Create empty result.
-
-
- ~const_accessor ()
- Destroy result after releasing the underlying reference.
-
-
-
-
-bool is_writer ()
-
-
-
-
-node * my_node
-
-
-hashcode_t my_hash
-
-
-
-
-class concurrent_hash_map< Key, T, HashCompare, Allocator >
-
-
-class accessor
-
+
+ concurrent_unordered_set (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
+
+
+ concurrent_unordered_set (const Allocator &a)
+
+
+template<typename Iterator >
+ concurrent_unordered_set (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
+
+
+ concurrent_unordered_set (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
+ Constructor from initializer_list.
+
+
+ concurrent_unordered_set (const concurrent_unordered_set &table)
+
+
+concurrent_unordered_set & operator= (const concurrent_unordered_set &table)
+
+
+ concurrent_unordered_set (concurrent_unordered_set &&table)
+
+
+concurrent_unordered_set & operator= (concurrent_unordered_set &&table)
+
+
+ concurrent_unordered_set (const concurrent_unordered_set &table, const Allocator &a)
+
+
+ concurrent_unordered_set (concurrent_unordered_set &&table, const Allocator &a)
+
-
-template<typename Key, typename T, typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
-class tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
-
-
Combines data access, locking, and garbage collection.
-
The documentation for this class was generated from the following file:
-concurrent_hash_map.h
+ The documentation for this class was generated from the following file:
+concurrent_unordered_set.h
diff --git a/doc/html/a00056.png b/doc/html/a00056.png
index e861a116ac..9f9a099251 100644
Binary files a/doc/html/a00056.png and b/doc/html/a00056.png differ
diff --git a/doc/html/a00057.html b/doc/html/a00057.html
index be8a60e968..6543958f40 100644
--- a/doc/html/a00057.html
+++ b/doc/html/a00057.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::continue_msg Class Reference
+tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > Class Template Reference
@@ -33,23 +33,63 @@
-
-
An empty class used for messages that mean "I'm done".
- More...
-
-
#include <flow_graph.h>
-
-
An empty class used for messages that mean "I'm done".
-
The documentation for this class was generated from the following file:
-flow_graph.h
+
+
+enum { allow_multimapping = Allow_multimapping
+ }
+
+
+typedef Key value_type
+
+
+typedef Key key_type
+
+
+typedef Hash_compare hash_compare
+
+
+typedef Allocator::template
+rebind< value_type >::other allocator_type
+
+
+typedef hash_compare value_compare
+
+
+
+
+ concurrent_unordered_set_traits (const hash_compare &hc)
+
+
+
+
+static const Key & get_key (const value_type &value)
+
+
+
+
+hash_compare my_hash_compare
+
+
+ The documentation for this class was generated from the following file:
+concurrent_unordered_set.h
diff --git a/doc/html/a00058.html b/doc/html/a00058.html
index 573bf74da3..6255390b1f 100644
--- a/doc/html/a00058.html
+++ b/doc/html/a00058.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::continue_node< Output > Class Template Reference
+tbb::concurrent_vector< T, A > Class Template Reference
@@ -33,132 +33,770 @@
+tbb::concurrent_vector< T, A > Class Template Reference
-
Implements an executable node that supports continue_msg -> Output.
+
Concurrent vector container.
More...
-
#include <flow_graph.h>
+
#include <concurrent_vector.h>
+Inheritance diagram for tbb::concurrent_vector< T, A >:
-
-
-
+
+
-
-typedef continue_msg input_type
-
-
-typedef Output output_type
-
-
-typedef sender < input_type > predecessor_type
-
-
-typedef receiver < output_type > successor_type
-
-
+
typedef
-internal::continue_input
-< Output > fInput_type
-
-
+internal::concurrent_vector_base_v3::size_type size_type
+
+
typedef
-internal::function_output
-< output_type > fOutput_type
-
+internal::allocator_base< T, A >
+::allocator_type allocator_type
+
+
+typedef T value_type
+
+
+typedef ptrdiff_t difference_type
+
+
+typedef T & reference
+
+
+typedef const T & const_reference
+
+
+typedef T * pointer
+
+
+typedef const T * const_pointer
+
+
+typedef
+internal::vector_iterator
+< concurrent_vector , T > iterator
+
+
+typedef
+internal::vector_iterator
+< concurrent_vector , const T > const_iterator
+
+
+typedef std::reverse_iterator
+< iterator > reverse_iterator
+
+
+typedef std::reverse_iterator
+< const_iterator > const_reverse_iterator
+
+
+typedef std::reverse_iterator
+< iterator, T, T &, T * > reverse_iterator
+
+
+typedef std::reverse_iterator
+< const_iterator, T, const T
+&, const T * > const_reverse_iterator
+
+
+typedef generic_range_type
+< iterator > range_type
+
+
+typedef generic_range_type
+< const_iterator > const_range_type
+
-
-
-internal::broadcast_cache
-< output_type > & successors ()
-
-
-void reset_node (reset_flags f)
-
+
+ concurrent_vector (const allocator_type &a=allocator_type())
+ Construct empty vector.
+
+
+ concurrent_vector (std::initializer_list< T > init_list, const allocator_type &a=allocator_type())
+ Constructor from initializer_list.
+
+
+ concurrent_vector (const concurrent_vector &vector, const allocator_type &a=allocator_type())
+ Copying constructor.
+
+
+ concurrent_vector (concurrent_vector &&source)
+ Move constructor.
+
+
+ concurrent_vector (concurrent_vector &&source, const allocator_type &a)
+
+
+template<class M >
+ concurrent_vector (const concurrent_vector < T, M > &vector, const allocator_type &a=allocator_type())
+ Copying constructor for vector with different allocator type.
+
+
+ concurrent_vector (size_type n)
+ Construction with initial size specified by argument n.
+
+
+ concurrent_vector (size_type n, const_reference t, const allocator_type &a=allocator_type())
+ Construction with initial size specified by argument n, initialization by copying of t, and given allocator instance.
+
+
+template<class I >
+ concurrent_vector (I first, I last, const allocator_type &a=allocator_type())
+ Construction with copying iteration range and given allocator instance.
+
+
+concurrent_vector & operator= (const concurrent_vector &vector)
+ Assignment.
+
+
+concurrent_vector & operator= (concurrent_vector &&other)
+ Move assignment.
+
+
+template<class M >
+concurrent_vector & operator= (const concurrent_vector < T, M > &vector)
+ Assignment for vector with different allocator type.
+
+
+concurrent_vector & operator= (std::initializer_list< T > init_list)
+ Assignment for initializer_list.
+
+iterator grow_by (size_type delta)
+ Grow by "delta" elements. More...
+
+iterator grow_by (size_type delta, const_reference t)
+ Grow by "delta" elements using copying constructor. More...
+
+template<typename I >
+iterator grow_by (I first, I last)
+
+iterator grow_by (std::initializer_list< T > init_list)
+
+iterator grow_to_at_least (size_type n)
+ Append minimal sequence of elements such that size() >=n. More...
+
+iterator grow_to_at_least (size_type n, const_reference t)
+
+iterator push_back (const_reference item)
+ Push item. More...
+
+iterator push_back (T &&item)
+ Push item, move-aware. More...
+
+template<typename... Args>
+iterator emplace_back (Args &&...args)
+ Push item, create item "in place" with provided arguments. More...
+
+reference operator[] (size_type index)
+ Get reference to element at given index. More...
+
+
+const_reference operator[] (size_type index) const
+ Get const reference to element at given index.
+
+
+reference at (size_type index)
+ Get reference to element at given index. Throws exceptions on errors.
+
+
+const_reference at (size_type index) const
+ Get const reference to element at given index. Throws exceptions on errors.
+
+
+range_type range (size_t grainsize=1)
+ Get range for iterating with parallel algorithms.
+
+
+const_range_type range (size_t grainsize=1) const
+ Get const range for iterating with parallel algorithms.
+
+
+size_type size () const
+ Return size of vector. It may include elements under construction.
+
+
+bool empty () const
+ Return false if vector is not empty or has elements under construction at least.
+
+
+size_type capacity () const
+ Maximum size to which array can grow without allocating more memory. Concurrent allocations are not included in the value.
+
+void reserve (size_type n)
+ Allocate enough space to grow to size n without having to allocate more memory later. More...
+
+
+void resize (size_type n)
+ Resize the vector. Not thread-safe.
+
+
+void resize (size_type n, const_reference t)
+ Resize the vector, copy t for new elements. Not thread-safe.
+
+
+void shrink_to_fit ()
+ Optimize memory usage and fragmentation.
+
+
+size_type max_size () const
+ Upper bound on argument to reserve.
+
+
+iterator begin ()
+ start iterator
+
+
+iterator end ()
+ end iterator
+
+
+const_iterator begin () const
+ start const iterator
+
+
+const_iterator end () const
+ end const iterator
+
+
+const_iterator cbegin () const
+ start const iterator
+
+
+const_iterator cend () const
+ end const iterator
+
+
+reverse_iterator rbegin ()
+ reverse start iterator
+
+
+reverse_iterator rend ()
+ reverse end iterator
+
+
+const_reverse_iterator rbegin () const
+ reverse start const iterator
+
+
+const_reverse_iterator rend () const
+ reverse end const iterator
+
+
+const_reverse_iterator crbegin () const
+ reverse start const iterator
+
+
+const_reverse_iterator crend () const
+ reverse end const iterator
+
+
+reference front ()
+ the first item
+
+
+const_reference front () const
+ the first item const
+
+
+reference back ()
+ the last item
+
+
+const_reference back () const
+ the last item const
+
+
+allocator_type get_allocator () const
+ return allocator object
+
+
+void assign (size_type n, const_reference t)
+ assign n items by copying t item
+
+
+template<class I >
+void assign (I first, I last)
+ assign range [first, last)
+
+
+void assign (std::initializer_list< T > init_list)
+ assigns an initializer list
+
+
+void swap (concurrent_vector &vector)
+ swap two instances
+
+void clear ()
+ Clear container while keeping memory allocated. More...
+
+
+ ~concurrent_vector ()
+ Clear and destroy vector.
+
+
+const
+internal::concurrent_vector_base_v3 & internal_vector_base () const
+
+
+template<typename I >
+void copy_range (void *dst, const void *p_type_erased_iterator, size_type n)
+
-
-template<typename R , typename B >
-class run_and_put_task
-
-
-template<typename X , typename Y >
-class internal::broadcast_cache
-
-
-template<typename X , typename Y >
-class internal::round_robin_cache
-
-
-
-
-
-graph & my_graph
-
-
-graph_node * next
-
-
-graph_node * prev
-
+
+template<typename C , typename U >
+class internal::vector_iterator
+
-template<typename Output>
-class tbb::flow::interface8::continue_node< Output >
+
template<typename T, class A = cache_aligned_allocator<T>>
+class tbb::concurrent_vector< T, A >
-
Implements an executable node that supports continue_msg -> Output.
-
The documentation for this class was generated from the following file:
concurrent_vector is a container having the following main properties:
+- It provides random indexed access to its elements. The index of the first element is 0.
+- It ensures safe concurrent growing its size (different threads can safely append new elements).
+- Adding new elements does not invalidate existing iterators and does not change indices of existing items.
+ Compatibility The class meets all Container Requirements and Reversible Container Requirements from C++ Standard (See ISO/IEC 14882:2003(E), clause 23.1). But it doesn't meet Sequence Requirements due to absence of insert() and erase() methods.
+
Exception Safety Methods working with memory allocation and/or new elements construction can throw an exception if allocator fails to allocate memory or element's default constructor throws one. Concurrent vector's element of type T must conform to the following requirements:
+Throwing an exception is forbidden for destructor of T.
+Default constructor of T must not throw an exception OR its non-virtual destructor must safely work when its object memory is zero-initialized.
+
+Otherwise, the program's behavior is undefined.
+
If an exception happens inside growth or assignment operation, an instance of the vector becomes invalid unless it is stated otherwise in the method documentation. Invalid state means:
+There are no guarantees that all items were initialized by a constructor. The rest of items is zero-filled, including item where exception happens.
+An invalid vector instance cannot be repaired; it is unable to grow anymore.
+Size and capacity reported by the vector are incorrect, and calculated as if the failed operation were successful.
+Attempt to access not allocated elements using operator[] or iterators results in access violation or segmentation fault exception, and in case of using at() method a C++ exception is thrown.
+
+If a concurrent grow operation successfully completes, all the elements it has added to the vector will remain valid and accessible even if one of subsequent grow operations fails.
+
Fragmentation Unlike an STL vector, a concurrent_vector does not move existing elements if it needs to allocate more memory. The container is divided into a series of contiguous arrays of elements. The first reservation, growth, or assignment operation determines the size of the first array. Using small number of elements as initial size incurs fragmentation that may increase element access time. Internal layout can be optimized by method compact() that merges several smaller arrays into one solid.
+
Changes since TBB 2.1
+Fixed guarantees of concurrent_vector::size() and grow_to_at_least() methods to assure elements are allocated.
+Methods end() /rbegin()/back() are partly thread-safe since they use size() to get the end of vector
+Added resize() methods (not thread-safe)
+Added cbegin/cend/crbegin/crend methods
+Changed return type of methods grow* and push_back to iterator
+
+
+
Changes since TBB 2.0
+Implemented exception-safety guarantees
+Added template argument for allocator
+Added allocator argument in constructors
+Faster index calculation
+First growth call specifies a number of segments to be merged in the first allocation.
+Fixed memory blow up for swarm of vector's instances of small size
+Added grow_by(size_type n, const_reference t) growth using copying constructor to init new items.
+Added STL-like constructors.
+Added operators ==, < and derivatives
+Added at() method, approved for using after an exception was thrown inside the vector
+Added get_allocator() method.
+Added assign() methods
+Added compact() method to defragment first segments
+Added swap() method
+range() defaults on grainsize = 1 supporting auto grainsize algorithms.
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+
+
+
Clear container while keeping memory allocated.
+
To free up the memory, use in conjunction with method compact(). Not thread safe
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+template<typename... Args>
+
+
+
+
Push item, create item "in place" with provided arguments.
+
Returns iterator pointing to the new element.
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+
+
+
Grow by "delta" elements.
+
Returns iterator pointing to the first new element.
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+
+
+
+
+ iterator tbb::concurrent_vector < T, A >::grow_by
+ (
+ size_type
+ delta ,
+
+
+
+
+ const_reference
+ t
+
+
+
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Grow by "delta" elements using copying constructor.
+
Returns iterator pointing to the first new element.
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+template<typename I >
+
+
+
Returns iterator pointing to the first new element.
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+
+
Returns iterator pointing to the first new element.
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+
+
+
Append minimal sequence of elements such that size() >=n.
+
The new elements are default constructed. Blocks until all elements in range [0..n) are allocated. May return while other elements are being constructed by other threads. Returns iterator that points to beginning of appended sequence. If no elements were appended, returns iterator pointing to nth element.
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+
+
+
+
+ iterator tbb::concurrent_vector < T, A >::grow_to_at_least
+ (
+ size_type
+ n ,
+
+
+
+
+ const_reference
+ t
+
+
+
+ )
+
+
+
+
+
+inline
+
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+
+
+
Get reference to element at given index.
+
This method is thread-safe for concurrent reads, and also while growing the vector, as long as the calling thread has checked that index < size() .
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+
+
+
Push item.
+
Returns iterator pointing to the new element.
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+
+
+
Push item, move-aware.
+
Returns iterator pointing to the new element.
+
+
+
+
+
+
+
+template<typename T, class A = cache_aligned_allocator<T>>
+
+
+
+
Allocate enough space to grow to size n without having to allocate more memory later.
+
Like most of the methods provided for STL compatibility, this method is not thread safe. The capacity afterwards may be bigger than the requested reservation.
+
+
+
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00058.png b/doc/html/a00058.png
index d877596750..4ffff4fb10 100644
Binary files a/doc/html/a00058.png and b/doc/html/a00058.png differ
diff --git a/doc/html/a00059.html b/doc/html/a00059.html
index 04d41d45b3..154286a31a 100644
--- a/doc/html/a00059.html
+++ b/doc/html/a00059.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::continue_receiver Class Reference
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor Class Reference
@@ -33,7 +33,7 @@
+List of all members
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor Class Reference
-
Base class for receivers of completion messages.
+
Combines data access, locking, and garbage collection.
More...
-
#include <flow_graph.h>
+
#include <concurrent_hash_map.h>
+Inheritance diagram for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor:
-
-
-
+
+
+
-
-task * try_put_task (const input_type &)
-
-
-void reset_receiver (reset_flags f)
-
-virtual task * execute ()=0
- Does whatever should happen when the threshold is reached. More...
-
-
-bool is_continue_receiver ()
-
+
+bool is_writer ()
+
-
-built_predecessors_type my_built_predecessors
-
-
-spin_mutex my_mutex
-
-
-int my_predecessor_count
-
-
-int my_current_count
-
-
-int my_initial_predecessor_count
-
+
+node * my_node
+
+
+hashcode_t my_hash
+
-
-template<typename R , typename B >
-class run_and_put_task
-
-
-template<typename X , typename Y >
-class internal::broadcast_cache
-
-
-template<typename X , typename Y >
-class internal::round_robin_cache
-
-
-template<typename U >
-class limiter_node
-
-
-template<typename TT , typename M >
-class internal::successor_cache
-
+
+class concurrent_hash_map< Key, T, HashCompare, Allocator >
+
+
+class accessor
+
-Base class for receivers of completion messages.
-
These receivers automatically reset, but cannot be explicitly waited on
-
-
-
-
-
-
-
-
-
- virtual task* tbb::flow::interface8::continue_receiver::execute
- (
- )
-
-
-
-
-
-protected pure virtual
-
-
-
-
-
Does whatever should happen when the threshold is reached.
-
This should be very fast or else spawn a task. This is called while the sender is blocked in the try_put() .
-
-
-
-
-
-
-
-
-
-
-
- bool tbb::flow::interface8::continue_receiver::remove_predecessor
- (
- predecessor_type &
- )
-
-
-
-
-
-inline virtual
-
-
-
-
-
Decrements the trigger threshold.
-
Does not check to see if the removal of the predecessor now makes the current count exceed the new threshold. So removing a predecessor while the graph is active can cause unexpected results.
-
-
Reimplemented from tbb::flow::interface8::receiver< continue_msg > .
+
template<typename Key, typename T, typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<Key, T> >>
+class tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
-
-
-
The documentation for this class was generated from the following file:
-flow_graph.h
+Combines data access, locking, and garbage collection.
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00059.png b/doc/html/a00059.png
index 1fbcea13e9..e861a116ac 100644
Binary files a/doc/html/a00059.png and b/doc/html/a00059.png differ
diff --git a/doc/html/a00060.html b/doc/html/a00060.html
index 32db0ab7d0..166178d23c 100644
--- a/doc/html/a00060.html
+++ b/doc/html/a00060.html
@@ -4,7 +4,7 @@
-tbb::internal::critical_section_v4 Class Reference
+tbb::flow::interface8::continue_msg Class Reference
@@ -33,62 +33,23 @@
-
-
-
-
-
-
-
-
-
-
-void __TBB_EXPORTED_METHOD internal_construct ()
-
-
-void lock ()
-
-
-bool try_lock ()
-
-
-void unlock ()
-
-
-
-
-static const bool is_rw_mutex = false
-
-
-static const bool is_recursive_mutex = false
-
-
-static const bool is_fair_mutex = true
-
-
-
The documentation for this class was generated from the following file:
-critical_section.h
+
+An empty class used for messages that mean "I'm done".
+ More...
+
+#include <flow_graph.h>
+
+An empty class used for messages that mean "I'm done".
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00060.png b/doc/html/a00060.png
deleted file mode 100644
index 835e586da2..0000000000
Binary files a/doc/html/a00060.png and /dev/null differ
diff --git a/doc/html/a00061.html b/doc/html/a00061.html
index 87e806344e..ecb13f4769 100644
--- a/doc/html/a00061.html
+++ b/doc/html/a00061.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::internal::edge_container< C > Class Template Reference
+tbb::flow::interface8::continue_node< Output > Class Template Reference
@@ -33,54 +33,132 @@
+tbb::flow::interface8::continue_node< Output > Class Template Reference
+
+
Implements an executable node that supports continue_msg -> Output.
+ More...
+
+
#include <flow_graph.h>
+
+
+
+
+
+
+
+
-
-typedef std::list< C
-*, tbb::tbb_allocator < C * > > edge_list_type
-
+
+typedef continue_msg input_type
+
+
+typedef Output output_type
+
+
+typedef sender < input_type > predecessor_type
+
+
+typedef receiver < output_type > successor_type
+
+
+typedef
+internal::continue_input
+< Output > fInput_type
+
+
+typedef
+internal::function_output
+< output_type > fOutput_type
+
-
-void add_edge (C &s)
-
-
-void delete_edge (C &s)
-
-
-void copy_edges (edge_list_type &v)
-
-
-size_t edge_count ()
-
-
-void clear ()
-
-
-template<typename S >
-void sender_extract (S &s)
-
-
-template<typename R >
-void receiver_extract (R &r)
-
+
+template<typename Body >
+ continue_node (graph &g, Body body)
+ Constructor for executable node with continue_msg -> Output.
+
+
+template<typename Body >
+ continue_node (graph &g, int number_of_predecessors, Body body)
+ Constructor for executable node with continue_msg -> Output.
+
+
+ continue_node (const continue_node &src)
+ Copy constructor.
+
+
+void set_name (const char *name)
+
+
+void extract ()
+
+
+
+ graph_node (graph &g)
+
+
+
+
+template<typename R , typename B >
+class run_and_put_task
+
+
+template<typename X , typename Y >
+class internal::broadcast_cache
+
+
+template<typename X , typename Y >
+class internal::round_robin_cache
+
+
-
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00061.png b/doc/html/a00061.png
new file mode 100644
index 0000000000..d877596750
Binary files /dev/null and b/doc/html/a00061.png differ
diff --git a/doc/html/a00062.html b/doc/html/a00062.html
index bf90b4eb13..1b84becab3 100644
--- a/doc/html/a00062.html
+++ b/doc/html/a00062.html
@@ -4,7 +4,7 @@
-tbb::concurrent_vector< T, A >::push_back_helper::element_construction_guard Struct Reference
+tbb::flow::interface8::continue_receiver Class Reference
@@ -33,44 +33,237 @@
+tbb::flow::interface8::continue_receiver Class Referenceabstract
+
+
Base class for receivers of completion messages.
+ More...
+
+
#include <flow_graph.h>
+Inheritance diagram for tbb::flow::interface8::continue_receiver:
-
-
+
+
+
+
+
+task * try_put_task (const input_type &)
+
+
+void reset_receiver (reset_flags f)
+
+virtual task * execute ()=0
+ Does whatever should happen when the threshold is reached. More...
+
+
+bool is_continue_receiver ()
+
+
+
+
+built_predecessors_type my_built_predecessors
+
+
+spin_mutex my_mutex
+
+
+int my_predecessor_count
+
+
+int my_current_count
+
+
+int my_initial_predecessor_count
+
-
-
-pointer element
-
+
+
+template<typename R , typename B >
+class run_and_put_task
+
+
+template<typename X , typename Y >
+class internal::broadcast_cache
+
+
+template<typename X , typename Y >
+class internal::round_robin_cache
+
+
+template<typename U >
+class limiter_node
+
+
+template<typename TT , typename M >
+class internal::successor_cache
+
- The documentation for this struct was generated from the following file:
-concurrent_vector.h
+
+Base class for receivers of completion messages.
+
These receivers automatically reset, but cannot be explicitly waited on
+
+
+
+
+
+
+
+
+
+ virtual task* tbb::flow::interface8::continue_receiver::execute
+ (
+ )
+
+
+
+
+
+protected pure virtual
+
+
+
+
+
Does whatever should happen when the threshold is reached.
+
This should be very fast or else spawn a task. This is called while the sender is blocked in the try_put() .
+
+
+
+
+
+
+
+
+
+
+
+ bool tbb::flow::interface8::continue_receiver::remove_predecessor
+ (
+ predecessor_type &
+ )
+
+
+
+
+
+inline virtual
+
+
+
+
+
Decrements the trigger threshold.
+
Does not check to see if the removal of the predecessor now makes the current count exceed the new threshold. So removing a predecessor while the graph is active can cause unexpected results.
+
+
Reimplemented from tbb::flow::interface8::receiver< continue_msg > .
+
+
+
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00062.png b/doc/html/a00062.png
index 0b05314963..1fbcea13e9 100644
Binary files a/doc/html/a00062.png and b/doc/html/a00062.png differ
diff --git a/doc/html/a00063.html b/doc/html/a00063.html
index 44052ac99e..8a27c3a84d 100644
--- a/doc/html/a00063.html
+++ b/doc/html/a00063.html
@@ -4,7 +4,7 @@
-tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > Class Template Reference
+tbb::internal::critical_section_v4 Class Reference
@@ -33,221 +33,62 @@
+tbb::internal::critical_section_v4 Class Reference
-
-
The enumerable_thread_specific container.
- More...
-
-
#include <enumerable_thread_specific.h>
+Inheritance diagram for tbb::internal::critical_section_v4:
-
-
+
+
-
-
-typedef Allocator allocator_type
- Basic types.
-
-
-typedef T value_type
-
-
-typedef T & reference
-
-
-typedef const T & const_reference
-
-
-typedef T * pointer
-
-
-typedef const T * const_pointer
-
-
-typedef
-internal_collection_type::size_type size_type
-
-
-typedef
-internal_collection_type::difference_type difference_type
-
-
-typedef
-internal::enumerable_thread_specific_iterator
-< internal_collection_type ,
-value_type > iterator
-
-
-typedef
-internal::enumerable_thread_specific_iterator
-< internal_collection_type ,
-const value_type > const_iterator
-
-
-typedef generic_range_type
-< iterator > range_type
-
-
-typedef generic_range_type
-< const_iterator > const_range_type
-
+
+class scoped_lock
+
-
- enumerable_thread_specific ()
- Default constructor. Each local instance of T is default constructed.
-
-
-template<typename Finit#if __TBB_ETS_USE_CPP11, typename = typename internal::enable_if<internal::is_callable_no_args<typename internal::strip<Finit>::type>::value>::type #endif>
- enumerable_thread_specific (Finit finit)
- Constructor with initializer functor. Each local instance of T is constructed by T(finit()).
-
-
- enumerable_thread_specific (const T &exemplar)
- Constructor with exemplar. Each local instance of T is copy-constructed from the exemplar.
-
-
- enumerable_thread_specific (T &&exemplar)
-
-
-template<typename P1 , typename... P, typename = typename internal::enable_if<!internal::is_callable_no_args<typename internal::strip<P1>::type>::value && !internal::is_compatible_ets<T, typename internal::strip<P1>::type>::value && !internal::is_same_type<T, typename internal::strip<P1>::type>::value >::type>
- enumerable_thread_specific (P1 &&arg1, P &&...args)
- Variadic constructor with initializer arguments. Each local instance of T is constructed by T(args...)
-
-
- ~enumerable_thread_specific ()
- Destructor.
-
-
-reference local ()
- returns reference to local, discarding exists
-
-
-reference local (bool &exists)
- Returns reference to calling thread's local copy, creating one if necessary.
-
-
-size_type size () const
- Get the number of local copies.
-
-
-bool empty () const
- true if there have been no local copies created
-
-
-iterator begin ()
- begin iterator
-
-
-iterator end ()
- end iterator
-
-
-const_iterator begin () const
- begin const iterator
-
-
-const_iterator end () const
- end const iterator
-
-
-range_type range (size_t grainsize=1)
- Get range for parallel algorithms.
-
-
-const_range_type range (size_t grainsize=1) const
- Get const range for parallel algorithms.
-
-
-void clear ()
- Destroys local copies.
-
-
- enumerable_thread_specific (const enumerable_thread_specific &other)
-
-
-template<typename Alloc , ets_key_usage_type Cachetype>
- enumerable_thread_specific (const enumerable_thread_specific < T, Alloc, Cachetype > &other)
-
-
- enumerable_thread_specific (enumerable_thread_specific &&other)
-
-
-template<typename Alloc , ets_key_usage_type Cachetype>
- enumerable_thread_specific (enumerable_thread_specific < T, Alloc, Cachetype > &&other)
-
-
-enumerable_thread_specific & operator= (const enumerable_thread_specific &other)
-
-
-template<typename Alloc , ets_key_usage_type Cachetype>
-enumerable_thread_specific & operator= (const enumerable_thread_specific < T, Alloc, Cachetype > &other)
-
-
-enumerable_thread_specific & operator= (enumerable_thread_specific &&other)
-
-
-template<typename Alloc , ets_key_usage_type Cachetype>
-enumerable_thread_specific & operator= (enumerable_thread_specific < T, Alloc, Cachetype > &&other)
-
-
-template<typename combine_func_t >
-T combine (combine_func_t f_combine)
-
-
-template<typename combine_func_t >
-void combine_each (combine_func_t f_combine)
-
+
+void __TBB_EXPORTED_METHOD internal_construct ()
+
+
+void lock ()
+
+
+bool try_lock ()
+
+
+void unlock ()
+
-
-
-template<typename U , typename A , ets_key_usage_type C>
-class enumerable_thread_specific
-
+
+
+static const bool is_rw_mutex = false
+
+
+static const bool is_recursive_mutex = false
+
+
+static const bool is_fair_mutex = true
+
-
-template<typename T, typename Allocator, ets_key_usage_type ETS_key_type>
-class tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
-
-
The enumerable_thread_specific container.
-
enumerable_thread_specific has the following properties:
-- thread-local copies are lazily created, with default, exemplar or function initialization.
-- thread-local copies do not move (during lifetime, and excepting clear()) so the address of a copy is invariant.
-- the contained objects need not have operator=() defined if combine is not used.
-- enumerable_thread_specific containers may be copy-constructed or assigned.
-- thread-local copies can be managed by hash-table, or can be accessed via TLS storage for speed.
-- outside of parallel contexts, the contents of all thread-local copies are accessible by iterator or using combine or combine_each methods
- Segmented iterator When the thread-local objects are containers with input_iterators defined, a segmented iterator may be used to iterate over all the elements of all thread-local copies.
-
combine and combine_each
-Both methods are defined for enumerable_thread_specific .
-combine() requires the type T have operator=() defined.
-neither method modifies the contents of the object (though there is no guarantee that the applied methods do not modify the object.)
-Both are evaluated in serial context (the methods are assumed to be non-benign.)
-
-
-
The documentation for this class was generated from the following file:
-enumerable_thread_specific.h
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00063.png b/doc/html/a00063.png
index fba36b8c91..835e586da2 100644
Binary files a/doc/html/a00063.png and b/doc/html/a00063.png differ
diff --git a/doc/html/a00064.html b/doc/html/a00064.html
index 245fac8d20..38f0907dcb 100644
--- a/doc/html/a00064.html
+++ b/doc/html/a00064.html
@@ -4,7 +4,7 @@
-tbb::filter Class Reference
+tbb::flow::interface8::default_opencl_factory Class Reference
@@ -33,106 +33,42 @@
+tbb::flow::interface8::default_opencl_factory Class Reference
-
-
A stage in a pipeline.
- More...
-
-
#include <pipeline.h>
+Inheritance diagram for tbb::flow::interface8::default_opencl_factory:
-
-
-
+
+
+
-
-
-
-
-
-
-
-
-
-
- const unsigned char tbb::filter::exact_exception_propagation
-
-
-
-
-static protected
-
-
-
-
Initial value: =
-
#if TBB_USE_CAPTURED_EXCEPTION
-
0x0
-
-
7th bit defines exception propagation mode expected by the application.
-
-
-
-
-
-
-
-
-
-
-
- const unsigned char tbb::filter::filter_is_out_of_order = 0x1<<4
-
-
-
-
-static protected
-
-
-
-
-
4th bit distinguishes ordered vs unordered filters.
-
The bit was not set for parallel filters in TBB 2.1 and earlier, but is_ordered() function always treats parallel filters as out of order.
-
-
-
The documentation for this class was generated from the following file:
-pipeline.h
+flow_graph_opencl_node.h
diff --git a/doc/html/a00064.png b/doc/html/a00064.png
index a4923e5f6f..e66950efeb 100644
Binary files a/doc/html/a00064.png and b/doc/html/a00064.png differ
diff --git a/doc/html/a00065.html b/doc/html/a00065.html
index 3af3ab206a..abacd66d20 100644
--- a/doc/html/a00065.html
+++ b/doc/html/a00065.html
@@ -4,7 +4,7 @@
-tbb::interface6::filter_t< T, U > Class Template Reference
+tbb::flow::interface8::default_opencl_factory_device_filter Struct Reference
@@ -33,62 +33,26 @@
+tbb::flow::interface8::default_opencl_factory_device_filter Struct Reference
-
-
Class representing a chain of type-safe pipeline filters.
- More...
-
-
#include <pipeline.h>
-
- filter_t (const filter_t < T, U > &rhs)
-
-
-template<typename Body >
- filter_t (tbb::filter::mode mode, const Body &body)
-
-
-void operator= (const filter_t < T, U > &rhs)
-
-
-void clear ()
-
-
-
-
-class internal::pipeline_proxy
-
-
-template<typename T_ , typename U_ , typename Body >
-filter_t < T_, U_ > make_filter (tbb::filter::mode, const Body &)
- Create a filter to participate in parallel_pipeline.
-
-
-template<typename T_ , typename V_ , typename U_ >
-filter_t < T_, U_ > operator& (const filter_t < T_, V_ > &, const filter_t < V_, U_ > &)
-
+
+opencl_device_list operator() (const opencl_device_list &devices)
+
-
-
template<typename T, typename U>
-class tbb::interface6::filter_t< T, U >
-
-
Class representing a chain of type-safe pipeline filters.
-
The documentation for this class was generated from the following file:
-pipeline.h
+ The documentation for this struct was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00066.html b/doc/html/a00066.html
index 20465dbe26..8b1289e002 100644
--- a/doc/html/a00066.html
+++ b/doc/html/a00066.html
@@ -4,7 +4,7 @@
-tbb::final_scan_tag Struct Reference
+tbb::flow::interface8::dependency_msg< T, Factory > Class Template Reference
@@ -33,33 +33,76 @@
+tbb::flow::interface8::dependency_msg< T, Factory > Class Template Reference
-
-
Used to indicate that the final scan is being performed.
- More...
-
-
#include <parallel_scan.h>
-
-
-static bool is_final_scan ()
-
+
+
+typedef T value_type
+
+
+
+
+ dependency_msg (const T &data)
+
+
+ dependency_msg (opencl_graph &g, const T &data)
+
+
+ dependency_msg (const T &data, cl_event event)
+
+
+T & data (bool wait=true)
+
+
+const T & data (bool wait=true) const
+
+
+ dependency_msg (const dependency_msg &dmsg)
+
+
+ dependency_msg (dependency_msg &&dmsg)
+
+
+dependency_msg & operator= (const dependency_msg &dmsg)
+
+
+cl_event const * get_event () const
+
+
+void set_event (cl_event e) const
+
+
+void set_graph (graph &g)
+
+
+void clear_event () const
+
+
+template<typename Callback >
+void register_callback (Callback c) const
+
+
+ operator T & ()
+
+
+ operator const T & () const
+
-
-
Used to indicate that the final scan is being performed.
-
The documentation for this struct was generated from the following file:
-parallel_scan.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00067.html b/doc/html/a00067.html
index 55a33d1b7b..0820202fbd 100644
--- a/doc/html/a00067.html
+++ b/doc/html/a00067.html
@@ -4,7 +4,7 @@
-tbb::interface6::fixed_pool Class Reference
+tbb::flow::interface8::internal::edge_container< C > Class Template Reference
@@ -33,39 +33,54 @@
+tbb::flow::interface8::internal::edge_container< C > Class Template Reference
-
-
-
-
-
-
-
-
- fixed_pool (void *buf, size_t size)
- construct pool with underlying allocator
-
-
- ~fixed_pool ()
- destroy pool
-
+
+void add_edge (C &s)
+
+
+void delete_edge (C &s)
+
+
+void copy_edges (edge_list_type &v)
+
+
+size_t edge_count ()
+
+
+void clear ()
+
+
+template<typename S >
+void sender_extract (S &s)
+
+
+template<typename R >
+void receiver_extract (R &r)
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00068.html b/doc/html/a00068.html
index a442c81cf2..bd23f2b05c 100644
--- a/doc/html/a00068.html
+++ b/doc/html/a00068.html
@@ -4,7 +4,7 @@
-tbb::interface6::flattened2d< Container > Class Template Reference
+tbb::concurrent_vector< T, A >::push_back_helper::element_construction_guard Struct Reference
@@ -33,85 +33,44 @@
+tbb::concurrent_vector< T, A >::push_back_helper::element_construction_guard Struct Reference
+
+
+
+
+
+
+
-
-
-typedef conval_type::size_type size_type
- Basic types.
-
-
-typedef
-conval_type::difference_type difference_type
-
-
-typedef conval_type::allocator_type allocator_type
-
-
-typedef conval_type::value_type value_type
-
-
-typedef conval_type::reference reference
-
-
-typedef
-conval_type::const_reference const_reference
-
-
-typedef conval_type::pointer pointer
-
-
-typedef conval_type::const_pointer const_pointer
-
-
-typedef
-internal::segmented_iterator
-< Container, value_type > iterator
-
-
-typedef
-internal::segmented_iterator
-< Container, const value_type > const_iterator
-
-
-
- flattened2d (const Container &c, typename Container::const_iterator b, typename Container::const_iterator e)
-
-
- flattened2d (const Container &c)
-
-
-iterator begin ()
-
-
-iterator end ()
-
-
-const_iterator begin () const
-
-
-const_iterator end () const
-
-
-size_type size () const
-
+
+ element_construction_guard (pointer an_element)
+
+
+void dismiss ()
+
+
-
The documentation for this class was generated from the following file:
-enumerable_thread_specific.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00068.png b/doc/html/a00068.png
new file mode 100644
index 0000000000..0b05314963
Binary files /dev/null and b/doc/html/a00068.png differ
diff --git a/doc/html/a00069.html b/doc/html/a00069.html
index 0cdb0b978c..5310f7542e 100644
--- a/doc/html/a00069.html
+++ b/doc/html/a00069.html
@@ -4,7 +4,7 @@
-tbb::interface6::flow_control Class Reference
+tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > Class Template Reference
@@ -33,41 +33,221 @@
+tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > Class Template Reference
-
input_filter control to signal end-of-input for parallel_pipeline
+
The enumerable_thread_specific container.
More...
-
#include <pipeline.h>
+
#include <enumerable_thread_specific.h>
+
+
+
+
+
+
+
+
+
+typedef Allocator allocator_type
+ Basic types.
+
+
+typedef T value_type
+
+
+typedef T & reference
+
+
+typedef const T & const_reference
+
+
+typedef T * pointer
+
+
+typedef const T * const_pointer
+
+
+typedef
+internal_collection_type::size_type size_type
+
+
+typedef
+internal_collection_type::difference_type difference_type
+
+
+typedef
+internal::enumerable_thread_specific_iterator
+< internal_collection_type ,
+value_type > iterator
+
+
+typedef
+internal::enumerable_thread_specific_iterator
+< internal_collection_type ,
+const value_type > const_iterator
+
+
+typedef generic_range_type
+< iterator > range_type
+
+
+typedef generic_range_type
+< const_iterator > const_range_type
+
+
-
-void stop ()
-
+
+ enumerable_thread_specific ()
+ Default constructor. Each local instance of T is default constructed.
+
+
+template<typename Finit#if __TBB_ETS_USE_CPP11, typename = typename internal::enable_if<internal::is_callable_no_args<typename internal::strip<Finit>::type>::value>::type #endif>
+ enumerable_thread_specific (Finit finit)
+ Constructor with initializer functor. Each local instance of T is constructed by T(finit()).
+
+
+ enumerable_thread_specific (const T &exemplar)
+ Constructor with exemplar. Each local instance of T is copy-constructed from the exemplar.
+
+
+ enumerable_thread_specific (T &&exemplar)
+
+
+template<typename P1 , typename... P, typename = typename internal::enable_if<!internal::is_callable_no_args<typename internal::strip<P1>::type>::value && !internal::is_compatible_ets<T, typename internal::strip<P1>::type>::value && !internal::is_same_type<T, typename internal::strip<P1>::type>::value >::type>
+ enumerable_thread_specific (P1 &&arg1, P &&...args)
+ Variadic constructor with initializer arguments. Each local instance of T is constructed by T(args...)
+
+
+ ~enumerable_thread_specific ()
+ Destructor.
+
+
+reference local ()
+ returns reference to local, discarding exists
+
+
+reference local (bool &exists)
+ Returns reference to calling thread's local copy, creating one if necessary.
+
+
+size_type size () const
+ Get the number of local copies.
+
+
+bool empty () const
+ true if there have been no local copies created
+
+
+iterator begin ()
+ begin iterator
+
+
+iterator end ()
+ end iterator
+
+
+const_iterator begin () const
+ begin const iterator
+
+
+const_iterator end () const
+ end const iterator
+
+
+range_type range (size_t grainsize=1)
+ Get range for parallel algorithms.
+
+
+const_range_type range (size_t grainsize=1) const
+ Get const range for parallel algorithms.
+
+
+void clear ()
+ Destroys local copies.
+
+
+ enumerable_thread_specific (const enumerable_thread_specific &other)
+
+
+template<typename Alloc , ets_key_usage_type Cachetype>
+ enumerable_thread_specific (const enumerable_thread_specific < T, Alloc, Cachetype > &other)
+
+
+ enumerable_thread_specific (enumerable_thread_specific &&other)
+
+
+template<typename Alloc , ets_key_usage_type Cachetype>
+ enumerable_thread_specific (enumerable_thread_specific < T, Alloc, Cachetype > &&other)
+
+
+enumerable_thread_specific & operator= (const enumerable_thread_specific &other)
+
+
+template<typename Alloc , ets_key_usage_type Cachetype>
+enumerable_thread_specific & operator= (const enumerable_thread_specific < T, Alloc, Cachetype > &other)
+
+
+enumerable_thread_specific & operator= (enumerable_thread_specific &&other)
+
+
+template<typename Alloc , ets_key_usage_type Cachetype>
+enumerable_thread_specific & operator= (enumerable_thread_specific < T, Alloc, Cachetype > &&other)
+
+
+template<typename combine_func_t >
+T combine (combine_func_t f_combine)
+
+
+template<typename combine_func_t >
+void combine_each (combine_func_t f_combine)
+
-
-template<typename T , typename U , typename Body >
-class internal::concrete_filter
-
+
+template<typename U , typename A , ets_key_usage_type C>
+class enumerable_thread_specific
+
-
input_filter control to signal end-of-input for parallel_pipeline
+
template<typename T, typename Allocator, ets_key_usage_type ETS_key_type>
+class tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+
+
The enumerable_thread_specific container.
+
enumerable_thread_specific has the following properties:
+- thread-local copies are lazily created, with default, exemplar or function initialization.
+- thread-local copies do not move (during lifetime, and excepting clear()) so the address of a copy is invariant.
+- the contained objects need not have operator=() defined if combine is not used.
+- enumerable_thread_specific containers may be copy-constructed or assigned.
+- thread-local copies can be managed by hash-table, or can be accessed via TLS storage for speed.
+- outside of parallel contexts, the contents of all thread-local copies are accessible by iterator or using combine or combine_each methods
+ Segmented iterator When the thread-local objects are containers with input_iterators defined, a segmented iterator may be used to iterate over all the elements of all thread-local copies.
+
combine and combine_each
+Both methods are defined for enumerable_thread_specific .
+combine() requires the type T have operator=() defined.
+neither method modifies the contents of the object (though there is no guarantee that the applied methods do not modify the object.)
+Both are evaluated in serial context (the methods are assumed to be non-benign.)
+
+
The documentation for this class was generated from the following file:
-pipeline.h
+enumerable_thread_specific.h
diff --git a/doc/html/a00069.png b/doc/html/a00069.png
new file mode 100644
index 0000000000..fba36b8c91
Binary files /dev/null and b/doc/html/a00069.png differ
diff --git a/doc/html/a00070.html b/doc/html/a00070.html
index ab81fadbea..57c532d0ff 100644
--- a/doc/html/a00070.html
+++ b/doc/html/a00070.html
@@ -4,7 +4,7 @@
-
tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > Class Template Reference
+
tbb::filter Class Reference
@@ -33,133 +33,106 @@
+tbb::filter Class Reference
-
Implements a function node that supports Input -> Output.
+
A stage in a pipeline.
More...
-
#include <flow_graph.h>
+
#include <pipeline.h>
+Inheritance diagram for tbb::filter:
-
-
-
+
+
+
-
-
-typedef Input input_type
-
-
-typedef Output output_type
-
-
-typedef sender < input_type > predecessor_type
-
-
-typedef receiver < output_type > successor_type
-
-
-typedef
-internal::function_input
-< input_type, output_type,
-Allocator > fInput_type
-
-
-typedef
-internal::function_input_queue
-< input_type, Allocator > input_queue_type
-
-
-typedef
-internal::function_output
-< output_type > fOutput_type
-
-
-
-
-template<typename Body >
- function_node (graph &g, size_t concurrency, Body body)
- Constructor.
-
-
- function_node (const function_node &src)
- Copy constructor.
-
-
-void set_name (const char *name)
-
-
-void extract ()
-
-
-
- graph_node (graph &g)
-
-
-
-
-template<typename R , typename B >
-class run_and_put_task
-
-
-template<typename X , typename Y >
-class internal::broadcast_cache
-
-
-template<typename X , typename Y >
-class internal::round_robin_cache
-
-
-template<typename Input, typename Output = continue_msg, typename Policy = queueing, typename Allocator = cache_aligned_allocator<Input>>
-class tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+
+
+
+
+
+
+
+
+
+ const unsigned char tbb::filter::exact_exception_propagation
+
+
+
+
+static protected
+
+
+
+
Initial value: =
+
#if TBB_USE_CAPTURED_EXCEPTION
+
0x0
+
+
7th bit defines exception propagation mode expected by the application.
+
+
+
+
+
+
+
+
+
+
+
+ const unsigned char tbb::filter::filter_is_out_of_order = 0x1<<4
+
+
+
+
+static protected
+
+
+
+
+
4th bit distinguishes ordered vs unordered filters.
+
The bit was not set for parallel filters in TBB 2.1 and earlier, but is_ordered() function always treats parallel filters as out of order.
-
Implements a function node that supports Input -> Output.
-
The documentation for this class was generated from the following file:
+
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00070.png b/doc/html/a00070.png
index ec9684e5e2..a4923e5f6f 100644
Binary files a/doc/html/a00070.png and b/doc/html/a00070.png differ
diff --git a/doc/html/a00071.html b/doc/html/a00071.html
index 7fef722b81..509c39cd26 100644
--- a/doc/html/a00071.html
+++ b/doc/html/a00071.html
@@ -4,7 +4,7 @@
-tbb::interface9::global_control Class Reference
+tbb::interface6::filter_t< T, U > Class Template Reference
@@ -33,42 +33,62 @@
+tbb::interface6::filter_t< T, U > Class Template Reference
+
+
Class representing a chain of type-safe pipeline filters.
+ More...
+
+
#include <pipeline.h>
-
-enum parameter { max_allowed_parallelism ,
-thread_stack_size ,
-parameter_max
- }
-
-
-
- global_control (parameter p, size_t value)
-
+
+ filter_t (const filter_t < T, U > &rhs)
+
+
+template<typename Body >
+ filter_t (tbb::filter::mode mode, const Body &body)
+
+
+void operator= (const filter_t < T, U > &rhs)
+
+
+void clear ()
+
-
-
-static size_t active_value (parameter p)
-
+
+
+class internal::pipeline_proxy
+
+
+template<typename T_ , typename U_ , typename Body >
+filter_t < T_, U_ > make_filter (tbb::filter::mode, const Body &)
+ Create a filter to participate in parallel_pipeline.
+
+
+template<typename T_ , typename V_ , typename U_ >
+filter_t < T_, U_ > operator& (const filter_t < T_, V_ > &, const filter_t < V_, U_ > &)
+
-
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00072.html b/doc/html/a00072.html
index 246cb49603..eff985502d 100644
--- a/doc/html/a00072.html
+++ b/doc/html/a00072.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::graph Class Reference
+tbb::final_scan_tag Struct Reference
@@ -33,315 +33,33 @@
+tbb::final_scan_tag Struct Reference
-
The graph class.
+
Used to indicate that the final scan is being performed.
More...
-
#include <flow_graph.h>
-
-
-
-
-
-
-
+
#include <parallel_scan.h>
-
-
- graph ()
- Constructs a graph with isolated task_group_context .
-
-
- graph (task_group_context &use_this_context)
- Constructs a graph with use_this_context as context.
-
- ~graph ()
- Destroys the graph. More...
-
-
-void set_name (const char *name)
-
-void increment_wait_count ()
- Used to register that an external entity may still interact with the graph. More...
-
-void decrement_wait_count ()
- Deregisters an external entity that may have interacted with the graph. More...
-
-template<typename Receiver , typename Body >
-void run (Receiver &r, Body body)
- Spawns a task that runs a body and puts its output to a specific receiver. More...
-
-template<typename Body >
-void run (Body body)
- Spawns a task that runs a function object. More...
-
-void wait_for_all ()
- Wait until graph is idle and decrement_wait_count calls equals increment_wait_count calls. More...
-
-
-task * root_task ()
- Returns the root task of the graph.
-
-
-void set_active (bool a=true)
-
-
-bool is_active ()
-
-
-void add_task_to_reset_list (task *tp)
-
-
-iterator begin ()
- start iterator
-
-
-iterator end ()
- end iterator
-
-
-const_iterator begin () const
- start const iterator
-
-
-const_iterator end () const
- end const iterator
-
-
-const_iterator cbegin () const
- start const iterator
-
-
-const_iterator cend () const
- end const iterator
-
-
-bool is_cancelled ()
- return status of graph execution
-
-
-bool exception_thrown ()
-
-
-void reset (reset_flags f=rf_reset_protocol)
-
-
-
-
-class graph_node
-
-
-template<typename C , typename N >
-class graph_iterator
-
+
+
+static bool is_final_scan ()
+
-
The graph class.
-
This class serves as a handle to the graph
-
-
-
-
-
-
-
-
-
- tbb::flow::interface8::graph::~graph
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
Destroys the graph.
-
Calls wait_for_all, then destroys the root task and context.
-
-
-
-
-
-
-
-
-
-
-
-
- void tbb::flow::interface8::graph::decrement_wait_count
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
Deregisters an external entity that may have interacted with the graph.
-
The graph will not return from wait_for_all until all the number of decrement_wait_count calls matches the number of increment_wait_count calls.
-
-
-
-
-
-
-
-
-
-
-
- void tbb::flow::interface8::graph::increment_wait_count
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
Used to register that an external entity may still interact with the graph.
-
The graph will not return from wait_for_all until a matching number of decrement_wait_count calls is made.
-
-
-
-
-
-
-
-template<typename Receiver , typename Body >
-
-
-
-
-
- void tbb::flow::interface8::graph::run
- (
- Receiver &
- r ,
-
-
-
-
- Body
- body
-
-
-
- )
-
-
-
-
-
-inline
-
-
-
-
-
Spawns a task that runs a body and puts its output to a specific receiver.
-
The task is spawned as a child of the graph. This is useful for running tasks that need to block a wait_for_all() on the graph. For example a one-off source.
-
-
-
-
-
-
-
-template<typename Body >
-
-
-
-
-
- void tbb::flow::interface8::graph::run
- (
- Body
- body )
-
-
-
-
-
-inline
-
-
-
-
-
Spawns a task that runs a function object.
-
The task is spawned as a child of the graph. This is useful for running tasks that need to block a wait_for_all() on the graph. For example a one-off source.
-
-
-
-
-
-
-
-
-
-
-
- void tbb::flow::interface8::graph::wait_for_all
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
Wait until graph is idle and decrement_wait_count calls equals increment_wait_count calls.
-
The waiting thread will go off and steal work while it is block in the wait_for_all.
-
-
-
-
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00072.png b/doc/html/a00072.png
deleted file mode 100644
index 9b061dff8c..0000000000
Binary files a/doc/html/a00072.png and /dev/null differ
diff --git a/doc/html/a00073.html b/doc/html/a00073.html
index b3838f60c6..4fdc284b5e 100644
--- a/doc/html/a00073.html
+++ b/doc/html/a00073.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > Class Template Reference
+tbb::interface6::fixed_pool Class Reference
@@ -33,91 +33,39 @@
+tbb::interface6::fixed_pool Class Reference
+
+
+
+
+
+
+
-
-
-typedef size_t size_type
-
-
-typedef GraphNodeType value_type
-
-
-typedef GraphNodeType * pointer
-
-
-typedef GraphNodeType & reference
-
-
-typedef const GraphNodeType & const_reference
-
-
-typedef std::forward_iterator_tag iterator_category
-
-
-
-
-class graph
-
-
-class graph_node
-
+
+ fixed_pool (void *buf, size_t size)
+ construct pool with underlying allocator
+
+
+ ~fixed_pool ()
+ destroy pool
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00067.png b/doc/html/a00073.png
similarity index 100%
rename from doc/html/a00067.png
rename to doc/html/a00073.png
diff --git a/doc/html/a00074.html b/doc/html/a00074.html
index 7543772123..6dd164f063 100644
--- a/doc/html/a00074.html
+++ b/doc/html/a00074.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::graph_node Class Reference
+tbb::interface6::flattened2d< Container > Class Template Reference
@@ -33,91 +33,85 @@
+tbb::interface6::flattened2d< Container > Class Template Reference
-
-
The base of all graph nodes.
- More...
-
-
#include <flow_graph.h>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+typedef conval_type::size_type size_type
+ Basic types.
+
+
+typedef
+conval_type::difference_type difference_type
+
+
+typedef conval_type::allocator_type allocator_type
+
+
+typedef conval_type::value_type value_type
+
+
+typedef conval_type::reference reference
+
+
+typedef
+conval_type::const_reference const_reference
+
+
+typedef conval_type::pointer pointer
+
+
+typedef conval_type::const_pointer const_pointer
+
+
+typedef
+internal::segmented_iterator
+< Container, value_type > iterator
+
+
+typedef
+internal::segmented_iterator
+< Container, const value_type > const_iterator
+
+
-
- graph_node (graph &g)
-
-
-virtual void set_name (const char *name)=0
-
-
-virtual void extract ()=0
-
-
-
-
-virtual void reset_node (reset_flags f=rf_reset_protocol)=0
-
-
-
-
-class graph
-
-
-template<typename C , typename N >
-class graph_iterator
-
+
+ flattened2d (const Container &c, typename Container::const_iterator b, typename Container::const_iterator e)
+
+
+ flattened2d (const Container &c)
+
+
+iterator begin ()
+
+
+iterator end ()
+
+
+const_iterator begin () const
+
+
+const_iterator end () const
+
+
+size_type size () const
+
-
-
The base of all graph nodes.
-
The documentation for this class was generated from the following file:
-flow_graph.h
+ The documentation for this class was generated from the following file:
+enumerable_thread_specific.h
diff --git a/doc/html/a00074.png b/doc/html/a00074.png
deleted file mode 100644
index 0b52871b6a..0000000000
Binary files a/doc/html/a00074.png and /dev/null differ
diff --git a/doc/html/a00075.html b/doc/html/a00075.html
index d4433673a4..229cd82d69 100644
--- a/doc/html/a00075.html
+++ b/doc/html/a00075.html
@@ -4,7 +4,7 @@
-tbb::internal::tbb_thread_v3::id Class Reference
+tbb::interface6::flow_control Class Reference
@@ -33,59 +33,41 @@
+tbb::interface6::flow_control Class Reference
+
+
input_filter control to signal end-of-input for parallel_pipeline
+ More...
+
+
#include <pipeline.h>
-
-class tbb_thread_v3
-
-
-bool operator== (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
-
-
-bool operator!= (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
-
-
-bool operator< (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
-
-
-bool operator<= (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
-
-
-bool operator> (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
-
-
-bool operator>= (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
-
-
-template<class charT , class traits >
-std::basic_ostream< charT,
-traits > & operator<< (std::basic_ostream< charT, traits > &out, tbb_thread_v3::id id )
-
-
-tbb_thread_v3::id
-__TBB_EXPORTED_FUNC thread_get_id_v3 ()
-
-
-size_t tbb_hasher (const tbb_thread_v3::id &id )
-
-
-id atomic_compare_and_swap (id &location, const id &value, const id &comparand)
-
+
+template<typename T , typename U , typename Body >
+class internal::concrete_filter
+
-
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00076.html b/doc/html/a00076.html
index 4494c54303..41a8790722 100644
--- a/doc/html/a00076.html
+++ b/doc/html/a00076.html
@@ -4,7 +4,7 @@
-tbb::improper_lock Class Reference
+tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > Class Template Reference
@@ -33,41 +33,133 @@
+tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > Class Template Reference
-
Exception for PPL locks.
+
Implements a function node that supports Input -> Output.
More...
-
#include <tbb_exception.h>
+
#include <flow_graph.h>
+Inheritance diagram for tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >:
-
-
+
+
+
+
+
+typedef Input input_type
+
+
+typedef Output output_type
+
+
+typedef sender < input_type > predecessor_type
+
+
+typedef receiver < output_type > successor_type
+
+
+typedef
+internal::function_input
+< input_type, output_type,
+Allocator > fInput_type
+
+
+typedef
+internal::function_input_queue
+< input_type, Allocator > input_queue_type
+
+
+typedef
+internal::function_output
+< output_type > fOutput_type
+
+
-
-const char * what () const throw ()
-
+
+template<typename Body >
+ function_node (graph &g, size_t concurrency, Body body)
+ Constructor.
+
+
+ function_node (const function_node &src)
+ Copy constructor.
+
+
+void set_name (const char *name)
+
+
+void extract ()
+
+
+
+ graph_node (graph &g)
+
+
+
+
+template<typename R , typename B >
+class run_and_put_task
+
+
+template<typename X , typename Y >
+class internal::broadcast_cache
+
+
+template<typename X , typename Y >
+class internal::round_robin_cache
+
+
-Exception for PPL locks.
+
template<typename Input, typename Output = continue_msg, typename Policy = queueing, typename Allocator = cache_aligned_allocator<Input>>
+class tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+
+
Implements a function node that supports Input -> Output.
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00076.png b/doc/html/a00076.png
index 7f4f5571e6..ec9684e5e2 100644
Binary files a/doc/html/a00076.png and b/doc/html/a00076.png differ
diff --git a/doc/html/a00077.html b/doc/html/a00077.html
index 0c7a3d5d78..f099a2237e 100644
--- a/doc/html/a00077.html
+++ b/doc/html/a00077.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > Class Template Reference
+tbb::interface9::global_control Class Reference
@@ -33,58 +33,42 @@
+tbb::interface9::global_control Class Reference
-
-
-
-
-
-
-
-
-typedef tuple< T0, T1, T2, T3,
-T4, T5, T6, T7, T8, T9 > InputTuple
-
-
-typedef internal::tagged_msg
-< size_t, T0, T1, T2, T3, T4,
-T5, T6, T7, T8, T9 > output_type
-
-
-typedef
-internal::unfolded_indexer_node
-< InputTuple > unfolded_type
-
+enum parameter { max_allowed_parallelism ,
+thread_stack_size ,
+parameter_max
+ }
+
-
- indexer_node (graph &g)
-
-
- indexer_node (const indexer_node &other)
-
-
-void set_name (const char *name)
-
+
+ global_control (parameter p, size_t value)
+
+
+
+
+static size_t active_value (parameter p)
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00077.png b/doc/html/a00077.png
deleted file mode 100644
index a2a0edf6e8..0000000000
Binary files a/doc/html/a00077.png and /dev/null differ
diff --git a/doc/html/a00078.html b/doc/html/a00078.html
index 1f72a4a7a2..aea909df6a 100644
--- a/doc/html/a00078.html
+++ b/doc/html/a00078.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::indexer_node< T0 > Class Template Reference
+tbb::flow::interface8::graph Class Reference
@@ -33,56 +33,320 @@
+tbb::flow::interface8::graph Class Reference
+
+
The graph class.
+ More...
+
+
#include <flow_graph.h>
+Inheritance diagram for tbb::flow::interface8::graph:
-
-
+
+
+
-
-typedef tuple< T0 > InputTuple
-
-
-typedef internal::tagged_msg
-< size_t, T0 > output_type
-
-
-typedef
-internal::unfolded_indexer_node
-< InputTuple > unfolded_type
-
+
+typedef graph_iterator < graph ,
+graph_node > iterator
+
+
+typedef graph_iterator < const
+graph , const graph_node > const_iterator
+
-
- indexer_node (graph &g)
-
-
- indexer_node (const indexer_node &other)
-
-
+
+ graph ()
+ Constructs a graph with isolated task_group_context .
+
+
+ graph (task_group_context &use_this_context)
+ Constructs a graph with use_this_context as context.
+
+ ~graph ()
+ Destroys the graph. More...
+
+
void set_name (const char *name)
-
+
+void increment_wait_count ()
+ Used to register that an external entity may still interact with the graph. More...
+
+void decrement_wait_count ()
+ Deregisters an external entity that may have interacted with the graph. More...
+
+template<typename Receiver , typename Body >
+void run (Receiver &r, Body body)
+ Spawns a task that runs a body and puts its output to a specific receiver. More...
+
+template<typename Body >
+void run (Body body)
+ Spawns a task that runs a function object. More...
+
+void wait_for_all ()
+ Wait until graph is idle and decrement_wait_count calls equals increment_wait_count calls. More...
+
+
+task * root_task ()
+ Returns the root task of the graph.
+
+
+void set_active (bool a=true)
+
+
+bool is_active ()
+
+
+void add_task_to_reset_list (task *tp)
+
+
+iterator begin ()
+ start iterator
+
+
+iterator end ()
+ end iterator
+
+
+const_iterator begin () const
+ start const iterator
+
+
+const_iterator end () const
+ end const iterator
+
+
+const_iterator cbegin () const
+ start const iterator
+
+
+const_iterator cend () const
+ end const iterator
+
+
+bool is_cancelled ()
+ return status of graph execution
+
+
+bool exception_thrown ()
+
+
+void reset (reset_flags f=rf_reset_protocol)
+
+
+
+
+class graph_node
+
+
+template<typename C , typename N >
+class graph_iterator
+
+
+template<typename Input , typename Output , typename Policy , typename Allocator >
+class async_node
+
+
+
+The graph class.
+
This class serves as a handle to the graph
+
+
+
+
+
+
+
+
+
+ tbb::flow::interface8::graph::~graph
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Destroys the graph.
+
Calls wait_for_all, then destroys the root task and context.
+
+
+
+
+
+
+
+
+
+
+
+
+ void tbb::flow::interface8::graph::decrement_wait_count
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
Deregisters an external entity that may have interacted with the graph.
+
The graph will not return from wait_for_all until all the number of decrement_wait_count calls matches the number of increment_wait_count calls.
+
+
+
+
+
+
+
+
+
+
+
+ void tbb::flow::interface8::graph::increment_wait_count
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Used to register that an external entity may still interact with the graph.
+
The graph will not return from wait_for_all until a matching number of decrement_wait_count calls is made.
+
+
+
+
+
+
+
+template<typename Receiver , typename Body >
+
+
+
+
+
+ void tbb::flow::interface8::graph::run
+ (
+ Receiver &
+ r ,
+
+
+
+
+ Body
+ body
+
+
+
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Spawns a task that runs a body and puts its output to a specific receiver.
+
The task is spawned as a child of the graph. This is useful for running tasks that need to block a wait_for_all() on the graph. For example a one-off source.
+
+
+
+
+
+
+
+template<typename Body >
+
+
+
+
+
+ void tbb::flow::interface8::graph::run
+ (
+ Body
+ body )
+
+
+
+
+
+inline
+
+
+
+
+
Spawns a task that runs a function object.
+
The task is spawned as a child of the graph. This is useful for running tasks that need to block a wait_for_all() on the graph. For example a one-off source.
+
+
+
+
+
+
+
+
+
+
+
+ void tbb::flow::interface8::graph::wait_for_all
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Wait until graph is idle and decrement_wait_count calls equals increment_wait_count calls.
+
The waiting thread will go off and steal work while it is block in the wait_for_all.
+
+
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00078.png b/doc/html/a00078.png
index fe6adbe591..7dadfee1b1 100644
Binary files a/doc/html/a00078.png and b/doc/html/a00078.png differ
diff --git a/doc/html/a00079.html b/doc/html/a00079.html
index 84e2ccb770..f835f746e9 100644
--- a/doc/html/a00079.html
+++ b/doc/html/a00079.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::indexer_node< T0, T1 > Class Template Reference
+tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > Class Template Reference
@@ -33,56 +33,91 @@
+tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > Class Template Reference
-
-
-
-
-
-
-
-
-typedef tuple< T0, T1 > InputTuple
-
-
-typedef internal::tagged_msg
-< size_t, T0, T1 > output_type
-
-
-typedef
-internal::unfolded_indexer_node
-< InputTuple > unfolded_type
-
+
+typedef size_t size_type
+
+
+typedef GraphNodeType value_type
+
+
+typedef GraphNodeType * pointer
+
+
+typedef GraphNodeType & reference
+
+
+typedef const GraphNodeType & const_reference
+
+
+typedef std::forward_iterator_tag iterator_category
+
+
+
+class graph
+
+
+class graph_node
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00079.png b/doc/html/a00079.png
deleted file mode 100644
index 1e6fd1b951..0000000000
Binary files a/doc/html/a00079.png and /dev/null differ
diff --git a/doc/html/a00080.html b/doc/html/a00080.html
index 90c17e4276..4fd53a4037 100644
--- a/doc/html/a00080.html
+++ b/doc/html/a00080.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::indexer_node< T0, T1, T2 > Class Template Reference
+tbb::flow::interface8::graph_node Class Reference
@@ -33,56 +33,93 @@
+tbb::flow::interface8::graph_node Class Referenceabstract
+
+
The base of all graph nodes.
+ More...
+
+
#include <flow_graph.h>
+Inheritance diagram for tbb::flow::interface8::graph_node:
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
-
-typedef tuple< T0, T1, T2 > InputTuple
-
-
-typedef internal::tagged_msg
-< size_t, T0, T1, T2 > output_type
-
-
-typedef
-internal::unfolded_indexer_node
-< InputTuple > unfolded_type
-
-
-
- indexer_node (graph &g)
-
-
- indexer_node (const indexer_node &other)
-
-
-void set_name (const char *name)
-
+
+ graph_node (graph &g)
+
+
+virtual void set_name (const char *name)=0
+
+
+virtual void extract ()=0
+
+
+
+
+virtual void reset_node (reset_flags f=rf_reset_protocol)=0
+
+
+
+
+class graph
+
+
+template<typename C , typename N >
+class graph_iterator
+
- The documentation for this class was generated from the following file:
-flow_graph.h
+
+The base of all graph nodes.
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00080.png b/doc/html/a00080.png
index 7bee186442..5b37142313 100644
Binary files a/doc/html/a00080.png and b/doc/html/a00080.png differ
diff --git a/doc/html/a00081.html b/doc/html/a00081.html
index 49de8b7426..81d303a3d3 100644
--- a/doc/html/a00081.html
+++ b/doc/html/a00081.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > Class Template Reference
+tbb::internal::tbb_thread_v3::id Class Reference
@@ -33,56 +33,59 @@
+tbb::internal::tbb_thread_v3::id Class Reference
-
-
-
-
-
-
-
-
-
-typedef tuple< T0, T1, T2, T3 > InputTuple
-
-
-typedef internal::tagged_msg
-< size_t, T0, T1, T2, T3 > output_type
-
-
-typedef
-internal::unfolded_indexer_node
-< InputTuple > unfolded_type
-
-
-
-
- indexer_node (graph &g)
-
-
- indexer_node (const indexer_node &other)
-
-
-void set_name (const char *name)
-
+
+
+class tbb_thread_v3
+
+
+bool operator== (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
+
+
+bool operator!= (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
+
+
+bool operator< (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
+
+
+bool operator<= (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
+
+
+bool operator> (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
+
+
+bool operator>= (tbb_thread_v3::id x, tbb_thread_v3::id y) __TBB_NOEXCEPT(true)
+
+
+template<class charT , class traits >
+std::basic_ostream< charT,
+traits > & operator<< (std::basic_ostream< charT, traits > &out, tbb_thread_v3::id id )
+
+
+tbb_thread_v3::id
+__TBB_EXPORTED_FUNC thread_get_id_v3 ()
+
+
+size_t tbb_hasher (const tbb_thread_v3::id &id )
+
+
+id atomic_compare_and_swap (id &location, const id &value, const id &comparand)
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00082.html b/doc/html/a00082.html
index 35a51c9d7b..44162f79e9 100644
--- a/doc/html/a00082.html
+++ b/doc/html/a00082.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > Class Template Reference
+tbb::improper_lock Class Reference
@@ -33,56 +33,41 @@
+tbb::improper_lock Class Reference
+
+
Exception for PPL locks.
+ More...
+
+
#include <tbb_exception.h>
+Inheritance diagram for tbb::improper_lock:
-
-
+
+
-
-
-typedef tuple< T0, T1, T2, T3, T4 > InputTuple
-
-
-typedef internal::tagged_msg
-< size_t, T0, T1, T2, T3, T4 > output_type
-
-
-typedef
-internal::unfolded_indexer_node
-< InputTuple > unfolded_type
-
-
-
- indexer_node (graph &g)
-
-
- indexer_node (const indexer_node &other)
-
-
-void set_name (const char *name)
-
+
+const char * what () const throw ()
+
- The documentation for this class was generated from the following file:
-flow_graph.h
+
+Exception for PPL locks.
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00082.png b/doc/html/a00082.png
index e8c28bfb87..7f4f5571e6 100644
Binary files a/doc/html/a00082.png and b/doc/html/a00082.png differ
diff --git a/doc/html/a00083.html b/doc/html/a00083.html
index f08f9202da..104443dba5 100644
--- a/doc/html/a00083.html
+++ b/doc/html/a00083.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > Class Template Reference
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > Class Template Reference
@@ -33,58 +33,58 @@
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > Class Template Reference
+Inheritance diagram for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >:
-
-
+
+
-
+
typedef tuple< T0, T1, T2, T3,
-T4, T5 > InputTuple
-
-
+T4, T5, T6, T7, T8, T9 > InputTuple
+
+
typedef internal::tagged_msg
< size_t, T0, T1, T2, T3, T4,
-T5 > output_type
-
-
+T5, T6, T7, T8, T9 > output_type
+
+
typedef
internal::unfolded_indexer_node
< InputTuple > unfolded_type
-
+
-
- indexer_node (graph &g)
-
-
- indexer_node (const indexer_node &other)
-
-
+
+ indexer_node (graph &g)
+
+
+ indexer_node (const indexer_node &other)
+
+
void set_name (const char *name)
-
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00083.png b/doc/html/a00083.png
index e3d1565f5b..a2a0edf6e8 100644
Binary files a/doc/html/a00083.png and b/doc/html/a00083.png differ
diff --git a/doc/html/a00084.html b/doc/html/a00084.html
index d9c185efee..e1f7b85047 100644
--- a/doc/html/a00084.html
+++ b/doc/html/a00084.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > Class Template Reference
+tbb::flow::interface8::indexer_node< T0 > Class Template Reference
@@ -33,58 +33,56 @@
+tbb::flow::interface8::indexer_node< T0 > Class Template Reference
+Inheritance diagram for tbb::flow::interface8::indexer_node< T0 >:
-
-
+
+
-
-typedef tuple< T0, T1, T2, T3,
-T4, T5, T6 > InputTuple
-
-
+
+typedef tuple< T0 > InputTuple
+
+
typedef internal::tagged_msg
-< size_t, T0, T1, T2, T3, T4,
-T5, T6 > output_type
-
-
+< size_t, T0 > output_type
+
+
typedef
internal::unfolded_indexer_node
< InputTuple > unfolded_type
-
+
-
- indexer_node (graph &g)
-
-
- indexer_node (const indexer_node &other)
-
-
+
+ indexer_node (graph &g)
+
+
+ indexer_node (const indexer_node &other)
+
+
void set_name (const char *name)
-
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00084.png b/doc/html/a00084.png
index a26e6ba874..fe6adbe591 100644
Binary files a/doc/html/a00084.png and b/doc/html/a00084.png differ
diff --git a/doc/html/a00085.html b/doc/html/a00085.html
index 11486c8af9..2129ac54c7 100644
--- a/doc/html/a00085.html
+++ b/doc/html/a00085.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > Class Template Reference
+tbb::flow::interface8::indexer_node< T0, T1 > Class Template Reference
@@ -33,58 +33,56 @@
+tbb::flow::interface8::indexer_node< T0, T1 > Class Template Reference
+Inheritance diagram for tbb::flow::interface8::indexer_node< T0, T1 >:
-
-
+
+
-
-typedef tuple< T0, T1, T2, T3,
-T4, T5, T6, T7 > InputTuple
-
-
+
+typedef tuple< T0, T1 > InputTuple
+
+
typedef internal::tagged_msg
-< size_t, T0, T1, T2, T3, T4,
-T5, T6, T7 > output_type
-
-
+< size_t, T0, T1 > output_type
+
+
typedef
internal::unfolded_indexer_node
< InputTuple > unfolded_type
-
+
-
- indexer_node (graph &g)
-
-
- indexer_node (const indexer_node &other)
-
-
+
+ indexer_node (graph &g)
+
+
+ indexer_node (const indexer_node &other)
+
+
void set_name (const char *name)
-
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00085.png b/doc/html/a00085.png
index ad53103e7b..1e6fd1b951 100644
Binary files a/doc/html/a00085.png and b/doc/html/a00085.png differ
diff --git a/doc/html/a00086.html b/doc/html/a00086.html
index 839738e367..40880fbad0 100644
--- a/doc/html/a00086.html
+++ b/doc/html/a00086.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > Class Template Reference
+tbb::flow::interface8::indexer_node< T0, T1, T2 > Class Template Reference
@@ -33,58 +33,56 @@
+tbb::flow::interface8::indexer_node< T0, T1, T2 > Class Template Reference
+Inheritance diagram for tbb::flow::interface8::indexer_node< T0, T1, T2 >:
-
-
+
+
-
-typedef tuple< T0, T1, T2, T3,
-T4, T5, T6, T7, T8 > InputTuple
-
-
+
+typedef tuple< T0, T1, T2 > InputTuple
+
+
typedef internal::tagged_msg
-< size_t, T0, T1, T2, T3, T4,
-T5, T6, T7, T8 > output_type
-
-
+< size_t, T0, T1, T2 > output_type
+
+
typedef
internal::unfolded_indexer_node
< InputTuple > unfolded_type
-
+
-
- indexer_node (graph &g)
-
-
- indexer_node (const indexer_node &other)
-
-
+
+ indexer_node (graph &g)
+
+
+ indexer_node (const indexer_node &other)
+
+
void set_name (const char *name)
-
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00086.png b/doc/html/a00086.png
index 6c3aba1e44..7bee186442 100644
Binary files a/doc/html/a00086.png and b/doc/html/a00086.png differ
diff --git a/doc/html/a00087.html b/doc/html/a00087.html
index 99759a4b4c..cda0f8af6a 100644
--- a/doc/html/a00087.html
+++ b/doc/html/a00087.html
@@ -4,7 +4,7 @@
-tbb::tick_count::interval_t Class Reference
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > Class Template Reference
@@ -33,69 +33,56 @@
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > Class Template Reference
-
-
Relative time interval.
- More...
-
-
#include <tick_count.h>
+
+
+
+
+
+
+
+
+
+typedef tuple< T0, T1, T2, T3 > InputTuple
+
+
+typedef internal::tagged_msg
+< size_t, T0, T1, T2, T3 > output_type
+
+
+typedef
+internal::unfolded_indexer_node
+< InputTuple > unfolded_type
+
+
-
-
Relative time interval.
-
The documentation for this class was generated from the following file:
-tick_count.h
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00081.png b/doc/html/a00087.png
similarity index 100%
rename from doc/html/a00081.png
rename to doc/html/a00087.png
diff --git a/doc/html/a00088.html b/doc/html/a00088.html
index a47b8b4c34..8ad0a3b966 100644
--- a/doc/html/a00088.html
+++ b/doc/html/a00088.html
@@ -4,7 +4,7 @@
-tbb::invalid_multiple_scheduling Class Reference
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > Class Template Reference
@@ -33,41 +33,56 @@
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > Class Template Reference
-
-
Exception for repeated scheduling of the same task_handle .
- More...
-
-
#include <tbb_exception.h>
+Inheritance diagram for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >:
-
-
+
+
+
+
+typedef tuple< T0, T1, T2, T3, T4 > InputTuple
+
+
+typedef internal::tagged_msg
+< size_t, T0, T1, T2, T3, T4 > output_type
+
+
+typedef
+internal::unfolded_indexer_node
+< InputTuple > unfolded_type
+
+
-
-const char * what () const throw ()
-
+
+ indexer_node (graph &g)
+
+
+ indexer_node (const indexer_node &other)
+
+
+void set_name (const char *name)
+
-
-Exception for repeated scheduling of the same task_handle .
-
The documentation for this class was generated from the following file:
-tbb_exception.h
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00088.png b/doc/html/a00088.png
index ba8483c1cf..e8c28bfb87 100644
Binary files a/doc/html/a00088.png and b/doc/html/a00088.png differ
diff --git a/doc/html/a00089.html b/doc/html/a00089.html
index b2a99501cf..71edc04558 100644
--- a/doc/html/a00089.html
+++ b/doc/html/a00089.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::join_node< OutputTuple, JP > Class Template Reference
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > Class Template Reference
@@ -33,16 +33,58 @@
+
+
+
+
+
+
+
+
+
+
+typedef tuple< T0, T1, T2, T3,
+T4, T5 > InputTuple
+
+
+typedef internal::tagged_msg
+< size_t, T0, T1, T2, T3, T4,
+T5 > output_type
+
+
+typedef
+internal::unfolded_indexer_node
+< InputTuple > unfolded_type
+
+
+
+
+ indexer_node (graph &g)
+
+
+ indexer_node (const indexer_node &other)
+
+
+void set_name (const char *name)
+
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00089.png b/doc/html/a00089.png
new file mode 100644
index 0000000000..e3d1565f5b
Binary files /dev/null and b/doc/html/a00089.png differ
diff --git a/doc/html/a00090.html b/doc/html/a00090.html
index be984c8d32..90146895ad 100644
--- a/doc/html/a00090.html
+++ b/doc/html/a00090.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > Class Template Reference
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > Class Template Reference
@@ -33,84 +33,58 @@
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > Class Template Reference
+Inheritance diagram for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >:
-
-
+
+
-
-typedef OutputTuple output_type
-
-
+
+typedef tuple< T0, T1, T2, T3,
+T4, T5, T6 > InputTuple
+
+
+typedef internal::tagged_msg
+< size_t, T0, T1, T2, T3, T4,
+T5, T6 > output_type
+
+
typedef
-unfolded_type::input_ports_type input_ports_type
-
+internal::unfolded_indexer_node
+< InputTuple > unfolded_type
+
-
-template<typename __TBB_B0 , typename __TBB_B1 >
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1)
-
-
-template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 >
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2)
-
-
-template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 >
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3)
-
-
-template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 >
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4)
-
-
-template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 , typename __TBB_B5 >
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5)
-
-
-template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 , typename __TBB_B5 , typename __TBB_B6 >
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6)
-
-
-template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 , typename __TBB_B5 , typename __TBB_B6 , typename __TBB_B7 >
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7)
-
-
-template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 , typename __TBB_B5 , typename __TBB_B6 , typename __TBB_B7 , typename __TBB_B8 >
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7, __TBB_B8 b8)
-
-
-template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 , typename __TBB_B5 , typename __TBB_B6 , typename __TBB_B7 , typename __TBB_B8 , typename __TBB_B9 >
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7, __TBB_B8 b8, __TBB_B9 b9)
-
-
- join_node (const join_node &other)
-
-
+
+ indexer_node (graph &g)
+
+
+ indexer_node (const indexer_node &other)
+
+
void set_name (const char *name)
-
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00090.png b/doc/html/a00090.png
index 04fbb34308..a26e6ba874 100644
Binary files a/doc/html/a00090.png and b/doc/html/a00090.png differ
diff --git a/doc/html/a00091.html b/doc/html/a00091.html
index 2cd2ed353b..fdce244fea 100644
--- a/doc/html/a00091.html
+++ b/doc/html/a00091.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::join_node< OutputTuple, queueing > Class Template Reference
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > Class Template Reference
@@ -33,51 +33,58 @@
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > Class Template Reference
+Inheritance diagram for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >:
-
-
+
+
-
-typedef OutputTuple output_type
-
-
+
+typedef tuple< T0, T1, T2, T3,
+T4, T5, T6, T7 > InputTuple
+
+
+typedef internal::tagged_msg
+< size_t, T0, T1, T2, T3, T4,
+T5, T6, T7 > output_type
+
+
typedef
-unfolded_type::input_ports_type input_ports_type
-
+internal::unfolded_indexer_node
+< InputTuple > unfolded_type
+
-
- join_node (graph &g)
-
-
- join_node (const join_node &other)
-
-
+
+ indexer_node (graph &g)
+
+
+ indexer_node (const indexer_node &other)
+
+
void set_name (const char *name)
-
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00091.png b/doc/html/a00091.png
index 890b2d6bb8..ad53103e7b 100644
Binary files a/doc/html/a00091.png and b/doc/html/a00091.png differ
diff --git a/doc/html/a00092.html b/doc/html/a00092.html
index 74ede4c0bd..baac509246 100644
--- a/doc/html/a00092.html
+++ b/doc/html/a00092.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::join_node< OutputTuple, reserving > Class Template Reference
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > Class Template Reference
@@ -33,51 +33,58 @@
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > Class Template Reference
+Inheritance diagram for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >:
-
-
+
+
-
-typedef OutputTuple output_type
-
-
+
+typedef tuple< T0, T1, T2, T3,
+T4, T5, T6, T7, T8 > InputTuple
+
+
+typedef internal::tagged_msg
+< size_t, T0, T1, T2, T3, T4,
+T5, T6, T7, T8 > output_type
+
+
typedef
-unfolded_type::input_ports_type input_ports_type
-
+internal::unfolded_indexer_node
+< InputTuple > unfolded_type
+
-
- join_node (graph &g)
-
-
- join_node (const join_node &other)
-
-
+
+ indexer_node (graph &g)
+
+
+ indexer_node (const indexer_node &other)
+
+
void set_name (const char *name)
-
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00092.png b/doc/html/a00092.png
index 0157a3afb3..6c3aba1e44 100644
Binary files a/doc/html/a00092.png and b/doc/html/a00092.png differ
diff --git a/doc/html/a00093.html b/doc/html/a00093.html
index 61a7a88498..b5e578f528 100644
--- a/doc/html/a00093.html
+++ b/doc/html/a00093.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::limiter_node< T > Class Template Reference
+tbb::tick_count::interval_t Class Reference
@@ -33,300 +33,69 @@
+tbb::tick_count::interval_t Class Reference
-
Forwards messages only if the threshold has not been reached.
+
Relative time interval.
More...
-
#include <flow_graph.h>
-
-
-
-
-
-
-
-
-
-
+
#include <tick_count.h>
-
-
-task * try_put_task (const T &t)
- Puts an item to this receiver.
-
-
-void reset_receiver (reset_flags)
-
-
-void reset_node (reset_flags f)
-
-
-
-virtual bool is_continue_receiver ()
-
+
+ interval_t ()
+ Construct a time interval representing zero time duration.
+
+
+ interval_t (double sec)
+ Construct a time interval representing sec seconds time duration.
+
+
+double seconds () const
+ Return the length of a time interval in seconds.
+
+
+interval_t & operator+= (const interval_t &i)
+ Accumulation operator.
+
+
+interval_t & operator-= (const interval_t &i)
+ Subtraction operator.
+
-
-class internal::forward_task_bypass< limiter_node< T > >
-
-
-class internal::decrementer< limiter_node< T > >
-
-
-template<typename R , typename B >
-class run_and_put_task
-
-
-template<typename X , typename Y >
-class internal::broadcast_cache
-
-
-template<typename X , typename Y >
-class internal::round_robin_cache
-
-
-
template<typename T>
-class tbb::flow::interface8::limiter_node< T >
-
-
Forwards messages only if the threshold has not been reached.
-
This node forwards items until its threshold is reached. It contains no buffering. If the downstream node rejects, the message is dropped.
-
-
-
-
-
-template<typename T >
-
-
-
-
-
-
-inline virtual
-
-
-
-
-
The documentation for this class was generated from the following file:
-flow_graph.h
+Relative time interval.
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00093.png b/doc/html/a00093.png
deleted file mode 100644
index 0a2205abf8..0000000000
Binary files a/doc/html/a00093.png and /dev/null differ
diff --git a/doc/html/a00094.html b/doc/html/a00094.html
index 11f8092ad7..bbdcf74fa9 100644
--- a/doc/html/a00094.html
+++ b/doc/html/a00094.html
@@ -4,7 +4,7 @@
-tbb::interface6::memory_pool< Alloc > Class Template Reference
+tbb::invalid_multiple_scheduling Class Reference
@@ -33,49 +33,41 @@
+tbb::invalid_multiple_scheduling Class Reference
-
Thread-safe growable pool allocator for variable-size requests.
+
Exception for repeated scheduling of the same task_handle .
More...
-
#include <memory_pool.h>
+
#include <tbb_exception.h>
+Inheritance diagram for tbb::invalid_multiple_scheduling:
-
-
+
+
-
- memory_pool (const Alloc &src=Alloc())
- construct pool with underlying allocator
-
-
- ~memory_pool ()
- destroy pool
-
+
+const char * what () const throw ()
+
-template<typename Alloc>
-class tbb::interface6::memory_pool< Alloc >
-
-
Thread-safe growable pool allocator for variable-size requests.
+
Exception for repeated scheduling of the same task_handle .
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00094.png b/doc/html/a00094.png
index 040c525da8..ba8483c1cf 100644
Binary files a/doc/html/a00094.png and b/doc/html/a00094.png differ
diff --git a/doc/html/a00095.html b/doc/html/a00095.html
index f52b9e34bb..ee95c61343 100644
--- a/doc/html/a00095.html
+++ b/doc/html/a00095.html
@@ -4,7 +4,7 @@
-tbb::interface6::memory_pool_allocator< T, P > Class Template Reference
+tbb::flow::interface8::join_node< OutputTuple, JP > Class Template Reference
@@ -33,139 +33,16 @@
-
-
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
- More...
-
-
#include <memory_pool.h>
-
-
-
-typedef
-tbb::internal::allocator_type
-< T >::value_type value_type
-
-
-typedef value_type * pointer
-
-
-typedef const value_type * const_pointer
-
-
-typedef value_type & reference
-
-
-typedef const value_type & const_reference
-
-
-typedef size_t size_type
-
-
-typedef ptrdiff_t difference_type
-
-
-
-
- memory_pool_allocator (pool_type &pool) throw ()
-
-
- memory_pool_allocator (const memory_pool_allocator &src) throw ()
-
-
-template<typename U >
- memory_pool_allocator (const memory_pool_allocator < U, P > &src) throw ()
-
-
-pointer address (reference x) const
-
-
-const_pointer address (const_reference x) const
-
-
-pointer allocate (size_type n, const void *=0)
- Allocate space for n objects.
-
-
-void deallocate (pointer p, size_type)
- Free previously allocated block of memory.
-
-
-size_type max_size () const throw ()
- Largest value for which method allocate might succeed.
-
-
-template<typename U , typename... Args>
-void construct (U *p, Args &&...args)
- Copy-construct value at location pointed to by p.
-
-
-void construct (pointer p, value_type &&value)
-
-
-void construct (pointer p, const value_type &value)
-
-
-void destroy (pointer p)
- Destroy value at location pointed to by p.
-
-
-
-
-typedef P pool_type
-
-
-
-
-pool_type * my_pool
-
-
-
-
-template<typename U , typename R >
-class memory_pool_allocator
-
-
-template<typename V , typename U , typename R >
-bool operator== (const memory_pool_allocator < V, R > &a, const memory_pool_allocator < U, R > &b)
-
-
-template<typename V , typename U , typename R >
-bool operator!= (const memory_pool_allocator < V, R > &a, const memory_pool_allocator < U, R > &b)
-
-
-
-
template<typename T, typename P = internal::pool_base>
-class tbb::interface6::memory_pool_allocator< T, P >
-
-
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
-
The documentation for this class was generated from the following file:
-memory_pool.h
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00096.html b/doc/html/a00096.html
index 89233cec85..f1729a4574 100644
--- a/doc/html/a00096.html
+++ b/doc/html/a00096.html
@@ -4,7 +4,7 @@
-tbb::interface6::memory_pool_allocator< void, P > Class Template Reference
+tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > Class Template Reference
@@ -33,88 +33,87 @@
+tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > Class Template Reference
-
-
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
- More...
-
-
#include <memory_pool.h>
+
+
+
+
+
+
+
-
-typedef P pool_type
-
-
-typedef void * pointer
-
-
-typedef const void * const_pointer
-
-
-typedef void value_type
-
+
+typedef OutputTuple output_type
+
+
+typedef
+unfolded_type::input_ports_type input_ports_type
+
-
- memory_pool_allocator (pool_type &pool) throw ()
-
-
- memory_pool_allocator (const memory_pool_allocator &src) throw ()
-
-
-template<typename U >
- memory_pool_allocator (const memory_pool_allocator < U, P > &src) throw ()
-
-
-
-
-pool_type * my_pool
-
-
-
-
-template<typename U , typename R >
-class memory_pool_allocator
-
-
-template<typename V , typename U , typename R >
-bool operator== (const memory_pool_allocator < V, R > &a, const memory_pool_allocator < U, R > &b)
-
-
-template<typename V , typename U , typename R >
-bool operator!= (const memory_pool_allocator < V, R > &a, const memory_pool_allocator < U, R > &b)
-
+
+ join_node (graph &g)
+
+
+template<typename __TBB_B0 , typename __TBB_B1 >
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1)
+
+
+template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 >
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2)
+
+
+template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 >
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3)
+
+
+template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 >
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4)
+
+
+template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 , typename __TBB_B5 >
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5)
+
+
+template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 , typename __TBB_B5 , typename __TBB_B6 >
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6)
+
+
+template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 , typename __TBB_B5 , typename __TBB_B6 , typename __TBB_B7 >
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7)
+
+
+template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 , typename __TBB_B5 , typename __TBB_B6 , typename __TBB_B7 , typename __TBB_B8 >
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7, __TBB_B8 b8)
+
+
+template<typename __TBB_B0 , typename __TBB_B1 , typename __TBB_B2 , typename __TBB_B3 , typename __TBB_B4 , typename __TBB_B5 , typename __TBB_B6 , typename __TBB_B7 , typename __TBB_B8 , typename __TBB_B9 >
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7, __TBB_B8 b8, __TBB_B9 b9)
+
+
+ join_node (const join_node &other)
+
+
+void set_name (const char *name)
+
-
-
template<typename P>
-class tbb::interface6::memory_pool_allocator< void, P >
-
-
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
-
The documentation for this class was generated from the following file:
-memory_pool.h
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00096.png b/doc/html/a00096.png
new file mode 100644
index 0000000000..04fbb34308
Binary files /dev/null and b/doc/html/a00096.png differ
diff --git a/doc/html/a00097.html b/doc/html/a00097.html
index c1b181e6cd..639ceddbb5 100644
--- a/doc/html/a00097.html
+++ b/doc/html/a00097.html
@@ -4,7 +4,7 @@
-rml::MemPoolPolicy Struct Reference
+tbb::flow::interface8::join_node< OutputTuple, queueing > Class Template Reference
@@ -33,58 +33,51 @@
+tbb::flow::interface8::join_node< OutputTuple, queueing > Class Template Reference
+
+
+
+
+
+
+
-enum { TBBMALLOC_POOL_VERSION = 1
- }
-
+
+typedef OutputTuple output_type
+
+
+typedef
+unfolded_type::input_ports_type input_ports_type
+
-
- MemPoolPolicy (rawAllocType pAlloc_, rawFreeType pFree_, size_t granularity_=0, bool fixedPool_=false, bool keepAllMemory_=false)
-
-
-
-
-rawAllocType pAlloc
-
-
-rawFreeType pFree
-
-
-size_t granularity
-
-
-int version
-
-
-unsigned fixedPool : 1
-
-
-unsigned keepAllMemory : 1
-
-
-unsigned reserved : 30
-
+
+ join_node (graph &g)
+
+
+ join_node (const join_node &other)
+
+
+void set_name (const char *name)
+
-
The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00097.png b/doc/html/a00097.png
new file mode 100644
index 0000000000..890b2d6bb8
Binary files /dev/null and b/doc/html/a00097.png differ
diff --git a/doc/html/a00098.html b/doc/html/a00098.html
index 527efa57f1..96b250d8f6 100644
--- a/doc/html/a00098.html
+++ b/doc/html/a00098.html
@@ -4,7 +4,7 @@
-tbb::missing_wait Class Reference
+tbb::flow::interface8::join_node< OutputTuple, reserving > Class Template Reference
@@ -33,41 +33,51 @@
+tbb::flow::interface8::join_node< OutputTuple, reserving > Class Template Reference
-
-
Exception for missing wait on structured_task_group .
- More...
-
-
#include <tbb_exception.h>
+Inheritance diagram for tbb::flow::interface8::join_node< OutputTuple, reserving >:
-
-
+
+
+
+
+typedef OutputTuple output_type
+
+
+typedef
+unfolded_type::input_ports_type input_ports_type
+
+
-
-const char * what () const throw ()
-
+
+ join_node (graph &g)
+
+
+ join_node (const join_node &other)
+
+
+void set_name (const char *name)
+
-
-Exception for missing wait on structured_task_group .
-
The documentation for this class was generated from the following file:
-tbb_exception.h
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00098.png b/doc/html/a00098.png
index 7f9c4b3140..0157a3afb3 100644
Binary files a/doc/html/a00098.png and b/doc/html/a00098.png differ
diff --git a/doc/html/a00099.html b/doc/html/a00099.html
index 43851b981c..ae9a11afc1 100644
--- a/doc/html/a00099.html
+++ b/doc/html/a00099.html
@@ -4,7 +4,7 @@
-tbb::movable_exception< ExceptionData > Class Template Reference
+tbb::flow::interface8::key_from_policy< JP > Struct Template Reference
@@ -33,190 +33,29 @@
+tbb::flow::interface8::key_from_policy< JP > Struct Template Reference
-
-
Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread.
- More...
-
-
#include <tbb_exception.h>
-
-
-
-
-
-
-
-
-
-
- movable_exception (const ExceptionData &data_)
-
-
- movable_exception (const movable_exception &src) throw ()
-
-
-const movable_exception & operator= (const movable_exception &src)
-
-
-ExceptionData & data () throw ()
-
-
-const ExceptionData & data () const throw ()
-
-
-const char * name () const throw ()
- Returns RTTI name of the originally intercepted exception.
-
-
-const char * what () const throw ()
- Returns the result of originally intercepted exception's what() method.
-
-movable_exception * move () throw ()
- Creates and returns pointer to the deep copy of this exception object. More...
-
-void destroy () throw ()
- Destroys objects created by the move() method. More...
-
-void throw_self ()
- Throws this exception object. More...
-
-
-void operator delete (void *p)
-
-
-
-
-ExceptionData my_exception_data
- User data.
-
+
+
+typedef size_t type
+
+
+typedef std::false_type is_key_matching
+
-
-
template<typename ExceptionData>
-class tbb::movable_exception< ExceptionData >
-
-
Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread.
-
Code using TBB can instantiate this template with an arbitrary ExceptionData type and throw this exception object. Such exceptions are intercepted by the TBB scheduler and delivered to the root thread ().
-
See Also tbb::tbb_exception
-
-
-
-
-
-template<typename ExceptionData >
-
-
-
-
-
-
-inline virtual
-
-
-
-
-
Destroys objects created by the move() method.
-
Frees memory and calls destructor for this exception object. Can and must be used only on objects created by the move method.
-
-
Implements tbb::tbb_exception .
-
-
-
-
-
-
-
-template<typename ExceptionData >
-
-
-
-
-
-
-inline virtual
-
-
-
-
-
Creates and returns pointer to the deep copy of this exception object.
-
Move semantics is allowed.
-
-
Implements tbb::tbb_exception .
-
-
-
-
-
-
-
-template<typename ExceptionData >
-
-
-
-
-
-
-inline virtual
-
-
-
-
-
Throws this exception object.
-
Make sure that if you have several levels of derivation from this interface you implement or override this method on the most derived level. The implementation is as simple as "throw *this;". Failure to do this will result in exception of a base class type being thrown.
-
-
Implements tbb::tbb_exception .
-
-
-
-
The documentation for this class was generated from the following file:
-tbb_exception.h
+ The documentation for this struct was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00099.png b/doc/html/a00099.png
deleted file mode 100644
index 2c2e3fe83e..0000000000
Binary files a/doc/html/a00099.png and /dev/null differ
diff --git a/doc/html/a00100.html b/doc/html/a00100.html
index 11ff0665eb..4b6e67570e 100644
--- a/doc/html/a00100.html
+++ b/doc/html/a00100.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > Class Template Reference
+tbb::flow::interface8::key_from_policy< key_matching< Key & > > Struct Template Reference
@@ -33,114 +33,29 @@
+tbb::flow::interface8::key_from_policy< key_matching< Key & > > Struct Template Reference
-
-
implements a function node that supports Input -> (set of outputs)
- More...
-
-
#include <flow_graph.h>
-
-
-
-
-
-
-
-
-
-typedef Input input_type
-
-
-typedef null_type output_type
-
-
-typedef
-internal::wrap_tuple_elements
-< N,
-internal::multifunction_output,
-Output >::type output_ports_type
-
-
-typedef
-internal::multifunction_input
-< input_type,
-output_ports_type, Allocator > fInput_type
-
-
-typedef
-internal::function_input_queue
-< input_type, Allocator > input_queue_type
-
-
-
-
-template<typename Body >
- multifunction_node (graph &g, size_t concurrency, Body body)
-
-
- multifunction_node (const multifunction_node &other)
-
-
-void set_name (const char *name)
-
-
-void extract ()
-
-
-
- graph_node (graph &g)
-
-
-
-
-void reset_node (reset_flags f)
-
-
-
-
-static const int N = tbb::flow::tuple_size<Output>::value
-
-
-
-
-
-graph & my_graph
-
-
-graph_node * next
-
-
-graph_node * prev
-
+
+typedef const Key & type
+
+
+typedef std::true_type is_key_matching
+
-
-
template<typename Input, typename Output, typename Policy = queueing, typename Allocator = cache_aligned_allocator<Input>>
-class tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
-
-
implements a function node that supports Input -> (set of outputs)
-
The documentation for this class was generated from the following file:
-flow_graph.h
+ The documentation for this struct was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00101.html b/doc/html/a00101.html
index e47237f586..e86af53cd3 100644
--- a/doc/html/a00101.html
+++ b/doc/html/a00101.html
@@ -4,7 +4,7 @@
-tbb::mutex Class Reference
+tbb::flow::interface8::key_from_policy< key_matching< Key > > Struct Template Reference
@@ -33,135 +33,29 @@
+tbb::flow::interface8::key_from_policy< key_matching< Key > > Struct Template Reference
-
-
Wrapper around the platform's native reader-writer lock.
- More...
-
-
#include <mutex.h>
-
-
-
-
-
-
-
-enum state_t { INITIALIZED =0x1234,
-DESTROYED =0x789A,
-HELD =0x56CD
- }
-
-
-typedef LPCRITICAL_SECTION native_handle_type
- Return native_handle.
-
-
-typedef pthread_mutex_t * native_handle_type
-
-
-
-
-static const bool is_rw_mutex = false
-
-
-static const bool is_recursive_mutex = false
-
-
-static const bool is_fair_mutex = false
-
-
-
-
-class scoped_lock
-
+
+typedef Key type
+
+
+typedef std::true_type is_key_matching
+
-
-
Wrapper around the platform's native reader-writer lock.
-
For testing purposes only.
-
-
-
-
-
-
-
-
-
- bool tbb::mutex::try_lock
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
The documentation for this class was generated from the following file:
-mutex.h
+ The documentation for this struct was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00102.html b/doc/html/a00102.html
index 46738e6c9a..b25f5a204c 100644
--- a/doc/html/a00102.html
+++ b/doc/html/a00102.html
@@ -4,7 +4,7 @@
-tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node Struct Reference
+tbb::flow::interface8::limiter_node< T > Class Template Reference
@@ -33,66 +33,300 @@
+tbb::flow::interface8::limiter_node< T > Class Template Reference
+
+
Forwards messages only if the threshold has not been reached.
+ More...
+
+
#include <flow_graph.h>
+Inheritance diagram for tbb::flow::interface8::limiter_node< T >:
-
-
+
+
+
+
+
-
- node (const Key &key)
-
-
- node (const Key &key, const T &t)
-
-
- node (const Key &key, T &&t)
-
-
- node (value_type &&i)
-
-
-template<typename... Args>
- node (Args &&...args)
-
-
- node (value_type &i)
-
-
- node (const value_type &i)
-
-
-void * operator new (size_t, node_allocator_type &a)
-
-
-void operator delete (void *ptr, node_allocator_type &a)
-
+
+ limiter_node (graph &g, size_t threshold, int num_decrement_predecessors=0)
+ Constructor.
+
+
+ limiter_node (const limiter_node &src)
+ Copy constructor.
+
+
+void set_name (const char *name)
+
+
+bool register_successor (receiver < output_type > &r)
+ Replace the current successor with this new successor.
+
+bool remove_successor (receiver < output_type > &r)
+ Removes a successor from this node. More...
+
+
+built_successors_type & built_successors ()
+
+
+built_predecessors_type & built_predecessors ()
+
+
+void internal_add_built_successor (receiver < output_type > &src)
+
+
+void internal_delete_built_successor (receiver < output_type > &src)
+
+
+size_t successor_count ()
+
+
+void copy_successors (successor_list_type &v)
+
+
+void internal_add_built_predecessor (sender < output_type > &src)
+
+
+void internal_delete_built_predecessor (sender < output_type > &src)
+
+
+size_t predecessor_count ()
+
+
+void copy_predecessors (predecessor_list_type &v)
+
+
+void extract ()
+
+
+bool register_predecessor (predecessor_type &src)
+ Adds src to the list of cached predecessors.
+
+
+bool remove_predecessor (predecessor_type &src)
+ Removes src from the list of cached predecessors.
+
+
+
+ graph_node (graph &g)
+
+
+
+virtual ~receiver ()
+ Destructor.
+
+
+bool try_put (const T &t)
+ Put an item to the receiver.
+
+
+virtual void copy_predecessors (predecessor_list_type &)=0
+
+
+
+virtual bool try_get (T &)
+ Request an item from the sender.
+
+
+virtual bool try_reserve (T &)
+ Reserves an item in the sender.
+
+
+virtual bool try_release ()
+ Releases the reserved item.
+
+
+virtual bool try_consume ()
+ Consumes the reserved item.
+
+
+
+task * try_put_task (const T &t)
+ Puts an item to this receiver.
+
+
+void reset_receiver (reset_flags)
+
+
+void reset_node (reset_flags f)
+
+
+
+virtual bool is_continue_receiver ()
+
+
+
+
+class internal::forward_task_bypass< limiter_node< T > >
+
+
+class internal::decrementer< limiter_node< T > >
+
+
+template<typename R , typename B >
+class run_and_put_task
+
+
+template<typename X , typename Y >
+class internal::broadcast_cache
+
+
+template<typename X , typename Y >
+class internal::round_robin_cache
+
+
- The documentation for this struct was generated from the following file:
-concurrent_hash_map.h
+
+template<typename T>
+class tbb::flow::interface8::limiter_node< T >
+
+
Forwards messages only if the threshold has not been reached.
+
This node forwards items until its threshold is reached. It contains no buffering. If the downstream node rejects, the message is dropped.
+
+
+
+
+
+template<typename T >
+
+
+
+
+
+
+inline virtual
+
+
+
+
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00102.png b/doc/html/a00102.png
index b914379539..0a2205abf8 100644
Binary files a/doc/html/a00102.png and b/doc/html/a00102.png differ
diff --git a/doc/html/a00103.html b/doc/html/a00103.html
index 447da11706..18b0acd7c9 100644
--- a/doc/html/a00103.html
+++ b/doc/html/a00103.html
@@ -4,7 +4,7 @@
-tbb::null_mutex Class Reference
+tbb::interface6::memory_pool< Alloc > Class Template Reference
@@ -33,55 +33,49 @@
+tbb::interface6::memory_pool< Alloc > Class Template Reference
-
A mutex which does nothing.
+
Thread-safe growable pool allocator for variable-size requests.
More...
-
#include <null_mutex.h>
+
#include <memory_pool.h>
+Inheritance diagram for tbb::interface6::memory_pool< Alloc >:
-
-
+
+
-
-
-static const bool is_rw_mutex = false
-
-
-static const bool is_recursive_mutex = true
-
-
-static const bool is_fair_mutex = true
-
+
+
+ memory_pool (const Alloc &src=Alloc())
+ construct pool with underlying allocator
+
+
+ ~memory_pool ()
+ destroy pool
+
-A mutex which does nothing.
-
A null_mutex does no operation and simulates success.
+
template<typename Alloc>
+class tbb::interface6::memory_pool< Alloc >
+
+
Thread-safe growable pool allocator for variable-size requests.
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00103.png b/doc/html/a00103.png
index b72b3103da..040c525da8 100644
Binary files a/doc/html/a00103.png and b/doc/html/a00103.png differ
diff --git a/doc/html/a00104.html b/doc/html/a00104.html
index 66327aa2d2..2177a5ab35 100644
--- a/doc/html/a00104.html
+++ b/doc/html/a00104.html
@@ -4,7 +4,7 @@
-tbb::null_rw_mutex Class Reference
+tbb::interface6::memory_pool_allocator< T, P > Class Template Reference
@@ -33,55 +33,139 @@
+tbb::interface6::memory_pool_allocator< T, P > Class Template Reference
-
A rw mutex which does nothing.
+
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
More...
-
#include <null_rw_mutex.h>
-
-
-
-
-
-
-
+
#include <memory_pool.h>
-
-
-static const bool is_rw_mutex = true
-
-
-static const bool is_recursive_mutex = true
-
-
-static const bool is_fair_mutex = true
-
+
+
+typedef
+tbb::internal::allocator_type
+< T >::value_type value_type
+
+
+typedef value_type * pointer
+
+
+typedef const value_type * const_pointer
+
+
+typedef value_type & reference
+
+
+typedef const value_type & const_reference
+
+
+typedef size_t size_type
+
+
+typedef ptrdiff_t difference_type
+
+
+
+
+ memory_pool_allocator (pool_type &pool) throw ()
+
+
+ memory_pool_allocator (const memory_pool_allocator &src) throw ()
+
+
+template<typename U >
+ memory_pool_allocator (const memory_pool_allocator < U, P > &src) throw ()
+
+
+pointer address (reference x) const
+
+
+const_pointer address (const_reference x) const
+
+
+pointer allocate (size_type n, const void *=0)
+ Allocate space for n objects.
+
+
+void deallocate (pointer p, size_type)
+ Free previously allocated block of memory.
+
+
+size_type max_size () const throw ()
+ Largest value for which method allocate might succeed.
+
+
+template<typename U , typename... Args>
+void construct (U *p, Args &&...args)
+ Copy-construct value at location pointed to by p.
+
+
+void construct (pointer p, value_type &&value)
+
+
+void construct (pointer p, const value_type &value)
+
+
+void destroy (pointer p)
+ Destroy value at location pointed to by p.
+
+
+
+
+typedef P pool_type
+
+
+
+
+pool_type * my_pool
+
+
+
+
+template<typename U , typename R >
+class memory_pool_allocator
+
+
+template<typename V , typename U , typename R >
+bool operator== (const memory_pool_allocator < V, R > &a, const memory_pool_allocator < U, R > &b)
+
+
+template<typename V , typename U , typename R >
+bool operator!= (const memory_pool_allocator < V, R > &a, const memory_pool_allocator < U, R > &b)
+
-
A rw mutex which does nothing.
-
A null_rw_mutex is a rw mutex that does nothing and simulates successful operation.
+
template<typename T, typename P = internal::pool_base>
+class tbb::interface6::memory_pool_allocator< T, P >
+
+
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00104.png b/doc/html/a00104.png
deleted file mode 100644
index 1ddf07110e..0000000000
Binary files a/doc/html/a00104.png and /dev/null differ
diff --git a/doc/html/a00105.html b/doc/html/a00105.html
index b064f74c27..de12a4bcfd 100644
--- a/doc/html/a00105.html
+++ b/doc/html/a00105.html
@@ -4,7 +4,7 @@
-
tbb::flow::interface8::null_type Struct Reference
+
tbb::interface6::memory_pool_allocator< void, P > Class Template Reference
@@ -33,16 +33,88 @@
-
The documentation for this struct was generated from the following file:
-flow_graph.h
+
+Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
+ More...
+
+#include <memory_pool.h>
+
+
+
+typedef P pool_type
+
+
+typedef void * pointer
+
+
+typedef const void * const_pointer
+
+
+typedef void value_type
+
+
+
+
+ memory_pool_allocator (pool_type &pool) throw ()
+
+
+ memory_pool_allocator (const memory_pool_allocator &src) throw ()
+
+
+template<typename U >
+ memory_pool_allocator (const memory_pool_allocator < U, P > &src) throw ()
+
+
+
+
+pool_type * my_pool
+
+
+
+
+template<typename U , typename R >
+class memory_pool_allocator
+
+
+template<typename V , typename U , typename R >
+bool operator== (const memory_pool_allocator < V, R > &a, const memory_pool_allocator < U, R > &b)
+
+
+template<typename V , typename U , typename R >
+bool operator!= (const memory_pool_allocator < V, R > &a, const memory_pool_allocator < U, R > &b)
+
+
+
+template<typename P>
+class tbb::interface6::memory_pool_allocator< void, P >
+
+
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00106.html b/doc/html/a00106.html
index 0cd4cfca24..ac5281e7f2 100644
--- a/doc/html/a00106.html
+++ b/doc/html/a00106.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::overwrite_node< T > Class Template Reference
+rml::MemPoolPolicy Struct Reference
@@ -33,265 +33,58 @@
+rml::MemPoolPolicy Struct Reference
-
-
-
-
-
-
-
-
-
-
-
-
- overwrite_node (graph &g)
-
-
- overwrite_node (const overwrite_node &src)
-
-
-void set_name (const char *name)
-
-
-bool register_successor (successor_type &s)
- Add a new successor to this node.
-
-
-bool remove_successor (successor_type &s)
- Removes a successor from this node.
-
-
-built_predecessors_type & built_predecessors ()
-
-
-built_successors_type & built_successors ()
-
-
-void internal_add_built_successor (successor_type &s)
-
-
-void internal_delete_built_successor (successor_type &s)
-
-
-size_t successor_count ()
-
-
-void copy_successors (successor_list_type &v)
-
-
-void internal_add_built_predecessor (predecessor_type &p)
-
-
-void internal_delete_built_predecessor (predecessor_type &p)
-
-
-size_t predecessor_count ()
-
-
-void copy_predecessors (predecessor_list_type &v)
-
-
-void extract ()
-
-
-bool try_get (input_type &v)
- Request an item from the sender.
-
-
-bool is_valid ()
-
-
-void clear ()
-
-
-
- graph_node (graph &g)
-
-
-
-virtual ~receiver ()
- Destructor.
-
-
-bool try_put (const T &t)
- Put an item to the receiver.
-
-
-virtual bool register_predecessor (predecessor_type &)
- Add a predecessor to the node.
-
-
-virtual bool remove_predecessor (predecessor_type &)
- Remove a predecessor from the node.
-
-
-virtual void copy_predecessors (predecessor_list_type &)=0
-
-
-
-virtual bool try_reserve (T &)
- Reserves an item in the sender.
-
-
-virtual bool try_release ()
- Releases the reserved item.
-
-
-virtual bool try_consume ()
- Consumes the reserved item.
-
+
+ MemPoolPolicy (rawAllocType pAlloc_, rawFreeType pFree_, size_t granularity_=0, bool fixedPool_=false, bool keepAllMemory_=false)
+
-
-
-task * try_put_task (const input_type &v)
-
-
-void reset_receiver (reset_flags)
-
-
-void reset_node (reset_flags f)
-
-
-
-virtual bool is_continue_receiver ()
-
-
-
-
-template<typename R , typename B >
-class run_and_put_task
-
-
-template<typename X , typename Y >
-class internal::broadcast_cache
-
-
-template<typename X , typename Y >
-class internal::round_robin_cache
-
+
+
+rawAllocType pAlloc
+
+
+rawFreeType pFree
+
+
+size_t granularity
+
+
+int version
+
+
+unsigned fixedPool : 1
+
+
+unsigned keepAllMemory : 1
+
+
+unsigned reserved : 30
+
-
The documentation for this class was generated from the following file:
-flow_graph.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00107.html b/doc/html/a00107.html
index fd1d9b0dfa..0dcd68aeff 100644
--- a/doc/html/a00107.html
+++ b/doc/html/a00107.html
@@ -4,7 +4,7 @@
-tbb::parallel_do_feeder< Item > Class Template Reference
+tbb::missing_wait Class Reference
@@ -33,59 +33,41 @@
+tbb::missing_wait Class Reference
-
Class the user supplied algorithm body uses to add new tasks.
+
Exception for missing wait on structured_task_group .
More...
-
#include <parallel_do.h>
+
#include <tbb_exception.h>
+Inheritance diagram for tbb::missing_wait:
-
-
+
+
-
-void add (const Item &item)
- Add a work item to a running parallel_do.
-
-
-
-
-template<typename Body_ , typename Item_ >
-class internal::parallel_do_feeder_impl
-
+
+const char * what () const throw ()
+
-template<typename Item>
-class tbb::parallel_do_feeder< Item >
-
-
Class the user supplied algorithm body uses to add new tasks.
-
Parameters
-
-
-
+
Exception for missing wait on structured_task_group .
The documentation for this class was generated from the following file:
-parallel_do.h
+tbb_exception.h
diff --git a/doc/html/a00107.png b/doc/html/a00107.png
index 742cad9d02..7f9c4b3140 100644
Binary files a/doc/html/a00107.png and b/doc/html/a00107.png differ
diff --git a/doc/html/a00108.html b/doc/html/a00108.html
index 11cc55737b..038fdbfb4f 100644
--- a/doc/html/a00108.html
+++ b/doc/html/a00108.html
@@ -4,7 +4,7 @@
-tbb::parallel_while< Body > Class Template Reference
+tbb::movable_exception< ExceptionData > Class Template Reference
@@ -33,125 +33,190 @@
+tbb::movable_exception< ExceptionData > Class Template Reference
-
Parallel iteration over a stream, with optional addition of more work.
+
Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread.
More...
-
#include <parallel_while.h>
+
#include <tbb_exception.h>
+Inheritance diagram for tbb::movable_exception< ExceptionData >:
-
-
+
+
+
-
-
-typedef Body::argument_type value_type
- Type of items.
-
-
-
- parallel_while ()
- Construct empty non-running parallel while.
-
-
- ~parallel_while ()
- Destructor cleans up data members before returning.
-
-template<typename Stream >
-void run (Stream &stream, const Body &body)
- Apply body.apply to each item in the stream. More...
-
-void add (const value_type &item)
- Add a work item while running. More...
-
+
+ movable_exception (const ExceptionData &data_)
+
+
+ movable_exception (const movable_exception &src) throw ()
+
+
+const movable_exception & operator= (const movable_exception &src)
+
+
+ExceptionData & data () throw ()
+
+
+const ExceptionData & data () const throw ()
+
+
+const char * name () const throw ()
+ Returns RTTI name of the originally intercepted exception.
+
+
+const char * what () const throw ()
+ Returns the result of originally intercepted exception's what() method.
+
+movable_exception * move () throw ()
+ Creates and returns pointer to the deep copy of this exception object. More...
+
+void destroy () throw ()
+ Destroys objects created by the move() method. More...
+
+void throw_self ()
+ Throws this exception object. More...
+
+
+void operator delete (void *p)
+
+
-template<typename Body>
-class tbb::parallel_while< Body >
+
template<typename ExceptionData>
+class tbb::movable_exception< ExceptionData >
-
Parallel iteration over a stream, with optional addition of more work.
-
The Body b has the requirement:
- "b(v)"
- "b.argument_type"
- where v is an argument_type
+
Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread.
+
Code using TBB can instantiate this template with an arbitrary ExceptionData type and throw this exception object. Such exceptions are intercepted by the TBB scheduler and delivered to the root thread ().
+
See Also tbb::tbb_exception
-
+
-template<typename Body >
+template<typename ExceptionData >
+
+
+
+
+
+inline virtual
+
+
-
Add a work item while running.
-
Should be executed only by body.apply or a thread spawned therefrom.
+
Destroys objects created by the move() method.
+
Frees memory and calls destructor for this exception object. Can and must be used only on objects created by the move method.
+
+
Implements tbb::tbb_exception .
-
+
-template<typename Body >
-
-template<typename Stream >
+template<typename ExceptionData >
+
+
+
+
+
+inline virtual
+
+
+
+
+
Creates and returns pointer to the deep copy of this exception object.
+
Move semantics is allowed.
+
+
Implements tbb::tbb_exception .
+
+
+
+
+
+
+
+template<typename ExceptionData >
+
+
+
+
+
+
+inline virtual
+
+
-
Apply body.apply to each item in the stream.
-
A Stream s has the requirements
- "S::value_type"
- "s.pop_if_present(value) is convertible to bool
+
Throws this exception object.
+
Make sure that if you have several levels of derivation from this interface you implement or override this method on the most derived level. The implementation is as simple as "throw *this;". Failure to do this will result in exception of a base class type being thrown.
+
+
Implements tbb::tbb_exception .
The documentation for this class was generated from the following file:
-parallel_while.h
+tbb_exception.h
diff --git a/doc/html/a00108.png b/doc/html/a00108.png
index fc86480fb6..2c2e3fe83e 100644
Binary files a/doc/html/a00108.png and b/doc/html/a00108.png differ
diff --git a/doc/html/a00109.html b/doc/html/a00109.html
index c96c2a62dc..f808e4852c 100644
--- a/doc/html/a00109.html
+++ b/doc/html/a00109.html
@@ -4,7 +4,7 @@
-tbb::pipeline Class Reference
+tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > Class Template Reference
@@ -33,99 +33,114 @@
+tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > Class Template Reference
-
A processing pipeline that applies filters to items.
+
implements a function node that supports Input -> (set of outputs)
More...
-
#include <pipeline.h>
+
#include <flow_graph.h>
+
+
+
+
+
+
+
+
+
+
+typedef Input input_type
+
+
+typedef null_type output_type
+
+
+typedef
+internal::wrap_tuple_elements
+< N,
+internal::multifunction_output,
+Output >::type output_ports_type
+
+
+typedef
+internal::multifunction_input
+< input_type,
+output_ports_type, Allocator > fInput_type
+
+
+typedef
+internal::function_input_queue
+< input_type, Allocator > input_queue_type
+
+
-
-__TBB_EXPORTED_METHOD pipeline ()
- Construct empty pipeline.
-
-virtual __TBB_EXPORTED_METHOD ~pipeline ()
-
-
-void __TBB_EXPORTED_METHOD add_filter (filter &filter_)
- Add filter to end of pipeline.
-
-
-void __TBB_EXPORTED_METHOD run (size_t max_number_of_live_tokens)
- Run the pipeline to completion.
-
-
-void __TBB_EXPORTED_METHOD run (size_t max_number_of_live_tokens, tbb::task_group_context &context)
- Run the pipeline to completion with user-supplied context.
-
-
-void __TBB_EXPORTED_METHOD clear ()
- Remove all filters from the pipeline.
-
+
+template<typename Body >
+ multifunction_node (graph &g, size_t concurrency, Body body)
+
+
+ multifunction_node (const multifunction_node &other)
+
+
+void set_name (const char *name)
+
+
+void extract ()
+
+
+
+ graph_node (graph &g)
+
+
+
+
+void reset_node (reset_flags f)
+
+
+
+
+static const int N = tbb::flow::tuple_size<Output>::value
+
-
-
-class internal::stage_task
-
-
-class internal::pipeline_root_task
-
-
-class filter
-
-
-class thread_bound_filter
-
-
-class internal::pipeline_cleaner
-
-
-class tbb::interface6::internal::pipeline_proxy
-
+
+
+
+graph & my_graph
+
+
+graph_node * next
+
+
+graph_node * prev
+
-
A processing pipeline that applies filters to items.
-
-
-
-
-
-
-
-
-
- virtual __TBB_EXPORTED_METHOD tbb::pipeline::~pipeline
- (
- )
-
-
-
-
-
-virtual
-
-
-
-
Though the current implementation declares the destructor virtual, do not rely on this detail. The virtualness is deprecated and may disappear in future versions of TBB.
+
template<typename Input, typename Output, typename Policy = queueing, typename Allocator = cache_aligned_allocator<Input>>
+class tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
-
-
-
The documentation for this class was generated from the following file:
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00100.png b/doc/html/a00109.png
similarity index 100%
rename from doc/html/a00100.png
rename to doc/html/a00109.png
diff --git a/doc/html/a00110.html b/doc/html/a00110.html
index afb7ba1624..5f2cb193cf 100644
--- a/doc/html/a00110.html
+++ b/doc/html/a00110.html
@@ -4,7 +4,7 @@
-tbb::pre_scan_tag Struct Reference
+tbb::mutex Class Reference
@@ -33,33 +33,135 @@
+tbb::mutex Class Reference
-
Used to indicate that the initial scan is being performed.
+
Wrapper around the platform's native reader-writer lock.
More...
-
#include <parallel_scan.h>
+
#include <mutex.h>
+
+
+
+
+
+
+
-
-
-static bool is_final_scan ()
-
+
+class scoped_lock
+ The scoped locking pattern. More...
+
+
+
+enum state_t { INITIALIZED =0x1234,
+DESTROYED =0x789A,
+HELD =0x56CD
+ }
+
+
+typedef LPCRITICAL_SECTION native_handle_type
+ Return native_handle.
+
+
+typedef pthread_mutex_t * native_handle_type
+
+
+
+
+static const bool is_rw_mutex = false
+
+
+static const bool is_recursive_mutex = false
+
+
+static const bool is_fair_mutex = false
+
+
-
Used to indicate that the initial scan is being performed.
-
The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00101.png b/doc/html/a00110.png
similarity index 100%
rename from doc/html/a00101.png
rename to doc/html/a00110.png
diff --git a/doc/html/a00111.html b/doc/html/a00111.html
index c0467f2539..1192db24b6 100644
--- a/doc/html/a00111.html
+++ b/doc/html/a00111.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::priority_queue_node< T, Compare, A > Class Template Reference
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node Struct Reference
@@ -33,389 +33,66 @@
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node Struct Reference
-
-
Forwards messages in priority order.
- More...
-
-
#include <flow_graph.h>
+Inheritance diagram for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node:
-
-
-
-
-
-
+
+
-
-enum op_stat { WAIT =0,
-SUCCEEDED ,
-FAILED
- }
-
-
-typedef buffer_node < T, A >
-::size_type size_type
-
-
-typedef buffer_node < T, A >
-::item_type item_type
-
-
-typedef buffer_node < T, A >
-::buffer_operation prio_operation
-
-
-enum op_type {
- reg_succ ,
-rem_succ ,
-req_item ,
-res_item ,
-
- rel_res ,
-con_res ,
-put_item ,
-try_fwd_task ,
-
- add_blt_succ ,
-del_blt_succ ,
-add_blt_pred ,
-del_blt_pred ,
-
- blt_succ_cnt ,
-blt_pred_cnt ,
-blt_succ_cpy ,
-blt_pred_cpy
-
- }
-
-enum op_stat { WAIT =0,
-SUCCEEDED ,
-FAILED
- }
-
-
-typedef size_t size_type
-
-
-typedef
-internal::aggregating_functor
-< class_type , buffer_operation > handler_type
-
-
-typedef sender < T >
-::built_successors_type built_successors_type
-
-
-typedef receiver < T >
-::built_predecessors_type built_predecessors_type
-
-
-
-template<typename T, typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
-class tbb::flow::interface8::priority_queue_node< T, Compare, A >
-
-
Forwards messages in priority order.
-
The documentation for this class was generated from the following file:
-flow_graph.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00111.png b/doc/html/a00111.png
index d3e88b55a6..b914379539 100644
Binary files a/doc/html/a00111.png and b/doc/html/a00111.png differ
diff --git a/doc/html/a00112.html b/doc/html/a00112.html
index e33cd05b70..2f1df27910 100644
--- a/doc/html/a00112.html
+++ b/doc/html/a00112.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::queue_node< T, A > Class Template Reference
+tbb::null_mutex Class Reference
@@ -33,384 +33,55 @@
+tbb::null_mutex Class Reference
-
Forwards messages in FIFO order.
+
A mutex which does nothing.
More...
-
#include <flow_graph.h>
+
#include <null_mutex.h>
+Inheritance diagram for tbb::null_mutex:
-
-
-
-
-
-
-
+
+
-
-enum op_stat { WAIT =0,
-SUCCEEDED ,
-FAILED
- }
-
-
-typedef buffer_node < T, A > base_type
-
-
-typedef base_type::size_type size_type
-
-
-typedef base_type::buffer_operation queue_operation
-
-
-enum op_type {
- reg_succ ,
-rem_succ ,
-req_item ,
-res_item ,
-
- rel_res ,
-con_res ,
-put_item ,
-try_fwd_task ,
-
- add_blt_succ ,
-del_blt_succ ,
-add_blt_pred ,
-del_blt_pred ,
-
- blt_succ_cnt ,
-blt_pred_cnt ,
-blt_succ_cpy ,
-blt_pred_cpy
-
- }
-
-enum op_stat { WAIT =0,
-SUCCEEDED ,
-FAILED
- }
-
-
-typedef size_t size_type
-
-
-typedef
-internal::aggregating_functor
-< class_type , buffer_operation > handler_type
-
-
-typedef sender < T >
-::built_successors_type built_successors_type
-
-
-typedef receiver < T >
-::built_predecessors_type built_predecessors_type
-
-
-template<typename T, typename A = cache_aligned_allocator<T>>
-class tbb::flow::interface8::queue_node< T, A >
-
-
Forwards messages in FIFO order.
+
A mutex which does nothing.
+
A null_mutex does no operation and simulates success.
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00112.png b/doc/html/a00112.png
index 8ad3fc1358..b72b3103da 100644
Binary files a/doc/html/a00112.png and b/doc/html/a00112.png differ
diff --git a/doc/html/a00113.html b/doc/html/a00113.html
index 26f9c0f54b..4ca607efad 100644
--- a/doc/html/a00113.html
+++ b/doc/html/a00113.html
@@ -4,7 +4,7 @@
-tbb::queuing_mutex Class Reference
+tbb::null_rw_mutex Class Reference
@@ -33,65 +33,55 @@
+tbb::null_rw_mutex Class Reference
-
Queuing mutex with local-only spinning.
+
A rw mutex which does nothing.
More...
-
#include <queuing_mutex.h>
+
#include <null_rw_mutex.h>
+Inheritance diagram for tbb::null_rw_mutex:
-
-
+
+
-
-
- queuing_mutex ()
- Construct unacquired mutex.
-
-
-void __TBB_EXPORTED_METHOD internal_construct ()
-
-
-
-static const bool is_rw_mutex = false
-
-
-static const bool is_recursive_mutex = false
-
-
+
+static const bool is_rw_mutex = true
+
+
+static const bool is_recursive_mutex = true
+
+
static const bool is_fair_mutex = true
-
+
-Queuing mutex with local-only spinning.
+
A rw mutex which does nothing.
+
A null_rw_mutex is a rw mutex that does nothing and simulates successful operation.
The documentation for this class was generated from the following file:
-queuing_mutex.h
+null_rw_mutex.h
diff --git a/doc/html/a00113.png b/doc/html/a00113.png
index 97f8b53bdb..1ddf07110e 100644
Binary files a/doc/html/a00113.png and b/doc/html/a00113.png differ
diff --git a/doc/html/a00114.html b/doc/html/a00114.html
index 4d33865796..50cc9d159a 100644
--- a/doc/html/a00114.html
+++ b/doc/html/a00114.html
@@ -4,7 +4,7 @@
-tbb::queuing_rw_mutex Class Reference
+tbb::flow::interface8::null_type Struct Reference
@@ -33,70 +33,16 @@
-
-
Queuing reader-writer mutex with local-only spinning.
- More...
-
-
#include <queuing_rw_mutex.h>
-
-
-
-
-
-
-
-
-
-
- queuing_rw_mutex ()
- Construct unacquired mutex.
-
-
- ~queuing_rw_mutex ()
- Destructor asserts if the mutex is acquired, i.e. q_tail is non-NULL.
-
-
-void __TBB_EXPORTED_METHOD internal_construct ()
-
-
-
-
-static const bool is_rw_mutex = true
-
-
-static const bool is_recursive_mutex = false
-
-
-static const bool is_fair_mutex = true
-
-
-
-
Queuing reader-writer mutex with local-only spinning.
-
Adapted from Krieger, Stumm, et al. pseudocode at http://www.eecg.toronto.edu/parallel/pubs_abs.html#Krieger_etal_ICPP93
-
The documentation for this class was generated from the following file:
-queuing_rw_mutex.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00114.png b/doc/html/a00114.png
deleted file mode 100644
index aeda94ccfe..0000000000
Binary files a/doc/html/a00114.png and /dev/null differ
diff --git a/doc/html/a00115.html b/doc/html/a00115.html
index 99f856695a..f9abe8ba05 100644
--- a/doc/html/a00115.html
+++ b/doc/html/a00115.html
@@ -4,7 +4,7 @@
-tbb::interface5::reader_writer_lock Class Reference
+tbb::flow::interface8::num_arguments< T > Struct Template Reference
@@ -33,191 +33,26 @@
+tbb::flow::interface8::num_arguments< T > Struct Template Reference
-
-
Writer-preference reader-writer lock with local-only spinning on readers.
- More...
-
-
#include <reader_writer_lock.h>
-
-
-
-
-
-
-
-
-enum status_t { waiting_nonblocking ,
-waiting ,
-active ,
-invalid
- }
- Status type for nodes associated with lock instances. More...
-
-
-
-
-class scoped_lock
-
-
-class scoped_lock_read
-
+
+
+static const int value = 1
+
-
-
Writer-preference reader-writer lock with local-only spinning on readers.
-
Loosely adapted from Mellor-Crummey and Scott pseudocode at http://www.cs.rochester.edu/research/synchronization/pseudocode/rw.html#s_wp
-
-
-
-
-
-
Status type for nodes associated with lock instances.
-
waiting_nonblocking: the wait state for nonblocking lock instances; for writes, these transition straight to active states; for reads, these are unused.
-
waiting: the start and spin state for all lock instances; these will transition to active state when appropriate. Non-blocking write locks transition from this state to waiting_nonblocking immediately.
-
active: the active state means that the lock instance holds the lock; it will transition to invalid state during node deletion
-
invalid: the end state for all nodes; this is set in the destructor so if we encounter this state, we are looking at memory that has already been freed
-
The state diagrams below describe the status transitions. Single arrows indicate that the thread that owns the node is responsible for the transition; double arrows indicate that any thread could make the transition.
-
State diagram for scoped_lock status:
-
waiting -------—> waiting_nonblocking | _____________/ | V V V active --------------—> invalid
-
State diagram for scoped_lock_read status:
-
waiting | V active --------------—>invalid
-
-
-
-
-
-
-
-
-
- void __TBB_EXPORTED_METHOD tbb::interface5::reader_writer_lock::lock
- (
- )
-
-
-
-
-
-
Acquires the reader_writer_lock for write.
-
If the lock is currently held in write mode by another context, the writer will block by spinning on a local variable. Exceptions thrown: improper_lock The context tries to acquire a reader_writer_lock that it already has write ownership of.
-
-
-
-
-
-
-
-
- void __TBB_EXPORTED_METHOD tbb::interface5::reader_writer_lock::lock_read
- (
- )
-
-
-
-
-
-
Acquires the reader_writer_lock for read.
-
If the lock is currently held by a writer, this reader will block and wait until the writers are done. Exceptions thrown: improper_lock The context tries to acquire a reader_writer_lock that it already has write ownership of.
-
-
-
-
-
-
-
-
- bool __TBB_EXPORTED_METHOD tbb::interface5::reader_writer_lock::try_lock
- (
- )
-
-
-
-
-
-
Tries to acquire the reader_writer_lock for write.
-
This function does not block. Return Value: True or false, depending on whether the lock is acquired or not. If the lock is already held by this acquiring context, try_lock() returns false.
-
-
-
-
-
-
-
-
- bool __TBB_EXPORTED_METHOD tbb::interface5::reader_writer_lock::try_lock_read
- (
- )
-
-
-
-
-
-
Tries to acquire the reader_writer_lock for read.
-
This function does not block. Return Value: True or false, depending on whether the lock is acquired or not.
-
-
-
-
The documentation for this class was generated from the following file:
-reader_writer_lock.h
+ The documentation for this struct was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00115.png b/doc/html/a00115.png
deleted file mode 100644
index 12ea5c6182..0000000000
Binary files a/doc/html/a00115.png and /dev/null differ
diff --git a/doc/html/a00116.html b/doc/html/a00116.html
index 695cdbf093..ca255cc7c2 100644
--- a/doc/html/a00116.html
+++ b/doc/html/a00116.html
@@ -4,7 +4,7 @@
-tbb::cache_aligned_allocator< void >::rebind< U > Struct Template Reference
+tbb::flow::interface8::num_arguments< port_ref_impl< N1, N2 > > Struct Template Reference
@@ -33,27 +33,26 @@
+tbb::flow::interface8::num_arguments< port_ref_impl< N1, N2 > > Struct Template Reference
The documentation for this struct was generated from the following file:
-cache_aligned_allocator.h
+flow_graph_opencl_node.h
diff --git a/doc/html/a00117.html b/doc/html/a00117.html
index 099df7856f..98c4bf18ad 100644
--- a/doc/html/a00117.html
+++ b/doc/html/a00117.html
@@ -4,7 +4,7 @@
-tbb::scalable_allocator< T >::rebind< U > Struct Template Reference
+tbb::flow::interface8::num_arguments< port_ref_impl< N1, N2 >(*)()> Struct Template Reference
@@ -33,26 +33,26 @@
+tbb::flow::interface8::num_arguments< port_ref_impl< N1, N2 >(*)()> Struct Template Reference
The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00118.html b/doc/html/a00118.html
index 19f3d1b5ff..01f37eea62 100644
--- a/doc/html/a00118.html
+++ b/doc/html/a00118.html
@@ -4,7 +4,7 @@
-tbb::scalable_allocator< void >::rebind< U > Struct Template Reference
+tbb::flow::interface8::opencl_buffer< T, Factory > Class Template Reference
@@ -33,26 +33,90 @@
+tbb::flow::interface8::opencl_buffer< T, Factory > Class Template Reference
-
-typedef scalable_allocator < U > other
-
+
+typedef cl_mem native_object_type
+
+
+typedef opencl_buffer memory_object_type
+
+
+typedef Factory opencl_factory_type
+
+
+template<access_type a>
+using iterator = T *
+
+
+
+
+template<access_type a>
+iterator< a > access () const
+
+
+T * data () const
+
+
+template<access_type a = read_write>
+iterator< a > begin () const
+
+
+template<access_type a = read_write>
+iterator< a > end () const
+
+
+size_t size () const
+
+
+T & operator[] (ptrdiff_t k)
+
+
+ opencl_buffer (opencl_graph &g, size_t size)
+
+
+ opencl_buffer (Factory &f, size_t size)
+
+
+cl_mem native_object () const
+
+
+const opencl_buffer & memory_object () const
+
+
+void send (opencl_device device, dependency_msg < opencl_buffer , Factory > &dependency) const
+
+
+void receive (const dependency_msg < opencl_buffer , Factory > &dependency) const
+
+
+
+
+template<typename >
+class opencl_factory
+
+
+bool operator== (const opencl_buffer < T, Factory > &lhs, const opencl_buffer < T, Factory > &rhs)
+
-
The documentation for this struct was generated from the following file:
-scalable_allocator.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00119.html b/doc/html/a00119.html
index 0e7400d93c..293b877b86 100644
--- a/doc/html/a00119.html
+++ b/doc/html/a00119.html
@@ -4,7 +4,7 @@
-tbb::tbb_allocator< void >::rebind< U > Struct Template Reference
+tbb::flow::interface8::opencl_buffer_impl< Factory > Class Template Reference
@@ -33,26 +33,91 @@
+tbb::flow::interface8::opencl_buffer_impl< Factory > Class Template Reference
+
+
+
+
+
+
+
+
-
-
-typedef tbb_allocator < U > other
-
+
+
+ opencl_buffer_impl (size_t size, Factory &f)
+
+
+size_t size () const
+
+
+void map_memory (opencl_device device, dependency_msg < void *, Factory > &dmsg)
+
+
+
+ opencl_memory (Factory &f)
+
+
+cl_mem get_cl_mem () const
+
+
+void * get_host_ptr ()
+
+
+dependency_msg < void *, Factory > send (opencl_device d, const cl_event *e)
+
+
+dependency_msg < void *, Factory > receive (const cl_event *e)
+
+
+
+
+template<typename , typename >
+class opencl_buffer
+
+
+
+
+
+cl_mem my_cl_mem
+
+
+tbb::atomic
+< opencl_device::device_id_type > my_curr_device_id
+
+
+void * my_host_ptr
+
+
+Factory * my_factory
+
+
+tbb::spin_mutex my_sending_lock
+
+
+bool my_sending_event_present
+
+
+cl_event my_sending_event
+
-
The documentation for this struct was generated from the following file:
-tbb_allocator.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00119.png b/doc/html/a00119.png
new file mode 100644
index 0000000000..1aeec1a091
Binary files /dev/null and b/doc/html/a00119.png differ
diff --git a/doc/html/a00120.html b/doc/html/a00120.html
index 730c4f5abb..75965547cb 100644
--- a/doc/html/a00120.html
+++ b/doc/html/a00120.html
@@ -4,7 +4,7 @@
-tbb::zero_allocator< T, Allocator >::rebind< U > Struct Template Reference
+tbb::flow::interface8::opencl_device Class Reference
@@ -33,27 +33,122 @@
+tbb::flow::interface8::opencl_device Class Reference
-
-
-typedef zero_allocator < U,
-Allocator > other
-
+
+
+std::string platform_profile () const
+
+
+std::string platform_version () const
+
+
+std::string platform_name () const
+
+
+std::string platform_vendor () const
+
+
+std::string platform_extensions () const
+
+
+template<typename T >
+void info (cl_device_info i, T &t) const
+
+
+std::string version () const
+
+
+int major_version () const
+
+
+int minor_version () const
+
+
+bool out_of_order_exec_mode_on_host_present () const
+
+
+bool out_of_order_exec_mode_on_device_present () const
+
+
+std::array< size_t, 3 > max_work_item_sizes () const
+
+
+size_t max_work_group_size () const
+
+
+bool built_in_kernel_available (const std::string &k) const
+
+
+std::string built_in_kernels () const
+
+
+std::string name () const
+
+
+cl_bool available () const
+
+
+cl_bool compiler_available () const
+
+
+cl_bool linker_available () const
+
+
+bool extension_available (const std::string &ext) const
+
+
+std::string extensions () const
+
+
+cl_device_type type () const
+
+
+std::string vendor () const
+
+
+cl_uint address_bits () const
+
+
+
+
+template<typename DeviceFilter >
+class opencl_factory
+
+
+template<typename Factory >
+class opencl_memory
+
+
+template<typename Factory >
+class opencl_program
+
+
+class opencl_foundation
+
+
+template<typename T , typename Factory >
+class opencl_buffer
+
+
+bool operator== (opencl_device d1, opencl_device d2)
+
-
The documentation for this struct was generated from the following file:
-tbb_allocator.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00121.html b/doc/html/a00121.html
index 262c083cd9..d267b4ebd2 100644
--- a/doc/html/a00121.html
+++ b/doc/html/a00121.html
@@ -4,7 +4,7 @@
-tbb::interface6::memory_pool_allocator< void, P >::rebind< U > Struct Template Reference
+tbb::flow::interface8::opencl_device_list Class Reference
@@ -33,27 +33,64 @@
+tbb::flow::interface8::opencl_device_list Class Reference
-
-typedef memory_pool_allocator
-< U, P > other
-
+
+typedef container_type::iterator iterator
+
+
+typedef
+container_type::const_iterator const_iterator
+
+
+typedef container_type::size_type size_type
+
+
+
+
+ opencl_device_list (std::initializer_list< opencl_device > il)
+
+
+void add (opencl_device d)
+
+
+size_type size () const
+
+
+iterator begin ()
+
+
+iterator end ()
+
+
+const_iterator begin () const
+
+
+const_iterator end () const
+
+
+const_iterator cbegin () const
+
+
+const_iterator cend () const
+
-
The documentation for this struct was generated from the following file:
-memory_pool.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00122.html b/doc/html/a00122.html
index 2714faab24..0fd4e5902b 100644
--- a/doc/html/a00122.html
+++ b/doc/html/a00122.html
@@ -4,7 +4,7 @@
-tbb::interface6::memory_pool_allocator< T, P >::rebind< U > Struct Template Reference
+tbb::flow::interface8::opencl_device_with_key< Key > Class Template Reference
@@ -33,27 +33,32 @@
+tbb::flow::interface8::opencl_device_with_key< Key > Class Template Reference
-
The documentation for this struct was generated from the following file:
-memory_pool.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00123.html b/doc/html/a00123.html
index f2a02ad768..6399926773 100644
--- a/doc/html/a00123.html
+++ b/doc/html/a00123.html
@@ -4,7 +4,7 @@
-tbb::tbb_allocator< T >::rebind< U > Struct Template Reference
+tbb::flow::interface8::opencl_factory< DeviceFilter > Class Template Reference
@@ -33,26 +33,49 @@
+tbb::flow::interface8::opencl_factory< DeviceFilter > Class Template Reference
+
+
+template<typename Factory >
+class opencl_program
+
+
+template<typename Factory >
+class opencl_buffer_impl
+
+
+template<typename Factory >
+class opencl_memory
+
+
+template<typename... Args>
+class opencl_node
+
-
The documentation for this struct was generated from the following file:
-tbb_allocator.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00124.html b/doc/html/a00124.html
index f026532ca0..7e58567c7d 100644
--- a/doc/html/a00124.html
+++ b/doc/html/a00124.html
@@ -4,7 +4,7 @@
-tbb::cache_aligned_allocator< T >::rebind< U > Struct Template Reference
+tbb::flow::interface8::opencl_foundation Class Reference
@@ -33,27 +33,44 @@
+tbb::flow::interface8::opencl_foundation Class Reference
+
+
+
+
+
+
+
-
The documentation for this struct was generated from the following file:
-cache_aligned_allocator.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00124.png b/doc/html/a00124.png
new file mode 100644
index 0000000000..947fbde9e6
Binary files /dev/null and b/doc/html/a00124.png differ
diff --git a/doc/html/a00125.html b/doc/html/a00125.html
index 12d934e375..7cd7380cb0 100644
--- a/doc/html/a00125.html
+++ b/doc/html/a00125.html
@@ -4,7 +4,7 @@
-tbb::zero_allocator< void, Allocator >::rebind< U > Struct Template Reference
+tbb::flow::interface8::opencl_graph Class Reference
@@ -33,27 +33,176 @@
+tbb::flow::interface8::opencl_graph Class Reference
+
+
+
+
+
+
+
+
+
+
+template<typename T , typename Factory >
+class opencl_buffer
+
+
+template<cl_channel_order channel_order, cl_channel_type channel_type, typename Factory >
+class opencl_image2d
+
+
+template<typename... Args>
+class opencl_node
+
+
+template<typename DeviceFilter >
+class opencl_factory
+
+
-
The documentation for this struct was generated from the following file:
-tbb_allocator.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00125.png b/doc/html/a00125.png
new file mode 100644
index 0000000000..c207263440
Binary files /dev/null and b/doc/html/a00125.png differ
diff --git a/doc/html/a00126.html b/doc/html/a00126.html
index 90929ac345..041efa71ea 100644
--- a/doc/html/a00126.html
+++ b/doc/html/a00126.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::receiver< T > Class Template Reference
+tbb::flow::interface8::opencl_memory< Factory > Class Template Reference
@@ -33,140 +33,76 @@
+tbb::flow::interface8::opencl_memory< Factory > Class Template Referenceabstract
-
-
Pure virtual template class that defines a receiver of messages of type T.
- More...
-
-
#include <flow_graph.h>
+Inheritance diagram for tbb::flow::interface8::opencl_memory< Factory >:
-
-
-
-
-
-
-
-
-
-
+
+
+
-
-
-virtual task * try_put_task (const T &t)=0
-
-
-virtual void reset_receiver (reset_flags f=rf_reset_protocol)=0
-
-
-virtual bool is_continue_receiver ()
-
+
+ opencl_memory (Factory &f)
+
+
+cl_mem get_cl_mem () const
+
+
+void * get_host_ptr ()
+
+
+dependency_msg < void *, Factory > send (opencl_device d, const cl_event *e)
+
+
+dependency_msg < void *, Factory > receive (const cl_event *e)
+
+
+virtual void map_memory (opencl_device , dependency_msg < void *, Factory > &)=0
+
-
-
-template<typename R , typename B >
-class run_and_put_task
- put item to successor; return task to run the successor if possible.
-
-
-template<typename X , typename Y >
-class internal::broadcast_cache
-
-
-template<typename X , typename Y >
-class internal::round_robin_cache
-
-
-template<typename U >
-class limiter_node
- put receiver back in initial state
-
-
-template<typename TT , typename M >
-class internal::successor_cache
-
+
+
+cl_mem my_cl_mem
+
+
+tbb::atomic
+< opencl_device::device_id_type > my_curr_device_id
+
+
+void * my_host_ptr
+
+
+Factory * my_factory
+
+
+tbb::spin_mutex my_sending_lock
+
+
+bool my_sending_event_present
+
+
+cl_event my_sending_event
+
-
-template<typename T>
-class tbb::flow::interface8::receiver< T >
-
-
Pure virtual template class that defines a receiver of messages of type T.
-
The documentation for this class was generated from the following file:
-flow_graph.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00126.png b/doc/html/a00126.png
index f765e3ebb5..d90f28a575 100644
Binary files a/doc/html/a00126.png and b/doc/html/a00126.png differ
diff --git a/doc/html/a00127.html b/doc/html/a00127.html
index 10ef9e52eb..2f6a64f468 100644
--- a/doc/html/a00127.html
+++ b/doc/html/a00127.html
@@ -4,7 +4,7 @@
-tbb::recursive_mutex Class Reference
+tbb::flow::interface8::opencl_node< Args > Class Template Reference
@@ -33,122 +33,16 @@
-
-
#include <recursive_mutex.h>
-
-
-
-
-
-
-
-
-
-
-typedef LPCRITICAL_SECTION native_handle_type
- Return native_handle.
-
-
-typedef pthread_mutex_t * native_handle_type
-
-
-
-
-static const bool is_rw_mutex = false
-
-
-static const bool is_recursive_mutex = true
-
-
-static const bool is_fair_mutex = false
-
-
-
-
-class scoped_lock
-
-
-
-
Mutex that allows recursive mutex acquisition.
-
-
-
-
-
-
-
-
-
- bool tbb::recursive_mutex::try_lock
- (
- )
-
-
-
-
-
-inline
-
-
-
-
The documentation for this class was generated from the following file:
-recursive_mutex.h
+flow_graph_opencl_node.h
diff --git a/doc/html/a00127.png b/doc/html/a00127.png
deleted file mode 100644
index 3157a913de..0000000000
Binary files a/doc/html/a00127.png and /dev/null differ
diff --git a/doc/html/a00128.html b/doc/html/a00128.html
index e8b0775b90..e8dbb45b6a 100644
--- a/doc/html/a00128.html
+++ b/doc/html/a00128.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::internal::round_robin_cache< T, M > Class Template Reference
+tbb::flow::interface8::opencl_node< tuple< Ports...> > Class Template Reference
@@ -33,16 +33,42 @@
+
+
+
+
+
+
+
+
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00128.png b/doc/html/a00128.png
new file mode 100644
index 0000000000..8a1801fad0
Binary files /dev/null and b/doc/html/a00128.png differ
diff --git a/doc/html/a00129.html b/doc/html/a00129.html
index 9143f8091a..6ef4967028 100644
--- a/doc/html/a00129.html
+++ b/doc/html/a00129.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::run_and_put_task< R, B > Class Template Reference
+tbb::flow::interface8::opencl_node< tuple< Ports...>, JP > Class Template Reference
@@ -33,16 +33,42 @@
+
+
+
+
+
+
+
+
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00129.png b/doc/html/a00129.png
new file mode 100644
index 0000000000..14dcd5dbe1
Binary files /dev/null and b/doc/html/a00129.png differ
diff --git a/doc/html/a00130.html b/doc/html/a00130.html
index 285e24f754..b1add1dcaa 100644
--- a/doc/html/a00130.html
+++ b/doc/html/a00130.html
@@ -4,7 +4,7 @@
-tbb::interface6::runtime_loader Class Reference
+tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > Class Template Reference
@@ -33,281 +33,81 @@
+tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > Class Template Reference
-
-
Load TBB at runtime.
- More...
-
-
#include <runtime_loader.h>
+Inheritance diagram for tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory >:
-
-
+
+
+
-
-Load TBB at runtime.
-
Usage:
-
In source code:
-
#include "tbb/runtime_loader.h"
-
-
char const * path[] = { "<install dir>/lib/ia32" , NULL };
-
tbb::runtime_loader loader( path );
-
-
-
Link with tbbproxy.lib
(or libtbbproxy.a
) instead of tbb.lib
(libtbb.dylib
, libtbb.so
).
-
TBB library will be loaded at runtime from
<install dir>="">/lib/ia32 directory.
-
Attention:
-
All runtime_loader
objects (in the same module, i.e. exe or dll) share some global state. The most noticeable piece of global state is loaded TBB library. There are some implications:
-
- Only one TBB library can be loaded per module.
-
-- If one object has already loaded TBB library, another object will not load TBB.
- If the loaded TBB library is suitable for the second object, both will use TBB
- cooperatively, otherwise the second object will report an error.
-
-- \c runtime_loader objects will not work (correctly) in parallel due to absence of
- synchronization.
-
-
-
-
-
Error codes.
-
-Enumerator ec_ok
-No errors.
-
- ec_bad_call
-Invalid function call (e. g. load() called when TBB is already loaded).
-
- ec_bad_arg
-Invalid argument passed.
-
- ec_bad_lib
-Invalid library found (e. g. TBB_runtime_version
symbol not found).
-
- ec_bad_ver
-TBB found but version is not suitable.
-
- ec_no_lib
-No suitable TBB library found.
-
-
-
-
-
-
-
-
-
-
Error mode constants.
-
-Enumerator em_status
-Save status of operation and continue.
-
- em_throw
-Throw an exception of tbb::runtime_loader::error_code type.
-
- em_abort
-Print message to stderr
and call abort()
.
-
+
+template<typename DeviceSelector >
+ opencl_node (opencl_graph &g, const opencl_program < Factory > &p, const std::string &kernel_name, DeviceSelector d, Factory &f)
+
+
+ opencl_node (opencl_graph &g, const opencl_program < Factory > &p, const std::string &kernel_name, Factory &f)
+
+
+ opencl_node (const opencl_node &node)
+
+
+ opencl_node (opencl_node &&node)
+
+
+template<typename T >
+void set_ndranges (std::initializer_list< T > global_work_size)
+
+
+template<typename GlobalNDRange >
+void set_ndranges (GlobalNDRange &&global_work_size)
+
+
+template<typename T , typename LocalNDRange >
+void set_ndranges (std::initializer_list< T > global_work_size, LocalNDRange &&local_work_size)
+
+
+template<typename T1 , typename T2 = T1>
+void set_ndranges (std::initializer_list< T1 > global_work_size, std::initializer_list< T2 > local_work_size)
+
+
+template<typename GlobalNDRange , typename LocalNDRange >
+void set_ndranges (GlobalNDRange &&global_work_size, LocalNDRange &&local_work_size)
+
+
+template<typename GlobalNDRange , typename T >
+void set_ndranges (GlobalNDRange &&global_work_size, std::initializer_list< T > local_work_size)
+
+
+template<typename... Args>
+void set_args (Args &&...args)
+
+
+
+
+void reset_node (reset_flags=rf_reset_protocol)
+
-
-
-
-
-
-
-
-
-
- tbb::interface6::runtime_loader::runtime_loader
- (
- char const *
- path [],
-
-
-
-
- int
- min_ver = TBB_INTERFACE_VERSION
,
-
-
-
-
- int
- max_ver = INT_MAX
,
-
-
-
-
- error_mode
- mode = em_abort
-
-
-
- )
-
-
-
-
-
-
Initialize object and load TBB.
-
See load() for details.
-
If error mode is em_status
, call status() to check whether TBB was loaded or not.
-
Parameters
-
- path List of directories to search TBB in.
- min_ver Minimal suitable version of TBB.
- max_ver Maximal suitable version of TBB.
- mode Error mode for this object.
-
-
-
-
-
-
-
-
-
-
-
-
- error_code tbb::interface6::runtime_loader::load
- (
- char const *
- path [],
-
-
-
-
- int
- min_ver = TBB_INTERFACE_VERSION
,
-
-
-
-
- int
- max_ver = INT_MAX
-
-
-
- )
-
-
-
-
-
-
Load TBB.
-
The method searches the directories specified in path
[] array for the TBB library. When the library is found, it is loaded and its version is checked. If the version is not suitable, the library is unloaded, and the search continues.
-
Note:
-
For security reasons, avoid using relative directory names. For example, never load TBB from current ("."
), parent (".."
) or any other relative directory (like "lib"
). Use only absolute directory names (e. g. "/usr/local/lib").
-
For the same security reasons, avoid using system default directories (""
) on Windows. (See http://www.microsoft.com/technet/security/advisory/2269637.mspx for details.)
-
Neglecting these rules may cause your program to execute 3-rd party malicious code.
-
Errors:
-
-ec_bad_call
- TBB already loaded by this object.
-ec_bad_arg
- min_ver
and/or max_ver
negative or zero, or min_ver
> max_ver
.
-ec_bad_ver
- TBB of unsuitable version already loaded by another object.
-ec_no_lib
- No suitable library found.
-
-
Parameters
-
- path List of directories to search TBB in.
- min_ver Minimal suitable version of TBB.
- max_ver Maximal suitable version of TBB.
-
-
-
-
-
-
-
-
-
-
-
- error_code tbb::interface6::runtime_loader::status
- (
- )
-
-
-
-
-
-
Report status.
-
If error mode is em_status
, the function returns status of the last operation.
-
-
-
The documentation for this class was generated from the following file:
-runtime_loader.h
+flow_graph_opencl_node.h
diff --git a/doc/html/a00130.png b/doc/html/a00130.png
index 56b89a68fd..36dff1d29d 100644
Binary files a/doc/html/a00130.png and b/doc/html/a00130.png differ
diff --git a/doc/html/a00131.html b/doc/html/a00131.html
index 31f9acd79e..36f4d8ae8b 100644
--- a/doc/html/a00131.html
+++ b/doc/html/a00131.html
@@ -4,7 +4,7 @@
-tbb::scalable_allocator< T > Class Template Reference
+tbb::flow::interface8::opencl_program< Factory > Class Template Reference
@@ -33,105 +33,52 @@
+tbb::flow::interface8::opencl_program< Factory > Class Template Reference
-
-
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
- More...
-
-
#include <scalable_allocator.h>
+
+
+
+
+
+
+
-
-
-typedef
-internal::allocator_type< T >
-::value_type value_type
-
-
-typedef value_type * pointer
-
-
-typedef const value_type * const_pointer
-
-
-typedef value_type & reference
-
-
-typedef const value_type & const_reference
-
-
-typedef size_t size_type
-
-
-typedef ptrdiff_t difference_type
-
-
-
- scalable_allocator (const scalable_allocator &) throw ()
-
-
-template<typename U >
- scalable_allocator (const scalable_allocator < U > &) throw ()
-
-
-pointer address (reference x) const
-
-
-const_pointer address (const_reference x) const
-
-
-pointer allocate (size_type n, const void *=0)
- Allocate space for n objects.
-
-
-void deallocate (pointer p, size_type)
- Free previously allocated block of memory.
-
-
-size_type max_size () const throw ()
- Largest value for which method allocate might succeed.
-
-
-template<typename U , typename... Args>
-void construct (U *p, Args &&...args)
-
-
-void construct (pointer p, value_type &&value)
-
-
-void construct (pointer p, const value_type &value)
-
-
-void destroy (pointer p)
-
+
+ opencl_program (opencl_program_type type, const std::string &program_name)
+
+
+ opencl_program (const char *program_name)
+
+
+ opencl_program (const std::string &program_name)
+
+
+ opencl_program (const opencl_program &src)
+
+
+
+
+template<typename... Args>
+class opencl_node
+
-
-
template<typename T>
-class tbb::scalable_allocator< T >
-
-
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
-
The members are ordered the same way they are in section 20.4.1 of the ISO C++ standard.
-
The documentation for this class was generated from the following file:
-scalable_allocator.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00131.png b/doc/html/a00131.png
new file mode 100644
index 0000000000..1e59d8d414
Binary files /dev/null and b/doc/html/a00131.png differ
diff --git a/doc/html/a00132.html b/doc/html/a00132.html
index 329c94c655..647f954cf2 100644
--- a/doc/html/a00132.html
+++ b/doc/html/a00132.html
@@ -4,7 +4,7 @@
-tbb::scalable_allocator< void > Class Template Reference
+tbb::flow::interface8::overwrite_node< T > Class Template Reference
@@ -33,48 +33,265 @@
+tbb::flow::interface8::overwrite_node< T > Class Template Reference
-
-
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
- More...
-
-
#include <scalable_allocator.h>
+
+
+
+
+
+
+
+
+
+
+
+
+
+task * try_put_task (const input_type &v)
+
+
+void reset_receiver (reset_flags)
+
+
+void reset_node (reset_flags f)
+
+
+
+virtual bool is_continue_receiver ()
+
+
+
+
+template<typename R , typename B >
+class run_and_put_task
+
+
+template<typename X , typename Y >
+class internal::broadcast_cache
+
+
+template<typename X , typename Y >
+class internal::round_robin_cache
+
-
-
template<>
-class tbb::scalable_allocator< void >
-
-
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
-
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00106.png b/doc/html/a00132.png
similarity index 100%
rename from doc/html/a00106.png
rename to doc/html/a00132.png
diff --git a/doc/html/a00133.html b/doc/html/a00133.html
index c82a845247..a243a58011 100644
--- a/doc/html/a00133.html
+++ b/doc/html/a00133.html
@@ -4,7 +4,7 @@
-tbb::null_mutex::scoped_lock Class Reference
+tbb::parallel_do_feeder< Item > Class Template Reference
@@ -33,50 +33,59 @@
+tbb::parallel_do_feeder< Item > Class Template Referenceabstract
-
Represents acquisition of a mutex.
+
Class the user supplied algorithm body uses to add new tasks.
More...
-
#include <null_mutex.h>
+
#include <parallel_do.h>
+Inheritance diagram for tbb::parallel_do_feeder< Item >:
-
-
+
+
-
- scoped_lock (null_mutex &)
-
-
-void acquire (null_mutex &)
-
-
-bool try_acquire (null_mutex &)
-
-
-void release ()
-
+
+void add (const Item &item)
+ Add a work item to a running parallel_do.
+
+
+
+
+template<typename Body_ , typename Item_ >
+class internal::parallel_do_feeder_impl
+
-Represents acquisition of a mutex.
+
template<typename Item>
+class tbb::parallel_do_feeder< Item >
+
+
Class the user supplied algorithm body uses to add new tasks.
+
Parameters
+
+
+
The documentation for this class was generated from the following file:
-null_mutex.h
+parallel_do.h
diff --git a/doc/html/a00133.png b/doc/html/a00133.png
index d8565aa377..742cad9d02 100644
Binary files a/doc/html/a00133.png and b/doc/html/a00133.png differ
diff --git a/doc/html/a00134.html b/doc/html/a00134.html
index 8a48a61f95..7628cf9b90 100644
--- a/doc/html/a00134.html
+++ b/doc/html/a00134.html
@@ -4,7 +4,7 @@
-tbb::queuing_rw_mutex::scoped_lock Class Reference
+tbb::parallel_while< Body > Class Template Reference
@@ -33,115 +33,125 @@
+tbb::parallel_while< Body > Class Template Reference
-
The scoped locking pattern.
+
Parallel iteration over a stream, with optional addition of more work.
More...
-
#include <queuing_rw_mutex.h>
+
#include <parallel_while.h>
+Inheritance diagram for tbb::parallel_while< Body >:
-
-
+
+
+
+
+typedef Body::argument_type value_type
+ Type of items.
+
+
-The scoped locking pattern.
-
It helps to avoid the common problem of forgetting to release lock. It also nicely provides the "node" for queuing locks.
-
-
+template<typename Body>
+class tbb::parallel_while< Body >
+
+
Parallel iteration over a stream, with optional addition of more work.
+
The Body b has the requirement:
+ "b(v)"
+ "b.argument_type"
+ where v is an argument_type
+
+
-
-
-
+
+template<typename Body >
-
-
-inline
-
-
-
Construct lock that has not acquired a mutex.
-
Equivalent to zero-initialization of *this.
+
Add a work item while running.
+
Should be executed only by body.apply or a thread spawned therefrom.
-
-
+
+
+template<typename Body >
+
+template<typename Stream >
- bool tbb::queuing_rw_mutex::scoped_lock::upgrade_to_writer
+ void tbb::parallel_while < Body >::run
(
- )
+ Stream &
+ stream ,
+
+
+
+
+ const Body &
+ body
+
+
+ )
+
-
Upgrade reader to become a writer.
-
Returns whether the upgrade happened without releasing and re-acquiring the lock
+
Apply body.apply to each item in the stream.
+
A Stream s has the requirements
+ "S::value_type"
+ "s.pop_if_present(value) is convertible to bool
The documentation for this class was generated from the following file:
-queuing_rw_mutex.h
+parallel_while.h
diff --git a/doc/html/a00134.png b/doc/html/a00134.png
index 227e99a9e7..fc86480fb6 100644
Binary files a/doc/html/a00134.png and b/doc/html/a00134.png differ
diff --git a/doc/html/a00135.html b/doc/html/a00135.html
index 63b3235b2e..26fe190e18 100644
--- a/doc/html/a00135.html
+++ b/doc/html/a00135.html
@@ -4,7 +4,7 @@
-tbb::interface5::reader_writer_lock::scoped_lock Class Reference
+tbb::pipeline Class Reference
@@ -33,60 +33,99 @@
+tbb::pipeline Class Reference
-
The scoped lock pattern for write locks.
+
A processing pipeline that applies filters to items.
More...
-
#include <reader_writer_lock.h>
-
-
-
-
-
-
-
+
#include <pipeline.h>
-
- scoped_lock (reader_writer_lock &lock )
- Construct with blocking attempt to acquire write lock on the passed-in lock.
-
-
- ~scoped_lock ()
- Destructor, releases the write lock.
-
-
-void * operator new (size_t s)
-
-
-void operator delete (void *p)
-
+
+__TBB_EXPORTED_METHOD pipeline ()
+ Construct empty pipeline.
+
+virtual __TBB_EXPORTED_METHOD ~pipeline ()
+
+
+void __TBB_EXPORTED_METHOD add_filter (filter &filter_)
+ Add filter to end of pipeline.
+
+
+void __TBB_EXPORTED_METHOD run (size_t max_number_of_live_tokens)
+ Run the pipeline to completion.
+
+
+void __TBB_EXPORTED_METHOD run (size_t max_number_of_live_tokens, tbb::task_group_context &context)
+ Run the pipeline to completion with user-supplied context.
+
+
+void __TBB_EXPORTED_METHOD clear ()
+ Remove all filters from the pipeline.
+
-
-class reader_writer_lock
-
+
+class internal::stage_task
+
+
+class internal::pipeline_root_task
+
+
+class filter
+
+
+class thread_bound_filter
+
+
+class internal::pipeline_cleaner
+
+
+class tbb::interface6::internal::pipeline_proxy
+
-
The scoped lock pattern for write locks.
-
Scoped locks help avoid the common problem of forgetting to release the lock. This type also serves as the node for queuing locks.
-
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00135.png b/doc/html/a00135.png
deleted file mode 100644
index a999a7d0cd..0000000000
Binary files a/doc/html/a00135.png and /dev/null differ
diff --git a/doc/html/a00136.html b/doc/html/a00136.html
index 6c266e3e83..f0fc4cf584 100644
--- a/doc/html/a00136.html
+++ b/doc/html/a00136.html
@@ -4,7 +4,7 @@
-tbb::spin_mutex::scoped_lock Class Reference
+tbb::flow::interface8::port_ref_impl< N1, N2 > Struct Template Reference
@@ -33,96 +33,26 @@
+tbb::flow::interface8::port_ref_impl< N1, N2 > Struct Template Reference
-
-
Represents acquisition of a mutex.
- More...
-
-
#include <spin_mutex.h>
-
-
-
-
-
-
-
-
-
-class spin_mutex
-
+
+
+static const int size = N2-N1+1
+
-
-
Represents acquisition of a mutex.
-
-
-
-
-
-
-
-
-
- bool tbb::spin_mutex::scoped_lock::try_acquire
- (
- spin_mutex &
- m )
-
-
-
-
-
-inline
-
-
-
-
-
Try acquiring lock (non-blocking)
-
Return true if lock acquired; false otherwise.
-
-
-
-
The documentation for this class was generated from the following file:
-spin_mutex.h
+ The documentation for this struct was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00136.png b/doc/html/a00136.png
deleted file mode 100644
index 25da9c6ba0..0000000000
Binary files a/doc/html/a00136.png and /dev/null differ
diff --git a/doc/html/a00137.html b/doc/html/a00137.html
index d9e85f0a5a..5279c13918 100644
--- a/doc/html/a00137.html
+++ b/doc/html/a00137.html
@@ -4,7 +4,7 @@
-tbb::queuing_mutex::scoped_lock Class Reference
+tbb::pre_scan_tag Struct Reference
@@ -33,89 +33,33 @@
+tbb::pre_scan_tag Struct Reference
-
The scoped locking pattern.
+
Used to indicate that the initial scan is being performed.
More...
-
#include <queuing_mutex.h>
-
-
-
-
-
-
-
+
#include <parallel_scan.h>
-
The scoped locking pattern.
-
It helps to avoid the common problem of forgetting to release lock. It also nicely provides the "node" for queuing locks.
-
-
-
-
-
-
-
-
-
- tbb::queuing_mutex::scoped_lock::scoped_lock
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
Construct lock that has not acquired a mutex.
-
Equivalent to zero-initialization of *this.
-
-
-
-
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00138.html b/doc/html/a00138.html
index 89ebcceda5..e5ec7edac1 100644
--- a/doc/html/a00138.html
+++ b/doc/html/a00138.html
@@ -4,7 +4,7 @@
-tbb::mutex::scoped_lock Class Reference
+tbb::flow::interface8::priority_queue_node< T, Compare, A > Class Template Reference
@@ -33,70 +33,389 @@
+tbb::flow::interface8::priority_queue_node< T, Compare, A > Class Template Reference
-
The scoped locking pattern.
+
Forwards messages in priority order.
More...
-
#include <mutex.h>
+
#include <flow_graph.h>
+Inheritance diagram for tbb::flow::interface8::priority_queue_node< T, Compare, A >:
-
-
+
+
+
+
+
+
+
+enum op_stat { WAIT =0,
+SUCCEEDED ,
+FAILED
+ }
+
+
+typedef buffer_node < T, A >
+::size_type size_type
+
+
+typedef buffer_node < T, A >
+::item_type item_type
+
+
+typedef buffer_node < T, A >
+::buffer_operation prio_operation
+
+
+enum op_type {
+ reg_succ ,
+rem_succ ,
+req_item ,
+res_item ,
+
+ rel_res ,
+con_res ,
+put_item ,
+try_fwd_task ,
+
+ add_blt_succ ,
+del_blt_succ ,
+add_blt_pred ,
+del_blt_pred ,
+
+ blt_succ_cnt ,
+blt_pred_cnt ,
+blt_succ_cpy ,
+blt_pred_cpy
+
+ }
+
+enum op_stat { WAIT =0,
+SUCCEEDED ,
+FAILED
+ }
+
+
+typedef size_t size_type
+
+
+typedef
+internal::aggregating_functor
+< class_type , buffer_operation > handler_type
+
+
+typedef sender < T >
+::built_successors_type built_successors_type
+
+
+typedef receiver < T >
+::built_predecessors_type built_predecessors_type
+
-The scoped locking pattern.
-
It helps to avoid the common problem of forgetting to release lock. It also nicely provides the "node" for queuing locks.
+
template<typename T, typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>>
+class tbb::flow::interface8::priority_queue_node< T, Compare, A >
+
+
Forwards messages in priority order.
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00138.png b/doc/html/a00138.png
index 5450176d7f..d3e88b55a6 100644
Binary files a/doc/html/a00138.png and b/doc/html/a00138.png differ
diff --git a/doc/html/a00139.html b/doc/html/a00139.html
index 1eaabd781a..f3a686c7f1 100644
--- a/doc/html/a00139.html
+++ b/doc/html/a00139.html
@@ -4,7 +4,7 @@
-tbb::null_rw_mutex::scoped_lock Class Reference
+tbb::flow::interface8::proxy_dependency_receiver< T, Factory > Class Template Reference
@@ -33,56 +33,85 @@
+tbb::flow::interface8::proxy_dependency_receiver< T, Factory > Class Template Reference
-
-
Represents acquisition of a mutex.
- More...
-
-
#include <null_rw_mutex.h>
+Inheritance diagram for tbb::flow::interface8::proxy_dependency_receiver< T, Factory >:
-
-
+
+
+
+
+
+void reset_receiver (reset_flags f=rf_reset_protocol)
+ put receiver back in initial state
+
+
+bool is_continue_receiver ()
+
-
-Represents acquisition of a mutex.
-
The documentation for this class was generated from the following file:
-null_rw_mutex.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00139.png b/doc/html/a00139.png
index 081a54dff5..68da7369fe 100644
Binary files a/doc/html/a00139.png and b/doc/html/a00139.png differ
diff --git a/doc/html/a00140.html b/doc/html/a00140.html
index 45206417f6..464b9f3188 100644
--- a/doc/html/a00140.html
+++ b/doc/html/a00140.html
@@ -4,7 +4,7 @@
-tbb::recursive_mutex::scoped_lock Class Reference
+tbb::flow::interface8::proxy_dependency_sender< T, Factory > Class Template Reference
@@ -33,70 +33,85 @@
+tbb::flow::interface8::proxy_dependency_sender< T, Factory > Class Template Reference
-
-
The scoped locking pattern.
- More...
-
-
#include <recursive_mutex.h>
+Inheritance diagram for tbb::flow::interface8::proxy_dependency_sender< T, Factory >:
-
-
+
+
+
-
-The scoped locking pattern.
-
It helps to avoid the common problem of forgetting to release lock. It also nicely provides the "node" for queuing locks.
-
The documentation for this class was generated from the following file:
-recursive_mutex.h
+ The documentation for this class was generated from the following file:
+flow_graph_opencl_node.h
diff --git a/doc/html/a00140.png b/doc/html/a00140.png
index 9d4ec98b91..3aea1666dc 100644
Binary files a/doc/html/a00140.png and b/doc/html/a00140.png differ
diff --git a/doc/html/a00141.html b/doc/html/a00141.html
index 8c95527723..c7ef2042bf 100644
--- a/doc/html/a00141.html
+++ b/doc/html/a00141.html
@@ -4,7 +4,7 @@
-tbb::spin_rw_mutex_v3::scoped_lock Class Reference
+tbb::flow::interface8::queue_node< T, A > Class Template Reference
@@ -33,169 +33,384 @@
+tbb::flow::interface8::queue_node< T, A > Class Template Reference
-
The scoped locking pattern.
+
Forwards messages in FIFO order.
More...
-
#include <spin_rw_mutex.h>
+
#include <flow_graph.h>
+Inheritance diagram for tbb::flow::interface8::queue_node< T, A >:
-
-
+
+
+
+
+
+
+
+
+enum op_stat { WAIT =0,
+SUCCEEDED ,
+FAILED
+ }
+
+
+typedef buffer_node < T, A > base_type
+
+
+typedef base_type::size_type size_type
+
+
+typedef base_type::buffer_operation queue_operation
+
+
+enum op_type {
+ reg_succ ,
+rem_succ ,
+req_item ,
+res_item ,
+
+ rel_res ,
+con_res ,
+put_item ,
+try_fwd_task ,
+
+ add_blt_succ ,
+del_blt_succ ,
+add_blt_pred ,
+del_blt_pred ,
+
+ blt_succ_cnt ,
+blt_pred_cnt ,
+blt_succ_cpy ,
+blt_pred_cpy
+
+ }
+
+enum op_stat { WAIT =0,
+SUCCEEDED ,
+FAILED
+ }
+
+
+typedef size_t size_type
+
+
+typedef
+internal::aggregating_functor
+< class_type , buffer_operation > handler_type
+
+
+typedef sender < T >
+::built_successors_type built_successors_type
+
+
+typedef receiver < T >
+::built_predecessors_type built_predecessors_type
+
-The scoped locking pattern.
-
It helps to avoid the common problem of forgetting to release lock. It also nicely provides the "node" for queuing locks.
-
-
-
-
-
-
-
-
-
- tbb::spin_rw_mutex_v3::scoped_lock::scoped_lock
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
Construct lock that has not acquired a mutex.
-
Equivalent to zero-initialization of *this.
-
-
-
-
-
-
-
-
-
-
-
-
- bool tbb::spin_rw_mutex_v3::scoped_lock::upgrade_to_writer
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
Upgrade reader to become a writer.
-
Returns whether the upgrade happened without releasing and re-acquiring the lock
+
template<typename T, typename A = cache_aligned_allocator<T>>
+class tbb::flow::interface8::queue_node< T, A >
-
References is_writer .
-
-
-
-
-
-
-
-
-
-
-
-
- bool tbb::spin_rw_mutex_v3::scoped_lock::is_writer
-
-
-
-
-protected
-
-
-
-
-
The documentation for this class was generated from the following file:
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00141.png b/doc/html/a00141.png
index 13249c6a5c..8ad3fc1358 100644
Binary files a/doc/html/a00141.png and b/doc/html/a00141.png differ
diff --git a/doc/html/a00142.html b/doc/html/a00142.html
index 754f6ec669..fe92dfad4a 100644
--- a/doc/html/a00142.html
+++ b/doc/html/a00142.html
@@ -4,7 +4,7 @@
-tbb::internal::critical_section_v4::scoped_lock Class Reference
+tbb::queuing_mutex Class Reference
@@ -33,34 +33,65 @@
+tbb::queuing_mutex Class Reference
+
+
Queuing mutex with local-only spinning.
+ More...
+
+
#include <queuing_mutex.h>
+Inheritance diagram for tbb::queuing_mutex:
-
-
+
+
+
+
+static const bool is_rw_mutex = false
+
+
+static const bool is_recursive_mutex = false
+
+
+static const bool is_fair_mutex = true
+
- The documentation for this class was generated from the following file:
-critical_section.h
+
+Queuing mutex with local-only spinning.
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00142.png b/doc/html/a00142.png
index 15626cfa0f..97f8b53bdb 100644
Binary files a/doc/html/a00142.png and b/doc/html/a00142.png differ
diff --git a/doc/html/a00143.html b/doc/html/a00143.html
index d62e590feb..25834f36ad 100644
--- a/doc/html/a00143.html
+++ b/doc/html/a00143.html
@@ -4,7 +4,7 @@
-tbb::interface5::reader_writer_lock::scoped_lock_read Class Reference
+tbb::queuing_rw_mutex Class Reference
@@ -33,59 +33,70 @@
+tbb::queuing_rw_mutex Class Reference
-
The scoped lock pattern for read locks.
+
Queuing reader-writer mutex with local-only spinning.
More...
-
#include <reader_writer_lock.h>
+
#include <queuing_rw_mutex.h>
+Inheritance diagram for tbb::queuing_rw_mutex:
-
-
+
+
-
- scoped_lock_read (reader_writer_lock &lock )
- Construct with blocking attempt to acquire read lock on the passed-in lock.
-
-
- ~scoped_lock_read ()
- Destructor, releases the read lock.
-
-
-void * operator new (size_t s)
-
-
-void operator delete (void *p)
-
+
+ queuing_rw_mutex ()
+ Construct unacquired mutex.
+
+
+ ~queuing_rw_mutex ()
+ Destructor asserts if the mutex is acquired, i.e. q_tail is non-NULL.
+
+
+void __TBB_EXPORTED_METHOD internal_construct ()
+
-
-
-class reader_writer_lock
-
+
+
+static const bool is_rw_mutex = true
+
+
+static const bool is_recursive_mutex = false
+
+
+static const bool is_fair_mutex = true
+
-The scoped lock pattern for read locks.
+
Queuing reader-writer mutex with local-only spinning.
+
Adapted from Krieger, Stumm, et al. pseudocode at http://www.eecg.toronto.edu/parallel/pubs_abs.html#Krieger_etal_ICPP93
The documentation for this class was generated from the following file:
-reader_writer_lock.h
+queuing_rw_mutex.h
diff --git a/doc/html/a00143.png b/doc/html/a00143.png
index 10066bd980..aeda94ccfe 100644
Binary files a/doc/html/a00143.png and b/doc/html/a00143.png differ
diff --git a/doc/html/a00144.html b/doc/html/a00144.html
index b6e766aa1b..39e882528b 100644
--- a/doc/html/a00144.html
+++ b/doc/html/a00144.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::sender< T > Class Template Reference
+tbb::interface5::reader_writer_lock Class Reference
@@ -33,110 +33,191 @@
+tbb::interface5::reader_writer_lock Class Reference
-
Pure virtual template class that defines a sender of messages of type T.
+
Writer-preference reader-writer lock with local-only spinning on readers.
More...
-
#include <flow_graph.h>
+
#include <reader_writer_lock.h>
+Inheritance diagram for tbb::interface5::reader_writer_lock:
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+class scoped_lock
+
+
+class scoped_lock_read
+
-template<typename T>
-class tbb::flow::interface8::sender< T >
+
Writer-preference reader-writer lock with local-only spinning on readers.
+
Loosely adapted from Mellor-Crummey and Scott pseudocode at http://www.cs.rochester.edu/research/synchronization/pseudocode/rw.html#s_wp
+
+
+
+
+
+
Status type for nodes associated with lock instances.
+
waiting_nonblocking: the wait state for nonblocking lock instances; for writes, these transition straight to active states; for reads, these are unused.
+
waiting: the start and spin state for all lock instances; these will transition to active state when appropriate. Non-blocking write locks transition from this state to waiting_nonblocking immediately.
+
active: the active state means that the lock instance holds the lock; it will transition to invalid state during node deletion
+
invalid: the end state for all nodes; this is set in the destructor so if we encounter this state, we are looking at memory that has already been freed
+
The state diagrams below describe the status transitions. Single arrows indicate that the thread that owns the node is responsible for the transition; double arrows indicate that any thread could make the transition.
+
State diagram for scoped_lock status:
+
waiting -------—> waiting_nonblocking | _____________/ | V V V active --------------—> invalid
+
State diagram for scoped_lock_read status:
+
waiting | V active --------------—>invalid
+
+
+
+
+
+
+
+
+
+ void __TBB_EXPORTED_METHOD tbb::interface5::reader_writer_lock::lock
+ (
+ )
+
+
+
+
+
+
Acquires the reader_writer_lock for write.
+
If the lock is currently held in write mode by another context, the writer will block by spinning on a local variable. Exceptions thrown: improper_lock The context tries to acquire a reader_writer_lock that it already has write ownership of.
+
+
+
+
+
+
+
+
+ void __TBB_EXPORTED_METHOD tbb::interface5::reader_writer_lock::lock_read
+ (
+ )
+
+
+
+
+
+
Acquires the reader_writer_lock for read.
+
If the lock is currently held by a writer, this reader will block and wait until the writers are done. Exceptions thrown: improper_lock The context tries to acquire a reader_writer_lock that it already has write ownership of.
-
Pure virtual template class that defines a sender of messages of type T.
-
The documentation for this class was generated from the following file:
+
+
+
+
+
+
+ bool __TBB_EXPORTED_METHOD tbb::interface5::reader_writer_lock::try_lock
+ (
+ )
+
+
+
+
+
+
Tries to acquire the reader_writer_lock for write.
+
This function does not block. Return Value: True or false, depending on whether the lock is acquired or not. If the lock is already held by this acquiring context, try_lock() returns false.
+
+
+
+
+
+
+
+
+ bool __TBB_EXPORTED_METHOD tbb::interface5::reader_writer_lock::try_lock_read
+ (
+ )
+
+
+
+
+
+
Tries to acquire the reader_writer_lock for read.
+
This function does not block. Return Value: True or false, depending on whether the lock is acquired or not.
+
+
+
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00144.png b/doc/html/a00144.png
index f8d0e860bb..12ea5c6182 100644
Binary files a/doc/html/a00144.png and b/doc/html/a00144.png differ
diff --git a/doc/html/a00145.html b/doc/html/a00145.html
index 3cfbb2c088..f0c171d8da 100644
--- a/doc/html/a00145.html
+++ b/doc/html/a00145.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::sequencer_node< T, A > Class Template Reference
+tbb::zero_allocator< void, Allocator >::rebind< U > Struct Template Reference
@@ -33,353 +33,27 @@
+tbb::zero_allocator< void, Allocator >::rebind< U > Struct Template Reference
-
-
Forwards messages in sequence order.
- More...
-
-
#include <flow_graph.h>
-
-
-
-
-
-
-
-
-
-
-
-
-
-enum op_stat { WAIT =0,
-SUCCEEDED ,
-FAILED
- }
-
-
-typedef buffer_node < T, A >
-::size_type size_type
-
-
-typedef buffer_node < T, A >
-::buffer_operation sequencer_operation
-
-
-enum op_stat { WAIT =0,
-SUCCEEDED ,
-FAILED
- }
-
-
-typedef buffer_node < T, A > base_type
-
-
-typedef base_type::size_type size_type
-
-
-typedef base_type::buffer_operation queue_operation
-
-
-enum op_type {
- reg_succ ,
-rem_succ ,
-req_item ,
-res_item ,
-
- rel_res ,
-con_res ,
-put_item ,
-try_fwd_task ,
-
- add_blt_succ ,
-del_blt_succ ,
-add_blt_pred ,
-del_blt_pred ,
-
- blt_succ_cnt ,
-blt_pred_cnt ,
-blt_succ_cpy ,
-blt_pred_cpy
-
- }
-
-enum op_stat { WAIT =0,
-SUCCEEDED ,
-FAILED
- }
-
-
-typedef size_t size_type
-
-
-typedef
-internal::aggregating_functor
-< class_type , buffer_operation > handler_type
-
-
-typedef sender < T >
-::built_successors_type built_successors_type
-
-
-typedef receiver < T >
-::built_predecessors_type built_predecessors_type
-
-
-
-
template<typename T, typename A = cache_aligned_allocator<T>>
-class tbb::flow::interface8::sequencer_node< T, A >
-
-
Forwards messages in sequence order.
-
The documentation for this class was generated from the following file:
-flow_graph.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00146.html b/doc/html/a00146.html
index db6c5c7d5a..2e021d4b25 100644
--- a/doc/html/a00146.html
+++ b/doc/html/a00146.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::source_node< Output > Class Template Reference
+tbb::interface6::memory_pool_allocator< void, P >::rebind< U > Struct Template Reference
@@ -33,213 +33,27 @@
+tbb::interface6::memory_pool_allocator< void, P >::rebind< U > Struct Template Reference
-
-
An executable node that acts as a source, i.e. it has no predecessors.
- More...
-
-
#include <flow_graph.h>
-
-
-
-
-
-
-
-
-
-
-
-class internal::source_task_bypass< source_node< output_type > >
-
-
-
-
template<typename Output>
-class tbb::flow::interface8::source_node< Output >
-
-
An executable node that acts as a source, i.e. it has no predecessors.
-
-
-
-
-
-template<typename Output >
-
-
-
-
-
-
-inline virtual
-
-
-
-
-
The documentation for this class was generated from the following file:
-flow_graph.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00146.png b/doc/html/a00146.png
deleted file mode 100644
index a8bbd54a47..0000000000
Binary files a/doc/html/a00146.png and /dev/null differ
diff --git a/doc/html/a00147.html b/doc/html/a00147.html
index a8da7ce153..f2490a07c9 100644
--- a/doc/html/a00147.html
+++ b/doc/html/a00147.html
@@ -4,7 +4,7 @@
-tbb::spin_mutex Class Reference
+tbb::interface6::memory_pool_allocator< T, P >::rebind< U > Struct Template Reference
@@ -33,142 +33,27 @@
+tbb::interface6::memory_pool_allocator< T, P >::rebind< U > Struct Template Reference
-
-
A lock that occupies a single byte.
- More...
-
-
#include <spin_mutex.h>
-
-
-
-
-
-
-
-
-
-static const bool is_rw_mutex = false
-
-
-static const bool is_recursive_mutex = false
-
-
-static const bool is_fair_mutex = false
-
-
-
-
A lock that occupies a single byte.
-
A spin_mutex is a spin mutex that fits in a single byte. It should be used only for locking short critical sections (typically less than 20 instructions) when fairness is not an issue. If zero-initialized, the mutex is considered unheld.
-
-
-
-
-
-
-
-
-
- tbb::spin_mutex::spin_mutex
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
Construct unacquired lock.
-
Equivalent to zero-initialization of *this.
-
-
References internal_construct() .
-
-
-
-
-
-
-
-
-
-
-
-
- bool tbb::spin_mutex::try_lock
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
The documentation for this class was generated from the following file:
-spin_mutex.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00147.png b/doc/html/a00147.png
deleted file mode 100644
index 5dfc58974f..0000000000
Binary files a/doc/html/a00147.png and /dev/null differ
diff --git a/doc/html/a00148.html b/doc/html/a00148.html
index e95d8b25af..5fbf747e35 100644
--- a/doc/html/a00148.html
+++ b/doc/html/a00148.html
@@ -4,7 +4,7 @@
-tbb::spin_rw_mutex_v3 Class Reference
+tbb::cache_aligned_allocator< T >::rebind< U > Struct Template Reference
@@ -33,196 +33,27 @@
+tbb::cache_aligned_allocator< T >::rebind< U > Struct Template Reference
-
-
Fast, unfair, spinning reader-writer lock with backoff and writer-preference.
- More...
-
-
#include <spin_rw_mutex.h>
-
-
-
-
-
-
-
-
-
-static const bool is_rw_mutex = true
-
-
-static const bool is_recursive_mutex = false
-
-
-static const bool is_fair_mutex = false
-
-
-
-
-typedef intptr_t state_t
-
-
-
-
-static const state_t WRITER = 1
-
-
-static const state_t WRITER_PENDING = 2
-
-
-static const state_t READERS = ~(WRITER | WRITER_PENDING)
-
-
-static const state_t ONE_READER = 4
-
-
-static const state_t BUSY = WRITER | READERS
-
+
+
+typedef
+cache_aligned_allocator < U > other
+
-
-
Fast, unfair, spinning reader-writer lock with backoff and writer-preference.
-
-
-
-
-
-
-
-
-
- bool tbb::spin_rw_mutex_v3::try_lock
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
Try acquiring writer lock (non-blocking)
-
Return true if lock acquired; false otherwise.
-
-
-
-
-
-
-
-
-
-
-
- bool tbb::spin_rw_mutex_v3::try_lock_read
- (
- )
-
-
-
-
-
-inline
-
-
-
-
-
Try acquiring reader lock (non-blocking)
-
Return true if reader lock acquired; false otherwise.
-
-
-
-
-
-
-
-
-
-
-
-
- state_t tbb::spin_rw_mutex_v3::state
-
-
-
-
-protected
-
-
-
-
-
The documentation for this class was generated from the following file:
-spin_rw_mutex.h
+ The documentation for this struct was generated from the following file:
+cache_aligned_allocator.h
diff --git a/doc/html/a00148.png b/doc/html/a00148.png
deleted file mode 100644
index ff1efc94ee..0000000000
Binary files a/doc/html/a00148.png and /dev/null differ
diff --git a/doc/html/a00149.html b/doc/html/a00149.html
index eb4de3cc1c..22b228dc88 100644
--- a/doc/html/a00149.html
+++ b/doc/html/a00149.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::split_node< TupleType, Allocator > Class Template Reference
+tbb::cache_aligned_allocator< void >::rebind< U > Struct Template Reference
@@ -33,133 +33,27 @@
+tbb::cache_aligned_allocator< void >::rebind< U > Struct Template Reference
-
-
split_node : accepts a tuple as input, forwards each element of the tuple to its
- More...
-
-
#include <flow_graph.h>
-
-
-
-
-
-
-
-
-
-
+
typedef
-base_type::output_ports_type output_ports_type
-
-
-typedef base_type::output_type output_type
-
-
-typedef TupleType input_type
-
-
-typedef Allocator allocator_type
-
-
-
-typedef TupleType input_type
-
-
-typedef null_type output_type
-
-
-typedef
-internal::wrap_tuple_elements
-< N,
-internal::multifunction_output,
-TupleType >::type output_ports_type
-
-
-typedef
-internal::multifunction_input
-< input_type,
-output_ports_type, Allocator > fInput_type
-
-
-typedef
-internal::function_input_queue
-< input_type, Allocator > input_queue_type
-
-
-
-
- split_node (graph &g)
-
-
- split_node (const split_node &other)
-
-
-void set_name (const char *name)
-
-
-
- multifunction_node (graph &g, size_t concurrency, Body body)
-
-
- multifunction_node (const multifunction_node &other)
-
-
-void set_name (const char *name)
-
-
-void extract ()
-
-
-
- graph_node (graph &g)
-
-
-
-
template<typename TupleType, typename Allocator = cache_aligned_allocator<TupleType>>
-class tbb::flow::interface8::split_node< TupleType, Allocator >
-
-
split_node : accepts a tuple as input, forwards each element of the tuple to its
-
The documentation for this class was generated from the following file:
-flow_graph.h
+ The documentation for this struct was generated from the following file:
+cache_aligned_allocator.h
diff --git a/doc/html/a00150.html b/doc/html/a00150.html
index df5bdd6906..ebe79c1270 100644
--- a/doc/html/a00150.html
+++ b/doc/html/a00150.html
@@ -4,7 +4,7 @@
-tbb::structured_task_group Class Reference
+tbb::scalable_allocator< T >::rebind< U > Struct Template Reference
@@ -33,78 +33,26 @@
+tbb::scalable_allocator< T >::rebind< U > Struct Template Reference
-
-
-
-
-
-
-
-
-
-
-template<typename F >
-task_group_status run_and_wait (task_handle < F > &h)
-
-
-task_group_status wait ()
-
-
-
- task_group_base (uintptr_t traits=0)
-
-
-template<typename F >
-void run (task_handle < F > &h)
-
-
-task_group_status wait ()
-
-
-bool is_canceling ()
-
-
-void cancel ()
-
-
-
-
-
-task & owner ()
-
-
-template<typename F >
-task_group_status internal_run_and_wait (F &f)
-
-
-template<typename F , typename Task >
-void internal_run (F &f)
-
-
-
-empty_task * my_root
-
-
-task_group_context my_context
-
+
+
+typedef scalable_allocator < U > other
+
-
The documentation for this class was generated from the following file:
-task_group.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00151.html b/doc/html/a00151.html
index 76e279ffb0..82f9a8777a 100644
--- a/doc/html/a00151.html
+++ b/doc/html/a00151.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::internal::successor_cache< T, M > Class Template Reference
+tbb::scalable_allocator< void >::rebind< U > Struct Template Reference
@@ -33,16 +33,26 @@
-
The documentation for this class was generated from the following file:
-flow_graph.h
+
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00152.html b/doc/html/a00152.html
index ab4e266604..1684ed634d 100644
--- a/doc/html/a00152.html
+++ b/doc/html/a00152.html
@@ -4,7 +4,7 @@
-tbb::interface7::task_arena Class Reference
+tbb::tbb_allocator< T >::rebind< U > Struct Template Reference
@@ -33,342 +33,26 @@
+tbb::tbb_allocator< T >::rebind< U > Struct Template Reference
-
-
#include <task_arena.h>
-
-
-
-
-
-
-
-
-
-static int current_thread_index ()
- Returns the index, aka slot number, of the calling thread in its current arena.
-
-
-
-
-class tbb::internal::task_scheduler_observer_v3
-
+
+
+typedef tbb_allocator < U > other
+
-
-
1-to-1 proxy representation class of scheduler's arena Constructors set up settings only, real construction is deferred till the first method invocation Destructor only removes one of the references to the inner arena representation. Final destruction happens when all the references (and the work) are gone.
-
-
-
-
-
-
-
-
-
- tbb::interface7::task_arena::task_arena
- (
- int
- max_concurrency = automatic
,
-
-
-
-
- unsigned
- reserved_for_masters = 1
-
-
-
- )
-
-
-
-
-
-inline
-
-
-
-
-
Creates task_arena with certain concurrency limits.
-
Sets up settings only, real construction is deferred till the first method invocation
-
-max_concurrency specifies total number of slots in arena where threads work
-reserved_for_masters specifies number of slots to be used by master threads only. Value of 1 is default and reflects behavior of implicit arenas.
-
-
-
-
-
-
-
-
-
-
-
-
- tbb::interface7::task_arena::~task_arena
- (
- )
-
-
-
-
-
-inline
-
-
-
-
Removes the reference to the internal arena representation, and destroys the external object. Not thread safe wrt concurrent invocations of other methods.
-
-
-
-
-
-
-
-
-
-
-
-
- void tbb::interface7::task_arena::debug_wait_until_empty
- (
- )
-
-
-
-
-
-inline
-
-
-
-
Wait for all work in the arena to be completed Even submitted by other application threads Joins arena if/when possible (in the same way as execute() )
-
-
-
-
-
-
-
-template<typename F >
-
-
-
-
-
- void tbb::interface7::task_arena::enqueue
- (
- const F &
- f )
-
-
-
-
-
-inline
-
-
-
-
Enqueues a task into the arena to process a functor, and immediately returns. Does not require the calling thread to join the arena
-
-
-
-
-
-
-
-template<typename F >
-
-
-
-
-
- void tbb::interface7::task_arena::enqueue
- (
- const F &
- f ,
-
-
-
-
- priority_t
- p
-
-
-
- )
-
-
-
-
-
-inline
-
-
-
-
Enqueues a task with priority p into the arena to process a functor f, and immediately returns. Does not require the calling thread to join the arena
-
-
-
-
-
-
-
-template<typename F >
-
-
-
-
-
- void tbb::interface7::task_arena::execute
- (
- F &
- f )
-
-
-
-
-
-inline
-
-
-
-
Joins the arena and executes a functor, then returns If not possible to join, wraps the functor into a task, enqueues it and waits for task completion Can decrement the arena demand for workers, causing a worker to leave and free a slot to the calling thread
-
-
-
-
-
-
-
-template<typename F >
-
-
-
-
-
- void tbb::interface7::task_arena::execute
- (
- const F &
- f )
-
-
-
-
-
-inline
-
-
-
-
Joins the arena and executes a functor, then returns If not possible to join, wraps the functor into a task, enqueues it and waits for task completion Can decrement the arena demand for workers, causing a worker to leave and free a slot to the calling thread
-
-
-
-
-
-
-
-
-
-
-
- bool tbb::interface7::task_arena::is_active
- (
- )
- const
-
-
-
-
-inline
-
-
-
-
Returns true if the arena is active (initialized); false otherwise. The name was chosen to match a task_scheduler_init method with the same semantics.
-
-
-
-
-
-
-
-
-
-
-
- void tbb::interface7::task_arena::terminate
- (
- )
-
-
-
-
-
-inline
-
-
-
-
Removes the reference to the internal arena representation. Not thread safe wrt concurrent invocations of other methods.
-
-
-
-
The documentation for this class was generated from the following file:
-task_arena.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00153.html b/doc/html/a00153.html
index cc5ca39624..a58a8b7223 100644
--- a/doc/html/a00153.html
+++ b/doc/html/a00153.html
@@ -4,7 +4,7 @@
-tbb::task_group Class Reference
+tbb::tbb_allocator< void >::rebind< U > Struct Template Reference
@@ -33,87 +33,26 @@
+tbb::tbb_allocator< void >::rebind< U > Struct Template Reference
-
-
-
-
-
-
-
-
-
-
-template<typename F >
-void run (task_handle < F > &h)
-
-
-template<typename F >
-void run (const F &f)
-
-
-template<typename F >
-task_group_status run_and_wait (const F &f)
-
-
-template<typename F >
-task_group_status run_and_wait (task_handle < F > &h)
-
-
-
- task_group_base (uintptr_t traits=0)
-
-
-template<typename F >
-void run (task_handle < F > &h)
-
-
-task_group_status wait ()
-
-
-bool is_canceling ()
-
-
-void cancel ()
-
-
-
-
-
-task & owner ()
-
-
-template<typename F >
-task_group_status internal_run_and_wait (F &f)
-
-
-template<typename F , typename Task >
-void internal_run (F &f)
-
-
-
-empty_task * my_root
-
-
-task_group_context my_context
-
+
+
+typedef tbb_allocator < U > other
+
-
The documentation for this class was generated from the following file:
-task_group.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00154.html b/doc/html/a00154.html
index 24c4118a8f..23d2e7eb5f 100644
--- a/doc/html/a00154.html
+++ b/doc/html/a00154.html
@@ -4,7 +4,7 @@
-tbb::internal::task_group_base Class Reference
+tbb::zero_allocator< T, Allocator >::rebind< U > Struct Template Reference
@@ -33,74 +33,27 @@
+tbb::zero_allocator< T, Allocator >::rebind< U > Struct Template Reference
-
-
-
-
-
-
-
-
-
-
-
- task_group_base (uintptr_t traits=0)
-
-
-template<typename F >
-void run (task_handle < F > &h)
-
-
-task_group_status wait ()
-
-
-bool is_canceling ()
-
-
-void cancel ()
-
-
-
-
-task & owner ()
-
-
-template<typename F >
-task_group_status internal_run_and_wait (F &f)
-
-
-template<typename F , typename Task >
-void internal_run (F &f)
-
-
-
The documentation for this class was generated from the following file:
-task_group.h
+ The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00155.html b/doc/html/a00155.html
index c3bab04b06..7620e524c9 100644
--- a/doc/html/a00155.html
+++ b/doc/html/a00155.html
@@ -4,7 +4,7 @@
-tbb::task_group_context Struct Reference
+tbb::flow::interface8::receiver< T > Class Template Reference
@@ -33,20 +33,144 @@
-
#include <parallel_invoke.h>
+
Pure virtual template class that defines a receiver of messages of type T.
+ More...
+
+
#include <flow_graph.h>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+virtual task * try_put_task (const T &t)=0
+
+
+virtual void reset_receiver (reset_flags f=rf_reset_protocol)=0
+
+
+virtual bool is_continue_receiver ()
+
+
+
+
+template<typename R , typename B >
+class run_and_put_task
+ put item to successor; return task to run the successor if possible.
+
+
+template<typename X , typename Y >
+class internal::broadcast_cache
+
+
+template<typename X , typename Y >
+class internal::round_robin_cache
+
+
+template<typename U >
+class limiter_node
+ put receiver back in initial state
+
+
+template<typename TT , typename M >
+class internal::successor_cache
+
+
+template<typename , typename >
+class proxy_dependency_receiver
+
+
-
Dummy to avoid cluttering the bulk of the header with enormous amount of ifdefs.
-
The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00155.png b/doc/html/a00155.png
new file mode 100644
index 0000000000..f765e3ebb5
Binary files /dev/null and b/doc/html/a00155.png differ
diff --git a/doc/html/a00156.html b/doc/html/a00156.html
index c5bca070c3..d277bfcab1 100644
--- a/doc/html/a00156.html
+++ b/doc/html/a00156.html
@@ -4,7 +4,7 @@
-tbb::task_handle< F > Class Template Reference
+tbb::flow::interface8::receiver< dependency_msg< T, Factory > > Class Template Reference
@@ -33,51 +33,77 @@
+tbb::flow::interface8::receiver< dependency_msg< T, Factory > > Class Template Referenceabstract
+Inheritance diagram for tbb::flow::interface8::receiver< dependency_msg< T, Factory > >:
-
-
+
+
+
-
-
-template<typename _F >
-class internal::task_handle_task
-
-
-class task_group
-
-
-class structured_task_group
-
+
+
+virtual void reset_receiver (reset_flags f=rf_reset_protocol)=0
+ put receiver back in initial state
+
+
+virtual bool is_continue_receiver ()
+
The documentation for this class was generated from the following file:
-task_group.h
+flow_graph_opencl_node.h
diff --git a/doc/html/a00156.png b/doc/html/a00156.png
index 5f640e9e73..e40c5c976c 100644
Binary files a/doc/html/a00156.png and b/doc/html/a00156.png differ
diff --git a/doc/html/a00157.html b/doc/html/a00157.html
index 9eb3bb22b9..2947993ae0 100644
--- a/doc/html/a00157.html
+++ b/doc/html/a00157.html
@@ -4,7 +4,7 @@
-tbb::internal::task_handle_task< F > Class Template Reference
+tbb::recursive_mutex Class Reference
@@ -33,34 +33,122 @@
+tbb::recursive_mutex Class Reference
+
+
#include <recursive_mutex.h>
+Inheritance diagram for tbb::recursive_mutex:
-
-
+
+
+
+
+typedef LPCRITICAL_SECTION native_handle_type
+ Return native_handle.
+
+
+typedef pthread_mutex_t * native_handle_type
+
+
+
+
+static const bool is_rw_mutex = false
+
+
+static const bool is_recursive_mutex = true
+
+
+static const bool is_fair_mutex = false
+
+
+
+Mutex that allows recursive mutex acquisition.
+
+
+
+
+
+
+
+
+
+ bool tbb::recursive_mutex::try_lock
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
The documentation for this class was generated from the following file:
-task_group.h
+recursive_mutex.h
diff --git a/doc/html/a00157.png b/doc/html/a00157.png
index 229263c622..3157a913de 100644
Binary files a/doc/html/a00157.png and b/doc/html/a00157.png differ
diff --git a/doc/html/a00158.html b/doc/html/a00158.html
index 08e3da3325..a8d0a75bce 100644
--- a/doc/html/a00158.html
+++ b/doc/html/a00158.html
@@ -4,7 +4,7 @@
-tbb::task_scheduler_init Class Reference
+tbb::flow::interface8::internal::round_robin_cache< T, M > Class Template Reference
@@ -33,175 +33,16 @@
-
-
Class delimiting the scope of task scheduler activity.
- More...
-
-
#include <task_scheduler_init.h>
-
-
-
-
-
-
-
-
-
-void __TBB_EXPORTED_METHOD initialize (int number_of_threads=automatic )
- Ensure that scheduler exists for this thread. More...
-
-void __TBB_EXPORTED_METHOD initialize (int number_of_threads, stack_size_type thread_stack_size )
- The overloaded method with stack size parameter. More...
-
-
-void __TBB_EXPORTED_METHOD terminate ()
- Inverse of method initialize.
-
-
- if (wait_workers_in_terminate) my_scheduler
-
-
- initialize (number_of_threads, thread_stack_size )
-
-
- ~task_scheduler_init ()
- Destroy scheduler for this thread if thread has no other live task_scheduler_inits.
-
-
-bool is_active () const
- Returns true if scheduler is active (initialized); false otherwise.
-
-
-
-static int __TBB_EXPORTED_FUNC default_num_threads ()
- Returns the number of threads TBB scheduler would create if initialized by default. More...
-
-
-
-
-task_scheduler_init (int
-number_of_threads=automatic ,
-stack_size_type
-thread_stack_size=0, bool
-wait_workers_in_terminate=false) thread_stack_size = TBB_USE_CAPTURED_EXCEPTION ? propagation_mode_captured : propagation_mode_exact
- Shorthand for default constructor followed by call to initialize(number_of_threads).
-
-
-
-
-static const int automatic = -1
- Typedef for number of threads that is automatic.
-
-
-static const int deferred = -2
- Argument to initialize() or constructor that causes initialization to be deferred.
-
-
-
-
Class delimiting the scope of task scheduler activity.
-
A thread can construct a task_scheduler_init object and keep it alive while it uses TBB's tasking subsystem (including parallel algorithms).
-
This class allows to customize properties of the TBB task pool to some extent. For example it can limit concurrency level of parallel work initiated by the given thread. It also can be used to specify stack size of the TBB worker threads, though this setting is not effective if the thread pool has already been created.
-
If a parallel construct is used without task_scheduler_init object previously created, the scheduler will be initialized automatically with default settings, and will persist until this thread exits. Default concurrency level is defined as described in task_scheduler_init::initialize() .
-
-
-
-
-
-
-
-
-
- static int __TBB_EXPORTED_FUNC tbb::task_scheduler_init::default_num_threads
- (
- )
-
-
-
-
-
-static
-
-
-
-
-
Returns the number of threads TBB scheduler would create if initialized by default.
-
Result returned by this method does not depend on whether the scheduler has already been initialized.
-
Because tbb 2.0 does not support blocking tasks yet, you may use this method to boost the number of threads in the tbb's internal pool, if your tasks are doing I/O operations. The optimal number of additional threads depends on how much time your tasks spend in the blocked state.
-
Before TBB 3.0 U4 this method returned the number of logical CPU in the system. Currently on Windows, Linux and FreeBSD it returns the number of logical CPUs available to the current process in accordance with its affinity mask.
-
NOTE: The return value of this method never changes after its first invocation. This means that changes in the process affinity mask that took place after this method was first invoked will not affect the number of worker threads in the TBB worker threads pool.
-
-
-
-
-
-
-
-
- void __TBB_EXPORTED_METHOD tbb::task_scheduler_init::initialize
- (
- int
- number_of_threads = automatic
)
-
-
-
-
-
-
Ensure that scheduler exists for this thread.
-
A value of -1 lets TBB decide on the number of threads, which is usually maximal hardware concurrency for this process, that is the number of logical CPUs on the machine (possibly limited by the processor affinity mask of this process (Windows) or of this thread (Linux, FreeBSD). It is preferable option for production code because it helps to avoid nasty surprises when several TBB based components run side-by-side or in a nested fashion inside the same process.
-
The number_of_threads is ignored if any other task_scheduler_inits currently exist. A thread may construct multiple task_scheduler_inits. Doing so does no harm because the underlying scheduler is reference counted.
-
-
-
-
-
-
-
-
- void __TBB_EXPORTED_METHOD tbb::task_scheduler_init::initialize
- (
- int
- number_of_threads ,
-
-
-
-
- stack_size_type
- thread_stack_size
-
-
-
- )
-
-
-
-
-
-
The overloaded method with stack size parameter.
-
Overloading is necessary to preserve ABI compatibility
-
-
-
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00159.html b/doc/html/a00159.html
index f3c36ef2f7..967213b8bb 100644
--- a/doc/html/a00159.html
+++ b/doc/html/a00159.html
@@ -4,7 +4,7 @@
-tbb::interface6::task_scheduler_observer Class Reference
+tbb::flow::interface8::run_and_put_task< R, B > Class Template Reference
@@ -33,229 +33,16 @@
-
-
-
-
-
-
-
-
-
-
-enum { keep_awake = false,
-allow_sleep = true
- }
- Return commands for may_sleep()
-
-
-
-
-class internal::task_scheduler_observer_v3
-
-
-class internal::observer_proxy
-
-
-class internal::observer_list
-
-
-
-
-
-
-
-
-
-
-
- tbb::interface6::task_scheduler_observer::task_scheduler_observer
- (
- bool
- local = false
)
-
-
-
-
-
-inline
-
-
-
-
-
Construct local or global observer in inactive state (observation disabled).
-
For a local observer entry/exit notifications are invoked whenever a worker thread joins/leaves the arena of the observer's owner thread. If a thread is already in the arena when the observer is activated, the entry notification is called before it executes the first stolen task. TODO: Obsolete. Global observer semantics is obsolete as it violates master thread isolation guarantees and is not composable. Thus the current default behavior of the constructor is obsolete too and will be changed in one of the future versions of the library.
-
-
-
-
-
-
-
-
-
-
-
- tbb::interface6::task_scheduler_observer::task_scheduler_observer
- (
- task_arena &
- a )
-
-
-
-
-
-inline
-
-
-
-
-
Construct local observer for a given arena in inactive state (observation disabled).
-
entry/exit notifications are invoked whenever a thread joins/leaves arena. If a thread is already in the arena when the observer is activated, the entry notification is called before it executes the first stolen task.
-
-
-
-
-
-
-
-
-
-
-
- virtual tbb::interface6::task_scheduler_observer::~task_scheduler_observer
- (
- )
-
-
-
-
-
-inline virtual
-
-
-
-
Destructor protects instance of the observer from concurrent notification. It is recommended to disable observation before destructor of a derived class starts, otherwise it can lead to concurrent notification callback on partly destroyed object
-
-
References observe() .
-
-
-
-
-
-
-
-
-
-
-
-
- virtual bool tbb::interface6::task_scheduler_observer::may_sleep
- (
- )
-
-
-
-
-
-inline virtual
-
-
-
-
-
The callback can be invoked by a worker thread before it goes to sleep.
-
If it returns false ('keep_awake'), the thread will keep spinning and looking for work. It will not be called for master threads.
-
-
-
-
-
-
-
-
-
-
-
- void tbb::interface6::task_scheduler_observer::observe
- (
- bool
- state = true
)
-
-
-
-
-
-inline
-
-
-
-
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00160.html b/doc/html/a00160.html
index 0e782f5911..e99a28a908 100644
--- a/doc/html/a00160.html
+++ b/doc/html/a00160.html
@@ -4,7 +4,7 @@
-tbb::internal::task_scheduler_observer_v3 Class Reference
+tbb::interface6::runtime_loader Class Reference
@@ -33,145 +33,281 @@
+tbb::interface6::runtime_loader Class Reference
+
+
Load TBB at runtime.
+ More...
+
+
#include <runtime_loader.h>
+Inheritance diagram for tbb::interface6::runtime_loader:
-
-
-
+
+
-
-
+
+Load TBB at runtime.
+
Usage:
+
In source code:
+
#include "tbb/runtime_loader.h"
+
+
char const * path[] = { "<install dir>/lib/ia32" , NULL };
+
tbb::runtime_loader loader( path );
+
+
+
Link with tbbproxy.lib
(or libtbbproxy.a
) instead of tbb.lib
(libtbb.dylib
, libtbb.so
).
+
TBB library will be loaded at runtime from
<install dir>="">/lib/ia32 directory.
+
Attention:
+
All runtime_loader
objects (in the same module, i.e. exe or dll) share some global state. The most noticeable piece of global state is loaded TBB library. There are some implications:
+
- Only one TBB library can be loaded per module.
+
+- If one object has already loaded TBB library, another object will not load TBB.
+ If the loaded TBB library is suitable for the second object, both will use TBB
+ cooperatively, otherwise the second object will report an error.
+
+- \c runtime_loader objects will not work (correctly) in parallel due to absence of
+ synchronization.
+
+
+
+
+
Error codes.
+
+Enumerator ec_ok
+No errors.
+
+ ec_bad_call
+Invalid function call (e. g. load() called when TBB is already loaded).
+
+ ec_bad_arg
+Invalid argument passed.
+
+ ec_bad_lib
+Invalid library found (e. g. TBB_runtime_version
symbol not found).
+
+ ec_bad_ver
+TBB found but version is not suitable.
+
+ ec_no_lib
+No suitable TBB library found.
+
+
+
+
+
+
+
+
+
+
Error mode constants.
+
+Enumerator em_status
+Save status of operation and continue.
+
+ em_throw
+Throw an exception of tbb::runtime_loader::error_code type.
+
+ em_abort
+Print message to stderr
and call abort()
.
+
+
+
+
+
+
+
- void __TBB_EXPORTED_METHOD tbb::internal::task_scheduler_observer_v3::observe
+ tbb::interface6::runtime_loader::runtime_loader
(
- bool
- state = true
)
+ char const *
+ path [],
+
+
+
+
+ int
+ min_ver = TBB_INTERFACE_VERSION
,
+
+
+
+
+ int
+ max_ver = INT_MAX
,
+
+
+
+
+ error_mode
+ mode = em_abort
+
+
+ )
+
-
Enable or disable observation.
-
For local observers the method can be used only when the current thread has the task scheduler initialized or is attached to an arena.
-
Repeated calls with the same state are no-ops.
-
-
Referenced by tbb::interface6::task_scheduler_observer::observe() , and ~task_scheduler_observer_v3() .
+
Initialize object and load TBB.
+
See load() for details.
+
If error mode is em_status
, call status() to check whether TBB was loaded or not.
+
Parameters
+
+ path List of directories to search TBB in.
+ min_ver Minimal suitable version of TBB.
+ max_ver Maximal suitable version of TBB.
+ mode Error mode for this object.
+
+
+
-
+
+
-
-
-
- virtual void tbb::internal::task_scheduler_observer_v3::on_scheduler_entry
+ error_code tbb::interface6::runtime_loader::load
(
- bool
- )
+ char const *
+ path [],
+
+
+
+
+ int
+ min_ver = TBB_INTERFACE_VERSION
,
+
+
+
+
+ int
+ max_ver = INT_MAX
+
+
+ )
+
-
-
-inline virtual
-
-
-
Entry notification.
-
Invoked from inside observe(true) call and whenever a worker enters the arena this observer is associated with. If a thread is already in the arena when the observer is activated, the entry notification is called before it executes the first stolen task.
-
Obsolete semantics. For global observers it is called by a thread before the first steal since observation became enabled.
+
Load TBB.
+
The method searches the directories specified in path
[] array for the TBB library. When the library is found, it is loaded and its version is checked. If the version is not suitable, the library is unloaded, and the search continues.
+
Note:
+
For security reasons, avoid using relative directory names. For example, never load TBB from current ("."
), parent (".."
) or any other relative directory (like "lib"
). Use only absolute directory names (e. g. "/usr/local/lib").
+
For the same security reasons, avoid using system default directories (""
) on Windows. (See http://www.microsoft.com/technet/security/advisory/2269637.mspx for details.)
+
Neglecting these rules may cause your program to execute 3-rd party malicious code.
+
Errors:
+
+ec_bad_call
- TBB already loaded by this object.
+ec_bad_arg
- min_ver
and/or max_ver
negative or zero, or min_ver
> max_ver
.
+ec_bad_ver
- TBB of unsuitable version already loaded by another object.
+ec_no_lib
- No suitable library found.
+
+
Parameters
+
+ path List of directories to search TBB in.
+ min_ver Minimal suitable version of TBB.
+ max_ver Maximal suitable version of TBB.
+
+
+
-
+
-
-
-
- virtual void tbb::internal::task_scheduler_observer_v3::on_scheduler_exit
+ error_code tbb::interface6::runtime_loader::status
(
- bool
)
-
-
-inline virtual
-
-
-
Exit notification.
-
Invoked from inside observe(false) call and whenever a worker leaves the arena this observer is associated with.
-
Obsolete semantics. For global observers it is called by a thread before the first steal since observation became enabled.
+
Report status.
+
If error mode is em_status
, the function returns status of the last operation.
The documentation for this class was generated from the following file:
-task_scheduler_observer.h
+runtime_loader.h
diff --git a/doc/html/a00160.png b/doc/html/a00160.png
index b87088c72d..56b89a68fd 100644
Binary files a/doc/html/a00160.png and b/doc/html/a00160.png differ
diff --git a/doc/html/a00161.html b/doc/html/a00161.html
index 255f13641f..f53776d4d7 100644
--- a/doc/html/a00161.html
+++ b/doc/html/a00161.html
@@ -4,7 +4,7 @@
-tbb::tbb_allocator< T > Class Template Reference
+tbb::scalable_allocator< T > Class Template Reference
@@ -33,7 +33,7 @@
+List of all members
+tbb::scalable_allocator< T > Class Template Reference
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
More...
-
#include <tbb_allocator.h>
+
#include <scalable_allocator.h>
-enum malloc_type { scalable ,
-standard
- }
- Specifies current allocator.
-
-
+
typedef
internal::allocator_type< T >
::value_type value_type
-
-
+
+
typedef value_type * pointer
-
-
+
+
typedef const value_type * const_pointer
-
-
+
+
typedef value_type & reference
-
-
+
+
typedef const value_type & const_reference
-
-
+
+
typedef size_t size_type
-
-
+
+
typedef ptrdiff_t difference_type
-
+
-
- tbb_allocator (const tbb_allocator &) throw ()
-
-
+
+ scalable_allocator (const scalable_allocator &) throw ()
+
+
template<typename U >
- tbb_allocator (const tbb_allocator < U > &) throw ()
-
-
+ scalable_allocator (const scalable_allocator < U > &) throw ()
+
+
pointer address (reference x) const
-
-
+
+
const_pointer address (const_reference x) const
-
-
-pointer allocate (size_type n, const void *=0)
- Allocate space for n objects.
-
-
-void deallocate (pointer p, size_type)
- Free previously allocated block of memory.
-
-
-size_type max_size () const throw ()
- Largest value for which method allocate might succeed.
-
-
+
+
+pointer allocate (size_type n, const void *=0)
+ Allocate space for n objects.
+
+
+void deallocate (pointer p, size_type)
+ Free previously allocated block of memory.
+
+
+size_type max_size () const throw ()
+ Largest value for which method allocate might succeed.
+
+
template<typename U , typename... Args>
-void construct (U *p, Args &&...args)
- Copy-construct value at location pointed to by p.
-
-
+void construct (U *p, Args &&...args)
+
+
void construct (pointer p, value_type &&value)
-
-
+
+
void construct (pointer p, const value_type &value)
-
-
-void destroy (pointer p)
- Destroy value at location pointed to by p.
-
-
template<typename T>
-class tbb::tbb_allocator< T >
+class tbb::scalable_allocator< T >
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
-
The class selects the best memory allocation mechanism available from scalable_malloc and standard malloc. The members are ordered the same way they are in section 20.4.1 of the ISO C++ standard.
+
The members are ordered the same way they are in section 20.4.1 of the ISO C++ standard.
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00162.html b/doc/html/a00162.html
index 0335c96b96..a2e5315f28 100644
--- a/doc/html/a00162.html
+++ b/doc/html/a00162.html
@@ -4,7 +4,7 @@
-tbb::tbb_allocator< void > Class Template Reference
+tbb::scalable_allocator< void > Class Template Reference
@@ -33,48 +33,48 @@
+tbb::scalable_allocator< void > Class Template Reference
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
More...
-
#include <tbb_allocator.h>
+
#include <scalable_allocator.h>
-
+
typedef void * pointer
-
-
+
+
typedef const void * const_pointer
-
-
+
+
typedef void value_type
-
+
template<>
-class tbb::tbb_allocator< void >
+class tbb::scalable_allocator< void >
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00163.html b/doc/html/a00163.html
index 1f3b78aff0..a85019c315 100644
--- a/doc/html/a00163.html
+++ b/doc/html/a00163.html
@@ -4,7 +4,7 @@
-tbb::tbb_exception Class Reference
+tbb::spin_mutex::scoped_lock Class Reference
@@ -33,63 +33,68 @@
+tbb::spin_mutex::scoped_lock Class Reference
-
Interface to be implemented by all exceptions TBB recognizes and propagates across the threads.
+
Represents acquisition of a mutex.
More...
-
#include <tbb_exception.h>
+
#include <spin_mutex.h>
+Inheritance diagram for tbb::spin_mutex::scoped_lock:
-
-
-
-
+
+
-virtual tbb_exception * move ()=0 throw ()
- Creates and returns pointer to the deep copy of this exception object. More...
-
-virtual void destroy ()=0 throw ()
- Destroys objects created by the move() method. More...
-
-virtual void throw_self ()=0
- Throws this exception object. More...
-
-
-virtual const char * name () const =0 throw ()
- Returns RTTI name of the originally intercepted exception.
-
-
-virtual const char * what () const =0 throw ()
- Returns the result of originally intercepted exception's what() method.
-
-void operator delete (void *p)
-
+
+ scoped_lock ()
+ Construct without acquiring a mutex.
+
+
+ scoped_lock (spin_mutex &m)
+ Construct and acquire lock on a mutex.
+
+
+void acquire (spin_mutex &m)
+ Acquire lock.
+
+bool try_acquire (spin_mutex &m)
+ Try acquiring lock (non-blocking) More...
+
+
+void release ()
+ Release lock.
+
+
+ ~scoped_lock ()
+ Destroy lock. If holding a lock, releases the lock first.
+
+
-Interface to be implemented by all exceptions TBB recognizes and propagates across the threads.
-
If an unhandled exception of the type derived from tbb::tbb_exception is intercepted by the TBB scheduler in one of the worker threads, it is delivered to and re-thrown in the root thread. The root thread is the thread that has started the outermost algorithm or root task sharing the same task_group_context with the guilty algorithm/task (the one that threw the exception first).
-
Note: when documentation mentions workers with respect to exception handling, masters are implied as well, because they are completely equivalent in this context. Consequently a root thread can be master or worker thread.
-
NOTE: In case of nested algorithms or complex task hierarchies when the nested levels share (explicitly or by means of implicit inheritance) the task group context of the outermost level, the exception may be (re-)thrown multiple times (ultimately - in each worker on each nesting level) before reaching the root thread at the outermost level. IMPORTANT: if you intercept an exception derived from this class on a nested level, you must re-throw it in the catch block by means of the "throw;" operator.
-
TBB provides two implementations of this interface: tbb::captured_exception and template class tbb::movable_exception . See their declarations for more info.
+
Represents acquisition of a mutex.
-
+
@@ -97,78 +102,10 @@
- virtual void tbb::tbb_exception::destroy
+ bool tbb::spin_mutex::scoped_lock::try_acquire
(
- )
-
-
-
- throw (
-
-
- )
-
-
-
-
-pure virtual
-
-
-
-
-
-
-
-
-
-
-
-
- virtual tbb_exception * tbb::tbb_exception::move
- (
- )
-
-
-
- throw (
-
-
- )
-
-
-
-
-pure virtual
-
-
-
-
-
-
-
-
-
-
-
-
- void tbb::tbb_exception::operator delete
- (
- void *
- p )
+ spin_mutex &
+ m )
@@ -178,41 +115,14 @@
-
Operator delete is provided only to allow using existing smart pointers with TBB exception objects obtained as the result of applying move() operation on an exception thrown out of TBB scheduler.
-
When overriding method move() make sure to override operator delete as well if memory is allocated not by TBB's scalable allocator.
-
-
-
-
-
-
-
-
-
-
-
- virtual void tbb::tbb_exception::throw_self
- (
- )
-
-
-
-
-
-pure virtual
-
-
-
-
-
Throws this exception object.
-
Make sure that if you have several levels of derivation from this interface you implement or override this method on the most derived level. The implementation is as simple as "throw *this;". Failure to do this will result in exception of a base class type being thrown.
-
Implemented in tbb::movable_exception< ExceptionData > , and tbb::captured_exception .
+
Try acquiring lock (non-blocking)
+
Return true if lock acquired; false otherwise.
The documentation for this class was generated from the following file:
-tbb_exception.h
+spin_mutex.h
diff --git a/doc/html/a00163.png b/doc/html/a00163.png
index a067095e06..25da9c6ba0 100644
Binary files a/doc/html/a00163.png and b/doc/html/a00163.png differ
diff --git a/doc/html/a00164.html b/doc/html/a00164.html
index 51bef62b38..1959cbbbaa 100644
--- a/doc/html/a00164.html
+++ b/doc/html/a00164.html
@@ -4,7 +4,7 @@
-tbb::internal::tbb_exception_ptr Class Reference
+tbb::queuing_mutex::scoped_lock Class Reference
@@ -33,77 +33,89 @@
+tbb::queuing_mutex::scoped_lock Class Reference
-
Exception container that preserves the exact copy of the original exception.
+
The scoped locking pattern.
More...
-
#include <tbb_exception.h>
+
#include <queuing_mutex.h>
+
+
+
+
+
+
+
-void destroy () throw ()
- Destroys this objects. More...
-
-
-void throw_self ()
- Throws the contained exception .
-
-
-
Exception container that preserves the exact copy of the original exception.
-
This class can be used only when the appropriate runtime support (mandated by C++0x) is present
-
-
+
The scoped locking pattern.
+
It helps to avoid the common problem of forgetting to release lock. It also nicely provides the "node" for queuing locks.
+
+
+
+
+
- void tbb::internal::tbb_exception_ptr::destroy
+ tbb::queuing_mutex::scoped_lock::scoped_lock
(
)
-
- throw (
-
-
- )
-
+
+
+inline
+
+
-
Destroys this objects.
-
Note that objects of this type can be created only by the allocate() method.
+
Construct lock that has not acquired a mutex.
+
Equivalent to zero-initialization of *this.
The documentation for this class was generated from the following file:
-tbb_exception.h
+queuing_mutex.h
diff --git a/doc/html/a00137.png b/doc/html/a00164.png
similarity index 100%
rename from doc/html/a00137.png
rename to doc/html/a00164.png
diff --git a/doc/html/a00165.html b/doc/html/a00165.html
index 4aecd0fa3e..c4361b967e 100644
--- a/doc/html/a00165.html
+++ b/doc/html/a00165.html
@@ -4,7 +4,7 @@
-tbb::internal::tbb_thread_v3 Class Reference
+tbb::spin_rw_mutex_v3::scoped_lock Class Reference
@@ -33,117 +33,114 @@
+tbb::spin_rw_mutex_v3::scoped_lock Class Reference
-
Versioned thread class.
+
The scoped locking pattern.
More...
-
#include <tbb_thread.h>
+
#include <spin_rw_mutex.h>
+
+
+
+
+
+
+
-
-
-typedef HANDLE native_handle_type
-
-
-typedef pthread_t native_handle_type
-
-
-
- tbb_thread_v3 (const tbb_thread_v3 &)
-
-
- tbb_thread_v3 () __TBB_NOEXCEPT(true)
- Constructs a thread object that does not represent a thread of execution.
-
-
-template<class F >
- tbb_thread_v3 (F f)
- Constructs an object and executes f() in a new thread.
-
-
-template<class F , class X >
- tbb_thread_v3 (F f, X x)
- Constructs an object and executes f(x) in a new thread.
-
-
-template<class F , class X , class Y >
- tbb_thread_v3 (F f, X x, Y y)
- Constructs an object and executes f(x,y) in a new thread.
-
-
-tbb_thread_v3 & operator= (tbb_thread_v3 &x)
-
-
-void swap (tbb_thread_v3 &t) __TBB_NOEXCEPT(true)
-
-
-bool joinable () const __TBB_NOEXCEPT(true)
-
-
-void __TBB_EXPORTED_METHOD join ()
- The completion of the thread represented by *this happens before join() returns.
-
-
-void __TBB_EXPORTED_METHOD detach ()
- When detach() returns, *this no longer represents the possibly continuing thread of execution.
-
-
-id get_id () const __TBB_NOEXCEPT(true)
-
-
-native_handle_type native_handle ()
-
-
-
Versioned thread class.
-
-
+
The scoped locking pattern.
+
It helps to avoid the common problem of forgetting to release lock. It also nicely provides the "node" for queuing locks.
+
+
+
+
+
+
+
+
+
+ tbb::spin_rw_mutex_v3::scoped_lock::scoped_lock
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Construct lock that has not acquired a mutex.
+
Equivalent to zero-initialization of *this.
+
+
+
+
+
@@ -151,7 +148,7 @@
- static unsigned __TBB_EXPORTED_FUNC tbb::internal::tbb_thread_v3::hardware_concurrency
+ bool tbb::spin_rw_mutex_v3::scoped_lock::upgrade_to_writer
(
)
@@ -159,19 +156,46 @@
-static
+inline
+
+
+
+
+
Upgrade reader to become a writer.
+
Returns whether the upgrade happened without releasing and re-acquiring the lock
+
+
References is_writer .
+
+
+
+
+
+
+
+
+
+
+
+
+ bool tbb::spin_rw_mutex_v3::scoped_lock::is_writer
+
+
+
+
+protected
-
The number of hardware thread contexts.
-
Before TBB 3.0 U4 this methods returned the number of logical CPU in the system. Currently on Windows, Linux and FreeBSD it returns the number of logical CPUs available to the current process in accordance with its affinity mask.
-
NOTE: The return value of this method never changes after its first invocation. This means that changes in the process affinity mask that took place after this method was first invoked will not affect the number of worker threads in the TBB worker threads pool.
+
If mutex!=NULL, then is_writer is true if holding a writer lock, false if holding a reader lock.
+
Not defined if not holding a lock.
+
+
Referenced by acquire() , downgrade_to_reader() , release() , try_acquire() , and upgrade_to_writer() .
The documentation for this class was generated from the following file:
-tbb_thread.h
+spin_rw_mutex.h
diff --git a/doc/html/a00165.png b/doc/html/a00165.png
new file mode 100644
index 0000000000..13249c6a5c
Binary files /dev/null and b/doc/html/a00165.png differ
diff --git a/doc/html/a00166.html b/doc/html/a00166.html
index 5747962d90..2734d88658 100644
--- a/doc/html/a00166.html
+++ b/doc/html/a00166.html
@@ -4,7 +4,7 @@
-tbb::thread_bound_filter Class Reference
+tbb::recursive_mutex::scoped_lock Class Reference
@@ -33,120 +33,70 @@
+tbb::recursive_mutex::scoped_lock Class Reference
-
A stage in a pipeline served by a user thread.
+
The scoped locking pattern.
More...
-
#include <pipeline.h>
+
#include <recursive_mutex.h>
+Inheritance diagram for tbb::recursive_mutex::scoped_lock:
-
-
-
+
+
-
-enum result_type { success ,
-item_not_available ,
-end_of_stream
- }
-
-
-result_type __TBB_EXPORTED_METHOD try_process_item ()
- If a data item is available, invoke operator() on that item. More...
-
-result_type __TBB_EXPORTED_METHOD process_item ()
- Wait until a data item becomes available, and invoke operator() on that item. More...
-
-
-
-
-
-static const unsigned char filter_is_serial = 0x1
- The lowest bit 0 is for parallel vs. serial.
-
-static const unsigned char filter_is_out_of_order = 0x1<<4
- 4th bit distinguishes ordered vs unordered filters. More...
-
-
-static const unsigned char filter_is_bound = 0x1<<5
- 5th bit distinguishes thread-bound and regular filters.
-
-
-static const unsigned char filter_may_emit_null = 0x1<<6
- 6th bit marks input filters emitting small objects
-
-static const unsigned char exact_exception_propagation
- 7th bit defines exception propagation mode expected by the application. More...
-
+
+
+class recursive_mutex
+
-A stage in a pipeline served by a user thread.
-
-
-
-
-
-
- result_type __TBB_EXPORTED_METHOD tbb::thread_bound_filter::process_item
- (
- )
-
-
-
-
-
-
Wait until a data item becomes available, and invoke operator() on that item.
-
This interface is blocking. Returns 'success' if an item was processed. Returns 'end_of_stream' if there are no more items to process. Never returns 'item_not_available', as it blocks until another return condition applies.
-
-
-
-
-
-
-
-
- result_type __TBB_EXPORTED_METHOD tbb::thread_bound_filter::try_process_item
- (
- )
-
-
-
-
-
-
If a data item is available, invoke operator() on that item.
-
This interface is non-blocking. Returns 'success' if an item was processed. Returns 'item_not_available' if no item can be processed now but more may arrive in the future, or if token limit is reached. Returns 'end_of_stream' if there are no more items to process.
-
-
-
- The documentation for this class was generated from the following file:
-pipeline.h
+The scoped locking pattern.
+
It helps to avoid the common problem of forgetting to release lock. It also nicely provides the "node" for queuing locks.
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00166.png b/doc/html/a00166.png
index 7eab1d5112..9d4ec98b91 100644
Binary files a/doc/html/a00166.png and b/doc/html/a00166.png differ
diff --git a/doc/html/a00167.html b/doc/html/a00167.html
index ad1b2994bd..a3e9ae23a3 100644
--- a/doc/html/a00167.html
+++ b/doc/html/a00167.html
@@ -4,7 +4,7 @@
-tbb::internal::thread_closure_0< F > Struct Template Reference
+tbb::queuing_rw_mutex::scoped_lock Class Reference
@@ -33,56 +33,115 @@
+tbb::queuing_rw_mutex::scoped_lock Class Reference
+
+
The scoped locking pattern.
+ More...
+
+
#include <queuing_rw_mutex.h>
+Inheritance diagram for tbb::queuing_rw_mutex::scoped_lock:
-
-
-
+
+
-
- thread_closure_0 (const F &f)
-
-
-
-void * operator new (size_t size)
-
-
-void operator delete (void *ptr)
-
-
-
-
-static __TBB_NATIVE_THREAD_ROUTINE start_routine (void *c)
-
-
- The documentation for this struct was generated from the following file:
-tbb_thread.h
+
+The scoped locking pattern.
+
It helps to avoid the common problem of forgetting to release lock. It also nicely provides the "node" for queuing locks.
+
+
+
+
+
+
+
+
+
+ tbb::queuing_rw_mutex::scoped_lock::scoped_lock
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Construct lock that has not acquired a mutex.
+
Equivalent to zero-initialization of *this.
+
+
+
+
+
+
+
+
+
+ bool tbb::queuing_rw_mutex::scoped_lock::upgrade_to_writer
+ (
+ )
+
+
+
+
+
+
Upgrade reader to become a writer.
+
Returns whether the upgrade happened without releasing and re-acquiring the lock
+
+
+
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00167.png b/doc/html/a00167.png
index ca33e7fe18..227e99a9e7 100644
Binary files a/doc/html/a00167.png and b/doc/html/a00167.png differ
diff --git a/doc/html/a00168.html b/doc/html/a00168.html
index 874bc9cd82..201f5e6daf 100644
--- a/doc/html/a00168.html
+++ b/doc/html/a00168.html
@@ -4,7 +4,7 @@
-tbb::internal::thread_closure_1< F, X > Struct Template Reference
+tbb::null_mutex::scoped_lock Class Reference
@@ -33,70 +33,50 @@
+tbb::null_mutex::scoped_lock Class Reference
-
Structure used to pass user function with 1 argument to thread.
+
Represents acquisition of a mutex.
More...
-
#include <tbb_thread.h>
+
#include <null_mutex.h>
+Inheritance diagram for tbb::null_mutex::scoped_lock:
-
-
-
+
+
-
- thread_closure_1 (const F &f, const X &x)
-
-
-
-void * operator new (size_t size)
-
-
-void operator delete (void *ptr)
-
-
-
-
-static __TBB_NATIVE_THREAD_ROUTINE start_routine (void *c)
- Routine passed to Windows's _beginthreadex by thread::internal_start() inside tbb.dll.
-
-
-
-
-F function
-
-
-X arg1
-
+
+ scoped_lock (null_mutex &)
+
+
+void acquire (null_mutex &)
+
+
+bool try_acquire (null_mutex &)
+
+
+void release ()
+
-template<class F, class X>
-struct tbb::internal::thread_closure_1< F, X >
-
-
Structure used to pass user function with 1 argument to thread.
-
The documentation for this struct was generated from the following file:
-tbb_thread.h
+Represents acquisition of a mutex.
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00168.png b/doc/html/a00168.png
index 961925b534..d8565aa377 100644
Binary files a/doc/html/a00168.png and b/doc/html/a00168.png differ
diff --git a/doc/html/a00169.html b/doc/html/a00169.html
index ca9522e19e..b841c5284b 100644
--- a/doc/html/a00169.html
+++ b/doc/html/a00169.html
@@ -4,7 +4,7 @@
-tbb::internal::thread_closure_2< F, X, Y > Struct Template Reference
+tbb::interface5::reader_writer_lock::scoped_lock Class Reference
@@ -33,63 +33,60 @@
+tbb::interface5::reader_writer_lock::scoped_lock Class Reference
+
+
The scoped lock pattern for write locks.
+ More...
+
+
#include <reader_writer_lock.h>
+Inheritance diagram for tbb::interface5::reader_writer_lock::scoped_lock:
-
-
-
+
+
-
- thread_closure_2 (const F &f, const X &x, const Y &y)
-
-
-
-void * operator new (size_t size)
-
-
-void operator delete (void *ptr)
-
+
+ scoped_lock (reader_writer_lock &lock )
+ Construct with blocking attempt to acquire write lock on the passed-in lock.
+
+
+ ~scoped_lock ()
+ Destructor, releases the write lock.
+
+
+void * operator new (size_t s)
+
+
+void operator delete (void *p)
+
-
-
-static __TBB_NATIVE_THREAD_ROUTINE start_routine (void *c)
- Routine passed to Windows's _beginthreadex by thread::internal_start() inside tbb.dll.
-
-
-
-
-F function
-
-
-X arg1
-
-
-Y arg2
-
+
+
+class reader_writer_lock
+
- The documentation for this struct was generated from the following file:
-tbb_thread.h
+
+The scoped lock pattern for write locks.
+
Scoped locks help avoid the common problem of forgetting to release the lock. This type also serves as the node for queuing locks.
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00169.png b/doc/html/a00169.png
index aa52099a9d..a999a7d0cd 100644
Binary files a/doc/html/a00169.png and b/doc/html/a00169.png differ
diff --git a/doc/html/a00170.html b/doc/html/a00170.html
index b465d67132..683e408793 100644
--- a/doc/html/a00170.html
+++ b/doc/html/a00170.html
@@ -4,7 +4,7 @@
-tbb::internal::thread_closure_base Struct Reference
+tbb::null_rw_mutex::scoped_lock Class Reference
@@ -33,40 +33,56 @@
+tbb::null_rw_mutex::scoped_lock Class Reference
+
+
Represents acquisition of a mutex.
+ More...
+
+
#include <null_rw_mutex.h>
+Inheritance diagram for tbb::null_rw_mutex::scoped_lock:
-
-
-
-
-
+
+
-
-void * operator new (size_t size)
-
-
-void operator delete (void *ptr)
-
+
+ scoped_lock (null_rw_mutex &, bool=true)
+
+
+void acquire (null_rw_mutex &, bool=true)
+
+
+bool upgrade_to_writer ()
+
+
+bool downgrade_to_reader ()
+
+
+bool try_acquire (null_rw_mutex &, bool=true)
+
+
+void release ()
+
- The documentation for this struct was generated from the following file:
-tbb_thread.h
+
+Represents acquisition of a mutex.
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00170.png b/doc/html/a00170.png
index 0324577e72..081a54dff5 100644
Binary files a/doc/html/a00170.png and b/doc/html/a00170.png differ
diff --git a/doc/html/a00171.html b/doc/html/a00171.html
index a32329107e..d41c0c38a7 100644
--- a/doc/html/a00171.html
+++ b/doc/html/a00171.html
@@ -4,7 +4,7 @@
-tbb::tick_count Class Reference
+tbb::internal::critical_section_v4::scoped_lock Class Reference
@@ -33,61 +33,34 @@
+tbb::internal::critical_section_v4::scoped_lock Class Reference
-
-
Absolute timestamp.
- More...
-
-
#include <tick_count.h>
+
+
+
+
+
+
+
-
- tick_count ()
- Construct an absolute timestamp initialized to zero.
-
-
-
-
-static tick_count now ()
- Return current time.
-
-
-static double resolution ()
- Return the resolution of the clock in seconds per tick.
-
-
-
-
The documentation for this class was generated from the following file:
-tick_count.h
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00171.png b/doc/html/a00171.png
new file mode 100644
index 0000000000..15626cfa0f
Binary files /dev/null and b/doc/html/a00171.png differ
diff --git a/doc/html/a00172.html b/doc/html/a00172.html
index 29ee5a8128..56e3688c7e 100644
--- a/doc/html/a00172.html
+++ b/doc/html/a00172.html
@@ -4,7 +4,7 @@
-tbb::interface5::internal::use_element_copy_constructor< T, C > Struct Template Reference
+tbb::mutex::scoped_lock Class Reference
@@ -33,29 +33,70 @@
+tbb::mutex::scoped_lock Class Reference
+
+
The scoped locking pattern.
+ More...
+
+
#include <mutex.h>
+
+
+
+
+
+
+
-
-
-typedef tbb::internal::true_type type
-
-
-typedef tbb::internal::true_type type
-
+
+
+ scoped_lock ()
+ Construct lock that has not acquired a mutex.
+
+
+ scoped_lock (mutex &mutex )
+ Acquire lock on given mutex.
+
+
+ ~scoped_lock ()
+ Release lock (if lock is held).
+
+
+void acquire (mutex &mutex )
+ Acquire lock on given mutex.
+
+
+bool try_acquire (mutex &mutex )
+ Try acquire lock on given mutex.
+
+
+void release ()
+ Release lock.
+
+
-
The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00172.png b/doc/html/a00172.png
new file mode 100644
index 0000000000..5450176d7f
Binary files /dev/null and b/doc/html/a00172.png differ
diff --git a/doc/html/a00173.html b/doc/html/a00173.html
index 8c5382be00..4cdca67c6e 100644
--- a/doc/html/a00173.html
+++ b/doc/html/a00173.html
@@ -4,7 +4,7 @@
-tbb::interface5::internal::use_element_copy_constructor< T, false > Struct Template Reference
+tbb::interface5::reader_writer_lock::scoped_lock_read Class Reference
@@ -33,26 +33,59 @@
+tbb::interface5::reader_writer_lock::scoped_lock_read Class Reference
+
+
The scoped lock pattern for read locks.
+ More...
+
+
#include <reader_writer_lock.h>
+
+
+
+
+
+
+
-
-
-typedef tbb::internal::false_type type
-
+
+
+ scoped_lock_read (reader_writer_lock &lock )
+ Construct with blocking attempt to acquire read lock on the passed-in lock.
+
+
+ ~scoped_lock_read ()
+ Destructor, releases the read lock.
+
+
+void * operator new (size_t s)
+
+
+void operator delete (void *p)
+
+
+
+
+class reader_writer_lock
+
-
The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00173.png b/doc/html/a00173.png
new file mode 100644
index 0000000000..10066bd980
Binary files /dev/null and b/doc/html/a00173.png differ
diff --git a/doc/html/a00174.html b/doc/html/a00174.html
index 0101ac53c0..61e7172953 100644
--- a/doc/html/a00174.html
+++ b/doc/html/a00174.html
@@ -4,7 +4,7 @@
-tbb::user_abort Class Reference
+tbb::flow::interface8::sender< T > Class Template Reference
@@ -33,41 +33,110 @@
+tbb::flow::interface8::sender< T > Class Template Referenceabstract
-
Exception for user-initiated abort.
+
Pure virtual template class that defines a sender of messages of type T.
More...
-
#include <tbb_exception.h>
+
#include <flow_graph.h>
+Inheritance diagram for tbb::flow::interface8::sender< T >:
-
-
+
+
+
+
+
+
+
+
+
+
-
-const char * what () const throw ()
-
+
+virtual bool register_successor (successor_type &r)=0
+ Add a new successor to this node.
+
+
+virtual bool remove_successor (successor_type &r)=0
+ Removes a successor from this node.
+
+
+virtual bool try_get (T &)
+ Request an item from the sender.
+
+
+virtual bool try_reserve (T &)
+ Reserves an item in the sender.
+
+
+virtual bool try_release ()
+ Releases the reserved item.
+
+
+virtual bool try_consume ()
+ Consumes the reserved item.
+
+
+virtual built_successors_type & built_successors ()=0
+
+
+virtual void internal_add_built_successor (successor_type &)=0
+
+
+virtual void internal_delete_built_successor (successor_type &)=0
+
+
+virtual void copy_successors (successor_list_type &)=0
+
+
+virtual size_t successor_count ()=0
+
-Exception for user-initiated abort.
+
template<typename T>
+class tbb::flow::interface8::sender< T >
+
+
Pure virtual template class that defines a sender of messages of type T.
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00174.png b/doc/html/a00174.png
index a1f23345c2..f8d0e860bb 100644
Binary files a/doc/html/a00174.png and b/doc/html/a00174.png differ
diff --git a/doc/html/a00175.html b/doc/html/a00175.html
index 382dcc6575..9dcce5ad1e 100644
--- a/doc/html/a00175.html
+++ b/doc/html/a00175.html
@@ -4,7 +4,7 @@
-tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare Class Reference
+tbb::flow::interface8::sender< dependency_msg< T, Factory > > Class Template Reference
@@ -33,51 +33,69 @@
+tbb::flow::interface8::sender< dependency_msg< T, Factory > > Class Template Referenceabstract
+Inheritance diagram for tbb::flow::interface8::sender< dependency_msg< T, Factory > >:
-
-
+
+
+
-
-bool operator() (const value_type &left, const value_type &right) const
-
-
- value_compare (const hash_compare &comparator)
-
-
-
-
-hash_compare my_hash_compare
-
-
The documentation for this class was generated from the following file:
-concurrent_unordered_map.h
+flow_graph_opencl_node.h
diff --git a/doc/html/a00175.png b/doc/html/a00175.png
index d6754637d9..f942f222c6 100644
Binary files a/doc/html/a00175.png and b/doc/html/a00175.png differ
diff --git a/doc/html/a00176.html b/doc/html/a00176.html
index a394185d27..f9bddddae2 100644
--- a/doc/html/a00176.html
+++ b/doc/html/a00176.html
@@ -4,7 +4,7 @@
-tbb::vector_iterator< Container, Value > Class Template Reference
+tbb::flow::interface8::sequencer_node< T, A > Class Template Reference
@@ -33,16 +33,353 @@
-
The documentation for this class was generated from the following file:
-concurrent_vector.h
+
+Forwards messages in sequence order.
+ More...
+
+#include <flow_graph.h>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+enum op_stat { WAIT =0,
+SUCCEEDED ,
+FAILED
+ }
+
+
+typedef buffer_node < T, A >
+::size_type size_type
+
+
+typedef buffer_node < T, A >
+::buffer_operation sequencer_operation
+
+
+enum op_stat { WAIT =0,
+SUCCEEDED ,
+FAILED
+ }
+
+
+typedef buffer_node < T, A > base_type
+
+
+typedef base_type::size_type size_type
+
+
+typedef base_type::buffer_operation queue_operation
+
+
+enum op_type {
+ reg_succ ,
+rem_succ ,
+req_item ,
+res_item ,
+
+ rel_res ,
+con_res ,
+put_item ,
+try_fwd_task ,
+
+ add_blt_succ ,
+del_blt_succ ,
+add_blt_pred ,
+del_blt_pred ,
+
+ blt_succ_cnt ,
+blt_pred_cnt ,
+blt_succ_cpy ,
+blt_pred_cpy
+
+ }
+
+enum op_stat { WAIT =0,
+SUCCEEDED ,
+FAILED
+ }
+
+
+typedef size_t size_type
+
+
+typedef
+internal::aggregating_functor
+< class_type , buffer_operation > handler_type
+
+
+typedef sender < T >
+::built_successors_type built_successors_type
+
+
+typedef receiver < T >
+::built_predecessors_type built_predecessors_type
+
+
+
+template<typename T, typename A = cache_aligned_allocator<T>>
+class tbb::flow::interface8::sequencer_node< T, A >
+
+
Forwards messages in sequence order.
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00145.png b/doc/html/a00176.png
similarity index 100%
rename from doc/html/a00145.png
rename to doc/html/a00176.png
diff --git a/doc/html/a00177.html b/doc/html/a00177.html
index 22b25c021d..8ce4effac5 100644
--- a/doc/html/a00177.html
+++ b/doc/html/a00177.html
@@ -4,7 +4,7 @@
-tbb::flow::interface8::write_once_node< T > Class Template Reference
+tbb::flow::interface8::source_node< Output > Class Template Reference
@@ -33,7 +33,7 @@
+List of all members
+tbb::flow::interface8::source_node< Output > Class Template Reference
+
+
An executable node that acts as a source, i.e. it has no predecessors.
+ More...
+
+
#include <flow_graph.h>
+Inheritance diagram for tbb::flow::interface8::source_node< Output >:
-
-
-
-
-
-
+
+
+
+
-
-task * try_put_task (const T &v)
-
-
-
-void reset_receiver (reset_flags)
-
-
-void reset_node (reset_flags f)
-
-
-
-virtual bool is_continue_receiver ()
-
+
+void reset_node (reset_flags f)
+ resets the source_node to its initial state
+
-
-template<typename R , typename B >
-class run_and_put_task
-
-
-template<typename X , typename Y >
-class internal::broadcast_cache
-
-
-template<typename X , typename Y >
-class internal::round_robin_cache
-
+
+class internal::source_task_bypass< source_node< output_type > >
+
+
+template<typename Output>
+class tbb::flow::interface8::source_node< Output >
+
+
An executable node that acts as a source, i.e. it has no predecessors.
+
+
+
+
+
+template<typename Output >
+
+
+
+
+
+
+inline virtual
+
+
+
The documentation for this class was generated from the following file:
diff --git a/doc/html/a00177.png b/doc/html/a00177.png
index 6919a098df..a8bbd54a47 100644
Binary files a/doc/html/a00177.png and b/doc/html/a00177.png differ
diff --git a/doc/html/a00178.html b/doc/html/a00178.html
index 8708a63961..491f3e19ef 100644
--- a/doc/html/a00178.html
+++ b/doc/html/a00178.html
@@ -4,7 +4,7 @@
-tbb::zero_allocator< T, Allocator > Class Template Reference
+tbb::spin_mutex Class Reference
@@ -33,93 +33,142 @@
+tbb::spin_mutex Class Reference
-
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
+
A lock that occupies a single byte.
More...
-
#include <tbb_allocator.h>
+
#include <spin_mutex.h>
+Inheritance diagram for tbb::spin_mutex:
-
-
+
+
-
-
-typedef Allocator< T > base_allocator_type
-
-
-typedef
-base_allocator_type::value_type value_type
-
-
-typedef
-base_allocator_type::pointer pointer
-
-
-typedef
-base_allocator_type::const_pointer const_pointer
-
-
-typedef
-base_allocator_type::reference reference
-
-
-typedef
-base_allocator_type::const_reference const_reference
-
-
-typedef
-base_allocator_type::size_type size_type
-
-
-typedef
-base_allocator_type::difference_type difference_type
-
-
-
- zero_allocator (const zero_allocator &a) throw ()
-
-
-template<typename U >
- zero_allocator (const zero_allocator < U > &a) throw ()
-
-
-pointer allocate (const size_type n, const void *hint=0)
-
+ spin_mutex ()
+ Construct unacquired lock. More...
+
+
+void __TBB_EXPORTED_METHOD internal_construct ()
+ Internal constructor with ITT instrumentation.
+
+
+void lock ()
+ Acquire lock.
+
+bool try_lock ()
+ Try acquiring lock (non-blocking) More...
+
+
+void unlock ()
+ Release lock.
+
+
+
+
+static const bool is_rw_mutex = false
+
+
+static const bool is_recursive_mutex = false
+
+
+static const bool is_fair_mutex = false
+
+
-template<typename T, template< typename X > class Allocator = tbb_allocator>
-class tbb::zero_allocator< T, Allocator >
+
A lock that occupies a single byte.
+
A spin_mutex is a spin mutex that fits in a single byte. It should be used only for locking short critical sections (typically less than 20 instructions) when fairness is not an issue. If zero-initialized, the mutex is considered unheld.
+
+
+
+
+
+
+
+
+
+ tbb::spin_mutex::spin_mutex
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Construct unacquired lock.
+
Equivalent to zero-initialization of *this.
+
+
References internal_construct() .
+
+
+
+
+
+
+
+
+
+
+
+
+ bool tbb::spin_mutex::try_lock
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Try acquiring lock (non-blocking)
+
Return true if lock acquired; false otherwise.
-
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
-
The class is an adapter over an actual allocator that fills the allocation using memset function with template argument C as the value. The members are ordered the same way they are in section 20.4.1 of the ISO C++ standard.
-
The documentation for this class was generated from the following file:
+
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00178.png b/doc/html/a00178.png
index f03aec2f32..5dfc58974f 100644
Binary files a/doc/html/a00178.png and b/doc/html/a00178.png differ
diff --git a/doc/html/a00179.html b/doc/html/a00179.html
index 5fd4d14323..a0f523e76c 100644
--- a/doc/html/a00179.html
+++ b/doc/html/a00179.html
@@ -4,7 +4,7 @@
-tbb::zero_allocator< void, Allocator > Class Template Reference
+tbb::spin_rw_mutex_v3 Class Reference
@@ -33,62 +33,196 @@
+tbb::spin_rw_mutex_v3 Class Reference
-
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
+
Fast, unfair, spinning reader-writer lock with backoff and writer-preference.
More...
-
#include <tbb_allocator.h>
+
#include <spin_rw_mutex.h>
+Inheritance diagram for tbb::spin_rw_mutex_v3:
-
-
+
+
-
-
-typedef Allocator< void > base_allocator_type
-
-
-typedef
-base_allocator_type::value_type value_type
-
-
-typedef
-base_allocator_type::pointer pointer
-
-
-typedef
-base_allocator_type::const_pointer const_pointer
-
+
+
+ spin_rw_mutex_v3 ()
+ Construct unacquired mutex.
+
+
+ ~spin_rw_mutex_v3 ()
+ Destructor asserts if the mutex is acquired, i.e. state is zero.
+
+
+void lock ()
+ Acquire writer lock.
+
+bool try_lock ()
+ Try acquiring writer lock (non-blocking) More...
+
+
+void unlock ()
+ Release lock.
+
+
+void lock_read ()
+ Acquire reader lock.
+
+bool try_lock_read ()
+ Try acquiring reader lock (non-blocking) More...
+
+
+
+
+static const bool is_rw_mutex = true
+
+
+static const bool is_recursive_mutex = false
+
+
+static const bool is_fair_mutex = false
+
+
+
+
+typedef intptr_t state_t
+
+
+
+
+static const state_t WRITER = 1
+
+
+static const state_t WRITER_PENDING = 2
+
+
+static const state_t READERS = ~(WRITER | WRITER_PENDING)
+
+
+static const state_t ONE_READER = 4
+
+
+static const state_t BUSY = WRITER | READERS
+
-template<template< typename T > class Allocator>
-class tbb::zero_allocator< void, Allocator >
+
Fast, unfair, spinning reader-writer lock with backoff and writer-preference.
+
+
+
+
+
+
+
+
+
+ bool tbb::spin_rw_mutex_v3::try_lock
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Try acquiring writer lock (non-blocking)
+
Return true if lock acquired; false otherwise.
+
+
+
+
+
+
+
+
+
+
+
+ bool tbb::spin_rw_mutex_v3::try_lock_read
+ (
+ )
+
+
+
+
+
+inline
+
+
+
-
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
-
The documentation for this class was generated from the following file:
-tbb_allocator.h
+Try acquiring reader lock (non-blocking)
+Return true if reader lock acquired; false otherwise.
+
+
+
+
+
+
+
+
+
+
+
+
+ state_t tbb::spin_rw_mutex_v3::state
+
+
+
+
+protected
+
+
+
+
+ The documentation for this class was generated from the following file:
diff --git a/doc/html/a00179.png b/doc/html/a00179.png
index f97e606d73..ff1efc94ee 100644
Binary files a/doc/html/a00179.png and b/doc/html/a00179.png differ
diff --git a/doc/html/a00180.html b/doc/html/a00180.html
new file mode 100644
index 0000000000..9d130f9777
--- /dev/null
+++ b/doc/html/a00180.html
@@ -0,0 +1,173 @@
+
+
+
+
+
+
+tbb::flow::interface8::split_node< TupleType, Allocator > Class Template Reference
+
+
+
+
+
+
+
+
+
+
+
split_node : accepts a tuple as input, forwards each element of the tuple to its
+ More...
+
+
#include <flow_graph.h>
+
+
+
+
+
+
+
+
+
+
+
+
+typedef
+base_type::output_ports_type output_ports_type
+
+
+typedef base_type::output_type output_type
+
+
+typedef TupleType input_type
+
+
+typedef Allocator allocator_type
+
+
+
+typedef TupleType input_type
+
+
+typedef null_type output_type
+
+
+typedef
+internal::wrap_tuple_elements
+< N,
+internal::multifunction_output,
+TupleType >::type output_ports_type
+
+
+typedef
+internal::multifunction_input
+< input_type,
+output_ports_type, Allocator > fInput_type
+
+
+typedef
+internal::function_input_queue
+< input_type, Allocator > input_queue_type
+
+
+
+
+ split_node (graph &g)
+
+
+ split_node (const split_node &other)
+
+
+void set_name (const char *name)
+
+
+
+ multifunction_node (graph &g, size_t concurrency, Body body)
+
+
+ multifunction_node (const multifunction_node &other)
+
+
+void set_name (const char *name)
+
+
+void extract ()
+
+
+
+ graph_node (graph &g)
+
+
+
+
+
+void reset_node (reset_flags f)
+
+
+
+graph & my_graph
+
+
+graph_node * next
+
+
+graph_node * prev
+
+
+
+static const int N
+
+
+
+
template<typename TupleType, typename Allocator = cache_aligned_allocator<TupleType>>
+class tbb::flow::interface8::split_node< TupleType, Allocator >
+
+
split_node : accepts a tuple as input, forwards each element of the tuple to its
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00149.png b/doc/html/a00180.png
similarity index 100%
rename from doc/html/a00149.png
rename to doc/html/a00180.png
diff --git a/doc/html/a00181.html b/doc/html/a00181.html
new file mode 100644
index 0000000000..5dcd61a201
--- /dev/null
+++ b/doc/html/a00181.html
@@ -0,0 +1,118 @@
+
+
+
+
+
+
+tbb::structured_task_group Class Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+template<typename F >
+task_group_status run_and_wait (task_handle < F > &h)
+
+
+task_group_status wait ()
+
+
+
+ task_group_base (uintptr_t traits=0)
+
+
+template<typename F >
+void run (task_handle < F > &h)
+
+
+task_group_status wait ()
+
+
+bool is_canceling ()
+
+
+void cancel ()
+
+
+
+
+
+task & owner ()
+
+
+template<typename F >
+task_group_status internal_run_and_wait (F &f)
+
+
+template<typename F , typename Task >
+void internal_run (F &f)
+
+
+
+empty_task * my_root
+
+
+task_group_context my_context
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00150.png b/doc/html/a00181.png
similarity index 100%
rename from doc/html/a00150.png
rename to doc/html/a00181.png
diff --git a/doc/html/a00182.html b/doc/html/a00182.html
new file mode 100644
index 0000000000..ad4a01c0c5
--- /dev/null
+++ b/doc/html/a00182.html
@@ -0,0 +1,56 @@
+
+
+
+
+
+
+tbb::flow::interface8::internal::successor_cache< T, M > Class Template Reference
+
+
+
+
+
+
+
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00183.html b/doc/html/a00183.html
new file mode 100644
index 0000000000..9439b4f113
--- /dev/null
+++ b/doc/html/a00183.html
@@ -0,0 +1,386 @@
+
+
+
+
+
+
+tbb::interface7::task_arena Class Reference
+
+
+
+
+
+
+
+
+
+
+
#include <task_arena.h>
+
+
+
+
+
+
+
+
+
+ task_arena (int max_concurrency=automatic, unsigned reserved_for_masters=1)
+ Creates task_arena with certain concurrency limits. More...
+
+
+ task_arena (const task_arena &s)
+ Copies settings from another task_arena .
+
+
+ task_arena (tbb::internal::attach)
+ Creates an instance of task_arena attached to the current arena of the thread.
+
+
+void initialize ()
+ Forces allocation of the resources for the task_arena as specified in constructor arguments.
+
+
+void initialize (int max_concurrency, unsigned reserved_for_masters=1)
+ Overrides concurrency level and forces initialization of internal representation.
+
+void terminate ()
+
+ ~task_arena ()
+
+bool is_active () const
+
+template<typename F >
+void enqueue (const F &f)
+
+template<typename F >
+void enqueue (const F &f, priority_t p)
+
+template<typename F >
+void execute (F &f)
+
+template<typename F >
+void execute (const F &f)
+
+void debug_wait_until_empty ()
+
+
+
+
+static int current_thread_index ()
+ Returns the index, aka slot number, of the calling thread in its current arena.
+
+
+
+
+class tbb::internal::task_scheduler_observer_v3
+
+
+
+
1-to-1 proxy representation class of scheduler's arena Constructors set up settings only, real construction is deferred till the first method invocation Destructor only removes one of the references to the inner arena representation. Final destruction happens when all the references (and the work) are gone.
+
+
+
+
+
+
+
+
+
+ tbb::interface7::task_arena::task_arena
+ (
+ int
+ max_concurrency = automatic
,
+
+
+
+
+ unsigned
+ reserved_for_masters = 1
+
+
+
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Creates task_arena with certain concurrency limits.
+
Sets up settings only, real construction is deferred till the first method invocation
+
+max_concurrency specifies total number of slots in arena where threads work
+reserved_for_masters specifies number of slots to be used by master threads only. Value of 1 is default and reflects behavior of implicit arenas.
+
+
+
+
+
+
+
+
+
+
+
+
+ tbb::interface7::task_arena::~task_arena
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
Removes the reference to the internal arena representation, and destroys the external object. Not thread safe wrt concurrent invocations of other methods.
+
+
+
+
+
+
+
+
+
+
+
+
+ void tbb::interface7::task_arena::debug_wait_until_empty
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
Wait for all work in the arena to be completed Even submitted by other application threads Joins arena if/when possible (in the same way as execute() )
+
+
+
+
+
+
+
+template<typename F >
+
+
+
+
+
+ void tbb::interface7::task_arena::enqueue
+ (
+ const F &
+ f )
+
+
+
+
+
+inline
+
+
+
+
Enqueues a task into the arena to process a functor, and immediately returns. Does not require the calling thread to join the arena
+
+
+
+
+
+
+
+template<typename F >
+
+
+
+
+
+ void tbb::interface7::task_arena::enqueue
+ (
+ const F &
+ f ,
+
+
+
+
+ priority_t
+ p
+
+
+
+ )
+
+
+
+
+
+inline
+
+
+
+
Enqueues a task with priority p into the arena to process a functor f, and immediately returns. Does not require the calling thread to join the arena
+
+
+
+
+
+
+
+template<typename F >
+
+
+
+
+
+ void tbb::interface7::task_arena::execute
+ (
+ F &
+ f )
+
+
+
+
+
+inline
+
+
+
+
Joins the arena and executes a functor, then returns If not possible to join, wraps the functor into a task, enqueues it and waits for task completion Can decrement the arena demand for workers, causing a worker to leave and free a slot to the calling thread
+
+
+
+
+
+
+
+template<typename F >
+
+
+
+
+
+ void tbb::interface7::task_arena::execute
+ (
+ const F &
+ f )
+
+
+
+
+
+inline
+
+
+
+
Joins the arena and executes a functor, then returns If not possible to join, wraps the functor into a task, enqueues it and waits for task completion Can decrement the arena demand for workers, causing a worker to leave and free a slot to the calling thread
+
+
+
+
+
+
+
+
+
+
+
+ bool tbb::interface7::task_arena::is_active
+ (
+ )
+ const
+
+
+
+
+inline
+
+
+
+
Returns true if the arena is active (initialized); false otherwise. The name was chosen to match a task_scheduler_init method with the same semantics.
+
+
+
+
+
+
+
+
+
+
+
+ void tbb::interface7::task_arena::terminate
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
Removes the reference to the internal arena representation. Not thread safe wrt concurrent invocations of other methods.
+
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00152.png b/doc/html/a00183.png
similarity index 100%
rename from doc/html/a00152.png
rename to doc/html/a00183.png
diff --git a/doc/html/a00184.html b/doc/html/a00184.html
new file mode 100644
index 0000000000..8ddade1bfe
--- /dev/null
+++ b/doc/html/a00184.html
@@ -0,0 +1,127 @@
+
+
+
+
+
+
+tbb::task_group Class Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+template<typename F >
+void run (task_handle < F > &h)
+
+
+template<typename F >
+void run (const F &f)
+
+
+template<typename F >
+task_group_status run_and_wait (const F &f)
+
+
+template<typename F >
+task_group_status run_and_wait (task_handle < F > &h)
+
+
+
+ task_group_base (uintptr_t traits=0)
+
+
+template<typename F >
+void run (task_handle < F > &h)
+
+
+task_group_status wait ()
+
+
+bool is_canceling ()
+
+
+void cancel ()
+
+
+
+
+
+task & owner ()
+
+
+template<typename F >
+task_group_status internal_run_and_wait (F &f)
+
+
+template<typename F , typename Task >
+void internal_run (F &f)
+
+
+
+empty_task * my_root
+
+
+task_group_context my_context
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00153.png b/doc/html/a00184.png
similarity index 100%
rename from doc/html/a00153.png
rename to doc/html/a00184.png
diff --git a/doc/html/a00185.html b/doc/html/a00185.html
new file mode 100644
index 0000000000..0f4d9244e7
--- /dev/null
+++ b/doc/html/a00185.html
@@ -0,0 +1,114 @@
+
+
+
+
+
+
+tbb::internal::task_group_base Class Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ task_group_base (uintptr_t traits=0)
+
+
+template<typename F >
+void run (task_handle < F > &h)
+
+
+task_group_status wait ()
+
+
+bool is_canceling ()
+
+
+void cancel ()
+
+
+
+
+task & owner ()
+
+
+template<typename F >
+task_group_status internal_run_and_wait (F &f)
+
+
+template<typename F , typename Task >
+void internal_run (F &f)
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00154.png b/doc/html/a00185.png
similarity index 100%
rename from doc/html/a00154.png
rename to doc/html/a00185.png
diff --git a/doc/html/a00286.html b/doc/html/a00186.html
similarity index 72%
rename from doc/html/a00286.html
rename to doc/html/a00186.html
index 33c2a1ab4a..e471d5b5df 100644
--- a/doc/html/a00286.html
+++ b/doc/html/a00186.html
@@ -4,7 +4,7 @@
-Member List
+tbb::task_group_context Struct Reference
@@ -33,19 +33,22 @@
-
This is the complete list of members for tbb::pre_scan_tag , including all inherited members.
-
+#include <parallel_invoke.h>
+
+Dummy to avoid cluttering the bulk of the header with enormous amount of ifdefs.
+
The documentation for this struct was generated from the following file:
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00187.html b/doc/html/a00187.html
new file mode 100644
index 0000000000..42379a4f36
--- /dev/null
+++ b/doc/html/a00187.html
@@ -0,0 +1,91 @@
+
+
+
+
+
+
+tbb::task_handle< F > Class Template Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ task_handle (const F &f)
+
+
+void operator() () const
+
+
+
+
+template<typename _F >
+class internal::task_handle_task
+
+
+class task_group
+
+
+class structured_task_group
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00187.png b/doc/html/a00187.png
new file mode 100644
index 0000000000..5f640e9e73
Binary files /dev/null and b/doc/html/a00187.png differ
diff --git a/doc/html/a00266.html b/doc/html/a00188.html
similarity index 55%
rename from doc/html/a00266.html
rename to doc/html/a00188.html
index 31cafa2b8e..572565f8d2 100644
--- a/doc/html/a00266.html
+++ b/doc/html/a00188.html
@@ -4,7 +4,7 @@
-Member List
+tbb::internal::task_handle_task< F > Class Template Reference
@@ -33,22 +33,36 @@
-
-
This is the complete list of members for tbb::atomic< T > , including all inherited members.
-
+
+
+
+
+
+
+
+
+ The documentation for this class was generated from the following file:
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00188.png b/doc/html/a00188.png
new file mode 100644
index 0000000000..229263c622
Binary files /dev/null and b/doc/html/a00188.png differ
diff --git a/doc/html/a00189.html b/doc/html/a00189.html
new file mode 100644
index 0000000000..e49c2e9da2
--- /dev/null
+++ b/doc/html/a00189.html
@@ -0,0 +1,215 @@
+
+
+
+
+
+
+tbb::task_scheduler_init Class Reference
+
+
+
+
+
+
+
+
+
+
+
Class delimiting the scope of task scheduler activity.
+ More...
+
+
#include <task_scheduler_init.h>
+
+
+
+
+
+
+
+
+
+void __TBB_EXPORTED_METHOD initialize (int number_of_threads=automatic )
+ Ensure that scheduler exists for this thread. More...
+
+void __TBB_EXPORTED_METHOD initialize (int number_of_threads, stack_size_type thread_stack_size )
+ The overloaded method with stack size parameter. More...
+
+
+void __TBB_EXPORTED_METHOD terminate ()
+ Inverse of method initialize.
+
+
+ if (wait_workers_in_terminate) my_scheduler
+
+
+ initialize (number_of_threads, thread_stack_size )
+
+
+ ~task_scheduler_init ()
+ Destroy scheduler for this thread if thread has no other live task_scheduler_inits.
+
+
+bool is_active () const
+ Returns true if scheduler is active (initialized); false otherwise.
+
+
+
+static int __TBB_EXPORTED_FUNC default_num_threads ()
+ Returns the number of threads TBB scheduler would create if initialized by default. More...
+
+
+
+
+task_scheduler_init (int
+number_of_threads=automatic ,
+stack_size_type
+thread_stack_size=0, bool
+wait_workers_in_terminate=false) thread_stack_size = TBB_USE_CAPTURED_EXCEPTION ? propagation_mode_captured : propagation_mode_exact
+ Shorthand for default constructor followed by call to initialize(number_of_threads).
+
+
+
+
+static const int automatic = -1
+ Typedef for number of threads that is automatic.
+
+
+static const int deferred = -2
+ Argument to initialize() or constructor that causes initialization to be deferred.
+
+
+
+
Class delimiting the scope of task scheduler activity.
+
A thread can construct a task_scheduler_init object and keep it alive while it uses TBB's tasking subsystem (including parallel algorithms).
+
This class allows to customize properties of the TBB task pool to some extent. For example it can limit concurrency level of parallel work initiated by the given thread. It also can be used to specify stack size of the TBB worker threads, though this setting is not effective if the thread pool has already been created.
+
If a parallel construct is used without task_scheduler_init object previously created, the scheduler will be initialized automatically with default settings, and will persist until this thread exits. Default concurrency level is defined as described in task_scheduler_init::initialize() .
+
+
+
+
+
+
+
+
+
+ static int __TBB_EXPORTED_FUNC tbb::task_scheduler_init::default_num_threads
+ (
+ )
+
+
+
+
+
+static
+
+
+
+
+
Returns the number of threads TBB scheduler would create if initialized by default.
+
Result returned by this method does not depend on whether the scheduler has already been initialized.
+
Because tbb 2.0 does not support blocking tasks yet, you may use this method to boost the number of threads in the tbb's internal pool, if your tasks are doing I/O operations. The optimal number of additional threads depends on how much time your tasks spend in the blocked state.
+
Before TBB 3.0 U4 this method returned the number of logical CPU in the system. Currently on Windows, Linux and FreeBSD it returns the number of logical CPUs available to the current process in accordance with its affinity mask.
+
NOTE: The return value of this method never changes after its first invocation. This means that changes in the process affinity mask that took place after this method was first invoked will not affect the number of worker threads in the TBB worker threads pool.
+
+
+
+
+
+
+
+
+ void __TBB_EXPORTED_METHOD tbb::task_scheduler_init::initialize
+ (
+ int
+ number_of_threads = automatic
)
+
+
+
+
+
+
Ensure that scheduler exists for this thread.
+
A value of -1 lets TBB decide on the number of threads, which is usually maximal hardware concurrency for this process, that is the number of logical CPUs on the machine (possibly limited by the processor affinity mask of this process (Windows) or of this thread (Linux, FreeBSD). It is preferable option for production code because it helps to avoid nasty surprises when several TBB based components run side-by-side or in a nested fashion inside the same process.
+
The number_of_threads is ignored if any other task_scheduler_inits currently exist. A thread may construct multiple task_scheduler_inits. Doing so does no harm because the underlying scheduler is reference counted.
+
+
+
+
+
+
+
+
+ void __TBB_EXPORTED_METHOD tbb::task_scheduler_init::initialize
+ (
+ int
+ number_of_threads ,
+
+
+
+
+ stack_size_type
+ thread_stack_size
+
+
+
+ )
+
+
+
+
+
+
The overloaded method with stack size parameter.
+
Overloading is necessary to preserve ABI compatibility
+
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00158.png b/doc/html/a00189.png
similarity index 100%
rename from doc/html/a00158.png
rename to doc/html/a00189.png
diff --git a/doc/html/a00190.html b/doc/html/a00190.html
new file mode 100644
index 0000000000..bfcaaca054
--- /dev/null
+++ b/doc/html/a00190.html
@@ -0,0 +1,269 @@
+
+
+
+
+
+
+tbb::interface6::task_scheduler_observer Class Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+enum { keep_awake = false,
+allow_sleep = true
+ }
+ Return commands for may_sleep()
+
+
+
+
+class internal::task_scheduler_observer_v3
+
+
+class internal::observer_proxy
+
+
+class internal::observer_list
+
+
+
+
+
+
+
+
+
+
+
+ tbb::interface6::task_scheduler_observer::task_scheduler_observer
+ (
+ bool
+ local = false
)
+
+
+
+
+
+inline
+
+
+
+
+
Construct local or global observer in inactive state (observation disabled).
+
For a local observer entry/exit notifications are invoked whenever a worker thread joins/leaves the arena of the observer's owner thread. If a thread is already in the arena when the observer is activated, the entry notification is called before it executes the first stolen task. TODO: Obsolete. Global observer semantics is obsolete as it violates master thread isolation guarantees and is not composable. Thus the current default behavior of the constructor is obsolete too and will be changed in one of the future versions of the library.
+
+
+
+
+
+
+
+
+
+
+
+ tbb::interface6::task_scheduler_observer::task_scheduler_observer
+ (
+ task_arena &
+ a )
+
+
+
+
+
+inline
+
+
+
+
+
Construct local observer for a given arena in inactive state (observation disabled).
+
entry/exit notifications are invoked whenever a thread joins/leaves arena. If a thread is already in the arena when the observer is activated, the entry notification is called before it executes the first stolen task.
+
+
+
+
+
+
+
+
+
+
+
+ virtual tbb::interface6::task_scheduler_observer::~task_scheduler_observer
+ (
+ )
+
+
+
+
+
+inline virtual
+
+
+
+
Destructor protects instance of the observer from concurrent notification. It is recommended to disable observation before destructor of a derived class starts, otherwise it can lead to concurrent notification callback on partly destroyed object
+
+
References observe() .
+
+
+
+
+
+
+
+
+
+
+
+
+ virtual bool tbb::interface6::task_scheduler_observer::may_sleep
+ (
+ )
+
+
+
+
+
+inline virtual
+
+
+
+
+
The callback can be invoked by a worker thread before it goes to sleep.
+
If it returns false ('keep_awake'), the thread will keep spinning and looking for work. It will not be called for master threads.
+
+
+
+
+
+
+
+
+
+
+
+ void tbb::interface6::task_scheduler_observer::observe
+ (
+ bool
+ state = true
)
+
+
+
+
+
+inline
+
+
+
+
+
The documentation for this class was generated from the following file:
+task_scheduler_observer.h
+
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00159.png b/doc/html/a00190.png
similarity index 100%
rename from doc/html/a00159.png
rename to doc/html/a00190.png
diff --git a/doc/html/a00191.html b/doc/html/a00191.html
new file mode 100644
index 0000000000..da0c35029b
--- /dev/null
+++ b/doc/html/a00191.html
@@ -0,0 +1,185 @@
+
+
+
+
+
+
+tbb::internal::task_scheduler_observer_v3 Class Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+class observer_proxy
+
+
+class observer_list
+
+
+class interface6::task_scheduler_observer
+
+
+
+
+
+
+
+
+ void __TBB_EXPORTED_METHOD tbb::internal::task_scheduler_observer_v3::observe
+ (
+ bool
+ state = true
)
+
+
+
+
+
+
+
+
+
+
+
+
+
+ virtual void tbb::internal::task_scheduler_observer_v3::on_scheduler_entry
+ (
+ bool
+ )
+
+
+
+
+
+inline virtual
+
+
+
+
+
Entry notification.
+
Invoked from inside observe(true) call and whenever a worker enters the arena this observer is associated with. If a thread is already in the arena when the observer is activated, the entry notification is called before it executes the first stolen task.
+
Obsolete semantics. For global observers it is called by a thread before the first steal since observation became enabled.
+
+
+
+
+
+
+
+
+
+
+
+ virtual void tbb::internal::task_scheduler_observer_v3::on_scheduler_exit
+ (
+ bool
+ )
+
+
+
+
+
+inline virtual
+
+
+
+
+
Exit notification.
+
Invoked from inside observe(false) call and whenever a worker leaves the arena this observer is associated with.
+
Obsolete semantics. For global observers it is called by a thread before the first steal since observation became enabled.
+
+
+
+
The documentation for this class was generated from the following file:
+task_scheduler_observer.h
+
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00191.png b/doc/html/a00191.png
new file mode 100644
index 0000000000..b87088c72d
Binary files /dev/null and b/doc/html/a00191.png differ
diff --git a/doc/html/a00192.html b/doc/html/a00192.html
new file mode 100644
index 0000000000..dcdff54f26
--- /dev/null
+++ b/doc/html/a00192.html
@@ -0,0 +1,160 @@
+
+
+
+
+
+
+tbb::tbb_allocator< T > Class Template Reference
+
+
+
+
+
+
+
+
+
+
+
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
+ More...
+
+
#include <tbb_allocator.h>
+
+
+enum malloc_type { scalable ,
+standard
+ }
+ Specifies current allocator.
+
+
+typedef
+internal::allocator_type< T >
+::value_type value_type
+
+
+typedef value_type * pointer
+
+
+typedef const value_type * const_pointer
+
+
+typedef value_type & reference
+
+
+typedef const value_type & const_reference
+
+
+typedef size_t size_type
+
+
+typedef ptrdiff_t difference_type
+
+
+
+
+ tbb_allocator (const tbb_allocator &) throw ()
+
+
+template<typename U >
+ tbb_allocator (const tbb_allocator < U > &) throw ()
+
+
+pointer address (reference x) const
+
+
+const_pointer address (const_reference x) const
+
+
+pointer allocate (size_type n, const void *=0)
+ Allocate space for n objects.
+
+
+void deallocate (pointer p, size_type)
+ Free previously allocated block of memory.
+
+
+size_type max_size () const throw ()
+ Largest value for which method allocate might succeed.
+
+
+template<typename U , typename... Args>
+void construct (U *p, Args &&...args)
+ Copy-construct value at location pointed to by p.
+
+
+void construct (pointer p, value_type &&value)
+
+
+void construct (pointer p, const value_type &value)
+
+
+void destroy (pointer p)
+ Destroy value at location pointed to by p.
+
+
+
+
template<typename T>
+class tbb::tbb_allocator< T >
+
+
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
+
The class selects the best memory allocation mechanism available from scalable_malloc and standard malloc. The members are ordered the same way they are in section 20.4.1 of the ISO C++ standard.
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00193.html b/doc/html/a00193.html
new file mode 100644
index 0000000000..6489324ab9
--- /dev/null
+++ b/doc/html/a00193.html
@@ -0,0 +1,88 @@
+
+
+
+
+
+
+tbb::tbb_allocator< void > Class Template Reference
+
+
+
+
+
+
+
+
+
+
+
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
+ More...
+
+
#include <tbb_allocator.h>
+
+
+
+typedef void * pointer
+
+
+typedef const void * const_pointer
+
+
+typedef void value_type
+
+
+
+
template<>
+class tbb::tbb_allocator< void >
+
+
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00194.html b/doc/html/a00194.html
new file mode 100644
index 0000000000..da5d7c2de6
--- /dev/null
+++ b/doc/html/a00194.html
@@ -0,0 +1,226 @@
+
+
+
+
+
+
+tbb::tbb_exception Class Reference
+
+
+
+
+
+
+
+
+
+
+
Interface to be implemented by all exceptions TBB recognizes and propagates across the threads.
+ More...
+
+
#include <tbb_exception.h>
+
+
+
+
+
+
+
+
+
+
+
+virtual tbb_exception * move ()=0 throw ()
+ Creates and returns pointer to the deep copy of this exception object. More...
+
+virtual void destroy ()=0 throw ()
+ Destroys objects created by the move() method. More...
+
+virtual void throw_self ()=0
+ Throws this exception object. More...
+
+
+virtual const char * name () const =0 throw ()
+ Returns RTTI name of the originally intercepted exception.
+
+
+virtual const char * what () const =0 throw ()
+ Returns the result of originally intercepted exception's what() method.
+
+void operator delete (void *p)
+
+
+
+
Interface to be implemented by all exceptions TBB recognizes and propagates across the threads.
+
If an unhandled exception of the type derived from tbb::tbb_exception is intercepted by the TBB scheduler in one of the worker threads, it is delivered to and re-thrown in the root thread. The root thread is the thread that has started the outermost algorithm or root task sharing the same task_group_context with the guilty algorithm/task (the one that threw the exception first).
+
Note: when documentation mentions workers with respect to exception handling, masters are implied as well, because they are completely equivalent in this context. Consequently a root thread can be master or worker thread.
+
NOTE: In case of nested algorithms or complex task hierarchies when the nested levels share (explicitly or by means of implicit inheritance) the task group context of the outermost level, the exception may be (re-)thrown multiple times (ultimately - in each worker on each nesting level) before reaching the root thread at the outermost level. IMPORTANT: if you intercept an exception derived from this class on a nested level, you must re-throw it in the catch block by means of the "throw;" operator.
+
TBB provides two implementations of this interface: tbb::captured_exception and template class tbb::movable_exception . See their declarations for more info.
+
+
+
+
+
+
+
+
+
+ virtual void tbb::tbb_exception::destroy
+ (
+ )
+
+
+
+ throw (
+
+
+ )
+
+
+
+
+pure virtual
+
+
+
+
+
+
+
+
+
+
+
+
+ virtual tbb_exception * tbb::tbb_exception::move
+ (
+ )
+
+
+
+ throw (
+
+
+ )
+
+
+
+
+pure virtual
+
+
+
+
+
+
+
+
+
+
+
+
+ void tbb::tbb_exception::operator delete
+ (
+ void *
+ p )
+
+
+
+
+
+inline
+
+
+
+
Operator delete is provided only to allow using existing smart pointers with TBB exception objects obtained as the result of applying move() operation on an exception thrown out of TBB scheduler.
+
When overriding method move() make sure to override operator delete as well if memory is allocated not by TBB's scalable allocator.
+
+
+
+
+
+
+
+
+
+
+
+ virtual void tbb::tbb_exception::throw_self
+ (
+ )
+
+
+
+
+
+pure virtual
+
+
+
+
+
Throws this exception object.
+
Make sure that if you have several levels of derivation from this interface you implement or override this method on the most derived level. The implementation is as simple as "throw *this;". Failure to do this will result in exception of a base class type being thrown.
+
+
Implemented in tbb::movable_exception< ExceptionData > , and tbb::captured_exception .
+
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00194.png b/doc/html/a00194.png
new file mode 100644
index 0000000000..a067095e06
Binary files /dev/null and b/doc/html/a00194.png differ
diff --git a/doc/html/a00195.html b/doc/html/a00195.html
new file mode 100644
index 0000000000..81165e9026
--- /dev/null
+++ b/doc/html/a00195.html
@@ -0,0 +1,117 @@
+
+
+
+
+
+
+tbb::internal::tbb_exception_ptr Class Reference
+
+
+
+
+
+
+
+
+
+
+
Exception container that preserves the exact copy of the original exception.
+ More...
+
+
#include <tbb_exception.h>
+
+
+void destroy () throw ()
+ Destroys this objects. More...
+
+
+void throw_self ()
+ Throws the contained exception .
+
+
+
+
Exception container that preserves the exact copy of the original exception.
+
This class can be used only when the appropriate runtime support (mandated by C++0x) is present
+
+
+
+
+
+
+ void tbb::internal::tbb_exception_ptr::destroy
+ (
+ )
+
+
+
+ throw (
+
+
+ )
+
+
+
+
+
Destroys this objects.
+
Note that objects of this type can be created only by the allocate() method.
+
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00196.html b/doc/html/a00196.html
new file mode 100644
index 0000000000..82bacc0faa
--- /dev/null
+++ b/doc/html/a00196.html
@@ -0,0 +1,185 @@
+
+
+
+
+
+
+tbb::internal::tbb_thread_v3 Class Reference
+
+
+
+
+
+
+
+
+
+
+
Versioned thread class.
+ More...
+
+
#include <tbb_thread.h>
+
+
+
+typedef HANDLE native_handle_type
+
+
+typedef pthread_t native_handle_type
+
+
+
+
+ tbb_thread_v3 (const tbb_thread_v3 &)
+
+
+ tbb_thread_v3 () __TBB_NOEXCEPT(true)
+ Constructs a thread object that does not represent a thread of execution.
+
+
+template<class F >
+ tbb_thread_v3 (F f)
+ Constructs an object and executes f() in a new thread.
+
+
+template<class F , class X >
+ tbb_thread_v3 (F f, X x)
+ Constructs an object and executes f(x) in a new thread.
+
+
+template<class F , class X , class Y >
+ tbb_thread_v3 (F f, X x, Y y)
+ Constructs an object and executes f(x,y) in a new thread.
+
+
+tbb_thread_v3 & operator= (tbb_thread_v3 &x)
+
+
+void swap (tbb_thread_v3 &t) __TBB_NOEXCEPT(true)
+
+
+bool joinable () const __TBB_NOEXCEPT(true)
+
+
+void __TBB_EXPORTED_METHOD join ()
+ The completion of the thread represented by *this happens before join() returns.
+
+
+void __TBB_EXPORTED_METHOD detach ()
+ When detach() returns, *this no longer represents the possibly continuing thread of execution.
+
+
+id get_id () const __TBB_NOEXCEPT(true)
+
+
+native_handle_type native_handle ()
+
+
+
+static unsigned __TBB_EXPORTED_FUNC hardware_concurrency () __TBB_NOEXCEPT(true)
+ The number of hardware thread contexts. More...
+
+
+
+
Versioned thread class.
+
+
+
+
+
+
+
+
+
+ static unsigned __TBB_EXPORTED_FUNC tbb::internal::tbb_thread_v3::hardware_concurrency
+ (
+ )
+
+
+
+
+
+static
+
+
+
+
+
The number of hardware thread contexts.
+
Before TBB 3.0 U4 this methods returned the number of logical CPU in the system. Currently on Windows, Linux and FreeBSD it returns the number of logical CPUs available to the current process in accordance with its affinity mask.
+
NOTE: The return value of this method never changes after its first invocation. This means that changes in the process affinity mask that took place after this method was first invoked will not affect the number of worker threads in the TBB worker threads pool.
+
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00197.html b/doc/html/a00197.html
index b0a1ffddcd..88d70c5e7f 100644
--- a/doc/html/a00197.html
+++ b/doc/html/a00197.html
@@ -4,7 +4,7 @@
-flow_graph.h File Reference
+tbb::thread_bound_filter Class Reference
@@ -20,250 +20,135 @@
Related Pages
Modules
Namespaces
- Classes
- Files
+ Classes
+ Files
+tbb::thread_bound_filter Class Reference
-
The graph related classes and functions.
-More...
+
A stage in a pipeline served by a user thread.
+ More...
+
+
#include <pipeline.h>
+
+
+
+
+
+
+
+
-
-class tbb::flow::interface8::internal::successor_cache< T, M >
-
-class tbb::flow::interface8::internal::broadcast_cache< T, M >
-
-class tbb::flow::interface8::internal::round_robin_cache< T, M >
-
-class tbb::flow::interface8::internal::edge_container< C >
-
-struct tbb::flow::interface8::null_type
-
-class tbb::flow::interface8::continue_msg
- An empty class used for messages that mean "I'm done". More...
-
-class tbb::flow::interface8::sender< T >
- Pure virtual template class that defines a sender of messages of type T. More...
-
-class tbb::flow::interface8::receiver< T >
- Pure virtual template class that defines a receiver of messages of type T. More...
-
-class tbb::flow::interface8::sender< T >
- Pure virtual template class that defines a sender of messages of type T. More...
-
-class tbb::flow::interface8::limiter_node< T >
- Forwards messages only if the threshold has not been reached. More...
-
-class tbb::flow::interface8::run_and_put_task< R, B >
-
-class tbb::flow::interface8::receiver< T >
- Pure virtual template class that defines a receiver of messages of type T. More...
-
-class tbb::flow::interface8::internal::edge_container< C >
-
-class tbb::flow::interface8::continue_receiver
- Base class for receivers of completion messages. More...
-
-class tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
-
-class tbb::flow::interface8::graph
- The graph class. More...
-
-class tbb::flow::interface8::graph_node
- The base of all graph nodes. More...
-
-class tbb::flow::interface8::source_node< Output >
- An executable node that acts as a source, i.e. it has no predecessors. More...
-
-struct tbb::flow::interface8::allocate_buffer< T >
-
-struct tbb::flow::interface8::allocate_buffer< queueing >
-
-class tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
- Implements a function node that supports Input -> Output. More...
-
-class tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
- implements a function node that supports Input -> (set of outputs) More...
-
-class tbb::flow::interface8::split_node< TupleType, Allocator >
- split_node : accepts a tuple as input, forwards each element of the tuple to its More...
-
-class tbb::flow::interface8::continue_node< Output >
- Implements an executable node that supports continue_msg -> Output. More...
-
-class tbb::flow::interface8::overwrite_node< T >
-
-class tbb::flow::interface8::write_once_node< T >
-
-class tbb::flow::interface8::broadcast_node< T >
- Forwards messages of type T to all successors. More...
-
-class tbb::flow::interface8::buffer_node< T, A >
- Forwards messages in arbitrary order. More...
-
-class tbb::flow::interface8::buffer_node< T, A >::buffer_operation
-
-class tbb::flow::interface8::queue_node< T, A >
- Forwards messages in FIFO order. More...
-
-class tbb::flow::interface8::sequencer_node< T, A >
- Forwards messages in sequence order. More...
-
-class tbb::flow::interface8::priority_queue_node< T, Compare, A >
- Forwards messages in priority order. More...
-
-class tbb::flow::interface8::limiter_node< T >
- Forwards messages only if the threshold has not been reached. More...
-
-class tbb::flow::interface8::join_node< OutputTuple, JP >
-
-class tbb::flow::interface8::join_node< OutputTuple, reserving >
-
-class tbb::flow::interface8::join_node< OutputTuple, queueing >
-
-class tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > >
-
-class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
-
-class tbb::flow::interface8::indexer_node< T0 >
-
-class tbb::flow::interface8::indexer_node< T0, T1 >
-
-class tbb::flow::interface8::indexer_node< T0, T1, T2 >
-
-class tbb::flow::interface8::indexer_node< T0, T1, T2, T3 >
-
-class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >
-
-class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 >
-
-class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >
-
-class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
-
-class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
-
-class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
-
-class tbb::flow::interface8::composite_node< InputTuple, OutputTuple >
-
-class tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
-
-class tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> >
-
-class tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> >
-
-class tbb::flow::interface8::internal::async_gateway< Output >
- Pure virtual template class that defines interface for async communication. More...
-
-class tbb::flow::interface8::async_node< Input, Output, Allocator >
- Implements a async node. More...
-
-
-
- tbb
- The namespace tbb contains all components of the library.
-
-
-
- tbb
- The namespace tbb contains all components of the library.
-
-
-
-enum concurrency { unlimited = 0,
-serial = 1
+
+enum result_type { success ,
+item_not_available ,
+end_of_stream
}
- An enumeration the provides the two most common concurrency levels: unlimited and serial.
-
-enum reset_flags { rf_reset_protocol = 0,
-rf_reset_bodies = 1<<0,
-rf_clear_edges = 1<<1
- }
-
+
+
+
+result_type __TBB_EXPORTED_METHOD try_process_item ()
+ If a data item is available, invoke operator() on that item. More...
+
+result_type __TBB_EXPORTED_METHOD process_item ()
+ Wait until a data item becomes available, and invoke operator() on that item. More...
+
-
-
-static tbb::task * tbb::flow::interface8::combine_tasks (tbb::task *left, tbb::task *right)
-
-
-template<typename T >
-void tbb::flow::interface8::make_edge (sender< T > &p, receiver< T > &s)
- Makes an edge between a single predecessor and a single successor.
-
-
-template<typename T , typename V , typename = typename T::output_ports_type, typename = typename V::input_ports_type>
-void tbb::flow::interface8::make_edge (T &output, V &input)
-
-
-template<typename T , typename R , typename = typename T::output_ports_type>
-void tbb::flow::interface8::make_edge (T &output, receiver< R > &input)
-
-
-template<typename S , typename V , typename = typename V::input_ports_type>
-void tbb::flow::interface8::make_edge (sender< S > &output, V &input)
-
-
-template<typename T >
-void tbb::flow::interface8::remove_edge (sender< T > &p, receiver< T > &s)
- Removes an edge between a single predecessor and a single successor.
-
-
-template<typename T , typename V , typename = typename T::output_ports_type, typename = typename V::input_ports_type>
-void tbb::flow::interface8::remove_edge (T &output, V &input)
-
-
-template<typename T , typename R , typename = typename T::output_ports_type>
-void tbb::flow::interface8::remove_edge (T &output, receiver< R > &input)
-
-
-template<typename S , typename V , typename = typename V::input_ports_type>
-void tbb::flow::interface8::remove_edge (sender< S > &output, V &input)
-
-
-template<typename Body , typename Node >
-Body tbb::flow::interface8::copy_body (Node &n)
- Returns a copy of the body from a function or continue node.
-
+
+
+ thread_bound_filter (mode filter_mode)
+
-
-
-static tbb::task *const tbb::flow::interface8::SUCCESSFULLY_ENQUEUED = (task *)-1
-
+
+
+
+static const unsigned char filter_is_serial = 0x1
+ The lowest bit 0 is for parallel vs. serial.
+
+static const unsigned char filter_is_out_of_order = 0x1<<4
+ 4th bit distinguishes ordered vs unordered filters. More...
+
+
+static const unsigned char filter_is_bound = 0x1<<5
+ 5th bit distinguishes thread-bound and regular filters.
+
+
+static const unsigned char filter_may_emit_null = 0x1<<6
+ 6th bit marks input filters emitting small objects
+
+static const unsigned char exact_exception_propagation
+ 7th bit defines exception propagation mode expected by the application. More...
+
-
The graph related classes and functions.
-
There are some applications that best express dependencies as messages passed between nodes in a graph. These messages may contain data or simply act as signals that a predecessors has completed. The graph class and its associated node classes can be used to express such applications.
-
+A stage in a pipeline served by a user thread.
+
+
+
+
+
+
+ result_type __TBB_EXPORTED_METHOD tbb::thread_bound_filter::process_item
+ (
+ )
+
+
+
+
+
+
Wait until a data item becomes available, and invoke operator() on that item.
+
This interface is blocking. Returns 'success' if an item was processed. Returns 'end_of_stream' if there are no more items to process. Never returns 'item_not_available', as it blocks until another return condition applies.
+
+
+
+
+
+
+
+
+ result_type __TBB_EXPORTED_METHOD tbb::thread_bound_filter::try_process_item
+ (
+ )
+
+
+
+
+
+
If a data item is available, invoke operator() on that item.
+
This interface is non-blocking. Returns 'success' if an item was processed. Returns 'item_not_available' if no item can be processed now but more may arrive in the future, or if token limit is reached. Returns 'end_of_stream' if there are no more items to process.
+
+
+
+ The documentation for this class was generated from the following file:
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00197.png b/doc/html/a00197.png
new file mode 100644
index 0000000000..7eab1d5112
Binary files /dev/null and b/doc/html/a00197.png differ
diff --git a/doc/html/a00198.html b/doc/html/a00198.html
new file mode 100644
index 0000000000..1e739519a9
--- /dev/null
+++ b/doc/html/a00198.html
@@ -0,0 +1,96 @@
+
+
+
+
+
+
+tbb::internal::thread_closure_0< F > Struct Template Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ thread_closure_0 (const F &f)
+
+
+
+void * operator new (size_t size)
+
+
+void operator delete (void *ptr)
+
+
+
+
+static __TBB_NATIVE_THREAD_ROUTINE start_routine (void *c)
+
+
+
The documentation for this struct was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00198.png b/doc/html/a00198.png
new file mode 100644
index 0000000000..ca33e7fe18
Binary files /dev/null and b/doc/html/a00198.png differ
diff --git a/doc/html/a00199.html b/doc/html/a00199.html
index b1ae387ccc..835424dabf 100644
--- a/doc/html/a00199.html
+++ b/doc/html/a00199.html
@@ -4,7 +4,7 @@
-memory_pool.h File Reference
+tbb::internal::thread_closure_1< F, X > Struct Template Reference
@@ -20,73 +20,84 @@
Related Pages
Modules
Namespaces
- Classes
- Files
+ Classes
+ Files
+tbb::internal::thread_closure_1< F, X > Struct Template Reference
+
+
Structure used to pass user function with 1 argument to thread.
+ More...
+
+
#include <tbb_thread.h>
+
+
+
+
+
+
+
+
-
- tbb
- The namespace tbb contains all components of the library.
-
+
+
+static __TBB_NATIVE_THREAD_ROUTINE start_routine (void *c)
+ Routine passed to Windows's _beginthreadex by thread::internal_start() inside tbb.dll.
+
-
- tbb
- The namespace tbb contains all components of the library.
-
-
-
-
-template<typename T , typename U , typename P >
-bool tbb::interface6::operator== (const memory_pool_allocator< T, P > &a, const memory_pool_allocator< U, P > &b)
-
-
-template<typename T , typename U , typename P >
-bool tbb::interface6::operator!= (const memory_pool_allocator< T, P > &a, const memory_pool_allocator< U, P > &b)
-
+
+
+F function
+
+
+X arg1
+
+
+
template<class F, class X>
+struct tbb::internal::thread_closure_1< F, X >
+
+
Structure used to pass user function with 1 argument to thread.
+
The documentation for this struct was generated from the following file:
diff --git a/doc/html/a00199.png b/doc/html/a00199.png
new file mode 100644
index 0000000000..961925b534
Binary files /dev/null and b/doc/html/a00199.png differ
diff --git a/doc/html/a00200.html b/doc/html/a00200.html
new file mode 100644
index 0000000000..1882a166ed
--- /dev/null
+++ b/doc/html/a00200.html
@@ -0,0 +1,103 @@
+
+
+
+
+
+
+tbb::internal::thread_closure_2< F, X, Y > Struct Template Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ thread_closure_2 (const F &f, const X &x, const Y &y)
+
+
+
+void * operator new (size_t size)
+
+
+void operator delete (void *ptr)
+
+
+
+
+static __TBB_NATIVE_THREAD_ROUTINE start_routine (void *c)
+ Routine passed to Windows's _beginthreadex by thread::internal_start() inside tbb.dll.
+
+
+
+
+F function
+
+
+X arg1
+
+
+Y arg2
+
+
+
The documentation for this struct was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00200.png b/doc/html/a00200.png
new file mode 100644
index 0000000000..aa52099a9d
Binary files /dev/null and b/doc/html/a00200.png differ
diff --git a/doc/html/a00201.html b/doc/html/a00201.html
new file mode 100644
index 0000000000..84a6e0d0e5
--- /dev/null
+++ b/doc/html/a00201.html
@@ -0,0 +1,80 @@
+
+
+
+
+
+
+tbb::internal::thread_closure_base Struct Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+void * operator new (size_t size)
+
+
+void operator delete (void *ptr)
+
+
+
The documentation for this struct was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00201.png b/doc/html/a00201.png
new file mode 100644
index 0000000000..0324577e72
Binary files /dev/null and b/doc/html/a00201.png differ
diff --git a/doc/html/a00202.html b/doc/html/a00202.html
new file mode 100644
index 0000000000..c0d657ae76
--- /dev/null
+++ b/doc/html/a00202.html
@@ -0,0 +1,101 @@
+
+
+
+
+
+
+tbb::tick_count Class Reference
+
+
+
+
+
+
+
+
+
+
+
Absolute timestamp.
+ More...
+
+
#include <tick_count.h>
+
+
+
+ tick_count ()
+ Construct an absolute timestamp initialized to zero.
+
+
+
+
+static tick_count now ()
+ Return current time.
+
+
+static double resolution ()
+ Return the resolution of the clock in seconds per tick.
+
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00203.html b/doc/html/a00203.html
new file mode 100644
index 0000000000..bee08d8bba
--- /dev/null
+++ b/doc/html/a00203.html
@@ -0,0 +1,91 @@
+
+
+
+
+
+
+tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor Struct Reference
+
+
+
+
+
+
+
+
+
+
+
+
+typedef
+internal::multifunction_output
+< Output > output_port_type
+
+
+
+
+ try_put_functor (output_port_type &p, const Output &v)
+
+
+void operator() ()
+
+
+
+
+output_port_type * port
+
+
+const Output * value
+
+
+bool result
+
+
+
The documentation for this struct was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00204.html b/doc/html/a00204.html
new file mode 100644
index 0000000000..78601c2cc2
--- /dev/null
+++ b/doc/html/a00204.html
@@ -0,0 +1,69 @@
+
+
+
+
+
+
+tbb::interface5::internal::use_element_copy_constructor< T, C > Struct Template Reference
+
+
+
+
+
+
+
+
+
+
+
+
+typedef tbb::internal::true_type type
+
+
+typedef tbb::internal::true_type type
+
+
+
The documentation for this struct was generated from the following file:
+concurrent_priority_queue.h
+
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00205.html b/doc/html/a00205.html
new file mode 100644
index 0000000000..00d3f894f0
--- /dev/null
+++ b/doc/html/a00205.html
@@ -0,0 +1,66 @@
+
+
+
+
+
+
+tbb::interface5::internal::use_element_copy_constructor< T, false > Struct Template Reference
+
+
+
+
+
+
+
+
+
+
+
+
+typedef tbb::internal::false_type type
+
+
+
The documentation for this struct was generated from the following file:
+concurrent_priority_queue.h
+
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00281.html b/doc/html/a00206.html
similarity index 55%
rename from doc/html/a00281.html
rename to doc/html/a00206.html
index 337934f20c..543d16b111 100644
--- a/doc/html/a00281.html
+++ b/doc/html/a00206.html
@@ -4,7 +4,7 @@
-Member List
+tbb::user_abort Class Reference
@@ -33,22 +33,43 @@
-
This is the complete list of members for tbb::null_mutex , including all inherited members.
-
+Exception for user-initiated abort.
+ More...
+
+#include <tbb_exception.h>
+
+
+
+
+
+
+
+
+
+
+const char * what () const throw ()
+
+
+
+Exception for user-initiated abort.
+
The documentation for this class was generated from the following file:
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00206.png b/doc/html/a00206.png
new file mode 100644
index 0000000000..a1f23345c2
Binary files /dev/null and b/doc/html/a00206.png differ
diff --git a/doc/html/a00207.html b/doc/html/a00207.html
new file mode 100644
index 0000000000..e77c21fc0b
--- /dev/null
+++ b/doc/html/a00207.html
@@ -0,0 +1,91 @@
+
+
+
+
+
+
+tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare Class Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+bool operator() (const value_type &left, const value_type &right) const
+
+
+ value_compare (const hash_compare &comparator)
+
+
+
+
+hash_compare my_hash_compare
+
+
+
+
+class concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >
+
+
+
The documentation for this class was generated from the following file:
+concurrent_unordered_map.h
+
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00207.png b/doc/html/a00207.png
new file mode 100644
index 0000000000..d6754637d9
Binary files /dev/null and b/doc/html/a00207.png differ
diff --git a/doc/html/a00263.html b/doc/html/a00208.html
similarity index 76%
rename from doc/html/a00263.html
rename to doc/html/a00208.html
index 98f187ffa4..550e488e8a 100644
--- a/doc/html/a00263.html
+++ b/doc/html/a00208.html
@@ -4,7 +4,7 @@
-Member List
+tbb::vector_iterator< Container, Value > Class Template Reference
@@ -31,17 +31,20 @@
Class Members
+
-
-
This is the complete list of members for __TBB_malloc_proxy_caller , including all inherited members.
-
+ The documentation for this class was generated from the following file:
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00209.html b/doc/html/a00209.html
new file mode 100644
index 0000000000..46736233e6
--- /dev/null
+++ b/doc/html/a00209.html
@@ -0,0 +1,318 @@
+
+
+
+
+
+
+tbb::flow::interface8::write_once_node< T > Class Template Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+task * try_put_task (const T &v)
+
+
+
+void reset_receiver (reset_flags)
+
+
+void reset_node (reset_flags f)
+
+
+
+virtual bool is_continue_receiver ()
+
+
+
+
+template<typename R , typename B >
+class run_and_put_task
+
+
+template<typename X , typename Y >
+class internal::broadcast_cache
+
+
+template<typename X , typename Y >
+class internal::round_robin_cache
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00209.png b/doc/html/a00209.png
new file mode 100644
index 0000000000..6919a098df
Binary files /dev/null and b/doc/html/a00209.png differ
diff --git a/doc/html/a00210.html b/doc/html/a00210.html
new file mode 100644
index 0000000000..6d0bc55223
--- /dev/null
+++ b/doc/html/a00210.html
@@ -0,0 +1,133 @@
+
+
+
+
+
+
+tbb::zero_allocator< T, Allocator > Class Template Reference
+
+
+
+
+
+
+
+
+
+
+
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
+ More...
+
+
#include <tbb_allocator.h>
+
+
+
+
+
+
+
+
+
+
+typedef Allocator< T > base_allocator_type
+
+
+typedef
+base_allocator_type::value_type value_type
+
+
+typedef
+base_allocator_type::pointer pointer
+
+
+typedef
+base_allocator_type::const_pointer const_pointer
+
+
+typedef
+base_allocator_type::reference reference
+
+
+typedef
+base_allocator_type::const_reference const_reference
+
+
+typedef
+base_allocator_type::size_type size_type
+
+
+typedef
+base_allocator_type::difference_type difference_type
+
+
+
+
+ zero_allocator (const zero_allocator &a) throw ()
+
+
+template<typename U >
+ zero_allocator (const zero_allocator < U > &a) throw ()
+
+
+pointer allocate (const size_type n, const void *hint=0)
+
+
+
+
template<typename T, template< typename X > class Allocator = tbb_allocator>
+class tbb::zero_allocator< T, Allocator >
+
+
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
+
The class is an adapter over an actual allocator that fills the allocation using memset function with template argument C as the value. The members are ordered the same way they are in section 20.4.1 of the ISO C++ standard.
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00210.png b/doc/html/a00210.png
new file mode 100644
index 0000000000..f03aec2f32
Binary files /dev/null and b/doc/html/a00210.png differ
diff --git a/doc/html/a00211.html b/doc/html/a00211.html
new file mode 100644
index 0000000000..81a821e2f0
--- /dev/null
+++ b/doc/html/a00211.html
@@ -0,0 +1,102 @@
+
+
+
+
+
+
+tbb::zero_allocator< void, Allocator > Class Template Reference
+
+
+
+
+
+
+
+
+
+
+
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
+ More...
+
+
#include <tbb_allocator.h>
+
+
+
+
+
+
+
+
+
+
+typedef Allocator< void > base_allocator_type
+
+
+typedef
+base_allocator_type::value_type value_type
+
+
+typedef
+base_allocator_type::pointer pointer
+
+
+typedef
+base_allocator_type::const_pointer const_pointer
+
+
+
+
template<template< typename T > class Allocator>
+class tbb::zero_allocator< void, Allocator >
+
+
Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1.
+
The documentation for this class was generated from the following file:
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00211.png b/doc/html/a00211.png
new file mode 100644
index 0000000000..f97e606d73
Binary files /dev/null and b/doc/html/a00211.png differ
diff --git a/doc/html/a00229.html b/doc/html/a00229.html
new file mode 100644
index 0000000000..22d4eac1cc
--- /dev/null
+++ b/doc/html/a00229.html
@@ -0,0 +1,283 @@
+
+
+
+
+
+
+flow_graph.h File Reference
+
+
+
+
+
+
+
+
+
+
+
The graph related classes and functions.
+More...
+
+
+class tbb::flow::interface8::internal::successor_cache< T, M >
+
+class tbb::flow::interface8::internal::broadcast_cache< T, M >
+
+class tbb::flow::interface8::internal::round_robin_cache< T, M >
+
+class tbb::flow::interface8::internal::edge_container< C >
+
+struct tbb::flow::interface8::null_type
+
+class tbb::flow::interface8::continue_msg
+ An empty class used for messages that mean "I'm done". More...
+
+class tbb::flow::interface8::sender< T >
+ Pure virtual template class that defines a sender of messages of type T. More...
+
+class tbb::flow::interface8::receiver< T >
+ Pure virtual template class that defines a receiver of messages of type T. More...
+
+class tbb::flow::interface8::sender< T >
+ Pure virtual template class that defines a sender of messages of type T. More...
+
+class tbb::flow::interface8::limiter_node< T >
+ Forwards messages only if the threshold has not been reached. More...
+
+class tbb::flow::interface8::run_and_put_task< R, B >
+
+class tbb::flow::interface8::receiver< T >
+ Pure virtual template class that defines a receiver of messages of type T. More...
+
+class tbb::flow::interface8::internal::edge_container< C >
+
+class tbb::flow::interface8::continue_receiver
+ Base class for receivers of completion messages. More...
+
+class tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+
+class tbb::flow::interface8::graph
+ The graph class. More...
+
+class tbb::flow::interface8::graph_node
+ The base of all graph nodes. More...
+
+class tbb::flow::interface8::source_node< Output >
+ An executable node that acts as a source, i.e. it has no predecessors. More...
+
+struct tbb::flow::interface8::allocate_buffer< T >
+
+struct tbb::flow::interface8::allocate_buffer< queueing >
+
+class tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+ Implements a function node that supports Input -> Output. More...
+
+class tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
+ implements a function node that supports Input -> (set of outputs) More...
+
+class tbb::flow::interface8::split_node< TupleType, Allocator >
+ split_node : accepts a tuple as input, forwards each element of the tuple to its More...
+
+class tbb::flow::interface8::continue_node< Output >
+ Implements an executable node that supports continue_msg -> Output. More...
+
+class tbb::flow::interface8::overwrite_node< T >
+
+class tbb::flow::interface8::write_once_node< T >
+
+class tbb::flow::interface8::broadcast_node< T >
+ Forwards messages of type T to all successors. More...
+
+class tbb::flow::interface8::buffer_node< T, A >
+ Forwards messages in arbitrary order. More...
+
+class tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+
+class tbb::flow::interface8::queue_node< T, A >
+ Forwards messages in FIFO order. More...
+
+class tbb::flow::interface8::sequencer_node< T, A >
+ Forwards messages in sequence order. More...
+
+class tbb::flow::interface8::priority_queue_node< T, Compare, A >
+ Forwards messages in priority order. More...
+
+class tbb::flow::interface8::limiter_node< T >
+ Forwards messages only if the threshold has not been reached. More...
+
+class tbb::flow::interface8::join_node< OutputTuple, JP >
+
+class tbb::flow::interface8::join_node< OutputTuple, reserving >
+
+class tbb::flow::interface8::join_node< OutputTuple, queueing >
+
+class tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > >
+
+class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
+
+class tbb::flow::interface8::indexer_node< T0 >
+
+class tbb::flow::interface8::indexer_node< T0, T1 >
+
+class tbb::flow::interface8::indexer_node< T0, T1, T2 >
+
+class tbb::flow::interface8::indexer_node< T0, T1, T2, T3 >
+
+class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >
+
+class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 >
+
+class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >
+
+class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
+
+class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
+
+class tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
+
+class tbb::flow::interface8::composite_node< InputTuple, OutputTuple >
+
+class tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
+
+class tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> >
+
+class tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> >
+
+class tbb::flow::interface8::internal::async_gateway< Output >
+ Pure virtual template class that defines interface for async communication. More...
+
+class tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body >
+
+class tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+ Implements async node. More...
+
+struct tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor
+
+
+
+ tbb
+ The namespace tbb contains all components of the library.
+
+
+
+ tbb
+ The namespace tbb contains all components of the library.
+
+
+
+enum concurrency { unlimited = 0,
+serial = 1
+ }
+ An enumeration the provides the two most common concurrency levels: unlimited and serial.
+
+enum reset_flags { rf_reset_protocol = 0,
+rf_reset_bodies = 1<<0,
+rf_clear_edges = 1<<1
+ }
+
+
+
+
+static tbb::task * tbb::flow::interface8::combine_tasks (tbb::task *left, tbb::task *right)
+
+
+template<typename K , typename T >
+K tbb::flow::key_from_message (const T &t)
+
+
+template<typename T >
+void tbb::flow::interface8::make_edge (sender< T > &p, receiver< T > &s)
+ Makes an edge between a single predecessor and a single successor.
+
+
+template<typename T , typename V , typename = typename T::output_ports_type, typename = typename V::input_ports_type>
+void tbb::flow::interface8::make_edge (T &output, V &input)
+
+
+template<typename T , typename R , typename = typename T::output_ports_type>
+void tbb::flow::interface8::make_edge (T &output, receiver< R > &input)
+
+
+template<typename S , typename V , typename = typename V::input_ports_type>
+void tbb::flow::interface8::make_edge (sender< S > &output, V &input)
+
+
+template<typename T >
+void tbb::flow::interface8::remove_edge (sender< T > &p, receiver< T > &s)
+ Removes an edge between a single predecessor and a single successor.
+
+
+template<typename T , typename V , typename = typename T::output_ports_type, typename = typename V::input_ports_type>
+void tbb::flow::interface8::remove_edge (T &output, V &input)
+
+
+template<typename T , typename R , typename = typename T::output_ports_type>
+void tbb::flow::interface8::remove_edge (T &output, receiver< R > &input)
+
+
+template<typename S , typename V , typename = typename V::input_ports_type>
+void tbb::flow::interface8::remove_edge (sender< S > &output, V &input)
+
+
+template<typename Body , typename Node >
+Body tbb::flow::interface8::copy_body (Node &n)
+ Returns a copy of the body from a function or continue node.
+
+
+
+
+static tbb::task *const tbb::flow::interface8::SUCCESSFULLY_ENQUEUED = (task *)-1
+
+
+
+
The graph related classes and functions.
+
There are some applications that best express dependencies as messages passed between nodes in a graph. These messages may contain data or simply act as signals that a predecessors has completed. The graph class and its associated node classes can be used to express such applications.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00232.html b/doc/html/a00232.html
new file mode 100644
index 0000000000..0d6c0e4afb
--- /dev/null
+++ b/doc/html/a00232.html
@@ -0,0 +1,99 @@
+
+
+
+
+
+
+memory_pool.h File Reference
+
+
+
+
+
+
+
+
+
+
+
+ tbb
+ The namespace tbb contains all components of the library.
+
+
+
+ tbb
+ The namespace tbb contains all components of the library.
+
+
+
+
+template<typename T , typename U , typename P >
+bool tbb::interface6::operator== (const memory_pool_allocator< T, P > &a, const memory_pool_allocator< U, P > &b)
+
+
+template<typename T , typename U , typename P >
+bool tbb::interface6::operator!= (const memory_pool_allocator< T, P > &a, const memory_pool_allocator< U, P > &b)
+
+
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00238.html b/doc/html/a00238.html
deleted file mode 100644
index 23922b2b3e..0000000000
--- a/doc/html/a00238.html
+++ /dev/null
@@ -1,116 +0,0 @@
-
-
-
-
-
-
-rml Namespace Reference
-
-
-
-
-
-
-
-
-
-
-
The namespace rml contains components of low-level memory pool interface.
-More...
-
-
-
-typedef void *(* rawAllocType )(intptr_t pool_id, size_t &bytes)
-
-
-typedef int(* rawFreeType )(intptr_t pool_id, void *raw_ptr, size_t raw_bytes)
-
-
-
-enum MemPoolError {
- POOL_OK = TBBMALLOC_OK,
-INVALID_POLICY = TBBMALLOC_INVALID_PARAM,
-UNSUPPORTED_POLICY = TBBMALLOC_UNSUPPORTED,
-NO_MEMORY = TBBMALLOC_NO_MEMORY,
-
- NO_EFFECT = TBBMALLOC_NO_EFFECT
-
- }
-
-
-
-
-MemPoolError pool_create_v1 (intptr_t pool_id, const MemPoolPolicy *policy, rml::MemoryPool **pool)
-
-
-bool pool_destroy (MemoryPool *memPool)
-
-
-void * pool_malloc (MemoryPool *memPool, size_t size)
-
-
-void * pool_realloc (MemoryPool *memPool, void *object, size_t size)
-
-
-void * pool_aligned_malloc (MemoryPool *mPool, size_t size, size_t alignment)
-
-
-void * pool_aligned_realloc (MemoryPool *mPool, void *ptr, size_t size, size_t alignment)
-
-
-bool pool_reset (MemoryPool *memPool)
-
-
-bool pool_free (MemoryPool *memPool, void *object)
-
-
-MemoryPool * pool_identify (void *object)
-
-
-
-
The namespace rml contains components of low-level memory pool interface.
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00241.html b/doc/html/a00241.html
deleted file mode 100644
index 9d9328168f..0000000000
--- a/doc/html/a00241.html
+++ /dev/null
@@ -1,689 +0,0 @@
-
-
-
-
-
-
-tbb Namespace Reference
-
-
-
-
-
-
-
-
-
-
-
The namespace tbb contains all components of the library.
-More...
-
-
-class aligned_space
- Block of space aligned sufficiently to construct an array T with N elements. More...
-
-struct atomic
- Primary template for atomic. More...
-
-struct atomic< void * >
- Specialization for atomic<void*> , for sake of not allowing arithmetic or operator->. More...
-
-class blocked_range
- A range over which to iterate. More...
-
-class blocked_range2d
- A 2-dimensional range that models the Range concept. More...
-
-class blocked_range3d
- A 3-dimensional range that models the Range concept. More...
-
-class cache_aligned_allocator
- Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
-
-class cache_aligned_allocator< void >
- Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
-
-class combinable
- Thread-local storage with optional reduction. More...
-
-class concurrent_bounded_queue
- A high-performance thread-safe blocking concurrent bounded queue. More...
-
-class concurrent_vector
- Concurrent vector container. More...
-
-class vector_iterator
-
-class mutex
- Wrapper around the platform's native reader-writer lock. More...
-
-class null_mutex
- A mutex which does nothing. More...
-
-class null_rw_mutex
- A rw mutex which does nothing. More...
-
-class parallel_do_feeder
- Class the user supplied algorithm body uses to add new tasks. More...
-
-struct task_group_context
-
-struct pre_scan_tag
- Used to indicate that the initial scan is being performed. More...
-
-struct final_scan_tag
- Used to indicate that the final scan is being performed. More...
-
-class parallel_while
- Parallel iteration over a stream, with optional addition of more work. More...
-
-class filter
- A stage in a pipeline. More...
-
-class thread_bound_filter
- A stage in a pipeline served by a user thread. More...
-
-class pipeline
- A processing pipeline that applies filters to items. More...
-
-class queuing_mutex
- Queuing mutex with local-only spinning. More...
-
-class queuing_rw_mutex
- Queuing reader-writer mutex with local-only spinning. More...
-
-class recursive_mutex
-
-class scalable_allocator
- Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
-
-class scalable_allocator< void >
- Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
-
-class spin_mutex
- A lock that occupies a single byte. More...
-
-class spin_rw_mutex_v3
- Fast, unfair, spinning reader-writer lock with backoff and writer-preference. More...
-
-class task_handle
-
-class task_group
-
-class structured_task_group
-
-class task_scheduler_init
- Class delimiting the scope of task scheduler activity. More...
-
-class tbb_allocator
- Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
-
-class tbb_allocator< void >
- Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
-
-class zero_allocator
- Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
-
-class zero_allocator< void, Allocator >
- Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
-
-class bad_last_alloc
- Exception for concurrent containers. More...
-
-class improper_lock
- Exception for PPL locks. More...
-
-class user_abort
- Exception for user-initiated abort. More...
-
-class missing_wait
- Exception for missing wait on structured_task_group . More...
-
-class invalid_multiple_scheduling
- Exception for repeated scheduling of the same task_handle . More...
-
-class tbb_exception
- Interface to be implemented by all exceptions TBB recognizes and propagates across the threads. More...
-
-class captured_exception
- This class is used by TBB to propagate information about unhandled exceptions into the root thread. More...
-
-class movable_exception
- Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread. More...
-
-class tick_count
- Absolute timestamp. More...
-
-
-
-
- __TBB_DECL_ATOMIC (__TBB_LONG_LONG) __TBB_DECL_ATOMIC(unsigned __TBB_LONG_LONG) __TBB_DECL_ATOMIC(long) __TBB_DECL_ATOMIC(unsigned long) __TBB_DECL_ATOMIC_ALT (unsigned
-
-
-size_t __TBB_DECL_ATOMIC_ALT (int, ptrdiff_t) __TBB_DECL_ATOMIC(unsigned) __TBB_DECL_ATOMIC(int) __TBB_DECL_ATOMIC(unsigned short) __TBB_DECL_ATOMIC(short) __TBB_DECL_ATOMIC(char) __TBB_DECL_ATOMIC(signed char) __TBB_DECL_ATOMIC(unsigned char) __TBB_DECL_ATOMIC(wchar_t) template< typename T > struct atomic < T * >
- Specialization for atomic<T*> with arithmetic and operator->.
-
-
-template<memory_semantics M, typename T >
-T load (const atomic < T > &a)
-
-
-template<memory_semantics M, typename T >
-void store (atomic < T > &a, T value)
-
-
-template<typename T , typename U >
-bool operator== (const cache_aligned_allocator < T > &, const cache_aligned_allocator < U > &)
-
-
-template<typename T , typename U >
-bool operator!= (const cache_aligned_allocator < T > &, const cache_aligned_allocator < U > &)
-
-
-template<typename Key , typename T , typename HashCompare , typename A1 , typename A2 >
-bool operator== (const concurrent_hash_map< Key, T, HashCompare, A1 > &a, const concurrent_hash_map< Key, T, HashCompare, A2 > &b)
-
-
-template<typename Key , typename T , typename HashCompare , typename A1 , typename A2 >
-bool operator!= (const concurrent_hash_map< Key, T, HashCompare, A1 > &a, const concurrent_hash_map< Key, T, HashCompare, A2 > &b)
-
-
-template<typename Key , typename T , typename HashCompare , typename A >
-void swap (concurrent_hash_map< Key, T, HashCompare, A > &a, concurrent_hash_map< Key, T, HashCompare, A > &b)
-
-
-template<typename T , class A1 , class A2 >
-bool operator== (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
-
-
-template<typename T , class A1 , class A2 >
-bool operator!= (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
-
-
-template<typename T , class A1 , class A2 >
-bool operator< (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
-
-
-template<typename T , class A1 , class A2 >
-bool operator> (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
-
-
-template<typename T , class A1 , class A2 >
-bool operator<= (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
-
-
-template<typename T , class A1 , class A2 >
-bool operator>= (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
-
-
-template<typename T , class A >
-void swap (concurrent_vector < T, A > &a, concurrent_vector < T, A > &b)
-
-
-template<typename T , typename U >
-bool operator== (const scalable_allocator < T > &, const scalable_allocator < U > &)
-
-
-template<typename T , typename U >
-bool operator!= (const scalable_allocator < T > &, const scalable_allocator < U > &)
-
-
-bool is_current_task_group_canceling ()
-
-
-template<class F >
-task_handle < F > make_task (const F &f)
-
-
-template<typename T , typename U >
-bool operator== (const tbb_allocator < T > &, const tbb_allocator < U > &)
-
-
-template<typename T , typename U >
-bool operator!= (const tbb_allocator < T > &, const tbb_allocator < U > &)
-
-
-template<typename T1 , template< typename X1 > class B1, typename T2 , template< typename X2 > class B2>
-bool operator== (const zero_allocator < T1, B1 > &a, const zero_allocator < T2, B2 > &b)
-
-
-template<typename T1 , template< typename X1 > class B1, typename T2 , template< typename X2 > class B2>
-bool operator!= (const zero_allocator < T1, B1 > &a, const zero_allocator < T2, B2 > &b)
-
-int __TBB_EXPORTED_FUNC TBB_runtime_interface_version ()
- The function returns the interface version of the TBB shared library being used. More...
-
-
-void swap (internal::tbb_thread_v3 &t1, internal::tbb_thread_v3 &t2) __TBB_NOEXCEPT(true)
-
-
-void move (tbb_thread &t1, tbb_thread &t2)
-
-
-tick_count::interval_t operator- (const tick_count &t1, const tick_count &t0)
-
-
-See also requirements on parallel_do Body .
-
-template<typename Iterator , typename Body >
-void parallel_do (Iterator first, Iterator last, const Body &body)
- Parallel iteration over a range, with optional addition of more work. More...
-
-
-template<typename Range , typename Body >
-void parallel_do (Range &rng, const Body &body)
-
-
-template<typename Range , typename Body >
-void parallel_do (const Range &rng, const Body &body)
-
-template<typename Iterator , typename Body >
-void parallel_do (Iterator first, Iterator last, const Body &body, task_group_context &context)
- Parallel iteration over a range, with optional addition of more work and user-supplied context. More...
-
-
-template<typename Range , typename Body >
-void parallel_do (Range &rng, const Body &body, task_group_context &context)
-
-
-template<typename Range , typename Body >
-void parallel_do (const Range &rng, const Body &body, task_group_context &context)
-
-
-See also requirements on Range and parallel_for Body .
-
-template<typename Range , typename Body >
-void parallel_for (const Range &range, const Body &body)
- Parallel iteration over range with default partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_for (const Range &range, const Body &body, const simple_partitioner &partitioner)
- Parallel iteration over range with simple partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_for (const Range &range, const Body &body, const auto_partitioner &partitioner)
- Parallel iteration over range with auto_partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_for (const Range &range, const Body &body, affinity_partitioner &partitioner)
- Parallel iteration over range with affinity_partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_for (const Range &range, const Body &body, task_group_context &context)
- Parallel iteration over range with default partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void parallel_for (const Range &range, const Body &body, const simple_partitioner &partitioner, task_group_context &context)
- Parallel iteration over range with simple partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void parallel_for (const Range &range, const Body &body, const auto_partitioner &partitioner, task_group_context &context)
- Parallel iteration over range with auto_partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void parallel_for (const Range &range, const Body &body, affinity_partitioner &partitioner, task_group_context &context)
- Parallel iteration over range with affinity_partitioner and user-supplied context. More...
-
-
-template<typename Iterator , typename Function >
-void parallel_for_each (Iterator first, Iterator last, const Function &f, task_group_context &context)
- Calls function f for all items from [first, last) interval using user-supplied context. More...
-
-template<typename Range , typename Function >
-void parallel_for_each (Range &rng, const Function &f, task_group_context &context)
- Calls function f for all items from rng using user-supplied context. More...
-
-template<typename Range , typename Function >
-void parallel_for_each (const Range &rng, const Function &f, task_group_context &context)
- Calls function f for all items from const rng user-supplied context. More...
-
-
-template<typename Iterator , typename Function >
-void parallel_for_each (Iterator first, Iterator last, const Function &f)
- Uses default context.
-
-
-template<typename Range , typename Function >
-void parallel_for_each (Range &rng, const Function &f)
- Uses default context.
-
-
-template<typename Range , typename Function >
-void parallel_for_each (const Range &rng, const Function &f)
- Uses default context.
-
-
-template<typename F0 , typename F1 , typename... F>
-void parallel_invoke (F0 &&f0, F1 &&f1, F &&...f)
- Executes a list of tasks in parallel and waits for all tasks to complete. More...
-
-
-template<typename F0 , typename F1 >
-void parallel_invoke (const F0 &f0, const F1 &f1, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 , typename F9 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, const F9 &f9, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 >
-void parallel_invoke (const F0 &f0, const F1 &f1)
-
-
-template<typename F0 , typename F1 , typename F2 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 , typename F9 >
-void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, const F9 &f9)
-
-
-See also requirements on Range and parallel_reduce Body .
-
-template<typename Range , typename Body >
-void parallel_reduce (const Range &range, Body &body)
- Parallel iteration with reduction and default partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_reduce (const Range &range, Body &body, const simple_partitioner &partitioner)
- Parallel iteration with reduction and simple_partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_reduce (const Range &range, Body &body, const auto_partitioner &partitioner)
- Parallel iteration with reduction and auto_partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_reduce (const Range &range, Body &body, affinity_partitioner &partitioner)
- Parallel iteration with reduction and affinity_partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_reduce (const Range &range, Body &body, const simple_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, simple partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void parallel_reduce (const Range &range, Body &body, const auto_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, auto_partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void parallel_reduce (const Range &range, Body &body, affinity_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, affinity_partitioner and user-supplied context. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction)
- Parallel iteration with reduction and default partitioner. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner)
- Parallel iteration with reduction and simple_partitioner. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const auto_partitioner &partitioner)
- Parallel iteration with reduction and auto_partitioner. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, affinity_partitioner &partitioner)
- Parallel iteration with reduction and affinity_partitioner. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, simple partitioner and user-supplied context. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const auto_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, auto_partitioner and user-supplied context. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, affinity_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, affinity_partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void parallel_deterministic_reduce (const Range &range, Body &body)
- Parallel iteration with deterministic reduction and default partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_deterministic_reduce (const Range &range, Body &body, task_group_context &context)
- Parallel iteration with deterministic reduction, simple partitioner and user-supplied context. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction)
- Parallel iteration with deterministic reduction and default partitioner. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, task_group_context &context)
- Parallel iteration with deterministic reduction, simple partitioner and user-supplied context. More...
-
-
-See also requirements on Range and parallel_scan Body .
-
-template<typename Range , typename Body >
-void parallel_scan (const Range &range, Body &body)
- Parallel prefix with default partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_scan (const Range &range, Body &body, const simple_partitioner &partitioner)
- Parallel prefix with simple_partitioner. More...
-
-template<typename Range , typename Body >
-void parallel_scan (const Range &range, Body &body, const auto_partitioner &partitioner)
- Parallel prefix with auto_partitioner. More...
-
-
-See also requirements on iterators for parallel_sort .
-
-template<typename RandomAccessIterator , typename Compare >
-void parallel_sort (RandomAccessIterator begin, RandomAccessIterator end, const Compare &comp)
- Sorts the data in [begin,end) using the given comparator. More...
-
-template<typename RandomAccessIterator >
-void parallel_sort (RandomAccessIterator begin, RandomAccessIterator end)
- Sorts the data in [begin,end) with a default comparator std::less<RandomAccessIterator>
More...
-
-template<typename Range , typename Compare >
-void parallel_sort (Range &rng, const Compare &comp)
- Sorts the data in rng using the given comparator. More...
-
-template<typename Range , typename Compare >
-void parallel_sort (const Range &rng, const Compare &comp)
- Sorts the data in const rng using the given comparator. More...
-
-template<typename Range >
-void parallel_sort (Range &rng)
- Sorts the data in rng with a default comparator std::less<RandomAccessIterator>
More...
-
-template<typename Range >
-void parallel_sort (const Range &rng)
- Sorts the data in const rng with a default comparator std::less<RandomAccessIterator>
More...
-
-template<typename T >
-void parallel_sort (T *begin, T *end)
- Sorts the data in the range
[begin,end) with a default comparator std::less<T>
More...
-
-
-
-
The namespace tbb contains all components of the library.
-
-
-
-
-
-
Specifies memory semantics.
-
-Enumerator full_fence
-Sequential consistency.
-
- acquire
-Acquire.
-
- release
-Release.
-
- relaxed
-No ordering.
-
-
-
-
-
-
-
-
-
-
-
- int __TBB_EXPORTED_FUNC tbb::TBB_runtime_interface_version
- (
- )
-
-
-
-
-
-
The function returns the interface version of the TBB shared library being used.
-
The version it returns is determined at runtime, not at compile/link time. So it can be different than the value of TBB_INTERFACE_VERSION obtained at compile time.
-
-
-
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00218.html b/doc/html/a00251.html
similarity index 90%
rename from doc/html/a00218.html
rename to doc/html/a00251.html
index 20481316ee..cf807004bd 100644
--- a/doc/html/a00218.html
+++ b/doc/html/a00251.html
@@ -50,35 +50,35 @@
- rml
- The namespace rml contains components of low-level memory pool interface.
+ rml
+ The namespace rml contains components of low-level memory pool interface.
- tbb
- The namespace tbb contains all components of the library.
+ tbb
+ The namespace tbb contains all components of the library.
- rml
- The namespace rml contains components of low-level memory pool interface.
+ rml
+ The namespace rml contains components of low-level memory pool interface.
- tbb
- The namespace tbb contains all components of the library.
+ tbb
+ The namespace tbb contains all components of the library.
-void *__TBB_EXPORTED_FUNC scalable_malloc (size_t size)
+void *__TBB_EXPORTED_FUNC scalable_malloc (size_t size)
-void __TBB_EXPORTED_FUNC scalable_free (void *ptr)
+void __TBB_EXPORTED_FUNC scalable_free (void *ptr)
-void *__TBB_EXPORTED_FUNC scalable_realloc (void *ptr, size_t size)
+void *__TBB_EXPORTED_FUNC scalable_realloc (void *ptr, size_t size)
-void *__TBB_EXPORTED_FUNC scalable_calloc (size_t nobj, size_t size)
+void *__TBB_EXPORTED_FUNC scalable_calloc (size_t nobj, size_t size)
-int __TBB_EXPORTED_FUNC scalable_posix_memalign (void **memptr, size_t alignment, size_t size)
+int __TBB_EXPORTED_FUNC scalable_posix_memalign (void **memptr, size_t alignment, size_t size)
-void *__TBB_EXPORTED_FUNC scalable_aligned_malloc (size_t size, size_t alignment)
+void *__TBB_EXPORTED_FUNC scalable_aligned_malloc (size_t size, size_t alignment)
-void *__TBB_EXPORTED_FUNC scalable_aligned_realloc (void *ptr, size_t size, size_t alignment)
+void *__TBB_EXPORTED_FUNC scalable_aligned_realloc (void *ptr, size_t size, size_t alignment)
-void __TBB_EXPORTED_FUNC scalable_aligned_free (void *ptr)
+void __TBB_EXPORTED_FUNC scalable_aligned_free (void *ptr)
-size_t __TBB_EXPORTED_FUNC scalable_msize (void *ptr)
+size_t __TBB_EXPORTED_FUNC scalable_msize (void *ptr)
-int __TBB_EXPORTED_FUNC scalable_allocation_mode (int param, intptr_t value)
+int __TBB_EXPORTED_FUNC scalable_allocation_mode (int param, intptr_t value)
-int __TBB_EXPORTED_FUNC scalable_allocation_command (int cmd, void *param)
+int __TBB_EXPORTED_FUNC scalable_allocation_command (int cmd, void *param)
MemPoolError rml::pool_create_v1 (intptr_t pool_id, const MemPoolPolicy *policy, rml::MemoryPool **pool)
diff --git a/doc/html/a00256.html b/doc/html/a00256.html
deleted file mode 100644
index d248af6b83..0000000000
--- a/doc/html/a00256.html
+++ /dev/null
@@ -1,2012 +0,0 @@
-
-
-
-
-
-
-Algorithms
-
-
-
-
-
-
-
-
-
-
-
- See also requirements on parallel_do Body .
-
-template<typename Iterator , typename Body >
-void tbb::parallel_do (Iterator first, Iterator last, const Body &body)
- Parallel iteration over a range, with optional addition of more work. More...
-
-template<typename Iterator , typename Body >
-void tbb::parallel_do (Iterator first, Iterator last, const Body &body, task_group_context &context)
- Parallel iteration over a range, with optional addition of more work and user-supplied context. More...
-
-
-template<typename Range , typename Body >
-void tbb::parallel_do (Range &rng, const Body &body)
-
-
-template<typename Range , typename Body >
-void tbb::parallel_do (const Range &rng, const Body &body)
-
-
-template<typename Range , typename Body >
-void tbb::parallel_do (Range &rng, const Body &body, task_group_context &context)
-
-
-template<typename Range , typename Body >
-void tbb::parallel_do (const Range &rng, const Body &body, task_group_context &context)
-
-
-
- See also requirements on Range and parallel_for Body .
-
-template<typename Range , typename Body >
-void tbb::parallel_for (const Range &range, const Body &body)
- Parallel iteration over range with default partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_for (const Range &range, const Body &body, const simple_partitioner &partitioner)
- Parallel iteration over range with simple partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_for (const Range &range, const Body &body, const auto_partitioner &partitioner)
- Parallel iteration over range with auto_partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_for (const Range &range, const Body &body, affinity_partitioner &partitioner)
- Parallel iteration over range with affinity_partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_for (const Range &range, const Body &body, task_group_context &context)
- Parallel iteration over range with default partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_for (const Range &range, const Body &body, const simple_partitioner &partitioner, task_group_context &context)
- Parallel iteration over range with simple partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_for (const Range &range, const Body &body, const auto_partitioner &partitioner, task_group_context &context)
- Parallel iteration over range with auto_partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_for (const Range &range, const Body &body, affinity_partitioner &partitioner, task_group_context &context)
- Parallel iteration over range with affinity_partitioner and user-supplied context. More...
-
-
-
-template<typename Iterator , typename Function >
-void tbb::parallel_for_each (Iterator first, Iterator last, const Function &f, task_group_context &context)
- Calls function f for all items from [first, last) interval using user-supplied context. More...
-
-template<typename Range , typename Function >
-void tbb::parallel_for_each (Range &rng, const Function &f, task_group_context &context)
- Calls function f for all items from rng using user-supplied context. More...
-
-template<typename Range , typename Function >
-void tbb::parallel_for_each (const Range &rng, const Function &f, task_group_context &context)
- Calls function f for all items from const rng user-supplied context. More...
-
-
-template<typename Iterator , typename Function >
-void tbb::parallel_for_each (Iterator first, Iterator last, const Function &f)
- Uses default context.
-
-
-template<typename Range , typename Function >
-void tbb::parallel_for_each (Range &rng, const Function &f)
- Uses default context.
-
-
-template<typename Range , typename Function >
-void tbb::parallel_for_each (const Range &rng, const Function &f)
- Uses default context.
-
-
-
-template<typename F0 , typename F1 , typename... F>
-void tbb::parallel_invoke (F0 &&f0, F1 &&f1, F &&...f)
- Executes a list of tasks in parallel and waits for all tasks to complete. More...
-
-
-template<typename F0 , typename F1 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 , typename F9 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, const F9 &f9, tbb::task_group_context &context)
-
-
-template<typename F0 , typename F1 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1)
-
-
-template<typename F0 , typename F1 , typename F2 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8)
-
-
-template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 , typename F9 >
-void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, const F9 &f9)
-
-
-
- See also requirements on Range and parallel_reduce Body .
-
-template<typename Range , typename Body >
-void tbb::parallel_reduce (const Range &range, Body &body)
- Parallel iteration with reduction and default partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_reduce (const Range &range, Body &body, const simple_partitioner &partitioner)
- Parallel iteration with reduction and simple_partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_reduce (const Range &range, Body &body, const auto_partitioner &partitioner)
- Parallel iteration with reduction and auto_partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_reduce (const Range &range, Body &body, affinity_partitioner &partitioner)
- Parallel iteration with reduction and affinity_partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_reduce (const Range &range, Body &body, const simple_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, simple partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_reduce (const Range &range, Body &body, const auto_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, auto_partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_reduce (const Range &range, Body &body, affinity_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, affinity_partitioner and user-supplied context. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction)
- Parallel iteration with reduction and default partitioner. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner)
- Parallel iteration with reduction and simple_partitioner. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const auto_partitioner &partitioner)
- Parallel iteration with reduction and auto_partitioner. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, affinity_partitioner &partitioner)
- Parallel iteration with reduction and affinity_partitioner. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, simple partitioner and user-supplied context. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const auto_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, auto_partitioner and user-supplied context. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, affinity_partitioner &partitioner, task_group_context &context)
- Parallel iteration with reduction, affinity_partitioner and user-supplied context. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_deterministic_reduce (const Range &range, Body &body)
- Parallel iteration with deterministic reduction and default partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_deterministic_reduce (const Range &range, Body &body, task_group_context &context)
- Parallel iteration with deterministic reduction, simple partitioner and user-supplied context. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value tbb::parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction)
- Parallel iteration with deterministic reduction and default partitioner. More...
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-Value tbb::parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, task_group_context &context)
- Parallel iteration with deterministic reduction, simple partitioner and user-supplied context. More...
-
-
-
- See also requirements on Range and parallel_scan Body .
-
-template<typename Range , typename Body >
-void tbb::parallel_scan (const Range &range, Body &body)
- Parallel prefix with default partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_scan (const Range &range, Body &body, const simple_partitioner &partitioner)
- Parallel prefix with simple_partitioner. More...
-
-template<typename Range , typename Body >
-void tbb::parallel_scan (const Range &range, Body &body, const auto_partitioner &partitioner)
- Parallel prefix with auto_partitioner. More...
-
-
-
- See also requirements on iterators for parallel_sort .
-
-template<typename RandomAccessIterator , typename Compare >
-void tbb::parallel_sort (RandomAccessIterator begin, RandomAccessIterator end, const Compare &comp)
- Sorts the data in [begin,end) using the given comparator. More...
-
-template<typename RandomAccessIterator >
-void tbb::parallel_sort (RandomAccessIterator begin, RandomAccessIterator end)
- Sorts the data in [begin,end) with a default comparator std::less<RandomAccessIterator>
More...
-
-template<typename Range , typename Compare >
-void tbb::parallel_sort (Range &rng, const Compare &comp)
- Sorts the data in rng using the given comparator. More...
-
-template<typename Range , typename Compare >
-void tbb::parallel_sort (const Range &rng, const Compare &comp)
- Sorts the data in const rng using the given comparator. More...
-
-template<typename Range >
-void tbb::parallel_sort (Range &rng)
- Sorts the data in rng with a default comparator std::less<RandomAccessIterator>
More...
-
-template<typename Range >
-void tbb::parallel_sort (const Range &rng)
- Sorts the data in const rng with a default comparator std::less<RandomAccessIterator>
More...
-
-template<typename T >
-void tbb::parallel_sort (T *begin, T *end)
- Sorts the data in the range
[begin,end) with a default comparator std::less<T>
More...
-
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_deterministic_reduce
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with deterministic reduction and default partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_deterministic_reduce
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with deterministic reduction, simple partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-
-
- Value tbb::parallel_deterministic_reduce
- (
- const Range &
- range ,
-
-
-
-
- const Value &
- identity ,
-
-
-
-
- const RealBody &
- real_body ,
-
-
-
-
- const Reduction &
- reduction
-
-
-
- )
-
-
-
-
-
-
-
-
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-
-
- Value tbb::parallel_deterministic_reduce
- (
- const Range &
- range ,
-
-
-
-
- const Value &
- identity ,
-
-
-
-
- const RealBody &
- real_body ,
-
-
-
-
- const Reduction &
- reduction ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with deterministic reduction, simple partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Iterator , typename Body >
-
-
- void tbb::parallel_do
- (
- Iterator
- first ,
-
-
-
-
- Iterator
- last ,
-
-
-
-
- const Body &
- body
-
-
-
- )
-
-
-
-
-
-
Parallel iteration over a range, with optional addition of more work.
-
-
-
-
-
-
-
-template<typename Iterator , typename Body >
-
-
- void tbb::parallel_do
- (
- Iterator
- first ,
-
-
-
-
- Iterator
- last ,
-
-
-
-
- const Body &
- body ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration over a range, with optional addition of more work and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_for
- (
- const Range &
- range ,
-
-
-
-
- const Body &
- body
-
-
-
- )
-
-
-
-
-
-
Parallel iteration over range with default partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_for
- (
- const Range &
- range ,
-
-
-
-
- const Body &
- body ,
-
-
-
-
- const simple_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel iteration over range with simple partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_for
- (
- const Range &
- range ,
-
-
-
-
- const Body &
- body ,
-
-
-
-
- const auto_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel iteration over range with auto_partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_for
- (
- const Range &
- range ,
-
-
-
-
- const Body &
- body ,
-
-
-
-
- affinity_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel iteration over range with affinity_partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_for
- (
- const Range &
- range ,
-
-
-
-
- const Body &
- body ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration over range with default partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_for
- (
- const Range &
- range ,
-
-
-
-
- const Body &
- body ,
-
-
-
-
- const simple_partitioner &
- partitioner ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration over range with simple partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_for
- (
- const Range &
- range ,
-
-
-
-
- const Body &
- body ,
-
-
-
-
- const auto_partitioner &
- partitioner ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration over range with auto_partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_for
- (
- const Range &
- range ,
-
-
-
-
- const Body &
- body ,
-
-
-
-
- affinity_partitioner &
- partitioner ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration over range with affinity_partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Iterator , typename Function >
-
-
- void tbb::parallel_for_each
- (
- Iterator
- first ,
-
-
-
-
- Iterator
- last ,
-
-
-
-
- const Function &
- f ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Calls function f for all items from [first, last) interval using user-supplied context.
-
-
Referenced by tbb::parallel_for_each() .
-
-
-
-
-
-
-
-template<typename Range , typename Function >
-
-
- void tbb::parallel_for_each
- (
- Range &
- rng ,
-
-
-
-
- const Function &
- f ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
-
-
-
-template<typename Range , typename Function >
-
-
- void tbb::parallel_for_each
- (
- const Range &
- rng ,
-
-
-
-
- const Function &
- f ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
-
-
-
-template<typename F0 , typename F1 , typename... F>
-
-
- void tbb::parallel_invoke
- (
- F0 &&
- f0 ,
-
-
-
-
- F1 &&
- f1 ,
-
-
-
-
- F &&...
- f
-
-
-
- )
-
-
-
-
-
-
Executes a list of tasks in parallel and waits for all tasks to complete.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction and default partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body ,
-
-
-
-
- const simple_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction and simple_partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body ,
-
-
-
-
- const auto_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction and auto_partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body ,
-
-
-
-
- affinity_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction and affinity_partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body ,
-
-
-
-
- const simple_partitioner &
- partitioner ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction, simple partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body ,
-
-
-
-
- const auto_partitioner &
- partitioner ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction, auto_partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body ,
-
-
-
-
- affinity_partitioner &
- partitioner ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction, affinity_partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-
-
- Value tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- const Value &
- identity ,
-
-
-
-
- const RealBody &
- real_body ,
-
-
-
-
- const Reduction &
- reduction
-
-
-
- )
-
-
-
-
-
-
-
-
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-
-
- Value tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- const Value &
- identity ,
-
-
-
-
- const RealBody &
- real_body ,
-
-
-
-
- const Reduction &
- reduction ,
-
-
-
-
- const simple_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction and simple_partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-
-
- Value tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- const Value &
- identity ,
-
-
-
-
- const RealBody &
- real_body ,
-
-
-
-
- const Reduction &
- reduction ,
-
-
-
-
- const auto_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction and auto_partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-
-
- Value tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- const Value &
- identity ,
-
-
-
-
- const RealBody &
- real_body ,
-
-
-
-
- const Reduction &
- reduction ,
-
-
-
-
- affinity_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction and affinity_partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-
-
- Value tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- const Value &
- identity ,
-
-
-
-
- const RealBody &
- real_body ,
-
-
-
-
- const Reduction &
- reduction ,
-
-
-
-
- const simple_partitioner &
- partitioner ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction, simple partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-
-
- Value tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- const Value &
- identity ,
-
-
-
-
- const RealBody &
- real_body ,
-
-
-
-
- const Reduction &
- reduction ,
-
-
-
-
- const auto_partitioner &
- partitioner ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction, auto_partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Value , typename RealBody , typename Reduction >
-
-
- Value tbb::parallel_reduce
- (
- const Range &
- range ,
-
-
-
-
- const Value &
- identity ,
-
-
-
-
- const RealBody &
- real_body ,
-
-
-
-
- const Reduction &
- reduction ,
-
-
-
-
- affinity_partitioner &
- partitioner ,
-
-
-
-
- task_group_context &
- context
-
-
-
- )
-
-
-
-
-
-
Parallel iteration with reduction, affinity_partitioner and user-supplied context.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_scan
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body
-
-
-
- )
-
-
-
-
-
-
Parallel prefix with default partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_scan
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body ,
-
-
-
-
- const simple_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel prefix with simple_partitioner.
-
-
-
-
-
-
-
-template<typename Range , typename Body >
-
-
- void tbb::parallel_scan
- (
- const Range &
- range ,
-
-
-
-
- Body &
- body ,
-
-
-
-
- const auto_partitioner &
- partitioner
-
-
-
- )
-
-
-
-
-
-
Parallel prefix with auto_partitioner.
-
-
-
-
-
-
-
-template<typename RandomAccessIterator , typename Compare >
-
-
- void tbb::parallel_sort
- (
- RandomAccessIterator
- begin ,
-
-
-
-
- RandomAccessIterator
- end ,
-
-
-
-
- const Compare &
- comp
-
-
-
- )
-
-
-
-
-
-
Sorts the data in [begin,end) using the given comparator.
-
The compare function object is used for all comparisons between elements during sorting. The compare object must define a bool operator() function.
-
-
Referenced by tbb::parallel_sort() .
-
-
-
-
-
-
-
-template<typename RandomAccessIterator >
-
-
-
-
-
- void tbb::parallel_sort
- (
- RandomAccessIterator
- begin ,
-
-
-
-
- RandomAccessIterator
- end
-
-
-
- )
-
-
-
-
-
-inline
-
-
-
-
-
Sorts the data in [begin,end) with a default comparator std::less<RandomAccessIterator>
-
-
References tbb::parallel_sort() .
-
-
-
-
-
-
-
-template<typename Range , typename Compare >
-
-
- void tbb::parallel_sort
- (
- Range &
- rng ,
-
-
-
-
- const Compare &
- comp
-
-
-
- )
-
-
-
-
-
-
-
-
-
-template<typename Range , typename Compare >
-
-
- void tbb::parallel_sort
- (
- const Range &
- rng ,
-
-
-
-
- const Compare &
- comp
-
-
-
- )
-
-
-
-
-
-
-
-
-
-template<typename Range >
-
-
- void tbb::parallel_sort
- (
- Range &
- rng )
-
-
-
-
-
-
Sorts the data in rng with a default comparator std::less<RandomAccessIterator>
-
-
References tbb::parallel_sort() .
-
-
-
-
-
-
-
-template<typename Range >
-
-
- void tbb::parallel_sort
- (
- const Range &
- rng )
-
-
-
-
-
-
Sorts the data in const rng with a default comparator std::less<RandomAccessIterator>
-
-
References tbb::parallel_sort() .
-
-
-
-
-
-
-
-template<typename T >
-
-
-
-
-
- void tbb::parallel_sort
- (
- T *
- begin ,
-
-
-
-
- T *
- end
-
-
-
- )
-
-
-
-
-
-inline
-
-
-
-
-
Sorts the data in the range
[begin,end) with a default comparator std::less<T>
-
-
References tbb::parallel_sort() .
-
-
-
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00257.html b/doc/html/a00257.html
deleted file mode 100644
index 7b283772f2..0000000000
--- a/doc/html/a00257.html
+++ /dev/null
@@ -1,67 +0,0 @@
-
-
-
-
-
-
-Containers
-
-
-
-
-
-
-
-
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00258.html b/doc/html/a00258.html
deleted file mode 100644
index d2aa131c14..0000000000
--- a/doc/html/a00258.html
+++ /dev/null
@@ -1,382 +0,0 @@
-
-
-
-
-
-
-Memory Allocation
-
-
-
-
-
-
-
-
-
-
-
-class tbb::aligned_space< T, N >
- Block of space aligned sufficiently to construct an array T with N elements. More...
-
-class tbb::cache_aligned_allocator< T >
- Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
-
-class tbb::cache_aligned_allocator< void >
- Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
-
-class tbb::interface6::memory_pool_allocator< T, P >
- Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
-
-class tbb::interface6::memory_pool_allocator< void, P >
- Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
-
-class tbb::scalable_allocator< T >
- Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
-
-class tbb::scalable_allocator< void >
- Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
-
-class tbb::tbb_allocator< T >
- Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
-
-class tbb::tbb_allocator< void >
- Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
-
-class tbb::zero_allocator< T, Allocator >
- Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
-
-class tbb::zero_allocator< void, Allocator >
- Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
-
-
-
-
-
-
-
-
-
- void __TBB_EXPORTED_FUNC scalable_aligned_free
- (
- void *
- ptr )
-
-
-
-
-
The "_aligned_free" analogue.
-
-
-
-
-
-
-
-
- void* __TBB_EXPORTED_FUNC scalable_aligned_malloc
- (
- size_t
- size ,
-
-
-
-
- size_t
- alignment
-
-
-
- )
-
-
-
-
-
The "_aligned_malloc" analogue.
-
-
-
-
-
-
-
-
- void* __TBB_EXPORTED_FUNC scalable_aligned_realloc
- (
- void *
- ptr ,
-
-
-
-
- size_t
- size ,
-
-
-
-
- size_t
- alignment
-
-
-
- )
-
-
-
-
-
The "_aligned_realloc" analogue.
-
-
-
-
-
-
-
-
- int __TBB_EXPORTED_FUNC scalable_allocation_command
- (
- int
- cmd ,
-
-
-
-
- void *
- param
-
-
-
- )
-
-
-
-
-
Call TBB allocator-specific commands.
-
-
-
-
-
-
-
-
- int __TBB_EXPORTED_FUNC scalable_allocation_mode
- (
- int
- param ,
-
-
-
-
- intptr_t
- value
-
-
-
- )
-
-
-
-
-
Set TBB allocator-specific allocation modes.
-
-
-
-
-
-
-
-
- void* __TBB_EXPORTED_FUNC scalable_calloc
- (
- size_t
- nobj ,
-
-
-
-
- size_t
- size
-
-
-
- )
-
-
-
-
-
The "calloc" analogue complementing scalable_malloc.
-
-
-
-
-
-
-
-
- void __TBB_EXPORTED_FUNC scalable_free
- (
- void *
- ptr )
-
-
-
-
-
-
-
-
-
-
- void* __TBB_EXPORTED_FUNC scalable_malloc
- (
- size_t
- size )
-
-
-
-
-
-
-
-
-
-
- size_t __TBB_EXPORTED_FUNC scalable_msize
- (
- void *
- ptr )
-
-
-
-
-
The analogue of msize/malloc_size/malloc_usable_size. Returns the usable size of a memory block previously allocated by scalable *, or 0 (zero) if ptr does not point to such a block.
-
-
-
-
-
-
-
-
- int __TBB_EXPORTED_FUNC scalable_posix_memalign
- (
- void **
- memptr ,
-
-
-
-
- size_t
- alignment ,
-
-
-
-
- size_t
- size
-
-
-
- )
-
-
-
-
-
The "posix_memalign" analogue.
-
-
-
-
-
-
-
-
- void* __TBB_EXPORTED_FUNC scalable_realloc
- (
- void *
- ptr ,
-
-
-
-
- size_t
- size
-
-
-
- )
-
-
-
-
-
The "realloc" analogue complementing scalable_malloc.
-
-
-
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00259.html b/doc/html/a00259.html
deleted file mode 100644
index eaa72172f2..0000000000
--- a/doc/html/a00259.html
+++ /dev/null
@@ -1,125 +0,0 @@
-
-
-
-
-
-
-Synchronization
-
-
-
-
-
-
-
-
-
-
-
-typedef
-interface7::internal::padded_mutex
-< interface7::internal::x86_eliding_mutex,
-false > tbb::speculative_spin_mutex
- A cross-platform spin mutex with speculative lock acquisition. More...
-
-typedef
-interface7::internal::padded_mutex
-< tbb::interface8::internal::x86_rtm_rw_mutex,
-true > tbb::interface8::speculative_spin_rw_mutex
- A cross-platform spin reader/writer mutex with speculative lock acquisition. More...
-
-
-
-
-
-
-
-
-
A cross-platform spin mutex with speculative lock acquisition.
-
On platforms with proper HW support, this lock may speculatively execute its critical sections, using HW mechanisms to detect real data races and ensure atomicity of the critical sections. In particular, it uses Intel(R) Transactional Synchronization Extensions (Intel(R) TSX). Without such HW support, it behaves like a spin_mutex . It should be used for locking short critical sections where the lock is contended but the data it protects are not. If zero-initialized, the mutex is considered unheld.
-
-
-
-
-
-
-
-
A cross-platform spin reader/writer mutex with speculative lock acquisition.
-
On platforms with proper HW support, this lock may speculatively execute its critical sections, using HW mechanisms to detect real data races and ensure atomicity of the critical sections. In particular, it uses Intel(R) Transactional Synchronization Extensions (Intel(R) TSX). Without such HW support, it behaves like a spin_rw_mutex. It should be used for locking short critical sections where the lock is contended but the data it protects are not.
-
-
-
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00260.html b/doc/html/a00260.html
deleted file mode 100644
index 75c08f877d..0000000000
--- a/doc/html/a00260.html
+++ /dev/null
@@ -1,52 +0,0 @@
-
-
-
-
-
-
-Timing
-
-
-
-
-
-
-
-
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00261.html b/doc/html/a00261.html
deleted file mode 100644
index b275ece3fd..0000000000
--- a/doc/html/a00261.html
+++ /dev/null
@@ -1,52 +0,0 @@
-
-
-
-
-
-
-Task Scheduling
-
-
-
-
-
-
-
-
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00264.html b/doc/html/a00264.html
deleted file mode 100644
index 62dc55d2d0..0000000000
--- a/doc/html/a00264.html
+++ /dev/null
@@ -1,65 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for rml::MemPoolPolicy , including all inherited members.
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00268.html b/doc/html/a00268.html
deleted file mode 100644
index 033cc97cad..0000000000
--- a/doc/html/a00268.html
+++ /dev/null
@@ -1,71 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::blocked_range< Value > , including all inherited members.
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00269.html b/doc/html/a00269.html
deleted file mode 100644
index ce282704a6..0000000000
--- a/doc/html/a00269.html
+++ /dev/null
@@ -1,68 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::blocked_range2d< RowValue, ColValue > , including all inherited members.
-
- blocked_range2d (RowValue row_begin, RowValue row_end, typename row_range_type::size_type row_grainsize, ColValue col_begin, ColValue col_end, typename col_range_type::size_type col_grainsize) (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue > inline
- blocked_range2d (RowValue row_begin, RowValue row_end, ColValue col_begin, ColValue col_end) (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue > inline
- blocked_range2d (blocked_range2d &r, split) (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue > inline
- blocked_range2d (blocked_range2d &r, proportional_split &proportion) (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue > inline
- col_range_type typedef (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue >
- cols () const tbb::blocked_range2d< RowValue, ColValue > inline
- do_split (blocked_range2d &r, Split &split_obj) (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue > inline
- empty () const tbb::blocked_range2d< RowValue, ColValue > inline
- is_divisible () const tbb::blocked_range2d< RowValue, ColValue > inline
- is_splittable_in_proportion tbb::blocked_range2d< RowValue, ColValue > static
- row_range_type typedeftbb::blocked_range2d< RowValue, ColValue >
- rows () const tbb::blocked_range2d< RowValue, ColValue > inline
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00270.html b/doc/html/a00270.html
deleted file mode 100644
index b567b4198b..0000000000
--- a/doc/html/a00270.html
+++ /dev/null
@@ -1,70 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::blocked_range3d< PageValue, RowValue, ColValue > , including all inherited members.
-
- blocked_range3d (PageValue page_begin, PageValue page_end, RowValue row_begin, RowValue row_end, ColValue col_begin, ColValue col_end) (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
- blocked_range3d (PageValue page_begin, PageValue page_end, typename page_range_type::size_type page_grainsize, RowValue row_begin, RowValue row_end, typename row_range_type::size_type row_grainsize, ColValue col_begin, ColValue col_end, typename col_range_type::size_type col_grainsize) (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
- blocked_range3d (blocked_range3d &r, split) (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
- blocked_range3d (blocked_range3d &r, proportional_split &proportion) (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
- col_range_type typedef (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue >
- cols () const tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
- do_split (blocked_range3d &r, Split &split_obj) (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
- empty () const tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
- is_divisible () const tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
- is_splittable_in_proportion tbb::blocked_range3d< PageValue, RowValue, ColValue > static
- page_range_type typedeftbb::blocked_range3d< PageValue, RowValue, ColValue >
- pages () const tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
- row_range_type typedef (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue >
- rows () const tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00271.html b/doc/html/a00271.html
index b51cb9db68..de9d0a8d24 100644
--- a/doc/html/a00271.html
+++ b/doc/html/a00271.html
@@ -4,7 +4,7 @@
-Member List
+rml Namespace Reference
@@ -19,51 +19,92 @@
Main Page
Related Pages
Modules
- Namespaces
- Classes
+ Namespaces
+ Classes
Files
-
-
This is the complete list of members for tbb::cache_aligned_allocator< T > , including all inherited members.
-
+The namespace rml contains components of low-level memory pool interface.
+More...
+
+
+
+typedef void *(* rawAllocType )(intptr_t pool_id, size_t &bytes)
+
+
+typedef int(* rawFreeType )(intptr_t pool_id, void *raw_ptr, size_t raw_bytes)
+
+
+
+enum MemPoolError {
+ POOL_OK = TBBMALLOC_OK,
+INVALID_POLICY = TBBMALLOC_INVALID_PARAM,
+UNSUPPORTED_POLICY = TBBMALLOC_UNSUPPORTED,
+NO_MEMORY = TBBMALLOC_NO_MEMORY,
+
+ NO_EFFECT = TBBMALLOC_NO_EFFECT
+
+ }
+
+
+
+
+MemPoolError pool_create_v1 (intptr_t pool_id, const MemPoolPolicy *policy, rml::MemoryPool **pool)
+
+
+bool pool_destroy (MemoryPool *memPool)
+
+
+void * pool_malloc (MemoryPool *memPool, size_t size)
+
+
+void * pool_realloc (MemoryPool *memPool, void *object, size_t size)
+
+
+void * pool_aligned_malloc (MemoryPool *mPool, size_t size, size_t alignment)
+
+
+void * pool_aligned_realloc (MemoryPool *mPool, void *ptr, size_t size, size_t alignment)
+
+
+bool pool_reset (MemoryPool *memPool)
+
+
+bool pool_free (MemoryPool *memPool, void *object)
+
+
+MemoryPool * pool_identify (void *object)
+
+
+
+The namespace rml contains components of low-level memory pool interface.
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00274.html b/doc/html/a00274.html
index 34810cd9f4..d8a92f5288 100644
--- a/doc/html/a00274.html
+++ b/doc/html/a00274.html
@@ -4,7 +4,7 @@
-Member List
+tbb Namespace Reference
@@ -19,33 +19,689 @@
Main Page
Related Pages
Modules
- Namespaces
- Classes
+ Namespaces
+ Classes
Files
-
-
This is the complete list of members for tbb::cache_aligned_allocator< void >::rebind< U > , including all inherited members.
-
+The namespace tbb contains all components of the library.
+More...
+
+
+class aligned_space
+ Block of space aligned sufficiently to construct an array T with N elements. More...
+
+struct atomic
+ Primary template for atomic. More...
+
+struct atomic< void * >
+ Specialization for atomic<void*> , for sake of not allowing arithmetic or operator->. More...
+
+class blocked_range
+ A range over which to iterate. More...
+
+class blocked_range2d
+ A 2-dimensional range that models the Range concept. More...
+
+class blocked_range3d
+ A 3-dimensional range that models the Range concept. More...
+
+class cache_aligned_allocator
+ Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
+
+class cache_aligned_allocator< void >
+ Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
+
+class combinable
+ Thread-local storage with optional reduction. More...
+
+class concurrent_bounded_queue
+ A high-performance thread-safe blocking concurrent bounded queue. More...
+
+class concurrent_vector
+ Concurrent vector container. More...
+
+class vector_iterator
+
+class mutex
+ Wrapper around the platform's native reader-writer lock. More...
+
+class null_mutex
+ A mutex which does nothing. More...
+
+class null_rw_mutex
+ A rw mutex which does nothing. More...
+
+class parallel_do_feeder
+ Class the user supplied algorithm body uses to add new tasks. More...
+
+struct task_group_context
+
+struct pre_scan_tag
+ Used to indicate that the initial scan is being performed. More...
+
+struct final_scan_tag
+ Used to indicate that the final scan is being performed. More...
+
+class parallel_while
+ Parallel iteration over a stream, with optional addition of more work. More...
+
+class filter
+ A stage in a pipeline. More...
+
+class thread_bound_filter
+ A stage in a pipeline served by a user thread. More...
+
+class pipeline
+ A processing pipeline that applies filters to items. More...
+
+class queuing_mutex
+ Queuing mutex with local-only spinning. More...
+
+class queuing_rw_mutex
+ Queuing reader-writer mutex with local-only spinning. More...
+
+class recursive_mutex
+
+class scalable_allocator
+ Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
+
+class scalable_allocator< void >
+ Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
+
+class spin_mutex
+ A lock that occupies a single byte. More...
+
+class spin_rw_mutex_v3
+ Fast, unfair, spinning reader-writer lock with backoff and writer-preference. More...
+
+class task_handle
+
+class task_group
+
+class structured_task_group
+
+class task_scheduler_init
+ Class delimiting the scope of task scheduler activity. More...
+
+class tbb_allocator
+ Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
+
+class tbb_allocator< void >
+ Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
+
+class zero_allocator
+ Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
+
+class zero_allocator< void, Allocator >
+ Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
+
+class bad_last_alloc
+ Exception for concurrent containers. More...
+
+class improper_lock
+ Exception for PPL locks. More...
+
+class user_abort
+ Exception for user-initiated abort. More...
+
+class missing_wait
+ Exception for missing wait on structured_task_group . More...
+
+class invalid_multiple_scheduling
+ Exception for repeated scheduling of the same task_handle . More...
+
+class tbb_exception
+ Interface to be implemented by all exceptions TBB recognizes and propagates across the threads. More...
+
+class captured_exception
+ This class is used by TBB to propagate information about unhandled exceptions into the root thread. More...
+
+class movable_exception
+ Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread. More...
+
+class tick_count
+ Absolute timestamp. More...
+
+
+
+
+ __TBB_DECL_ATOMIC (__TBB_LONG_LONG) __TBB_DECL_ATOMIC(unsigned __TBB_LONG_LONG) __TBB_DECL_ATOMIC(long) __TBB_DECL_ATOMIC(unsigned long) __TBB_DECL_ATOMIC_ALT (unsigned
+
+
+size_t __TBB_DECL_ATOMIC_ALT (int, ptrdiff_t) __TBB_DECL_ATOMIC(unsigned) __TBB_DECL_ATOMIC(int) __TBB_DECL_ATOMIC(unsigned short) __TBB_DECL_ATOMIC(short) __TBB_DECL_ATOMIC(char) __TBB_DECL_ATOMIC(signed char) __TBB_DECL_ATOMIC(unsigned char) __TBB_DECL_ATOMIC(wchar_t) template< typename T > struct atomic < T * >
+ Specialization for atomic<T*> with arithmetic and operator->.
+
+
+template<memory_semantics M, typename T >
+T load (const atomic < T > &a)
+
+
+template<memory_semantics M, typename T >
+void store (atomic < T > &a, T value)
+
+
+template<typename T , typename U >
+bool operator== (const cache_aligned_allocator < T > &, const cache_aligned_allocator < U > &)
+
+
+template<typename T , typename U >
+bool operator!= (const cache_aligned_allocator < T > &, const cache_aligned_allocator < U > &)
+
+
+template<typename Key , typename T , typename HashCompare , typename A1 , typename A2 >
+bool operator== (const concurrent_hash_map< Key, T, HashCompare, A1 > &a, const concurrent_hash_map< Key, T, HashCompare, A2 > &b)
+
+
+template<typename Key , typename T , typename HashCompare , typename A1 , typename A2 >
+bool operator!= (const concurrent_hash_map< Key, T, HashCompare, A1 > &a, const concurrent_hash_map< Key, T, HashCompare, A2 > &b)
+
+
+template<typename Key , typename T , typename HashCompare , typename A >
+void swap (concurrent_hash_map< Key, T, HashCompare, A > &a, concurrent_hash_map< Key, T, HashCompare, A > &b)
+
+
+template<typename T , class A1 , class A2 >
+bool operator== (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
+
+
+template<typename T , class A1 , class A2 >
+bool operator!= (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
+
+
+template<typename T , class A1 , class A2 >
+bool operator< (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
+
+
+template<typename T , class A1 , class A2 >
+bool operator> (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
+
+
+template<typename T , class A1 , class A2 >
+bool operator<= (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
+
+
+template<typename T , class A1 , class A2 >
+bool operator>= (const concurrent_vector < T, A1 > &a, const concurrent_vector < T, A2 > &b)
+
+
+template<typename T , class A >
+void swap (concurrent_vector < T, A > &a, concurrent_vector < T, A > &b)
+
+
+template<typename T , typename U >
+bool operator== (const scalable_allocator < T > &, const scalable_allocator < U > &)
+
+
+template<typename T , typename U >
+bool operator!= (const scalable_allocator < T > &, const scalable_allocator < U > &)
+
+
+bool is_current_task_group_canceling ()
+
+
+template<class F >
+task_handle < F > make_task (const F &f)
+
+
+template<typename T , typename U >
+bool operator== (const tbb_allocator < T > &, const tbb_allocator < U > &)
+
+
+template<typename T , typename U >
+bool operator!= (const tbb_allocator < T > &, const tbb_allocator < U > &)
+
+
+template<typename T1 , template< typename X1 > class B1, typename T2 , template< typename X2 > class B2>
+bool operator== (const zero_allocator < T1, B1 > &a, const zero_allocator < T2, B2 > &b)
+
+
+template<typename T1 , template< typename X1 > class B1, typename T2 , template< typename X2 > class B2>
+bool operator!= (const zero_allocator < T1, B1 > &a, const zero_allocator < T2, B2 > &b)
+
+int __TBB_EXPORTED_FUNC TBB_runtime_interface_version ()
+ The function returns the interface version of the TBB shared library being used. More...
+
+
+void swap (internal::tbb_thread_v3 &t1, internal::tbb_thread_v3 &t2) __TBB_NOEXCEPT(true)
+
+
+void move (tbb_thread &t1, tbb_thread &t2)
+
+
+tick_count::interval_t operator- (const tick_count &t1, const tick_count &t0)
+
+
+See also requirements on parallel_do Body .
+
+template<typename Iterator , typename Body >
+void parallel_do (Iterator first, Iterator last, const Body &body)
+ Parallel iteration over a range, with optional addition of more work. More...
+
+
+template<typename Range , typename Body >
+void parallel_do (Range &rng, const Body &body)
+
+
+template<typename Range , typename Body >
+void parallel_do (const Range &rng, const Body &body)
+
+template<typename Iterator , typename Body >
+void parallel_do (Iterator first, Iterator last, const Body &body, task_group_context &context)
+ Parallel iteration over a range, with optional addition of more work and user-supplied context. More...
+
+
+template<typename Range , typename Body >
+void parallel_do (Range &rng, const Body &body, task_group_context &context)
+
+
+template<typename Range , typename Body >
+void parallel_do (const Range &rng, const Body &body, task_group_context &context)
+
+
+See also requirements on Range and parallel_for Body .
+
+template<typename Range , typename Body >
+void parallel_for (const Range &range, const Body &body)
+ Parallel iteration over range with default partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_for (const Range &range, const Body &body, const simple_partitioner &partitioner)
+ Parallel iteration over range with simple partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_for (const Range &range, const Body &body, const auto_partitioner &partitioner)
+ Parallel iteration over range with auto_partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_for (const Range &range, const Body &body, const static_partitioner &partitioner)
+ Parallel iteration over range with static_partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_for (const Range &range, const Body &body, affinity_partitioner &partitioner)
+ Parallel iteration over range with affinity_partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_for (const Range &range, const Body &body, task_group_context &context)
+ Parallel iteration over range with default partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void parallel_for (const Range &range, const Body &body, const simple_partitioner &partitioner, task_group_context &context)
+ Parallel iteration over range with simple partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void parallel_for (const Range &range, const Body &body, const auto_partitioner &partitioner, task_group_context &context)
+ Parallel iteration over range with auto_partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void parallel_for (const Range &range, const Body &body, const static_partitioner &partitioner, task_group_context &context)
+ Parallel iteration over range with static_partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void parallel_for (const Range &range, const Body &body, affinity_partitioner &partitioner, task_group_context &context)
+ Parallel iteration over range with affinity_partitioner and user-supplied context. More...
+
+
+template<typename Iterator , typename Function >
+void parallel_for_each (Iterator first, Iterator last, const Function &f, task_group_context &context)
+ Calls function f for all items from [first, last) interval using user-supplied context. More...
+
+template<typename Range , typename Function >
+void parallel_for_each (Range &rng, const Function &f, task_group_context &context)
+ Calls function f for all items from rng using user-supplied context. More...
+
+template<typename Range , typename Function >
+void parallel_for_each (const Range &rng, const Function &f, task_group_context &context)
+ Calls function f for all items from const rng user-supplied context. More...
+
+
+template<typename Iterator , typename Function >
+void parallel_for_each (Iterator first, Iterator last, const Function &f)
+ Uses default context.
+
+
+template<typename Range , typename Function >
+void parallel_for_each (Range &rng, const Function &f)
+ Uses default context.
+
+
+template<typename Range , typename Function >
+void parallel_for_each (const Range &rng, const Function &f)
+ Uses default context.
+
+
+template<typename F0 , typename F1 , typename... F>
+void parallel_invoke (F0 &&f0, F1 &&f1, F &&...f)
+ Executes a list of tasks in parallel and waits for all tasks to complete. More...
+
+
+template<typename F0 , typename F1 >
+void parallel_invoke (const F0 &f0, const F1 &f1, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 , typename F9 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, const F9 &f9, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 >
+void parallel_invoke (const F0 &f0, const F1 &f1)
+
+
+template<typename F0 , typename F1 , typename F2 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 , typename F9 >
+void parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, const F9 &f9)
+
+
+See also requirements on Range and parallel_reduce Body .
+
+template<typename Range , typename Body >
+void parallel_reduce (const Range &range, Body &body)
+ Parallel iteration with reduction and default partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_reduce (const Range &range, Body &body, const simple_partitioner &partitioner)
+ Parallel iteration with reduction and simple_partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_reduce (const Range &range, Body &body, const auto_partitioner &partitioner)
+ Parallel iteration with reduction and auto_partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_reduce (const Range &range, Body &body, const static_partitioner &partitioner)
+ Parallel iteration with reduction and static_partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_reduce (const Range &range, Body &body, affinity_partitioner &partitioner)
+ Parallel iteration with reduction and affinity_partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_reduce (const Range &range, Body &body, const simple_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, simple partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void parallel_reduce (const Range &range, Body &body, const auto_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, auto_partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void parallel_reduce (const Range &range, Body &body, const static_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, static_partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void parallel_reduce (const Range &range, Body &body, affinity_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, affinity_partitioner and user-supplied context. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction)
+ Parallel iteration with reduction and default partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner)
+ Parallel iteration with reduction and simple_partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const auto_partitioner &partitioner)
+ Parallel iteration with reduction and auto_partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const static_partitioner &partitioner)
+ Parallel iteration with reduction and static_partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, affinity_partitioner &partitioner)
+ Parallel iteration with reduction and affinity_partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, simple partitioner and user-supplied context. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const auto_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, auto_partitioner and user-supplied context. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const static_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, static_partitioner and user-supplied context. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, affinity_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, affinity_partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void parallel_deterministic_reduce (const Range &range, Body &body)
+ Parallel iteration with deterministic reduction and default partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_deterministic_reduce (const Range &range, Body &body, task_group_context &context)
+ Parallel iteration with deterministic reduction, simple partitioner and user-supplied context. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction)
+ Parallel iteration with deterministic reduction and default partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, task_group_context &context)
+ Parallel iteration with deterministic reduction, simple partitioner and user-supplied context. More...
+
+
+See also requirements on Range and parallel_scan Body .
+
+template<typename Range , typename Body >
+void parallel_scan (const Range &range, Body &body)
+ Parallel prefix with default partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_scan (const Range &range, Body &body, const simple_partitioner &partitioner)
+ Parallel prefix with simple_partitioner. More...
+
+template<typename Range , typename Body >
+void parallel_scan (const Range &range, Body &body, const auto_partitioner &partitioner)
+ Parallel prefix with auto_partitioner. More...
+
+
+See also requirements on iterators for parallel_sort .
+
+template<typename RandomAccessIterator , typename Compare >
+void parallel_sort (RandomAccessIterator begin, RandomAccessIterator end, const Compare &comp)
+ Sorts the data in [begin,end) using the given comparator. More...
+
+template<typename RandomAccessIterator >
+void parallel_sort (RandomAccessIterator begin, RandomAccessIterator end)
+ Sorts the data in [begin,end) with a default comparator std::less<RandomAccessIterator>
More...
+
+template<typename Range , typename Compare >
+void parallel_sort (Range &rng, const Compare &comp)
+ Sorts the data in rng using the given comparator. More...
+
+template<typename Range , typename Compare >
+void parallel_sort (const Range &rng, const Compare &comp)
+ Sorts the data in const rng using the given comparator. More...
+
+template<typename Range >
+void parallel_sort (Range &rng)
+ Sorts the data in rng with a default comparator std::less<RandomAccessIterator>
More...
+
+template<typename Range >
+void parallel_sort (const Range &rng)
+ Sorts the data in const rng with a default comparator std::less<RandomAccessIterator>
More...
+
+template<typename T >
+void parallel_sort (T *begin, T *end)
+ Sorts the data in the range
[begin,end) with a default comparator std::less<T>
More...
+
+
+
+The namespace tbb contains all components of the library.
+
+
+
+
+
+
Specifies memory semantics.
+
+Enumerator full_fence
+Sequential consistency.
+
+ acquire
+Acquire.
+
+ release
+Release.
+
+ relaxed
+No ordering.
+
+
+
+
+
+
+
+
+
+
+
+ int __TBB_EXPORTED_FUNC tbb::TBB_runtime_interface_version
+ (
+ )
+
+
+
+
+
+
The function returns the interface version of the TBB shared library being used.
+
The version it returns is determined at runtime, not at compile/link time. So it can be different than the value of TBB_INTERFACE_VERSION obtained at compile time.
+
+
+
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00275.html b/doc/html/a00275.html
deleted file mode 100644
index 138a38414d..0000000000
--- a/doc/html/a00275.html
+++ /dev/null
@@ -1,66 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::combinable< T > , including all inherited members.
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00276.html b/doc/html/a00276.html
deleted file mode 100644
index 2d377adb26..0000000000
--- a/doc/html/a00276.html
+++ /dev/null
@@ -1,90 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::concurrent_bounded_queue< T, A > , including all inherited members.
-
- abort ()tbb::concurrent_bounded_queue< T, A > inline
- allocator_type typedeftbb::concurrent_bounded_queue< T, A >
- capacity () const tbb::concurrent_bounded_queue< T, A > inline
- clear ()tbb::concurrent_bounded_queue< T, A >
- concurrent_bounded_queue (const allocator_type &a=allocator_type())tbb::concurrent_bounded_queue< T, A > inline explicit
- concurrent_bounded_queue (const concurrent_bounded_queue &src, const allocator_type &a=allocator_type())tbb::concurrent_bounded_queue< T, A > inline
- concurrent_bounded_queue (concurrent_bounded_queue &&src)tbb::concurrent_bounded_queue< T, A > inline
- concurrent_bounded_queue (concurrent_bounded_queue &&src, const allocator_type &a) (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
- concurrent_bounded_queue (InputIterator begin, InputIterator end, const allocator_type &a=allocator_type())tbb::concurrent_bounded_queue< T, A > inline
- const_iterator typedef (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A >
- const_reference typedeftbb::concurrent_bounded_queue< T, A >
- difference_type typedeftbb::concurrent_bounded_queue< T, A >
- emplace (Arguments &&...args) (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
- empty () const tbb::concurrent_bounded_queue< T, A > inline
- get_allocator () const tbb::concurrent_bounded_queue< T, A > inline
- internal::concurrent_queue_iterator (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > friend
- iterator typedef (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A >
- pop (T &destination)tbb::concurrent_bounded_queue< T, A > inline
- push (const T &source)tbb::concurrent_bounded_queue< T, A > inline
- push (T &&source)tbb::concurrent_bounded_queue< T, A > inline
- reference typedeftbb::concurrent_bounded_queue< T, A >
- set_capacity (size_type new_capacity)tbb::concurrent_bounded_queue< T, A > inline
- size () const tbb::concurrent_bounded_queue< T, A > inline
- size_type typedeftbb::concurrent_bounded_queue< T, A >
- try_emplace (Arguments &&...args) (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
- try_pop (T &destination)tbb::concurrent_bounded_queue< T, A > inline
- try_push (const T &source)tbb::concurrent_bounded_queue< T, A > inline
- try_push (T &&source)tbb::concurrent_bounded_queue< T, A > inline
- unsafe_begin () (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
- unsafe_begin () const (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
- unsafe_end () (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
- unsafe_end () const (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
- value_type typedeftbb::concurrent_bounded_queue< T, A >
- ~concurrent_bounded_queue ()tbb::concurrent_bounded_queue< T, A >
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00277.html b/doc/html/a00277.html
deleted file mode 100644
index 99afc096be..0000000000
--- a/doc/html/a00277.html
+++ /dev/null
@@ -1,134 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::concurrent_vector< T, A > , including all inherited members.
-
- allocator_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- assign (size_type n, const_reference t)tbb::concurrent_vector< T, A > inline
- assign (I first, I last)tbb::concurrent_vector< T, A > inline
- assign (std::initializer_list< T > init_list)tbb::concurrent_vector< T, A > inline
- at (size_type index)tbb::concurrent_vector< T, A > inline
- at (size_type index) const tbb::concurrent_vector< T, A > inline
- back ()tbb::concurrent_vector< T, A > inline
- back () const tbb::concurrent_vector< T, A > inline
- begin ()tbb::concurrent_vector< T, A > inline
- begin () const tbb::concurrent_vector< T, A > inline
- capacity () const tbb::concurrent_vector< T, A > inline
- cbegin () const tbb::concurrent_vector< T, A > inline
- cend () const tbb::concurrent_vector< T, A > inline
- clear ()tbb::concurrent_vector< T, A > inline
- concurrent_vector (const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline explicit
- concurrent_vector (std::initializer_list< T > init_list, const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline
- concurrent_vector (const concurrent_vector &vector, const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline
- concurrent_vector (concurrent_vector &&source)tbb::concurrent_vector< T, A > inline
- concurrent_vector (concurrent_vector &&source, const allocator_type &a) (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A > inline
- concurrent_vector (const concurrent_vector< T, M > &vector, const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline
- concurrent_vector (size_type n)tbb::concurrent_vector< T, A > inline explicit
- concurrent_vector (size_type n, const_reference t, const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline
- concurrent_vector (I first, I last, const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline
- const_iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- const_pointer typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- const_range_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- const_reference typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- const_reverse_iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- const_reverse_iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- copy_range (void *dst, const void *p_type_erased_iterator, size_type n) (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- crbegin () const tbb::concurrent_vector< T, A > inline
- crend () const tbb::concurrent_vector< T, A > inline
- difference_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- emplace_back (Args &&...args)tbb::concurrent_vector< T, A > inline
- empty () const tbb::concurrent_vector< T, A > inline
- end ()tbb::concurrent_vector< T, A > inline
- end () const tbb::concurrent_vector< T, A > inline
- front ()tbb::concurrent_vector< T, A > inline
- front () const tbb::concurrent_vector< T, A > inline
- get_allocator () const tbb::concurrent_vector< T, A > inline
- grow_by (size_type delta)tbb::concurrent_vector< T, A > inline
- grow_by (size_type delta, const_reference t)tbb::concurrent_vector< T, A > inline
- grow_by (I first, I last)tbb::concurrent_vector< T, A > inline
- grow_by (std::initializer_list< T > init_list)tbb::concurrent_vector< T, A > inline
- grow_to_at_least (size_type n)tbb::concurrent_vector< T, A > inline
- grow_to_at_least (size_type n, const_reference t)tbb::concurrent_vector< T, A > inline
- internal::vector_iterator (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A > friend
- internal_vector_base () const (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A > inline
- iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- max_size () const tbb::concurrent_vector< T, A > inline
- operator= (const concurrent_vector &vector)tbb::concurrent_vector< T, A > inline
- operator= (concurrent_vector &&other)tbb::concurrent_vector< T, A > inline
- operator= (const concurrent_vector< T, M > &vector)tbb::concurrent_vector< T, A > inline
- operator= (std::initializer_list< T > init_list)tbb::concurrent_vector< T, A > inline
- operator[] (size_type index)tbb::concurrent_vector< T, A > inline
- operator[] (size_type index) const tbb::concurrent_vector< T, A > inline
- pointer typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- push_back (const_reference item)tbb::concurrent_vector< T, A > inline
- push_back (T &&item)tbb::concurrent_vector< T, A > inline
- range (size_t grainsize=1)tbb::concurrent_vector< T, A > inline
- range (size_t grainsize=1) const tbb::concurrent_vector< T, A > inline
- range_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- rbegin ()tbb::concurrent_vector< T, A > inline
- rbegin () const tbb::concurrent_vector< T, A > inline
- reference typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- rend ()tbb::concurrent_vector< T, A > inline
- rend () const tbb::concurrent_vector< T, A > inline
- reserve (size_type n)tbb::concurrent_vector< T, A > inline
- resize (size_type n)tbb::concurrent_vector< T, A > inline
- resize (size_type n, const_reference t)tbb::concurrent_vector< T, A > inline
- reverse_iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- reverse_iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- shrink_to_fit ()tbb::concurrent_vector< T, A >
- size () const tbb::concurrent_vector< T, A > inline
- size_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- swap (concurrent_vector &vector)tbb::concurrent_vector< T, A > inline
- value_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
- ~concurrent_vector ()tbb::concurrent_vector< T, A > inline
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00278.html b/doc/html/a00278.html
deleted file mode 100644
index 0b53adabca..0000000000
--- a/doc/html/a00278.html
+++ /dev/null
@@ -1,60 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::concurrent_vector< T, A >::push_back_helper::element_construction_guard , including all inherited members.
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00279.html b/doc/html/a00279.html
deleted file mode 100644
index 2d6ede55ee..0000000000
--- a/doc/html/a00279.html
+++ /dev/null
@@ -1,73 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::mutex , including all inherited members.
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00280.html b/doc/html/a00280.html
deleted file mode 100644
index 877525856d..0000000000
--- a/doc/html/a00280.html
+++ /dev/null
@@ -1,63 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::mutex::scoped_lock , including all inherited members.
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00283.html b/doc/html/a00283.html
deleted file mode 100644
index 4cbc79a9b6..0000000000
--- a/doc/html/a00283.html
+++ /dev/null
@@ -1,60 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::null_rw_mutex , including all inherited members.
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00284.html b/doc/html/a00284.html
deleted file mode 100644
index 185e5931d2..0000000000
--- a/doc/html/a00284.html
+++ /dev/null
@@ -1,64 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::null_rw_mutex::scoped_lock , including all inherited members.
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00289.html b/doc/html/a00289.html
index c16aef7887..7708a97e48 100644
--- a/doc/html/a00289.html
+++ b/doc/html/a00289.html
@@ -4,7 +4,7 @@
-Member List
+Algorithms
@@ -20,36 +20,2269 @@
Related Pages
Modules
Namespaces
- Classes
+ Classes
Files
-
-
+
+
+ See also requirements on parallel_do Body .
+
+template<typename Iterator , typename Body >
+void tbb::parallel_do (Iterator first, Iterator last, const Body &body)
+ Parallel iteration over a range, with optional addition of more work. More...
+
+template<typename Iterator , typename Body >
+void tbb::parallel_do (Iterator first, Iterator last, const Body &body, task_group_context &context)
+ Parallel iteration over a range, with optional addition of more work and user-supplied context. More...
+
+
+template<typename Range , typename Body >
+void tbb::parallel_do (Range &rng, const Body &body)
+
+
+template<typename Range , typename Body >
+void tbb::parallel_do (const Range &rng, const Body &body)
+
+
+template<typename Range , typename Body >
+void tbb::parallel_do (Range &rng, const Body &body, task_group_context &context)
+
+
+template<typename Range , typename Body >
+void tbb::parallel_do (const Range &rng, const Body &body, task_group_context &context)
+
+
+
+ See also requirements on Range and parallel_for Body .
+
+template<typename Range , typename Body >
+void tbb::parallel_for (const Range &range, const Body &body)
+ Parallel iteration over range with default partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_for (const Range &range, const Body &body, const simple_partitioner &partitioner)
+ Parallel iteration over range with simple partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_for (const Range &range, const Body &body, const auto_partitioner &partitioner)
+ Parallel iteration over range with auto_partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_for (const Range &range, const Body &body, const static_partitioner &partitioner)
+ Parallel iteration over range with static_partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_for (const Range &range, const Body &body, affinity_partitioner &partitioner)
+ Parallel iteration over range with affinity_partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_for (const Range &range, const Body &body, task_group_context &context)
+ Parallel iteration over range with default partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_for (const Range &range, const Body &body, const simple_partitioner &partitioner, task_group_context &context)
+ Parallel iteration over range with simple partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_for (const Range &range, const Body &body, const auto_partitioner &partitioner, task_group_context &context)
+ Parallel iteration over range with auto_partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_for (const Range &range, const Body &body, const static_partitioner &partitioner, task_group_context &context)
+ Parallel iteration over range with static_partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_for (const Range &range, const Body &body, affinity_partitioner &partitioner, task_group_context &context)
+ Parallel iteration over range with affinity_partitioner and user-supplied context. More...
+
+
+
+template<typename Iterator , typename Function >
+void tbb::parallel_for_each (Iterator first, Iterator last, const Function &f, task_group_context &context)
+ Calls function f for all items from [first, last) interval using user-supplied context. More...
+
+template<typename Range , typename Function >
+void tbb::parallel_for_each (Range &rng, const Function &f, task_group_context &context)
+ Calls function f for all items from rng using user-supplied context. More...
+
+template<typename Range , typename Function >
+void tbb::parallel_for_each (const Range &rng, const Function &f, task_group_context &context)
+ Calls function f for all items from const rng user-supplied context. More...
+
+
+template<typename Iterator , typename Function >
+void tbb::parallel_for_each (Iterator first, Iterator last, const Function &f)
+ Uses default context.
+
+
+template<typename Range , typename Function >
+void tbb::parallel_for_each (Range &rng, const Function &f)
+ Uses default context.
+
+
+template<typename Range , typename Function >
+void tbb::parallel_for_each (const Range &rng, const Function &f)
+ Uses default context.
+
+
+
+template<typename F0 , typename F1 , typename... F>
+void tbb::parallel_invoke (F0 &&f0, F1 &&f1, F &&...f)
+ Executes a list of tasks in parallel and waits for all tasks to complete. More...
+
+
+template<typename F0 , typename F1 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 , typename F9 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, const F9 &f9, tbb::task_group_context &context)
+
+
+template<typename F0 , typename F1 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1)
+
+
+template<typename F0 , typename F1 , typename F2 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8)
+
+
+template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 , typename F9 >
+void tbb::parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, const F9 &f9)
+
+
+
+ See also requirements on Range and parallel_reduce Body .
+
+template<typename Range , typename Body >
+void tbb::parallel_reduce (const Range &range, Body &body)
+ Parallel iteration with reduction and default partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_reduce (const Range &range, Body &body, const simple_partitioner &partitioner)
+ Parallel iteration with reduction and simple_partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_reduce (const Range &range, Body &body, const auto_partitioner &partitioner)
+ Parallel iteration with reduction and auto_partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_reduce (const Range &range, Body &body, const static_partitioner &partitioner)
+ Parallel iteration with reduction and static_partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_reduce (const Range &range, Body &body, affinity_partitioner &partitioner)
+ Parallel iteration with reduction and affinity_partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_reduce (const Range &range, Body &body, const simple_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, simple partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_reduce (const Range &range, Body &body, const auto_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, auto_partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_reduce (const Range &range, Body &body, const static_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, static_partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_reduce (const Range &range, Body &body, affinity_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, affinity_partitioner and user-supplied context. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction)
+ Parallel iteration with reduction and default partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner)
+ Parallel iteration with reduction and simple_partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const auto_partitioner &partitioner)
+ Parallel iteration with reduction and auto_partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const static_partitioner &partitioner)
+ Parallel iteration with reduction and static_partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, affinity_partitioner &partitioner)
+ Parallel iteration with reduction and affinity_partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, simple partitioner and user-supplied context. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const auto_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, auto_partitioner and user-supplied context. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const static_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, static_partitioner and user-supplied context. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, affinity_partitioner &partitioner, task_group_context &context)
+ Parallel iteration with reduction, affinity_partitioner and user-supplied context. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_deterministic_reduce (const Range &range, Body &body)
+ Parallel iteration with deterministic reduction and default partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_deterministic_reduce (const Range &range, Body &body, task_group_context &context)
+ Parallel iteration with deterministic reduction, simple partitioner and user-supplied context. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction)
+ Parallel iteration with deterministic reduction and default partitioner. More...
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+Value tbb::parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, task_group_context &context)
+ Parallel iteration with deterministic reduction, simple partitioner and user-supplied context. More...
+
+
+
+ See also requirements on Range and parallel_scan Body .
+
+template<typename Range , typename Body >
+void tbb::parallel_scan (const Range &range, Body &body)
+ Parallel prefix with default partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_scan (const Range &range, Body &body, const simple_partitioner &partitioner)
+ Parallel prefix with simple_partitioner. More...
+
+template<typename Range , typename Body >
+void tbb::parallel_scan (const Range &range, Body &body, const auto_partitioner &partitioner)
+ Parallel prefix with auto_partitioner. More...
+
+
+
+ See also requirements on iterators for parallel_sort .
+
+template<typename RandomAccessIterator , typename Compare >
+void tbb::parallel_sort (RandomAccessIterator begin, RandomAccessIterator end, const Compare &comp)
+ Sorts the data in [begin,end) using the given comparator. More...
+
+template<typename RandomAccessIterator >
+void tbb::parallel_sort (RandomAccessIterator begin, RandomAccessIterator end)
+ Sorts the data in [begin,end) with a default comparator std::less<RandomAccessIterator>
More...
+
+template<typename Range , typename Compare >
+void tbb::parallel_sort (Range &rng, const Compare &comp)
+ Sorts the data in rng using the given comparator. More...
+
+template<typename Range , typename Compare >
+void tbb::parallel_sort (const Range &rng, const Compare &comp)
+ Sorts the data in const rng using the given comparator. More...
+
+template<typename Range >
+void tbb::parallel_sort (Range &rng)
+ Sorts the data in rng with a default comparator std::less<RandomAccessIterator>
More...
+
+template<typename Range >
+void tbb::parallel_sort (const Range &rng)
+ Sorts the data in const rng with a default comparator std::less<RandomAccessIterator>
More...
+
+template<typename T >
+void tbb::parallel_sort (T *begin, T *end)
+ Sorts the data in the range
[begin,end) with a default comparator std::less<T>
More...
+
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_deterministic_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with deterministic reduction and default partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_deterministic_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with deterministic reduction, simple partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_deterministic_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction
+
+
+
+ )
+
+
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_deterministic_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with deterministic reduction, simple partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Iterator , typename Body >
+
+
+ void tbb::parallel_do
+ (
+ Iterator
+ first ,
+
+
+
+
+ Iterator
+ last ,
+
+
+
+
+ const Body &
+ body
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over a range, with optional addition of more work.
+
+
+
+
+
+
+
+template<typename Iterator , typename Body >
+
+
+ void tbb::parallel_do
+ (
+ Iterator
+ first ,
+
+
+
+
+ Iterator
+ last ,
+
+
+
+
+ const Body &
+ body ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over a range, with optional addition of more work and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_for
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Body &
+ body
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over range with default partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_for
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Body &
+ body ,
+
+
+
+
+ const simple_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over range with simple partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_for
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Body &
+ body ,
+
+
+
+
+ const auto_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over range with auto_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_for
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Body &
+ body ,
+
+
+
+
+ const static_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over range with static_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_for
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Body &
+ body ,
+
+
+
+
+ affinity_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over range with affinity_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_for
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Body &
+ body ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over range with default partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_for
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Body &
+ body ,
+
+
+
+
+ const simple_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over range with simple partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_for
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Body &
+ body ,
+
+
+
+
+ const auto_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over range with auto_partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_for
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Body &
+ body ,
+
+
+
+
+ const static_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over range with static_partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_for
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Body &
+ body ,
+
+
+
+
+ affinity_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration over range with affinity_partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Iterator , typename Function >
+
+
+ void tbb::parallel_for_each
+ (
+ Iterator
+ first ,
+
+
+
+
+ Iterator
+ last ,
+
+
+
+
+ const Function &
+ f ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Calls function f for all items from [first, last) interval using user-supplied context.
+
+
Referenced by tbb::parallel_for_each() .
+
+
+
+
+
+
+
+template<typename Range , typename Function >
+
+
+ void tbb::parallel_for_each
+ (
+ Range &
+ rng ,
+
+
+
+
+ const Function &
+ f ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
+
+
+
+template<typename Range , typename Function >
+
+
+ void tbb::parallel_for_each
+ (
+ const Range &
+ rng ,
+
+
+
+
+ const Function &
+ f ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
+
+
+
+template<typename F0 , typename F1 , typename... F>
+
+
+ void tbb::parallel_invoke
+ (
+ F0 &&
+ f0 ,
+
+
+
+
+ F1 &&
+ f1 ,
+
+
+
+
+ F &&...
+ f
+
+
+
+ )
+
+
+
+
+
+
Executes a list of tasks in parallel and waits for all tasks to complete.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction and default partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ const simple_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction and simple_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ const auto_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction and auto_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ const static_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction and static_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ affinity_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
-
This is the complete list of members for tbb::filter , including all inherited members.
-
+
Parallel iteration with reduction and affinity_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ const simple_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction, simple partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ const auto_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction, auto_partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ const static_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction, static_partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ affinity_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction, affinity_partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction
+
+
+
+ )
+
+
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction ,
+
+
+
+
+ const simple_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction and simple_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction ,
+
+
+
+
+ const auto_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction and auto_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction ,
+
+
+
+
+ const static_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction and static_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction ,
+
+
+
+
+ affinity_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction and affinity_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction ,
+
+
+
+
+ const simple_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction, simple partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction ,
+
+
+
+
+ const auto_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction, auto_partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction ,
+
+
+
+
+ const static_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction, static_partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Value , typename RealBody , typename Reduction >
+
+
+ Value tbb::parallel_reduce
+ (
+ const Range &
+ range ,
+
+
+
+
+ const Value &
+ identity ,
+
+
+
+
+ const RealBody &
+ real_body ,
+
+
+
+
+ const Reduction &
+ reduction ,
+
+
+
+
+ affinity_partitioner &
+ partitioner ,
+
+
+
+
+ task_group_context &
+ context
+
+
+
+ )
+
+
+
+
+
+
Parallel iteration with reduction, affinity_partitioner and user-supplied context.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_scan
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body
+
+
+
+ )
+
+
+
+
+
+
Parallel prefix with default partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_scan
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ const simple_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel prefix with simple_partitioner.
+
+
+
+
+
+
+
+template<typename Range , typename Body >
+
+
+ void tbb::parallel_scan
+ (
+ const Range &
+ range ,
+
+
+
+
+ Body &
+ body ,
+
+
+
+
+ const auto_partitioner &
+ partitioner
+
+
+
+ )
+
+
+
+
+
+
Parallel prefix with auto_partitioner.
+
+
+
+
+
+
+
+template<typename RandomAccessIterator , typename Compare >
+
+
+ void tbb::parallel_sort
+ (
+ RandomAccessIterator
+ begin ,
+
+
+
+
+ RandomAccessIterator
+ end ,
+
+
+
+
+ const Compare &
+ comp
+
+
+
+ )
+
+
+
+
+
+
Sorts the data in [begin,end) using the given comparator.
+
The compare function object is used for all comparisons between elements during sorting. The compare object must define a bool operator() function.
+
+
Referenced by tbb::parallel_sort() .
+
+
+
+
+
+
+
+template<typename RandomAccessIterator >
+
+
+
+
+
+ void tbb::parallel_sort
+ (
+ RandomAccessIterator
+ begin ,
+
+
+
+
+ RandomAccessIterator
+ end
+
+
+
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Sorts the data in [begin,end) with a default comparator std::less<RandomAccessIterator>
+
+
References tbb::parallel_sort() .
+
+
+
+
+
+
+
+template<typename Range , typename Compare >
+
+
+ void tbb::parallel_sort
+ (
+ Range &
+ rng ,
+
+
+
+
+ const Compare &
+ comp
+
+
+
+ )
+
+
+
+
+
+
+
+
+
+template<typename Range , typename Compare >
+
+
+ void tbb::parallel_sort
+ (
+ const Range &
+ rng ,
+
+
+
+
+ const Compare &
+ comp
+
+
+
+ )
+
+
+
+
+
+
+
+
+
+template<typename Range >
+
+
+ void tbb::parallel_sort
+ (
+ Range &
+ rng )
+
+
+
+
+
+
Sorts the data in rng with a default comparator std::less<RandomAccessIterator>
+
+
References tbb::parallel_sort() .
+
+
+
+
+
+
+
+template<typename Range >
+
+
+ void tbb::parallel_sort
+ (
+ const Range &
+ rng )
+
+
+
+
+
+
Sorts the data in const rng with a default comparator std::less<RandomAccessIterator>
+
+
References tbb::parallel_sort() .
+
+
+
+
+
+
+
+template<typename T >
+
+
+
+
+
+ void tbb::parallel_sort
+ (
+ T *
+ begin ,
+
+
+
+
+ T *
+ end
+
+
+
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Sorts the data in the range
[begin,end) with a default comparator std::less<T>
+
+
References tbb::parallel_sort() .
+
+
+
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00290.html b/doc/html/a00290.html
index e8f3c6b79b..e29a2d72d0 100644
--- a/doc/html/a00290.html
+++ b/doc/html/a00290.html
@@ -4,7 +4,7 @@
-Member List
+Containers
@@ -20,43 +20,42 @@
Related Pages
Modules
Namespaces
- Classes
+ Classes
Files
-
-
-
-
This is the complete list of members for tbb::thread_bound_filter , including all inherited members.
-
+
+
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00291.html b/doc/html/a00291.html
index 0261e0b0e1..abfc585ead 100644
--- a/doc/html/a00291.html
+++ b/doc/html/a00291.html
@@ -4,7 +4,7 @@
-Member List
+Memory Allocation
@@ -20,43 +20,357 @@
Related Pages
Modules
Namespaces
- Classes
+ Classes
Files
-
-
+
+
+class tbb::aligned_space< T, N >
+ Block of space aligned sufficiently to construct an array T with N elements. More...
+
+class tbb::cache_aligned_allocator< T >
+ Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
+
+class tbb::cache_aligned_allocator< void >
+ Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
+
+class tbb::interface6::memory_pool_allocator< T, P >
+ Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
+
+class tbb::interface6::memory_pool_allocator< void, P >
+ Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
+
+class tbb::scalable_allocator< T >
+ Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
+
+class tbb::scalable_allocator< void >
+ Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
+
+class tbb::tbb_allocator< T >
+ Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
+
+class tbb::tbb_allocator< void >
+ Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
+
+class tbb::zero_allocator< T, Allocator >
+ Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
+
+class tbb::zero_allocator< void, Allocator >
+ Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
+
+
+
+
+
+
+
+
+
+ void __TBB_EXPORTED_FUNC scalable_aligned_free
+ (
+ void *
+ ptr )
+
+
+
+
+
The "_aligned_free" analogue.
+
+
+
+
+
+
+
+
+ void* __TBB_EXPORTED_FUNC scalable_aligned_malloc
+ (
+ size_t
+ size ,
+
+
+
+
+ size_t
+ alignment
+
+
+
+ )
+
+
+
+
+
The "_aligned_malloc" analogue.
+
+
+
+
+
+
+
+
+ void* __TBB_EXPORTED_FUNC scalable_aligned_realloc
+ (
+ void *
+ ptr ,
+
+
+
+
+ size_t
+ size ,
+
+
+
+
+ size_t
+ alignment
+
+
+
+ )
+
+
+
+
+
The "_aligned_realloc" analogue.
+
+
+
+
+
+
+
+
+ int __TBB_EXPORTED_FUNC scalable_allocation_command
+ (
+ int
+ cmd ,
+
+
+
+
+ void *
+ param
+
+
+
+ )
+
+
+
+
+
Call TBB allocator-specific commands.
+
+
+
+
+
+
+
+
+ int __TBB_EXPORTED_FUNC scalable_allocation_mode
+ (
+ int
+ param ,
+
+
+
+
+ intptr_t
+ value
+
+
+
+ )
+
+
+
+
+
Set TBB allocator-specific allocation modes.
+
+
+
+
+
+
+
+
+ void* __TBB_EXPORTED_FUNC scalable_calloc
+ (
+ size_t
+ nobj ,
+
+
+
+
+ size_t
+ size
+
+
+
+ )
+
+
+
+
+
The "calloc" analogue complementing scalable_malloc.
-
This is the complete list of members for tbb::pipeline , including all inherited members.
-
+
+
+
+
+
+
+
+ void __TBB_EXPORTED_FUNC scalable_free
+ (
+ void *
+ ptr )
+
+
+
+
+
+
+
+
+
+
+ void* __TBB_EXPORTED_FUNC scalable_malloc
+ (
+ size_t
+ size )
+
+
+
+
+
+
+
+
+
+
+ size_t __TBB_EXPORTED_FUNC scalable_msize
+ (
+ void *
+ ptr )
+
+
+
+
+
The analogue of msize/malloc_size/malloc_usable_size. Returns the usable size of a memory block previously allocated by scalable *, or 0 (zero) if ptr does not point to such a block.
+
+
+
+
+
+
+
+
+ int __TBB_EXPORTED_FUNC scalable_posix_memalign
+ (
+ void **
+ memptr ,
+
+
+
+
+ size_t
+ alignment ,
+
+
+
+
+ size_t
+ size
+
+
+
+ )
+
+
+
+
+
The "posix_memalign" analogue.
+
+
+
+
+
+
+
+
+ void* __TBB_EXPORTED_FUNC scalable_realloc
+ (
+ void *
+ ptr ,
+
+
+
+
+ size_t
+ size
+
+
+
+ )
+
+
+
+
+
The "realloc" analogue complementing scalable_malloc.
+
+
+
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00292.html b/doc/html/a00292.html
index f027e6712c..a2a329d8e9 100644
--- a/doc/html/a00292.html
+++ b/doc/html/a00292.html
@@ -4,7 +4,7 @@
-Member List
+Synchronization
@@ -20,36 +20,100 @@
Related Pages
Modules
Namespaces
- Classes
+ Classes
Files
-
-
+
+
+typedef
+interface7::internal::padded_mutex
+< interface7::internal::x86_eliding_mutex,
+false > tbb::speculative_spin_mutex
+ A cross-platform spin mutex with speculative lock acquisition. More...
+
+typedef
+interface7::internal::padded_mutex
+< tbb::interface8::internal::x86_rtm_rw_mutex,
+true > tbb::interface8::speculative_spin_rw_mutex
+ A cross-platform spin reader/writer mutex with speculative lock acquisition. More...
+
+
+
+
+
+
+
+
+
A cross-platform spin mutex with speculative lock acquisition.
+
On platforms with proper HW support, this lock may speculatively execute its critical sections, using HW mechanisms to detect real data races and ensure atomicity of the critical sections. In particular, it uses Intel(R) Transactional Synchronization Extensions (Intel(R) TSX). Without such HW support, it behaves like a spin_mutex . It should be used for locking short critical sections where the lock is contended but the data it protects are not. If zero-initialized, the mutex is considered unheld.
-
This is the complete list of members for tbb::queuing_mutex , including all inherited members.
-
+
+
+
+
+
+
+
A cross-platform spin reader/writer mutex with speculative lock acquisition.
+
On platforms with proper HW support, this lock may speculatively execute its critical sections, using HW mechanisms to detect real data races and ensure atomicity of the critical sections. In particular, it uses Intel(R) Transactional Synchronization Extensions (Intel(R) TSX). Without such HW support, it behaves like a spin_rw_mutex. It should be used for locking short critical sections where the lock is contended but the data it protects are not.
+
+
+
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00293.html b/doc/html/a00293.html
index f3e4085d50..bd8a100f03 100644
--- a/doc/html/a00293.html
+++ b/doc/html/a00293.html
@@ -4,7 +4,7 @@
-Member List
+Timing
@@ -20,37 +20,27 @@
Related Pages
Modules
Namespaces
- Classes
+ Classes
Files
-
-
-
-
This is the complete list of members for tbb::queuing_mutex::scoped_lock , including all inherited members.
-
+
+
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00294.html b/doc/html/a00294.html
index b0a15519e5..d2bd6666aa 100644
--- a/doc/html/a00294.html
+++ b/doc/html/a00294.html
@@ -4,7 +4,7 @@
-Member List
+Task Scheduling
@@ -20,37 +20,27 @@
Related Pages
Modules
Namespaces
- Classes
+ Classes
Files
-
-
-
-
This is the complete list of members for tbb::queuing_rw_mutex , including all inherited members.
-
+
+
+
Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
diff --git a/doc/html/a00295.html b/doc/html/a00295.html
deleted file mode 100644
index 9239d27364..0000000000
--- a/doc/html/a00295.html
+++ /dev/null
@@ -1,64 +0,0 @@
-
-
-
-
-
-
-Member List
-
-
-
-
-
-
-
-
-
-
-
This is the complete list of members for tbb::queuing_rw_mutex::scoped_lock , including all inherited members.
-
-
-
-Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
-
-Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
-registered trademarks or trademarks of Intel Corporation or its
-subsidiaries in the United States and other countries.
-
-* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00296.html b/doc/html/a00296.html
index 8f96aa736f..98f187ffa4 100644
--- a/doc/html/a00296.html
+++ b/doc/html/a00296.html
@@ -31,31 +31,16 @@
Class Members
-
-
This is the complete list of members for tbb::recursive_mutex , including all inherited members.
+
This is the complete list of members for __TBB_malloc_proxy_caller , including all inherited members.
diff --git a/doc/html/a00297.html b/doc/html/a00297.html
index 8c503a5c1d..514e695a56 100644
--- a/doc/html/a00297.html
+++ b/doc/html/a00297.html
@@ -33,24 +33,26 @@
-
This is the complete list of members for tbb::recursive_mutex::scoped_lock , including all inherited members.
+
This is the complete list of members for rml::MemPoolPolicy , including all inherited members.
diff --git a/doc/html/a00298.html b/doc/html/a00298.html
index 1f87bb5d60..0c7f3f7086 100644
--- a/doc/html/a00298.html
+++ b/doc/html/a00298.html
@@ -33,36 +33,19 @@
-
This is the complete list of members for tbb::scalable_allocator< T > , including all inherited members.
+
This is the complete list of members for tbb::aligned_space< T, N > , including all inherited members.
diff --git a/doc/html/a00299.html b/doc/html/a00299.html
index 33cd7fa193..0199d9dfad 100644
--- a/doc/html/a00299.html
+++ b/doc/html/a00299.html
@@ -33,18 +33,21 @@
-
This is the complete list of members for tbb::scalable_allocator< T >::rebind< U > , including all inherited members.
+
This is the complete list of members for tbb::atomic< T > , including all inherited members.
diff --git a/doc/html/a00300.html b/doc/html/a00300.html
index 8a823ee782..1c08054bf3 100644
--- a/doc/html/a00300.html
+++ b/doc/html/a00300.html
@@ -33,20 +33,21 @@
-
This is the complete list of members for tbb::scalable_allocator< void > , including all inherited members.
+
This is the complete list of members for tbb::atomic< void * > , including all inherited members.
diff --git a/doc/html/a00301.html b/doc/html/a00301.html
index cbb066a649..01730576b7 100644
--- a/doc/html/a00301.html
+++ b/doc/html/a00301.html
@@ -33,18 +33,32 @@
-
This is the complete list of members for tbb::scalable_allocator< void >::rebind< U > , including all inherited members.
+
This is the complete list of members for tbb::blocked_range< Value > , including all inherited members.
diff --git a/doc/html/a00302.html b/doc/html/a00302.html
index 1c613aaeba..84ed405844 100644
--- a/doc/html/a00302.html
+++ b/doc/html/a00302.html
@@ -33,26 +33,29 @@
-
This is the complete list of members for tbb::spin_mutex , including all inherited members.
+
This is the complete list of members for tbb::blocked_range2d< RowValue, ColValue > , including all inherited members.
- internal_construct ()tbb::spin_mutex
- is_fair_mutex (defined in tbb::spin_mutex )tbb::spin_mutex static
- is_recursive_mutex (defined in tbb::spin_mutex )tbb::spin_mutex static
- is_rw_mutex (defined in tbb::spin_mutex )tbb::spin_mutex static
- lock ()tbb::spin_mutex inline
- scoped_lock (defined in tbb::spin_mutex )tbb::spin_mutex friend
- spin_mutex ()tbb::spin_mutex inline
- try_lock ()tbb::spin_mutex inline
- unlock ()tbb::spin_mutex inline
+ blocked_range2d (RowValue row_begin, RowValue row_end, typename row_range_type::size_type row_grainsize, ColValue col_begin, ColValue col_end, typename col_range_type::size_type col_grainsize) (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue > inline
+ blocked_range2d (RowValue row_begin, RowValue row_end, ColValue col_begin, ColValue col_end) (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue > inline
+ blocked_range2d (blocked_range2d &r, split) (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue > inline
+ blocked_range2d (blocked_range2d &r, proportional_split &proportion) (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue > inline
+ col_range_type typedef (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue >
+ cols () const tbb::blocked_range2d< RowValue, ColValue > inline
+ do_split (blocked_range2d &r, Split &split_obj) (defined in tbb::blocked_range2d< RowValue, ColValue > )tbb::blocked_range2d< RowValue, ColValue > inline
+ empty () const tbb::blocked_range2d< RowValue, ColValue > inline
+ is_divisible () const tbb::blocked_range2d< RowValue, ColValue > inline
+ is_splittable_in_proportion tbb::blocked_range2d< RowValue, ColValue > static
+ row_range_type typedeftbb::blocked_range2d< RowValue, ColValue >
+ rows () const tbb::blocked_range2d< RowValue, ColValue > inline
diff --git a/doc/html/a00303.html b/doc/html/a00303.html
index 94511e1040..94ea0365ed 100644
--- a/doc/html/a00303.html
+++ b/doc/html/a00303.html
@@ -33,24 +33,31 @@
-
This is the complete list of members for tbb::spin_mutex::scoped_lock , including all inherited members.
+
This is the complete list of members for tbb::blocked_range3d< PageValue, RowValue, ColValue > , including all inherited members.
- acquire (spin_mutex &m)tbb::spin_mutex::scoped_lock inline
- release ()tbb::spin_mutex::scoped_lock inline
- scoped_lock ()tbb::spin_mutex::scoped_lock inline
- scoped_lock (spin_mutex &m)tbb::spin_mutex::scoped_lock inline
- spin_mutex (defined in tbb::spin_mutex::scoped_lock )tbb::spin_mutex::scoped_lock friend
- try_acquire (spin_mutex &m)tbb::spin_mutex::scoped_lock inline
- ~scoped_lock ()tbb::spin_mutex::scoped_lock inline
+ blocked_range3d (PageValue page_begin, PageValue page_end, RowValue row_begin, RowValue row_end, ColValue col_begin, ColValue col_end) (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
+ blocked_range3d (PageValue page_begin, PageValue page_end, typename page_range_type::size_type page_grainsize, RowValue row_begin, RowValue row_end, typename row_range_type::size_type row_grainsize, ColValue col_begin, ColValue col_end, typename col_range_type::size_type col_grainsize) (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
+ blocked_range3d (blocked_range3d &r, split) (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
+ blocked_range3d (blocked_range3d &r, proportional_split &proportion) (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
+ col_range_type typedef (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue >
+ cols () const tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
+ do_split (blocked_range3d &r, Split &split_obj) (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
+ empty () const tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
+ is_divisible () const tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
+ is_splittable_in_proportion tbb::blocked_range3d< PageValue, RowValue, ColValue > static
+ page_range_type typedeftbb::blocked_range3d< PageValue, RowValue, ColValue >
+ pages () const tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
+ row_range_type typedef (defined in tbb::blocked_range3d< PageValue, RowValue, ColValue > )tbb::blocked_range3d< PageValue, RowValue, ColValue >
+ rows () const tbb::blocked_range3d< PageValue, RowValue, ColValue > inline
diff --git a/doc/html/a00304.html b/doc/html/a00304.html
index 973fc406bc..bf77b27eb2 100644
--- a/doc/html/a00304.html
+++ b/doc/html/a00304.html
@@ -33,34 +33,36 @@
-
This is the complete list of members for tbb::spin_rw_mutex_v3 , including all inherited members.
+
This is the complete list of members for tbb::cache_aligned_allocator< T > , including all inherited members.
diff --git a/doc/html/a00305.html b/doc/html/a00305.html
index 698eb3061d..0e5497a243 100644
--- a/doc/html/a00305.html
+++ b/doc/html/a00305.html
@@ -33,28 +33,18 @@
-
This is the complete list of members for tbb::spin_rw_mutex_v3::scoped_lock , including all inherited members.
+
This is the complete list of members for tbb::cache_aligned_allocator< T >::rebind< U > , including all inherited members.
diff --git a/doc/html/a00306.html b/doc/html/a00306.html
index 848084614a..28740bc63a 100644
--- a/doc/html/a00306.html
+++ b/doc/html/a00306.html
@@ -33,22 +33,20 @@
-
This is the complete list of members for tbb::task_handle< F > , including all inherited members.
+
This is the complete list of members for tbb::cache_aligned_allocator< void > , including all inherited members.
diff --git a/doc/html/a00307.html b/doc/html/a00307.html
index ac3f3e8034..faa3bd00e9 100644
--- a/doc/html/a00307.html
+++ b/doc/html/a00307.html
@@ -33,32 +33,18 @@
-
This is the complete list of members for tbb::task_group , including all inherited members.
+
This is the complete list of members for tbb::cache_aligned_allocator< void >::rebind< U > , including all inherited members.
diff --git a/doc/html/a00308.html b/doc/html/a00308.html
index a828fbbf4a..d7025a12c7 100644
--- a/doc/html/a00308.html
+++ b/doc/html/a00308.html
@@ -33,29 +33,27 @@
-
This is the complete list of members for tbb::structured_task_group , including all inherited members.
+
This is the complete list of members for tbb::combinable< T > , including all inherited members.
diff --git a/doc/html/a00309.html b/doc/html/a00309.html
index 524e92d6d5..887d3c0406 100644
--- a/doc/html/a00309.html
+++ b/doc/html/a00309.html
@@ -33,28 +33,51 @@
-
This is the complete list of members for tbb::task_scheduler_init , including all inherited members.
+
This is the complete list of members for tbb::concurrent_bounded_queue< T, A > , including all inherited members.
- automatic tbb::task_scheduler_init static
- default_num_threads ()tbb::task_scheduler_init static
- deferred tbb::task_scheduler_init static
- if (wait_workers_in_terminate) my_scheduler (defined in tbb::task_scheduler_init )tbb::task_scheduler_init
- initialize (int number_of_threads=automatic)tbb::task_scheduler_init
- initialize (int number_of_threads, stack_size_type thread_stack_size)tbb::task_scheduler_init
- initialize (number_of_threads, thread_stack_size) (defined in tbb::task_scheduler_init )tbb::task_scheduler_init
- is_active () const tbb::task_scheduler_init inline
- terminate ()tbb::task_scheduler_init
- thread_stack_size tbb::task_scheduler_init
- ~task_scheduler_init ()tbb::task_scheduler_init inline
+ abort ()tbb::concurrent_bounded_queue< T, A > inline
+ allocator_type typedeftbb::concurrent_bounded_queue< T, A >
+ capacity () const tbb::concurrent_bounded_queue< T, A > inline
+ clear ()tbb::concurrent_bounded_queue< T, A >
+ concurrent_bounded_queue (const allocator_type &a=allocator_type())tbb::concurrent_bounded_queue< T, A > inline explicit
+ concurrent_bounded_queue (const concurrent_bounded_queue &src, const allocator_type &a=allocator_type())tbb::concurrent_bounded_queue< T, A > inline
+ concurrent_bounded_queue (concurrent_bounded_queue &&src)tbb::concurrent_bounded_queue< T, A > inline
+ concurrent_bounded_queue (concurrent_bounded_queue &&src, const allocator_type &a) (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
+ concurrent_bounded_queue (InputIterator begin, InputIterator end, const allocator_type &a=allocator_type())tbb::concurrent_bounded_queue< T, A > inline
+ const_iterator typedef (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A >
+ const_reference typedeftbb::concurrent_bounded_queue< T, A >
+ difference_type typedeftbb::concurrent_bounded_queue< T, A >
+ emplace (Arguments &&...args) (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
+ empty () const tbb::concurrent_bounded_queue< T, A > inline
+ get_allocator () const tbb::concurrent_bounded_queue< T, A > inline
+ internal::concurrent_queue_iterator (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > friend
+ iterator typedef (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A >
+ pop (T &destination)tbb::concurrent_bounded_queue< T, A > inline
+ push (const T &source)tbb::concurrent_bounded_queue< T, A > inline
+ push (T &&source)tbb::concurrent_bounded_queue< T, A > inline
+ reference typedeftbb::concurrent_bounded_queue< T, A >
+ set_capacity (size_type new_capacity)tbb::concurrent_bounded_queue< T, A > inline
+ size () const tbb::concurrent_bounded_queue< T, A > inline
+ size_type typedeftbb::concurrent_bounded_queue< T, A >
+ try_emplace (Arguments &&...args) (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
+ try_pop (T &destination)tbb::concurrent_bounded_queue< T, A > inline
+ try_push (const T &source)tbb::concurrent_bounded_queue< T, A > inline
+ try_push (T &&source)tbb::concurrent_bounded_queue< T, A > inline
+ unsafe_begin () (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
+ unsafe_begin () const (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
+ unsafe_end () (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
+ unsafe_end () const (defined in tbb::concurrent_bounded_queue< T, A > )tbb::concurrent_bounded_queue< T, A > inline
+ value_type typedeftbb::concurrent_bounded_queue< T, A >
+ ~concurrent_bounded_queue ()tbb::concurrent_bounded_queue< T, A >
diff --git a/doc/html/a00310.html b/doc/html/a00310.html
index 75d49edef2..50535c9cdb 100644
--- a/doc/html/a00310.html
+++ b/doc/html/a00310.html
@@ -33,40 +33,95 @@
-
This is the complete list of members for tbb::tbb_allocator< T > , including all inherited members.
+
This is the complete list of members for tbb::concurrent_vector< T, A > , including all inherited members.
- address (reference x) const (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T > inline
- address (const_reference x) const (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T > inline
- allocate (size_type n, const void *=0)tbb::tbb_allocator< T > inline
- allocator_type ()tbb::tbb_allocator< T > inline static
- const_pointer typedef (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T >
- const_reference typedef (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T >
- construct (U *p, Args &&...args)tbb::tbb_allocator< T > inline
- construct (pointer p, value_type &&value) (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T > inline
- construct (pointer p, const value_type &value) (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T > inline
- deallocate (pointer p, size_type)tbb::tbb_allocator< T > inline
- destroy (pointer p)tbb::tbb_allocator< T > inline
- difference_type typedef (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T >
- malloc_type enum nametbb::tbb_allocator< T >
- max_size () const tbb::tbb_allocator< T > inline
- pointer typedef (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T >
- reference typedef (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T >
- scalable enum value (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T >
- size_type typedef (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T >
- standard enum value (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T >
- tbb_allocator () (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T > inline
- tbb_allocator (const tbb_allocator &) (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T > inline
- tbb_allocator (const tbb_allocator< U > &) (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T > inline
- value_type typedef (defined in tbb::tbb_allocator< T > )tbb::tbb_allocator< T >
+ allocator_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ assign (size_type n, const_reference t)tbb::concurrent_vector< T, A > inline
+ assign (I first, I last)tbb::concurrent_vector< T, A > inline
+ assign (std::initializer_list< T > init_list)tbb::concurrent_vector< T, A > inline
+ at (size_type index)tbb::concurrent_vector< T, A > inline
+ at (size_type index) const tbb::concurrent_vector< T, A > inline
+ back ()tbb::concurrent_vector< T, A > inline
+ back () const tbb::concurrent_vector< T, A > inline
+ begin ()tbb::concurrent_vector< T, A > inline
+ begin () const tbb::concurrent_vector< T, A > inline
+ capacity () const tbb::concurrent_vector< T, A > inline
+ cbegin () const tbb::concurrent_vector< T, A > inline
+ cend () const tbb::concurrent_vector< T, A > inline
+ clear ()tbb::concurrent_vector< T, A > inline
+ concurrent_vector (const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline explicit
+ concurrent_vector (std::initializer_list< T > init_list, const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline
+ concurrent_vector (const concurrent_vector &vector, const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline
+ concurrent_vector (concurrent_vector &&source)tbb::concurrent_vector< T, A > inline
+ concurrent_vector (concurrent_vector &&source, const allocator_type &a) (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A > inline
+ concurrent_vector (const concurrent_vector< T, M > &vector, const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline
+ concurrent_vector (size_type n)tbb::concurrent_vector< T, A > inline explicit
+ concurrent_vector (size_type n, const_reference t, const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline
+ concurrent_vector (I first, I last, const allocator_type &a=allocator_type())tbb::concurrent_vector< T, A > inline
+ const_iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ const_pointer typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ const_range_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ const_reference typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ const_reverse_iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ const_reverse_iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ copy_range (void *dst, const void *p_type_erased_iterator, size_type n) (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ crbegin () const tbb::concurrent_vector< T, A > inline
+ crend () const tbb::concurrent_vector< T, A > inline
+ difference_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ emplace_back (Args &&...args)tbb::concurrent_vector< T, A > inline
+ empty () const tbb::concurrent_vector< T, A > inline
+ end ()tbb::concurrent_vector< T, A > inline
+ end () const tbb::concurrent_vector< T, A > inline
+ front ()tbb::concurrent_vector< T, A > inline
+ front () const tbb::concurrent_vector< T, A > inline
+ get_allocator () const tbb::concurrent_vector< T, A > inline
+ grow_by (size_type delta)tbb::concurrent_vector< T, A > inline
+ grow_by (size_type delta, const_reference t)tbb::concurrent_vector< T, A > inline
+ grow_by (I first, I last)tbb::concurrent_vector< T, A > inline
+ grow_by (std::initializer_list< T > init_list)tbb::concurrent_vector< T, A > inline
+ grow_to_at_least (size_type n)tbb::concurrent_vector< T, A > inline
+ grow_to_at_least (size_type n, const_reference t)tbb::concurrent_vector< T, A > inline
+ internal::vector_iterator (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A > friend
+ internal_vector_base () const (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A > inline
+ iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ max_size () const tbb::concurrent_vector< T, A > inline
+ operator= (const concurrent_vector &vector)tbb::concurrent_vector< T, A > inline
+ operator= (concurrent_vector &&other)tbb::concurrent_vector< T, A > inline
+ operator= (const concurrent_vector< T, M > &vector)tbb::concurrent_vector< T, A > inline
+ operator= (std::initializer_list< T > init_list)tbb::concurrent_vector< T, A > inline
+ operator[] (size_type index)tbb::concurrent_vector< T, A > inline
+ operator[] (size_type index) const tbb::concurrent_vector< T, A > inline
+ pointer typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ push_back (const_reference item)tbb::concurrent_vector< T, A > inline
+ push_back (T &&item)tbb::concurrent_vector< T, A > inline
+ range (size_t grainsize=1)tbb::concurrent_vector< T, A > inline
+ range (size_t grainsize=1) const tbb::concurrent_vector< T, A > inline
+ range_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ rbegin ()tbb::concurrent_vector< T, A > inline
+ rbegin () const tbb::concurrent_vector< T, A > inline
+ reference typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ rend ()tbb::concurrent_vector< T, A > inline
+ rend () const tbb::concurrent_vector< T, A > inline
+ reserve (size_type n)tbb::concurrent_vector< T, A > inline
+ resize (size_type n)tbb::concurrent_vector< T, A > inline
+ resize (size_type n, const_reference t)tbb::concurrent_vector< T, A > inline
+ reverse_iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ reverse_iterator typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ shrink_to_fit ()tbb::concurrent_vector< T, A >
+ size () const tbb::concurrent_vector< T, A > inline
+ size_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ swap (concurrent_vector &vector)tbb::concurrent_vector< T, A > inline
+ value_type typedef (defined in tbb::concurrent_vector< T, A > )tbb::concurrent_vector< T, A >
+ ~concurrent_vector ()tbb::concurrent_vector< T, A > inline
diff --git a/doc/html/a00311.html b/doc/html/a00311.html
index 08dca6b671..779a87e788 100644
--- a/doc/html/a00311.html
+++ b/doc/html/a00311.html
@@ -33,18 +33,21 @@
-
This is the complete list of members for tbb::tbb_allocator< T >::rebind< U > , including all inherited members.
+
This is the complete list of members for tbb::concurrent_vector< T, A >::push_back_helper::element_construction_guard , including all inherited members.
diff --git a/doc/html/a00312.html b/doc/html/a00312.html
index 566fe806ad..6c5fee5539 100644
--- a/doc/html/a00312.html
+++ b/doc/html/a00312.html
@@ -33,20 +33,34 @@
-
This is the complete list of members for tbb::tbb_allocator< void > , including all inherited members.
+
This is the complete list of members for tbb::mutex , including all inherited members.
diff --git a/doc/html/a00313.html b/doc/html/a00313.html
index a5b2fcc7b0..201cc64d20 100644
--- a/doc/html/a00313.html
+++ b/doc/html/a00313.html
@@ -33,18 +33,24 @@
-
This is the complete list of members for tbb::tbb_allocator< void >::rebind< U > , including all inherited members.
+
This is the complete list of members for tbb::mutex::scoped_lock , including all inherited members.
diff --git a/doc/html/a00314.html b/doc/html/a00314.html
index ee06e5d88b..7ad18d413b 100644
--- a/doc/html/a00314.html
+++ b/doc/html/a00314.html
@@ -33,29 +33,21 @@
-
This is the complete list of members for tbb::zero_allocator< T, Allocator > , including all inherited members.
+
This is the complete list of members for tbb::null_mutex , including all inherited members.
- allocate (const size_type n, const void *hint=0) (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator > inline
- base_allocator_type typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
- const_pointer typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
- const_reference typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
- difference_type typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
- pointer typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
- reference typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
- size_type typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
- value_type typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
- zero_allocator () (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator > inline
- zero_allocator (const zero_allocator &a) (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator > inline
- zero_allocator (const zero_allocator< U > &a) (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator > inline
+ is_fair_mutex (defined in tbb::null_mutex )tbb::null_mutex static
+ is_recursive_mutex (defined in tbb::null_mutex )tbb::null_mutex static
+ is_rw_mutex (defined in tbb::null_mutex )tbb::null_mutex static
+ null_mutex () (defined in tbb::null_mutex )tbb::null_mutex inline
diff --git a/doc/html/a00315.html b/doc/html/a00315.html
index 0fbac07bfc..3e9d55e1b4 100644
--- a/doc/html/a00315.html
+++ b/doc/html/a00315.html
@@ -33,18 +33,23 @@
-
This is the complete list of members for tbb::zero_allocator< T, Allocator >::rebind< U > , including all inherited members.
+
This is the complete list of members for tbb::null_mutex::scoped_lock , including all inherited members.
diff --git a/doc/html/a00316.html b/doc/html/a00316.html
index 1dde030485..be540b533e 100644
--- a/doc/html/a00316.html
+++ b/doc/html/a00316.html
@@ -33,21 +33,21 @@
-
This is the complete list of members for tbb::zero_allocator< void, Allocator > , including all inherited members.
+
This is the complete list of members for tbb::null_rw_mutex , including all inherited members.
diff --git a/doc/html/a00317.html b/doc/html/a00317.html
index 890233fe26..7be96b1457 100644
--- a/doc/html/a00317.html
+++ b/doc/html/a00317.html
@@ -33,18 +33,25 @@
-
This is the complete list of members for tbb::zero_allocator< void, Allocator >::rebind< U > , including all inherited members.
+
This is the complete list of members for tbb::null_rw_mutex::scoped_lock , including all inherited members.
diff --git a/doc/html/a00318.html b/doc/html/a00318.html
index fc20431863..9227f457cf 100644
--- a/doc/html/a00318.html
+++ b/doc/html/a00318.html
@@ -33,19 +33,19 @@
-
This is the complete list of members for tbb::bad_last_alloc , including all inherited members.
+
This is the complete list of members for tbb::parallel_do_feeder< Item > , including all inherited members.
diff --git a/doc/html/a00319.html b/doc/html/a00319.html
index 2c8940b37c..f8216210bd 100644
--- a/doc/html/a00319.html
+++ b/doc/html/a00319.html
@@ -33,18 +33,18 @@
-
This is the complete list of members for tbb::improper_lock , including all inherited members.
+
This is the complete list of members for tbb::pre_scan_tag , including all inherited members.
diff --git a/doc/html/a00320.html b/doc/html/a00320.html
index fb3767757e..b66b843901 100644
--- a/doc/html/a00320.html
+++ b/doc/html/a00320.html
@@ -33,18 +33,18 @@
-
This is the complete list of members for tbb::user_abort , including all inherited members.
+
This is the complete list of members for tbb::final_scan_tag , including all inherited members.
diff --git a/doc/html/a00321.html b/doc/html/a00321.html
index a0999d79f1..6201199999 100644
--- a/doc/html/a00321.html
+++ b/doc/html/a00321.html
@@ -33,18 +33,22 @@
-
This is the complete list of members for tbb::missing_wait , including all inherited members.
+
This is the complete list of members for tbb::parallel_while< Body > , including all inherited members.
diff --git a/doc/html/a00322.html b/doc/html/a00322.html
index 5f51da8397..8673a9e0d5 100644
--- a/doc/html/a00322.html
+++ b/doc/html/a00322.html
@@ -33,18 +33,22 @@
-
This is the complete list of members for tbb::invalid_multiple_scheduling , including all inherited members.
+
This is the complete list of members for tbb::filter , including all inherited members.
diff --git a/doc/html/a00323.html b/doc/html/a00323.html
index 3f6d9847a1..00b1c656d2 100644
--- a/doc/html/a00323.html
+++ b/doc/html/a00323.html
@@ -33,24 +33,29 @@
-
This is the complete list of members for tbb::tbb_exception , including all inherited members.
+
This is the complete list of members for tbb::thread_bound_filter , including all inherited members.
diff --git a/doc/html/a00324.html b/doc/html/a00324.html
index 6698c35e34..e5b62b3f82 100644
--- a/doc/html/a00324.html
+++ b/doc/html/a00324.html
@@ -33,30 +33,29 @@
-
This is the complete list of members for tbb::captured_exception , including all inherited members.
+
This is the complete list of members for tbb::pipeline , including all inherited members.
diff --git a/doc/html/a00325.html b/doc/html/a00325.html
index 824268f0c0..0b62524e20 100644
--- a/doc/html/a00325.html
+++ b/doc/html/a00325.html
@@ -33,31 +33,22 @@
-
This is the complete list of members for tbb::movable_exception< ExceptionData > , including all inherited members.
+
This is the complete list of members for tbb::queuing_mutex , including all inherited members.
diff --git a/doc/html/a00326.html b/doc/html/a00326.html
index 0f87fe170c..43ee577fc9 100644
--- a/doc/html/a00326.html
+++ b/doc/html/a00326.html
@@ -33,21 +33,23 @@
-
This is the complete list of members for tbb::tick_count , including all inherited members.
+
This is the complete list of members for tbb::queuing_mutex::scoped_lock , including all inherited members.
diff --git a/doc/html/a00327.html b/doc/html/a00327.html
index e1355ac550..2d7543c3f2 100644
--- a/doc/html/a00327.html
+++ b/doc/html/a00327.html
@@ -33,26 +33,23 @@
-
This is the complete list of members for tbb::tick_count::interval_t , including all inherited members.
+
This is the complete list of members for tbb::queuing_rw_mutex , including all inherited members.
diff --git a/doc/html/a00328.html b/doc/html/a00328.html
index f542d9ecb7..167a7a298a 100644
--- a/doc/html/a00328.html
+++ b/doc/html/a00328.html
@@ -33,33 +33,25 @@
-
This is the complete list of members for tbb::flow::interface8::sender< T > , including all inherited members.
+
This is the complete list of members for tbb::queuing_rw_mutex::scoped_lock , including all inherited members.
diff --git a/doc/html/a00329.html b/doc/html/a00329.html
index e61c122f8b..700701fbeb 100644
--- a/doc/html/a00329.html
+++ b/doc/html/a00329.html
@@ -33,38 +33,29 @@
-
This is the complete list of members for tbb::flow::interface8::receiver< T > , including all inherited members.
+
This is the complete list of members for tbb::recursive_mutex , including all inherited members.
diff --git a/doc/html/a00330.html b/doc/html/a00330.html
index 656284786d..cedd77d9c7 100644
--- a/doc/html/a00330.html
+++ b/doc/html/a00330.html
@@ -33,66 +33,24 @@
-
This is the complete list of members for tbb::flow::interface8::limiter_node< T > , including all inherited members.
+
This is the complete list of members for tbb::recursive_mutex::scoped_lock , including all inherited members.
diff --git a/doc/html/a00331.html b/doc/html/a00331.html
index c539d932e5..2a9c3d1bce 100644
--- a/doc/html/a00331.html
+++ b/doc/html/a00331.html
@@ -33,47 +33,36 @@
-
This is the complete list of members for tbb::flow::interface8::continue_receiver , including all inherited members.
+
This is the complete list of members for tbb::scalable_allocator< T > , including all inherited members.
diff --git a/doc/html/a00332.html b/doc/html/a00332.html
index 096b1411e5..ce7d4f1083 100644
--- a/doc/html/a00332.html
+++ b/doc/html/a00332.html
@@ -33,34 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > , including all inherited members.
+
This is the complete list of members for tbb::scalable_allocator< T >::rebind< U > , including all inherited members.
- const_reference typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
- graph (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > friend
- graph_iterator ()tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
- graph_iterator (const graph_iterator &other)tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
- graph_node (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > friend
- iterator_category typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
- operator!= (const graph_iterator &other) const tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
- operator* () const tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
- operator++ ()tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
- operator++ (int)tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
- operator-> () const tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
- operator= (const graph_iterator &other)tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
- operator== (const graph_iterator &other) const tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
- pointer typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
- reference typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
- size_type typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
- value_type typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+ other typedef (defined in tbb::scalable_allocator< T >::rebind< U > )tbb::scalable_allocator< T >::rebind< U >
diff --git a/doc/html/a00333.html b/doc/html/a00333.html
index 91ff624115..996203e903 100644
--- a/doc/html/a00333.html
+++ b/doc/html/a00333.html
@@ -33,43 +33,20 @@
-
This is the complete list of members for tbb::flow::interface8::graph , including all inherited members.
+
This is the complete list of members for tbb::scalable_allocator< void > , including all inherited members.
diff --git a/doc/html/a00334.html b/doc/html/a00334.html
index a401e02fa2..b30d66cede 100644
--- a/doc/html/a00334.html
+++ b/doc/html/a00334.html
@@ -33,27 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::graph_node , including all inherited members.
+
This is the complete list of members for tbb::scalable_allocator< void >::rebind< U > , including all inherited members.
diff --git a/doc/html/a00335.html b/doc/html/a00335.html
index 56a582099b..f3a0da1291 100644
--- a/doc/html/a00335.html
+++ b/doc/html/a00335.html
@@ -33,48 +33,26 @@
-
This is the complete list of members for tbb::flow::interface8::source_node< Output > , including all inherited members.
+
This is the complete list of members for tbb::spin_mutex , including all inherited members.
diff --git a/doc/html/a00336.html b/doc/html/a00336.html
index d1541b6e81..ef169da792 100644
--- a/doc/html/a00336.html
+++ b/doc/html/a00336.html
@@ -33,18 +33,24 @@
-
This is the complete list of members for tbb::flow::interface8::allocate_buffer< T > , including all inherited members.
+
This is the complete list of members for tbb::spin_mutex::scoped_lock , including all inherited members.
diff --git a/doc/html/a00337.html b/doc/html/a00337.html
index 0261fe67a3..305fe10338 100644
--- a/doc/html/a00337.html
+++ b/doc/html/a00337.html
@@ -33,18 +33,34 @@
-
This is the complete list of members for tbb::flow::interface8::allocate_buffer< queueing > , including all inherited members.
+
This is the complete list of members for tbb::spin_rw_mutex_v3 , including all inherited members.
diff --git a/doc/html/a00338.html b/doc/html/a00338.html
index 13e7560779..713548d3e9 100644
--- a/doc/html/a00338.html
+++ b/doc/html/a00338.html
@@ -33,38 +33,28 @@
-
This is the complete list of members for tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > , including all inherited members.
+
This is the complete list of members for tbb::spin_rw_mutex_v3::scoped_lock , including all inherited members.
- extract () (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline virtual
- fInput_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
- fOutput_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
- function_node (graph &g, size_t concurrency, Body body)tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline
- function_node (const function_node &src)tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- input_queue_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
- input_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
- internal::broadcast_cache (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > friend
- internal::round_robin_cache (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > friend
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- output_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
- predecessor_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- reset_node (reset_flags f) (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline protected virtual
- run_and_put_task (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > friend
- set_name (const char *name) (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline virtual
- successor_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
- successors () (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline protected
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ acquire (spin_rw_mutex &m, bool write=true)tbb::spin_rw_mutex_v3::scoped_lock inline
+ downgrade_to_reader ()tbb::spin_rw_mutex_v3::scoped_lock inline
+ is_writer tbb::spin_rw_mutex_v3::scoped_lock protected
+ mutex tbb::spin_rw_mutex_v3::scoped_lock protected
+ release ()tbb::spin_rw_mutex_v3::scoped_lock inline
+ scoped_lock ()tbb::spin_rw_mutex_v3::scoped_lock inline
+ scoped_lock (spin_rw_mutex &m, bool write=true)tbb::spin_rw_mutex_v3::scoped_lock inline
+ tbb::interface8::internal::x86_rtm_rw_mutex (defined in tbb::spin_rw_mutex_v3::scoped_lock )tbb::spin_rw_mutex_v3::scoped_lock friend
+ try_acquire (spin_rw_mutex &m, bool write=true)tbb::spin_rw_mutex_v3::scoped_lock inline
+ upgrade_to_writer ()tbb::spin_rw_mutex_v3::scoped_lock inline
+ ~scoped_lock ()tbb::spin_rw_mutex_v3::scoped_lock inline
diff --git a/doc/html/a00339.html b/doc/html/a00339.html
index 5180ee04be..118c4dd856 100644
--- a/doc/html/a00339.html
+++ b/doc/html/a00339.html
@@ -33,33 +33,22 @@
-
This is the complete list of members for tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > , including all inherited members.
+
This is the complete list of members for tbb::task_handle< F > , including all inherited members.
- extract () (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > inline virtual
- fInput_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- input_queue_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
- input_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
- multifunction_node (graph &g, size_t concurrency, Body body) (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > inline
- multifunction_node (const multifunction_node &other) (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > inline
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- N (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > protected static
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- output_ports_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
- output_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- reset_node (reset_flags f) (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > inline protected virtual
- set_name (const char *name) (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > inline virtual
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ internal::task_handle_task (defined in tbb::task_handle< F > )tbb::task_handle< F > friend
+ operator() () const (defined in tbb::task_handle< F > )tbb::task_handle< F > inline
+ structured_task_group (defined in tbb::task_handle< F > )tbb::task_handle< F > friend
+ task_group (defined in tbb::task_handle< F > )tbb::task_handle< F > friend
+ task_handle (const F &f) (defined in tbb::task_handle< F > )tbb::task_handle< F > inline
diff --git a/doc/html/a00340.html b/doc/html/a00340.html
index 1282dce293..50ba00ace8 100644
--- a/doc/html/a00340.html
+++ b/doc/html/a00340.html
@@ -33,35 +33,32 @@
-
This is the complete list of members for tbb::flow::interface8::split_node< TupleType, Allocator > , including all inherited members.
+
This is the complete list of members for tbb::task_group , including all inherited members.
- allocator_type typedef (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator >
- extract () (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > inline virtual
- fInput_type typedef (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator >
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- input_queue_type typedef (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator >
- input_type typedef (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator >
- multifunction_node (graph &g, size_t concurrency, Body body) (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > inline
- multifunction_node (const multifunction_node &other) (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > inline
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- output_ports_type typedef (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator >
- output_type typedef (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator >
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- reset_node (reset_flags f) (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > inline protected virtual
- set_name (const char *name) (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator > inline virtual
- split_node (graph &g) (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator > inline
- split_node (const split_node &other) (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator > inline
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ cancel () (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
+ internal_run (F &f) (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline protected
+ internal_run_and_wait (F &f) (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline protected
+ is_canceling () (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
+ my_context (defined in tbb::internal::task_group_base )tbb::internal::task_group_base protected
+ my_root (defined in tbb::internal::task_group_base )tbb::internal::task_group_base protected
+ owner () (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline protected
+ run (task_handle< F > &h) (defined in tbb::task_group )tbb::task_group inline
+ run (const F &f) (defined in tbb::task_group )tbb::task_group inline
+ run_and_wait (const F &f) (defined in tbb::task_group )tbb::task_group inline
+ run_and_wait (task_handle< F > &h) (defined in tbb::task_group )tbb::task_group inline
+ task_group () (defined in tbb::task_group )tbb::task_group inline
+ task_group_base (uintptr_t traits=0) (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
+ wait () (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
+ ~task_group_base () __TBB_NOEXCEPT(false) (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
diff --git a/doc/html/a00341.html b/doc/html/a00341.html
index ea1c7819fb..fa99304c22 100644
--- a/doc/html/a00341.html
+++ b/doc/html/a00341.html
@@ -33,38 +33,29 @@
-
This is the complete list of members for tbb::flow::interface8::continue_node< Output > , including all inherited members.
+
This is the complete list of members for tbb::structured_task_group , including all inherited members.
diff --git a/doc/html/a00342.html b/doc/html/a00342.html
index b063494c80..91df3539af 100644
--- a/doc/html/a00342.html
+++ b/doc/html/a00342.html
@@ -33,71 +33,28 @@
-
This is the complete list of members for tbb::flow::interface8::overwrite_node< T > , including all inherited members.
+
This is the complete list of members for tbb::task_scheduler_init , including all inherited members.
diff --git a/doc/html/a00343.html b/doc/html/a00343.html
index 540f2091a0..2fc5720a26 100644
--- a/doc/html/a00343.html
+++ b/doc/html/a00343.html
@@ -33,73 +33,40 @@
-
This is the complete list of members for tbb::flow::interface8::write_once_node< T > , including all inherited members.
+
This is the complete list of members for tbb::tbb_allocator< T > , including all inherited members.
diff --git a/doc/html/a00344.html b/doc/html/a00344.html
index e43d74fb28..fb63c61a7d 100644
--- a/doc/html/a00344.html
+++ b/doc/html/a00344.html
@@ -33,63 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::broadcast_node< T > , including all inherited members.
+
This is the complete list of members for tbb::tbb_allocator< T >::rebind< U > , including all inherited members.
diff --git a/doc/html/a00345.html b/doc/html/a00345.html
index a0d1510458..0d34a0c298 100644
--- a/doc/html/a00345.html
+++ b/doc/html/a00345.html
@@ -33,114 +33,20 @@
-
This is the complete list of members for tbb::flow::interface8::buffer_node< T, A > , including all inherited members.
+
This is the complete list of members for tbb::tbb_allocator< void > , including all inherited members.
- add_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- add_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_pred_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_pred_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_succ_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_succ_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- buffer_node (graph &g)tbb::flow::interface8::buffer_node< T, A > inline
- buffer_node (const buffer_node &src)tbb::flow::interface8::buffer_node< T, A > inline
- built_predecessors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- built_predecessors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- built_successors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- built_successors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- class_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- con_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline
- copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
- copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- del_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- del_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- enqueue_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
- extract () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- FAILED enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- forward_task ()tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- forwarder_busy (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- grab_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- handle_operations (buffer_operation *op_list) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- handler_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- input_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- internal::aggregating_functor< class_type, buffer_operation > (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > friend
- internal::broadcast_cache (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > friend
- internal::forward_task_bypass< buffer_node< T, A > > (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > friend
- internal::round_robin_cache (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > friend
- internal_add_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_add_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_add_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_consume (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_copy_preds (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_copy_succs (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_del_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_del_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_delete_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_forward_task (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_pop (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_pred_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_push (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_reg_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_release (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_rem_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_reserve (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_succ_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
- my_aggregator (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- my_built_predecessors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- my_successors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- op_stat enum name (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- op_type enum name (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- output_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- predecessor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- predecessor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- predecessor_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- put_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- reg_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
- register_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
- rel_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- rem_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
- remove_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
- req_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- res_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- reset_node (reset_flags f) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- reset_receiver (reset_flags) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- run_and_put_task (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > friend
- set_name (const char *name) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- size_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- SUCCEEDED enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- successor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- successor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- successor_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- try_consume ()tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_fwd_task enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- try_get (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_put (const T &t)tbb::flow::interface8::receiver< T > inline
- try_put_task (const T &t)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- try_release ()tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_reserve (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
- WAIT enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- ~buffer_node () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
- ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
- ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
+ const_pointer typedef (defined in tbb::tbb_allocator< void > )tbb::tbb_allocator< void >
+ pointer typedef (defined in tbb::tbb_allocator< void > )tbb::tbb_allocator< void >
+ value_type typedef (defined in tbb::tbb_allocator< void > )tbb::tbb_allocator< void >
diff --git a/doc/html/a00346.html b/doc/html/a00346.html
index 3acc0933d2..c428fc1fe4 100644
--- a/doc/html/a00346.html
+++ b/doc/html/a00346.html
@@ -33,27 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::buffer_node< T, A >::buffer_operation , including all inherited members.
+
This is the complete list of members for tbb::tbb_allocator< void >::rebind< U > , including all inherited members.
- buffer_operation (const T &e, op_type t) (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation inline
- cnt_val (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
- elem (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
- elem (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
- ltask (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
- p (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
- pvec (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
- r (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
- svec (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
- type (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+ other typedef (defined in tbb::tbb_allocator< void >::rebind< U > )tbb::tbb_allocator< void >::rebind< U >
diff --git a/doc/html/a00347.html b/doc/html/a00347.html
new file mode 100644
index 0000000000..a53237c31f
--- /dev/null
+++ b/doc/html/a00347.html
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::zero_allocator< T, Allocator > , including all inherited members.
+
+ allocate (const size_type n, const void *hint=0) (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator > inline
+ base_allocator_type typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
+ const_pointer typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
+ const_reference typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
+ difference_type typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
+ pointer typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
+ reference typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
+ size_type typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
+ value_type typedef (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator >
+ zero_allocator () (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator > inline
+ zero_allocator (const zero_allocator &a) (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator > inline
+ zero_allocator (const zero_allocator< U > &a) (defined in tbb::zero_allocator< T, Allocator > )tbb::zero_allocator< T, Allocator > inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00348.html b/doc/html/a00348.html
index ae13b319c9..a73478c3ef 100644
--- a/doc/html/a00348.html
+++ b/doc/html/a00348.html
@@ -33,113 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::queue_node< T, A > , including all inherited members.
+
This is the complete list of members for tbb::zero_allocator< T, Allocator >::rebind< U > , including all inherited members.
- add_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- add_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- base_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
- blt_pred_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_pred_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_succ_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_succ_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- buffer_node (graph &g)tbb::flow::interface8::buffer_node< T, A > inline
- buffer_node (const buffer_node &src)tbb::flow::interface8::buffer_node< T, A > inline
- built_predecessors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- built_predecessors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- built_successors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- built_successors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- class_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- con_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline
- copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
- copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- del_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- del_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- enqueue_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
- extract () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- FAILED enum value (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
- forward_task ()tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- forwarder_busy (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- grab_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- handle_operations (buffer_operation *op_list) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- handler_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- input_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A >
- internal_add_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_add_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_add_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_consume (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
- internal_copy_preds (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_copy_succs (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_del_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_del_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_delete_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_forward_task (queue_operation *op)tbb::flow::interface8::queue_node< T, A > inline protected virtual
- internal_pop (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
- internal_pred_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_push (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_reg_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_release (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_rem_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_reserve (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
- internal_succ_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
- my_aggregator (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- my_built_predecessors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- my_successors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- op_stat enum name (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
- op_type enum name (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- output_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A >
- predecessor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- predecessor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- predecessor_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A >
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- put_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- queue_node (graph &g)tbb::flow::interface8::queue_node< T, A > inline
- queue_node (const queue_node &src)tbb::flow::interface8::queue_node< T, A > inline
- queue_operation typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
- reg_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
- register_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
- rel_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- rem_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
- remove_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
- req_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- res_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- reset_node (reset_flags f) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
- reset_receiver (reset_flags) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- set_name (const char *name) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline virtual
- size_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
- SUCCEEDED enum value (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
- successor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- successor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- successor_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A >
- try_consume ()tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_fwd_task enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- try_get (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_put (const T &t)tbb::flow::interface8::receiver< T > inline
- try_put_task (const T &t)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- try_release ()tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_reserve (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
- WAIT enum value (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
- ~buffer_node () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
- ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
- ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
+ other typedef (defined in tbb::zero_allocator< T, Allocator >::rebind< U > )tbb::zero_allocator< T, Allocator >::rebind< U >
diff --git a/doc/html/a00349.html b/doc/html/a00349.html
index b891e2e317..7218c25f25 100644
--- a/doc/html/a00349.html
+++ b/doc/html/a00349.html
@@ -33,116 +33,21 @@
-
This is the complete list of members for tbb::flow::interface8::sequencer_node< T, A > , including all inherited members.
+
This is the complete list of members for tbb::zero_allocator< void, Allocator > , including all inherited members.
- add_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- add_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- base_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
- blt_pred_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_pred_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_succ_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_succ_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- buffer_node (graph &g)tbb::flow::interface8::buffer_node< T, A > inline
- buffer_node (const buffer_node &src)tbb::flow::interface8::buffer_node< T, A > inline
- built_predecessors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- built_predecessors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- built_successors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- built_successors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- class_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- con_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline
- copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
- copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- del_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- del_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- enqueue_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
- extract () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- FAILED enum value (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
- forward_task ()tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- forwarder_busy (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- grab_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- handle_operations (buffer_operation *op_list) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- handler_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- input_type typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A >
- internal_add_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_add_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_add_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_consume (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
- internal_copy_preds (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_copy_succs (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_del_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_del_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_delete_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_forward_task (queue_operation *op)tbb::flow::interface8::queue_node< T, A > inline protected virtual
- internal_pop (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
- internal_pred_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_reg_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_release (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_rem_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_reserve (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
- internal_succ_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
- my_aggregator (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- my_built_predecessors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- my_successors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- op_stat enum name (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
- op_type enum name (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- output_type typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A >
- predecessor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- predecessor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- predecessor_type typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A >
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- put_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- queue_node (graph &g)tbb::flow::interface8::queue_node< T, A > inline
- queue_node (const queue_node &src)tbb::flow::interface8::queue_node< T, A > inline
- queue_operation typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
- reg_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
- register_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
- rel_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- rem_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
- remove_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
- req_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- res_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- reset_node (reset_flags f) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
- reset_receiver (reset_flags) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- sequencer_node (graph &g, const Sequencer &s)tbb::flow::interface8::sequencer_node< T, A > inline
- sequencer_node (const sequencer_node &src)tbb::flow::interface8::sequencer_node< T, A > inline
- sequencer_operation typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
- set_name (const char *name) (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > inline virtual
- size_type typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
- SUCCEEDED enum value (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
- successor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- successor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- successor_type typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A >
- try_consume ()tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_fwd_task enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- try_get (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_put (const T &t)tbb::flow::interface8::receiver< T > inline
- try_put_task (const T &t)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- try_release ()tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_reserve (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
- WAIT enum value (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
- ~buffer_node () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
- ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
- ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
- ~sequencer_node ()tbb::flow::interface8::sequencer_node< T, A > inline
+ base_allocator_type typedef (defined in tbb::zero_allocator< void, Allocator > )tbb::zero_allocator< void, Allocator >
+ const_pointer typedef (defined in tbb::zero_allocator< void, Allocator > )tbb::zero_allocator< void, Allocator >
+ pointer typedef (defined in tbb::zero_allocator< void, Allocator > )tbb::zero_allocator< void, Allocator >
+ value_type typedef (defined in tbb::zero_allocator< void, Allocator > )tbb::zero_allocator< void, Allocator >
diff --git a/doc/html/a00350.html b/doc/html/a00350.html
index 74182fdc8c..0bb723820d 100644
--- a/doc/html/a00350.html
+++ b/doc/html/a00350.html
@@ -33,114 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::priority_queue_node< T, Compare, A > , including all inherited members.
+
This is the complete list of members for tbb::zero_allocator< void, Allocator >::rebind< U > , including all inherited members.
- add_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- add_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- base_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A >
- blt_pred_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_pred_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_succ_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- blt_succ_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- buffer_node (graph &g)tbb::flow::interface8::buffer_node< T, A > inline
- buffer_node (const buffer_node &src)tbb::flow::interface8::buffer_node< T, A > inline
- built_predecessors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- built_predecessors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- built_successors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- built_successors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- class_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- con_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline
- copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
- copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- del_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- del_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- enqueue_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
- extract () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- FAILED enum value (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
- forward_task ()tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- forwarder_busy (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- grab_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- handle_operations (prio_operation *op_list) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
- handler_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- input_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A >
- internal_add_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_add_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_add_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_consume (prio_operation *op) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
- internal_copy_preds (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_copy_succs (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_del_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_del_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_delete_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- internal_forward_task (prio_operation *op)tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
- internal_pop (prio_operation *op) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
- internal_pred_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_push (prio_operation *op) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
- internal_reg_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_release (prio_operation *op) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
- internal_rem_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- internal_reserve (prio_operation *op) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
- internal_succ_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
- item_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
- my_aggregator (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- my_built_predecessors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- my_successors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- op_stat enum name (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
- op_type enum name (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- output_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A >
- predecessor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- predecessor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- predecessor_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A >
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- prio_operation typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
- priority_queue_node (graph &g)tbb::flow::interface8::priority_queue_node< T, Compare, A > inline
- priority_queue_node (const priority_queue_node &src)tbb::flow::interface8::priority_queue_node< T, Compare, A > inline
- put_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- reg_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
- register_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
- rel_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- rem_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
- remove_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
- req_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- res_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- reset_node (reset_flags f) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
- reset_receiver (reset_flags) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- set_name (const char *name) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline virtual
- size_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
- SUCCEEDED enum value (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
- successor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- successor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
- successor_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A >
- try_consume ()tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_fwd_task enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
- try_get (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_put (const T &t)tbb::flow::interface8::receiver< T > inline
- try_put_task (const T &t)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
- try_release ()tbb::flow::interface8::buffer_node< T, A > inline virtual
- try_reserve (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
- WAIT enum value (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
- ~buffer_node () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
- ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
- ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
+ other typedef (defined in tbb::zero_allocator< void, Allocator >::rebind< U > )tbb::zero_allocator< void, Allocator >::rebind< U >
diff --git a/doc/html/a00351.html b/doc/html/a00351.html
index 974cc8f19e..80f4e1c62a 100644
--- a/doc/html/a00351.html
+++ b/doc/html/a00351.html
@@ -33,22 +33,19 @@
-
This is the complete list of members for tbb::flow::interface8::join_node< OutputTuple, reserving > , including all inherited members.
+
This is the complete list of members for tbb::bad_last_alloc , including all inherited members.
- input_ports_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, reserving > )tbb::flow::interface8::join_node< OutputTuple, reserving >
- join_node (graph &g) (defined in tbb::flow::interface8::join_node< OutputTuple, reserving > )tbb::flow::interface8::join_node< OutputTuple, reserving > inline
- join_node (const join_node &other) (defined in tbb::flow::interface8::join_node< OutputTuple, reserving > )tbb::flow::interface8::join_node< OutputTuple, reserving > inline
- output_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, reserving > )tbb::flow::interface8::join_node< OutputTuple, reserving >
- set_name (const char *name) (defined in tbb::flow::interface8::join_node< OutputTuple, reserving > )tbb::flow::interface8::join_node< OutputTuple, reserving > inline
+ what () const (defined in tbb::bad_last_alloc )tbb::bad_last_alloc
+ ~bad_last_alloc () (defined in tbb::bad_last_alloc )tbb::bad_last_alloc inline
diff --git a/doc/html/a00352.html b/doc/html/a00352.html
index b10a7dea95..bd4633e7d9 100644
--- a/doc/html/a00352.html
+++ b/doc/html/a00352.html
@@ -33,22 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::join_node< OutputTuple, queueing > , including all inherited members.
+
This is the complete list of members for tbb::improper_lock , including all inherited members.
- input_ports_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, queueing > )tbb::flow::interface8::join_node< OutputTuple, queueing >
- join_node (graph &g) (defined in tbb::flow::interface8::join_node< OutputTuple, queueing > )tbb::flow::interface8::join_node< OutputTuple, queueing > inline
- join_node (const join_node &other) (defined in tbb::flow::interface8::join_node< OutputTuple, queueing > )tbb::flow::interface8::join_node< OutputTuple, queueing > inline
- output_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, queueing > )tbb::flow::interface8::join_node< OutputTuple, queueing >
- set_name (const char *name) (defined in tbb::flow::interface8::join_node< OutputTuple, queueing > )tbb::flow::interface8::join_node< OutputTuple, queueing > inline
+ what () const (defined in tbb::improper_lock )tbb::improper_lock
diff --git a/doc/html/a00353.html b/doc/html/a00353.html
index de16b407a1..ded6eae9ce 100644
--- a/doc/html/a00353.html
+++ b/doc/html/a00353.html
@@ -33,30 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > , including all inherited members.
+
This is the complete list of members for tbb::user_abort , including all inherited members.
- input_ports_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > >
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7, __TBB_B8 b8) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
- join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7, __TBB_B8 b8, __TBB_B9 b9) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
- join_node (const join_node &other) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
- output_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > >
- set_name (const char *name) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ what () const (defined in tbb::user_abort )tbb::user_abort
diff --git a/doc/html/a00354.html b/doc/html/a00354.html
index 5e97352802..6c1ddcb706 100644
--- a/doc/html/a00354.html
+++ b/doc/html/a00354.html
@@ -33,23 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > , including all inherited members.
+
This is the complete list of members for tbb::missing_wait , including all inherited members.
- indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > inline
- indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > inline
- InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
- output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
- set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > inline
- unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
+ what () const (defined in tbb::missing_wait )tbb::missing_wait
diff --git a/doc/html/a00355.html b/doc/html/a00355.html
index 1e1509b901..5782eb727d 100644
--- a/doc/html/a00355.html
+++ b/doc/html/a00355.html
@@ -33,23 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::indexer_node< T0 > , including all inherited members.
+
This is the complete list of members for tbb::invalid_multiple_scheduling , including all inherited members.
diff --git a/doc/html/a00356.html b/doc/html/a00356.html
index 3246a732c0..fb05275223 100644
--- a/doc/html/a00356.html
+++ b/doc/html/a00356.html
@@ -33,23 +33,24 @@
-
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1 > , including all inherited members.
+
This is the complete list of members for tbb::tbb_exception , including all inherited members.
- indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 > inline
- indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 > inline
- InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 >
- output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 >
- set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 > inline
- unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 >
+ destroy ()=0tbb::tbb_exception pure virtual
+ move ()=0tbb::tbb_exception pure virtual
+ name () const =0tbb::tbb_exception pure virtual
+ operator delete (void *p)tbb::tbb_exception inline
+ throw_self ()=0tbb::tbb_exception pure virtual
+ what () const =0tbb::tbb_exception pure virtual
+ ~tbb_exception () (defined in tbb::tbb_exception )tbb::tbb_exception inline
diff --git a/doc/html/a00357.html b/doc/html/a00357.html
index a1e17e5517..b30af85946 100644
--- a/doc/html/a00357.html
+++ b/doc/html/a00357.html
@@ -33,23 +33,30 @@
-
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2 > , including all inherited members.
+
This is the complete list of members for tbb::captured_exception , including all inherited members.
- indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 > inline
- indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 > inline
- InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 >
- output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 >
- set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 > inline
- unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 >
+ captured_exception (const captured_exception &src) (defined in tbb::captured_exception )tbb::captured_exception inline
+ captured_exception (const char *name_, const char *info) (defined in tbb::captured_exception )tbb::captured_exception inline
+ clear () (defined in tbb::captured_exception )tbb::captured_exception
+ destroy ()tbb::captured_exception virtual
+ move ()tbb::captured_exception virtual
+ name () const tbb::captured_exception virtual
+ operator delete (void *p)tbb::tbb_exception inline
+ operator= (const captured_exception &src) (defined in tbb::captured_exception )tbb::captured_exception inline
+ set (const char *name, const char *info) (defined in tbb::captured_exception )tbb::captured_exception
+ throw_self ()tbb::captured_exception inline virtual
+ what () const tbb::captured_exception virtual
+ ~captured_exception () (defined in tbb::captured_exception )tbb::captured_exception
+ ~tbb_exception () (defined in tbb::tbb_exception )tbb::tbb_exception inline
diff --git a/doc/html/a00358.html b/doc/html/a00358.html
index 9beed9b329..598921eddd 100644
--- a/doc/html/a00358.html
+++ b/doc/html/a00358.html
@@ -33,23 +33,31 @@
-
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > , including all inherited members.
+
This is the complete list of members for tbb::movable_exception< ExceptionData > , including all inherited members.
- indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > inline
- indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > inline
- InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 >
- output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 >
- set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > inline
- unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 >
+ data () (defined in tbb::movable_exception< ExceptionData > )tbb::movable_exception< ExceptionData > inline
+ data () const (defined in tbb::movable_exception< ExceptionData > )tbb::movable_exception< ExceptionData > inline
+ destroy ()tbb::movable_exception< ExceptionData > inline virtual
+ movable_exception (const ExceptionData &data_) (defined in tbb::movable_exception< ExceptionData > )tbb::movable_exception< ExceptionData > inline
+ movable_exception (const movable_exception &src) (defined in tbb::movable_exception< ExceptionData > )tbb::movable_exception< ExceptionData > inline
+ move ()tbb::movable_exception< ExceptionData > inline virtual
+ my_exception_data tbb::movable_exception< ExceptionData > protected
+ name () const tbb::movable_exception< ExceptionData > inline virtual
+ operator delete (void *p)tbb::tbb_exception inline
+ operator= (const movable_exception &src) (defined in tbb::movable_exception< ExceptionData > )tbb::movable_exception< ExceptionData > inline
+ throw_self ()tbb::movable_exception< ExceptionData > inline virtual
+ what () const tbb::movable_exception< ExceptionData > inline virtual
+ ~movable_exception () (defined in tbb::movable_exception< ExceptionData > )tbb::movable_exception< ExceptionData > inline
+ ~tbb_exception () (defined in tbb::tbb_exception )tbb::tbb_exception inline
diff --git a/doc/html/a00359.html b/doc/html/a00359.html
index d052fd36e3..d3f2e4bf8e 100644
--- a/doc/html/a00359.html
+++ b/doc/html/a00359.html
@@ -33,23 +33,21 @@
-
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > , including all inherited members.
+
This is the complete list of members for tbb::tick_count , including all inherited members.
- indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > inline
- indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > inline
- InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >
- output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >
- set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > inline
- unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >
+ now ()tbb::tick_count inline static
+ operator- (const tick_count &t1, const tick_count &t0)tbb::tick_count friend
+ resolution ()tbb::tick_count inline static
+ tick_count ()tbb::tick_count inline
diff --git a/doc/html/a00360.html b/doc/html/a00360.html
index 7edf2292e8..1741cfd8c7 100644
--- a/doc/html/a00360.html
+++ b/doc/html/a00360.html
@@ -33,23 +33,26 @@
-
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > , including all inherited members.
+
This is the complete list of members for tbb::tick_count::interval_t , including all inherited members.
- indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > inline
- indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > inline
- InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 >
- output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 >
- set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > inline
- unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 >
+ interval_t ()tbb::tick_count::interval_t inline
+ interval_t (double sec)tbb::tick_count::interval_t inline explicit
+ operator+ (const interval_t &i, const interval_t &j)tbb::tick_count::interval_t friend
+ operator+= (const interval_t &i)tbb::tick_count::interval_t inline
+ operator- (const tick_count &t1, const tick_count &t0)tbb::tick_count::interval_t friend
+ operator- (const interval_t &i, const interval_t &j)tbb::tick_count::interval_t friend
+ operator-= (const interval_t &i)tbb::tick_count::interval_t inline
+ seconds () const tbb::tick_count::interval_t inline
+ tbb::tick_count (defined in tbb::tick_count::interval_t )tbb::tick_count::interval_t friend
diff --git a/doc/html/a00361.html b/doc/html/a00361.html
index 082f6cc689..9c9098e2f8 100644
--- a/doc/html/a00361.html
+++ b/doc/html/a00361.html
@@ -33,23 +33,33 @@
-
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::sender< T > , including all inherited members.
- indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > inline
- indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > inline
- InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >
- output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >
- set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > inline
- unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >
+ built_successors ()=0 (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > pure virtual
+ built_successors_type typedeftbb::flow::interface8::sender< T >
+ copy_successors (successor_list_type &)=0 (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > pure virtual
+ internal_add_built_successor (successor_type &)=0 (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > pure virtual
+ internal_delete_built_successor (successor_type &)=0 (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > pure virtual
+ output_type typedeftbb::flow::interface8::sender< T >
+ register_successor (successor_type &r)=0tbb::flow::interface8::sender< T > pure virtual
+ remove_successor (successor_type &r)=0tbb::flow::interface8::sender< T > pure virtual
+ successor_count ()=0 (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > pure virtual
+ successor_list_type typedef (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T >
+ successor_type typedeftbb::flow::interface8::sender< T >
+ try_consume ()tbb::flow::interface8::sender< T > inline virtual
+ try_get (T &)tbb::flow::interface8::sender< T > inline virtual
+ try_release ()tbb::flow::interface8::sender< T > inline virtual
+ try_reserve (T &)tbb::flow::interface8::sender< T > inline virtual
+ ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
diff --git a/doc/html/a00362.html b/doc/html/a00362.html
index 33e0b6e5ab..8e444035ff 100644
--- a/doc/html/a00362.html
+++ b/doc/html/a00362.html
@@ -33,23 +33,39 @@
-
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::receiver< T > , including all inherited members.
- indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > inline
- indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > inline
- InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
- output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
- set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > inline
- unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
+ built_predecessors ()=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ built_predecessors_type typedef (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T >
+ copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ input_type typedeftbb::flow::interface8::receiver< T >
+ internal::broadcast_cache (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > friend
+ internal::round_robin_cache (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > friend
+ internal::successor_cache (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > friend
+ internal_add_built_predecessor (predecessor_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ internal_delete_built_predecessor (predecessor_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
+ limiter_node classtbb::flow::interface8::receiver< T > friend
+ predecessor_count ()=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ predecessor_list_type typedef (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T >
+ predecessor_type typedeftbb::flow::interface8::receiver< T >
+ proxy_dependency_receiver (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > friend
+ register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ reset_receiver (reset_flags f=rf_reset_protocol)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > protected pure virtual
+ run_and_put_task classtbb::flow::interface8::receiver< T > friend
+ try_put (const T &t)tbb::flow::interface8::receiver< T > inline
+ try_put_task (const T &t)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > protected pure virtual
+ ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
diff --git a/doc/html/a00363.html b/doc/html/a00363.html
index fe3a510ac2..60dad58855 100644
--- a/doc/html/a00363.html
+++ b/doc/html/a00363.html
@@ -33,23 +33,66 @@
-
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::limiter_node< T > , including all inherited members.
- indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > inline
- indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > inline
- InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
- output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
- set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > inline
- unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
+ built_predecessors () (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ built_predecessors_type typedef (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T >
+ built_successors () (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ built_successors_type typedef (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T >
+ copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline
+ copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ decrement tbb::flow::interface8::limiter_node< T >
+ extract () (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_type typedef (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T >
+ internal::broadcast_cache (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > friend
+ internal::decrementer< limiter_node< T > > (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > friend
+ internal::forward_task_bypass< limiter_node< T > > (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > friend
+ internal::round_robin_cache (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > friend
+ internal_add_built_predecessor (sender< output_type > &src) (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ internal_add_built_successor (receiver< output_type > &src) (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ internal_delete_built_predecessor (sender< output_type > &src) (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ internal_delete_built_successor (receiver< output_type > &src) (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
+ limiter_node (graph &g, size_t threshold, int num_decrement_predecessors=0)tbb::flow::interface8::limiter_node< T > inline
+ limiter_node (const limiter_node &src)tbb::flow::interface8::limiter_node< T > inline
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_type typedef (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T >
+ predecessor_count () (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ predecessor_list_type typedef (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T >
+ predecessor_type typedef (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ register_predecessor (predecessor_type &src)tbb::flow::interface8::limiter_node< T > inline virtual
+ register_successor (receiver< output_type > &r)tbb::flow::interface8::limiter_node< T > inline virtual
+ remove_predecessor (predecessor_type &src)tbb::flow::interface8::limiter_node< T > inline virtual
+ remove_successor (receiver< output_type > &r)tbb::flow::interface8::limiter_node< T > inline virtual
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline protected virtual
+ reset_receiver (reset_flags) (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline protected virtual
+ run_and_put_task (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > friend
+ set_name (const char *name) (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ successor_count () (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T > inline virtual
+ successor_list_type typedef (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T >
+ successor_type typedef (defined in tbb::flow::interface8::limiter_node< T > )tbb::flow::interface8::limiter_node< T >
+ try_consume ()tbb::flow::interface8::sender< T > inline virtual
+ try_get (T &)tbb::flow::interface8::sender< T > inline virtual
+ try_put (const T &t)tbb::flow::interface8::receiver< T > inline
+ try_put_task (const T &t)tbb::flow::interface8::limiter_node< T > inline protected virtual
+ try_release ()tbb::flow::interface8::sender< T > inline virtual
+ try_reserve (T &)tbb::flow::interface8::sender< T > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
+ ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
diff --git a/doc/html/a00364.html b/doc/html/a00364.html
index 685db08b76..d3d3f1febd 100644
--- a/doc/html/a00364.html
+++ b/doc/html/a00364.html
@@ -33,37 +33,47 @@
-
This is the complete list of members for tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::continue_receiver , including all inherited members.
- add_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
- add_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
- add_visible_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
- add_visible_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
- composite_node (graph &g, const char *type_name="composite_node") (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
- composite_node (graph &g) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
- extract () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline virtual
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- input_ports () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
- input_ports_type typedef (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- output_ports () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
- output_ports_type typedef (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- reset_node (reset_flags) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline protected virtual
- set_external_ports (T1 &&input_ports_tuple, T2 &&output_ports_tuple) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
- set_name (const char *name) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline virtual
- ~composite_node () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline virtual
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ built_predecessors () (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver inline virtual
+ built_predecessors_type typedef (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver
+ continue_receiver (int number_of_predecessors=0)tbb::flow::interface8::continue_receiver inline
+ continue_receiver (const continue_receiver &src)tbb::flow::interface8::continue_receiver inline
+ copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver inline virtual
+ execute ()=0tbb::flow::interface8::continue_receiver protected pure virtual
+ input_type typedeftbb::flow::interface8::continue_receiver
+ internal::broadcast_cache (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver friend
+ internal::round_robin_cache (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver friend
+ internal::successor_cache (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver friend
+ internal_add_built_predecessor (predecessor_type &s) (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver inline virtual
+ internal_delete_built_predecessor (predecessor_type &s) (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver inline virtual
+ is_continue_receiver () (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver inline protected virtual
+ limiter_node (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver friend
+ my_built_predecessors (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver protected
+ my_current_count (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver protected
+ my_initial_predecessor_count (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver protected
+ my_mutex (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver protected
+ my_predecessor_count (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver protected
+ predecessor_count () (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver inline virtual
+ predecessor_list_type typedef (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver
+ predecessor_type typedeftbb::flow::interface8::continue_receiver
+ register_predecessor (predecessor_type &)tbb::flow::interface8::continue_receiver inline virtual
+ remove_predecessor (predecessor_type &)tbb::flow::interface8::continue_receiver inline virtual
+ reset_receiver (reset_flags f) (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver inline protected virtual
+ run_and_put_task (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver friend
+ try_put (const continue_msg &t)tbb::flow::interface8::receiver< continue_msg > inline
+ try_put_task (const input_type &) (defined in tbb::flow::interface8::continue_receiver )tbb::flow::interface8::continue_receiver inline protected virtual
+ ~continue_receiver ()tbb::flow::interface8::continue_receiver inline virtual
+ ~receiver ()tbb::flow::interface8::receiver< continue_msg > inline virtual
diff --git a/doc/html/a00365.html b/doc/html/a00365.html
index 29b9a2479d..e93826e8aa 100644
--- a/doc/html/a00365.html
+++ b/doc/html/a00365.html
@@ -33,35 +33,34 @@
-
This is the complete list of members for tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > , including all inherited members.
- add_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
- add_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
- add_visible_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
- add_visible_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
- composite_node (graph &g, const char *type_name="composite_node") (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
- composite_node (graph &g) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
- extract () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline virtual
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- input_ports () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
- input_ports_type typedef (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> >
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- reset_node (reset_flags) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline protected virtual
- set_external_ports (T &&input_ports_tuple) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
- set_name (const char *name) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline virtual
- ~composite_node () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline virtual
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ const_reference typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+ graph (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > friend
+ graph_iterator ()tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
+ graph_iterator (const graph_iterator &other)tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
+ graph_node (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > friend
+ iterator_category typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+ operator!= (const graph_iterator &other) const tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
+ operator* () const tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+ operator++ ()tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
+ operator++ (int)tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
+ operator-> () const tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+ operator= (const graph_iterator &other)tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
+ operator== (const graph_iterator &other) const tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > inline
+ pointer typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+ reference typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+ size_type typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+ value_type typedef (defined in tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType > )tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
diff --git a/doc/html/a00366.html b/doc/html/a00366.html
index 1a7a2709a8..32fdc31ce2 100644
--- a/doc/html/a00366.html
+++ b/doc/html/a00366.html
@@ -33,35 +33,44 @@
-
This is the complete list of members for tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::graph , including all inherited members.
- add_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
- add_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
- add_visible_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
- add_visible_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
- composite_node (graph &g, const char *type_name="composite_node") (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
- composite_node (graph &g) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
- extract () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline virtual
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- output_ports () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
- output_ports_type typedef (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> >
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- reset_node (reset_flags) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline protected virtual
- set_external_ports (T &&output_ports_tuple) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
- set_name (const char *name) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline virtual
- ~composite_node () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline virtual
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ add_task_to_reset_list (task *tp) (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ async_node (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph friend
+ begin ()tbb::flow::interface8::graph inline
+ begin () const tbb::flow::interface8::graph inline
+ cbegin () const tbb::flow::interface8::graph inline
+ cend () const tbb::flow::interface8::graph inline
+ const_iterator typedef (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph
+ decrement_wait_count ()tbb::flow::interface8::graph inline
+ end ()tbb::flow::interface8::graph inline
+ end () const tbb::flow::interface8::graph inline
+ exception_thrown () (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ graph ()tbb::flow::interface8::graph inline
+ graph (task_group_context &use_this_context)tbb::flow::interface8::graph inline explicit
+ graph_iterator (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph friend
+ graph_node (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph friend
+ increment_wait_count ()tbb::flow::interface8::graph inline
+ is_active () (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ is_cancelled ()tbb::flow::interface8::graph inline
+ iterator typedef (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph
+ reset (reset_flags f=rf_reset_protocol) (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ root_task ()tbb::flow::interface8::graph inline
+ run (Receiver &r, Body body)tbb::flow::interface8::graph inline
+ run (Body body)tbb::flow::interface8::graph inline
+ set_active (bool a=true) (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ set_name (const char *name) (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ wait_for_all ()tbb::flow::interface8::graph inline
+ ~graph ()tbb::flow::interface8::graph inline
diff --git a/doc/html/a00367.html b/doc/html/a00367.html
index 15bd4b2f13..38b9e4ec54 100644
--- a/doc/html/a00367.html
+++ b/doc/html/a00367.html
@@ -33,44 +33,27 @@
-
This is the complete list of members for tbb::flow::interface8::async_node< Input, Output, Allocator > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::graph_node , including all inherited members.
- async_commit () (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator > inline protected virtual
- async_gateway () (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator > inline
- async_gateway_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator >
- async_input_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator >
- async_node (graph &g, Body body)tbb::flow::interface8::async_node< Input, Output, Allocator > inline
- async_node (const async_node &src)tbb::flow::interface8::async_node< Input, Output, Allocator > inline
- async_output_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator >
- async_reserve () (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator > inline protected virtual
- async_try_put (const output_type &i)tbb::flow::interface8::async_node< Input, Output, Allocator > inline protected virtual
- extract () (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator > inline protected virtual
- graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
- input_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator >
- internal::broadcast_cache (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator > friend
- internal::round_robin_cache (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator > friend
- my_class typedef (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator >
- my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- output_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator >
- predecessor_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator >
- prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
- reset_node (reset_flags f) (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator > inline protected virtual
- run_and_put_task (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator > friend
- set_name (const char *name) (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator > inline virtual
- successor_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator >
- successors () (defined in tbb::flow::interface8::async_node< Input, Output, Allocator > )tbb::flow::interface8::async_node< Input, Output, Allocator > inline protected
- ~async_gateway () (defined in tbb::flow::interface8::internal::async_gateway< Output > )tbb::flow::interface8::internal::async_gateway< Output > inline virtual
- ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ extract ()=0 (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node pure virtual
+ graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node friend
+ graph_iterator (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node friend
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ reset_node (reset_flags f=rf_reset_protocol)=0 (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected pure virtual
+ set_name (const char *name)=0 (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node pure virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
diff --git a/doc/html/a00368.html b/doc/html/a00368.html
index fef80a1990..a2827cc38f 100644
--- a/doc/html/a00368.html
+++ b/doc/html/a00368.html
@@ -33,25 +33,48 @@
-
This is the complete list of members for tbb::flow::interface8::internal::edge_container< C > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::source_node< Output > , including all inherited members.
diff --git a/doc/html/a00369.html b/doc/html/a00369.html
index ce92c345b7..711eb6690d 100644
--- a/doc/html/a00369.html
+++ b/doc/html/a00369.html
@@ -33,22 +33,18 @@
-
This is the complete list of members for tbb::flow::interface8::internal::async_gateway< Output > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::allocate_buffer< T > , including all inherited members.
diff --git a/doc/html/a00370.html b/doc/html/a00370.html
index 042a819b3e..2a25057e5c 100644
--- a/doc/html/a00370.html
+++ b/doc/html/a00370.html
@@ -33,104 +33,18 @@
-
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::allocate_buffer< queueing > , including all inherited members.
- accessor_location (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
- accessor_location (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
- allocate_node_copy_construct (node_allocator_type &allocator, const Key &key, const T *t) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected static
- allocate_node_default_construct (node_allocator_type &allocator, const Key &key, const T *) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected static
- allocate_node_emplace_construct (node_allocator_type &allocator, Args &&...args) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected static
- allocate_node_move_construct (node_allocator_type &allocator, const Key &key, const T *t) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected static
- allocator_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- begin () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- begin () const (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- bucket_count () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- clear ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- concurrent_hash_map (const allocator_type &a=allocator_type())tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- concurrent_hash_map (size_type n, const allocator_type &a=allocator_type())tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- concurrent_hash_map (const concurrent_hash_map &table, const allocator_type &a=allocator_type())tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- concurrent_hash_map (concurrent_hash_map &&table)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- concurrent_hash_map (concurrent_hash_map &&table, const allocator_type &a)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- concurrent_hash_map (I first, I last, const allocator_type &a=allocator_type())tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- concurrent_hash_map (std::initializer_list< value_type > il, const allocator_type &a=allocator_type())tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- const_accessor (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
- const_iterator typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- const_pointer typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- const_range_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- const_reference typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- count (const Key &key) const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- delete_node (node_base *n) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
- difference_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- do_not_allocate_node (node_allocator_type &, const Key &, const T *) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected static
- emplace (const_accessor &result, Args &&...args)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- emplace (accessor &result, Args &&...args)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- emplace (Args &&...args)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- empty () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- end () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- end () const (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- equal_range (const Key &key) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- equal_range (const Key &key) const (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- erase (const Key &key)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- erase (const_accessor &item_accessor)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- erase (accessor &item_accessor)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- exclude (const_accessor &item_accessor)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
- find (const_accessor &result, const Key &key) const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- find (accessor &result, const Key &key)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- generic_emplace (Accessor &&result, Args &&...args) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
- generic_move_insert (Accessor &&result, value_type &&value) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
- get_allocator () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- insert (const_accessor &result, const Key &key)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- insert (accessor &result, const Key &key)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- insert (const_accessor &result, const value_type &value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- insert (accessor &result, const value_type &value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- insert (const value_type &value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- insert (const_accessor &result, value_type &&value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- insert (accessor &result, value_type &&value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- insert (value_type &&value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- insert (I first, I last)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- insert (std::initializer_list< value_type > il)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- internal::hash_map_iterator (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
- internal::hash_map_range (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
- internal_copy (const concurrent_hash_map &source)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
- internal_copy (I first, I last) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
- internal_equal_range (const Key &key, I end) const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
- internal_fast_find (const Key &key) const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
- is_write_access_needed (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
- is_write_access_needed (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
- is_write_access_needed (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
- iterator typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- key_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- lookup (bool op_insert, const Key &key, const T *t, const_accessor *result, bool write, node *(*allocate_node)(node_allocator_type &, const Key &, const T *), node *tmp_n=0)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
- mapped_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- max_size () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- my_allocator (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
- my_hash_compare (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
- node_allocator_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
- operator= (const concurrent_hash_map &table)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- operator= (concurrent_hash_map &&table)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- operator= (std::initializer_list< value_type > il)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- pointer typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- range (size_type grainsize=1) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- range (size_type grainsize=1) const (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- range_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- reference typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- rehash (size_type n=0)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- rehash_bucket (bucket *b_new, const hashcode_t h) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
- search_bucket (const key_type &key, bucket *b) const (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
- size () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
- size_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- swap (concurrent_hash_map &table)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- value_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
- ~concurrent_hash_map ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ value (defined in tbb::flow::interface8::allocate_buffer< queueing > )tbb::flow::interface8::allocate_buffer< queueing > static
diff --git a/doc/html/a00371.html b/doc/html/a00371.html
index 14a24dc012..288e92d0a4 100644
--- a/doc/html/a00371.html
+++ b/doc/html/a00371.html
@@ -33,27 +33,38 @@
-
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > , including all inherited members.
- const_accessor ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
- empty () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
- is_writer () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline protected
- my_hash (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor protected
- my_node (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor protected
- operator* () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor inline
- operator-> () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor inline
- release ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
- value_type typedeftbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor
- ~const_accessor ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+ extract () (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline virtual
+ fInput_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+ fOutput_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+ function_node (graph &g, size_t concurrency, Body body)tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline
+ function_node (const function_node &src)tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_queue_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+ input_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+ internal::broadcast_cache (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > friend
+ internal::round_robin_cache (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > friend
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+ predecessor_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline protected virtual
+ run_and_put_task (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > friend
+ set_name (const char *name) (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline virtual
+ successor_type typedef (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+ successors () (defined in tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > inline protected
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
diff --git a/doc/html/a00372.html b/doc/html/a00372.html
index 0631c6e2fc..620ad06ac5 100644
--- a/doc/html/a00372.html
+++ b/doc/html/a00372.html
@@ -33,18 +33,33 @@
-
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor_not_used , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > , including all inherited members.
- release () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor_not_used )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor_not_used inline
+ extract () (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > inline virtual
+ fInput_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_queue_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
+ input_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
+ multifunction_node (graph &g, size_t concurrency, Body body) (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > inline
+ multifunction_node (const multifunction_node &other) (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > inline
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ N (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > protected static
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_ports_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
+ output_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > inline protected virtual
+ set_name (const char *name) (defined in tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
diff --git a/doc/html/a00373.html b/doc/html/a00373.html
index f4c71d1440..19031d0e6b 100644
--- a/doc/html/a00373.html
+++ b/doc/html/a00373.html
@@ -33,21 +33,35 @@
-
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::split_node< TupleType, Allocator > , including all inherited members.
- acquire (concurrent_hash_map *base, const hashcode_t h, bool writer=false)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor inline
- bucket_accessor (concurrent_hash_map *base, const hashcode_t h, bool writer=false) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor inline
- is_writer ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor inline
- operator() ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor inline
+ allocator_type typedef (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator >
+ extract () (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > inline virtual
+ fInput_type typedef (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator >
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_queue_type typedef (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator >
+ input_type typedef (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator >
+ multifunction_node (graph &g, size_t concurrency, Body body) (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > inline
+ multifunction_node (const multifunction_node &other) (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > inline
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_ports_type typedef (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator >
+ output_type typedef (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > )tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator > inline protected virtual
+ set_name (const char *name) (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator > inline virtual
+ split_node (graph &g) (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator > inline
+ split_node (const split_node &other) (defined in tbb::flow::interface8::split_node< TupleType, Allocator > )tbb::flow::interface8::split_node< TupleType, Allocator > inline
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
diff --git a/doc/html/a00374.html b/doc/html/a00374.html
index 50533a58f0..adb30bcaff 100644
--- a/doc/html/a00374.html
+++ b/doc/html/a00374.html
@@ -33,21 +33,38 @@
-
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::continue_node< Output > , including all inherited members.
- call_clear_on_leave (concurrent_hash_map *a_ch_map) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave inline
- dismiss () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave inline
- my_ch_map (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave
- ~call_clear_on_leave () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave inline
+ continue_node (graph &g, Body body)tbb::flow::interface8::continue_node< Output > inline
+ continue_node (graph &g, int number_of_predecessors, Body body)tbb::flow::interface8::continue_node< Output > inline
+ continue_node (const continue_node &src)tbb::flow::interface8::continue_node< Output > inline
+ extract () (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output > inline virtual
+ fInput_type typedef (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output >
+ fOutput_type typedef (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output >
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_type typedef (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output >
+ internal::broadcast_cache (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output > friend
+ internal::round_robin_cache (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output > friend
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_type typedef (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output >
+ predecessor_type typedef (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output > inline protected virtual
+ run_and_put_task (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output > friend
+ set_name (const char *name) (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output > inline virtual
+ successor_type typedef (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output >
+ successors () (defined in tbb::flow::interface8::continue_node< Output > )tbb::flow::interface8::continue_node< Output > inline protected
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
diff --git a/doc/html/a00375.html b/doc/html/a00375.html
index 5e71fc03af..fec52ad729 100644
--- a/doc/html/a00375.html
+++ b/doc/html/a00375.html
@@ -33,29 +33,71 @@
-
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::overwrite_node< T > , including all inherited members.
- accessor (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor friend
- concurrent_hash_map< Key, T, HashCompare, Allocator > (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor friend
- const_accessor ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
- empty () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
- is_writer () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline protected
- my_hash (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor protected
- my_node (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor protected
- operator* () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
- operator-> () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
- release ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
- value_type typedeftbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
- ~const_accessor ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+ built_predecessors () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ built_predecessors_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ built_successors () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ built_successors_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ clear () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ extract () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ internal::broadcast_cache (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > friend
+ internal::round_robin_cache (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > friend
+ internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ internal_add_built_successor (successor_type &s) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ internal_delete_built_successor (successor_type &s) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
+ is_valid () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ my_buffer (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > protected
+ my_buffer_is_valid (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > protected
+ my_built_predecessors (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > protected
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ my_mutex (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > protected
+ my_successors (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ overwrite_node (graph &g) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ overwrite_node (const overwrite_node &src) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ predecessor_count () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ predecessor_list_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ predecessor_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ register_successor (successor_type &s)tbb::flow::interface8::overwrite_node< T > inline virtual
+ remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ remove_successor (successor_type &s)tbb::flow::interface8::overwrite_node< T > inline virtual
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline protected virtual
+ reset_receiver (reset_flags) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline protected virtual
+ run_and_put_task (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > friend
+ set_name (const char *name) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ successor_count () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ successor_list_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ successor_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ try_consume ()tbb::flow::interface8::sender< T > inline virtual
+ try_get (input_type &v)tbb::flow::interface8::overwrite_node< T > inline virtual
+ try_put (const T &t)tbb::flow::interface8::receiver< T > inline
+ try_put_task (const input_type &v) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline protected virtual
+ try_release ()tbb::flow::interface8::sender< T > inline virtual
+ try_reserve (T &)tbb::flow::interface8::sender< T > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ ~overwrite_node () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
+ ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
diff --git a/doc/html/a00376.html b/doc/html/a00376.html
index 1e604fb51f..39081ac36e 100644
--- a/doc/html/a00376.html
+++ b/doc/html/a00376.html
@@ -33,27 +33,73 @@
-
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::write_once_node< T > , including all inherited members.
- item (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node
- node (const Key &key) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
- node (const Key &key, const T &t) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
- node (const Key &key, T &&t) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
- node (value_type &&i) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
- node (Args &&...args) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
- node (value_type &i) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
- node (const value_type &i) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
- operator delete (void *ptr, node_allocator_type &a) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
- operator new (size_t, node_allocator_type &a) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
+ built_predecessors () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ built_predecessors_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ built_successors () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ built_successors_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ clear () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ extract () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_type typedef (defined in tbb::flow::interface8::write_once_node< T > )tbb::flow::interface8::write_once_node< T >
+ internal::broadcast_cache (defined in tbb::flow::interface8::write_once_node< T > )tbb::flow::interface8::write_once_node< T > friend
+ internal::round_robin_cache (defined in tbb::flow::interface8::write_once_node< T > )tbb::flow::interface8::write_once_node< T > friend
+ internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ internal_add_built_successor (successor_type &s) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ internal_delete_built_successor (successor_type &s) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
+ is_valid () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ my_buffer (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > protected
+ my_buffer_is_valid (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > protected
+ my_built_predecessors (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > protected
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ my_mutex (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > protected
+ my_successors (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_type typedef (defined in tbb::flow::interface8::write_once_node< T > )tbb::flow::interface8::write_once_node< T >
+ overwrite_node (graph &g) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ overwrite_node (const overwrite_node &src) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ predecessor_count () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ predecessor_list_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ predecessor_type typedef (defined in tbb::flow::interface8::write_once_node< T > )tbb::flow::interface8::write_once_node< T >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ register_successor (successor_type &s)tbb::flow::interface8::overwrite_node< T > inline virtual
+ remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ remove_successor (successor_type &s)tbb::flow::interface8::overwrite_node< T > inline virtual
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline protected virtual
+ reset_receiver (reset_flags) (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline protected virtual
+ run_and_put_task (defined in tbb::flow::interface8::write_once_node< T > )tbb::flow::interface8::write_once_node< T > friend
+ set_name (const char *name) (defined in tbb::flow::interface8::write_once_node< T > )tbb::flow::interface8::write_once_node< T > inline virtual
+ successor_count () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline virtual
+ successor_list_type typedef (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T >
+ successor_type typedef (defined in tbb::flow::interface8::write_once_node< T > )tbb::flow::interface8::write_once_node< T >
+ try_consume ()tbb::flow::interface8::sender< T > inline virtual
+ try_get (input_type &v)tbb::flow::interface8::overwrite_node< T > inline virtual
+ try_put (const T &t)tbb::flow::interface8::receiver< T > inline
+ try_put_task (const T &v) (defined in tbb::flow::interface8::write_once_node< T > )tbb::flow::interface8::write_once_node< T > inline protected virtual
+ try_release ()tbb::flow::interface8::sender< T > inline virtual
+ try_reserve (T &)tbb::flow::interface8::sender< T > inline virtual
+ write_once_node (graph &g)tbb::flow::interface8::write_once_node< T > inline
+ write_once_node (const write_once_node &src)tbb::flow::interface8::write_once_node< T > inline
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ ~overwrite_node () (defined in tbb::flow::interface8::overwrite_node< T > )tbb::flow::interface8::overwrite_node< T > inline
+ ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
+ ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
diff --git a/doc/html/a00377.html b/doc/html/a00377.html
index b8ba5ff8af..9431092a7a 100644
--- a/doc/html/a00377.html
+++ b/doc/html/a00377.html
@@ -33,45 +33,63 @@
-
This is the complete list of members for tbb::interface5::concurrent_priority_queue< T, Compare, A > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::broadcast_node< T > , including all inherited members.
- allocator_type typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
- assign (InputIterator begin, InputIterator end)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- assign (std::initializer_list< T > il)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- clear ()tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- concurrent_priority_queue (const allocator_type &a=allocator_type())tbb::interface5::concurrent_priority_queue< T, Compare, A > inline explicit
- concurrent_priority_queue (size_type init_capacity, const allocator_type &a=allocator_type())tbb::interface5::concurrent_priority_queue< T, Compare, A > inline explicit
- concurrent_priority_queue (InputIterator begin, InputIterator end, const allocator_type &a=allocator_type())tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- concurrent_priority_queue (std::initializer_list< T > init_list, const allocator_type &a=allocator_type())tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- concurrent_priority_queue (const concurrent_priority_queue &src)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline explicit
- concurrent_priority_queue (const concurrent_priority_queue &src, const allocator_type &a)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- concurrent_priority_queue (concurrent_priority_queue &&src)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- concurrent_priority_queue (concurrent_priority_queue &&src, const allocator_type &a)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- const_reference typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
- difference_type typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
- emplace (Args &&...args)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- empty () const tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- get_allocator () const tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- operator= (const concurrent_priority_queue &src)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- operator= (concurrent_priority_queue &&src)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- operator= (std::initializer_list< T > il)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- push (const_reference elem)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- push (value_type &&elem)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- reference typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
- size () const tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- size_type typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
- swap (concurrent_priority_queue &q)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- try_pop (reference elem)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
- value_type typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
+ broadcast_node (graph &g) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline
+ broadcast_node (const broadcast_node &src) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline
+ built_predecessors () (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ built_predecessors_type typedef (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T >
+ built_successors () (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ built_successors_type typedef (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T >
+ copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline
+ copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ extract () (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_type typedef (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T >
+ internal::broadcast_cache (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > friend
+ internal::round_robin_cache (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > friend
+ internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ internal_add_built_successor (successor_type &r) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ internal_delete_built_successor (successor_type &r) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_type typedef (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T >
+ predecessor_count () (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ predecessor_list_type typedef (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T >
+ predecessor_type typedef (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ register_successor (receiver< T > &r)tbb::flow::interface8::broadcast_node< T > inline virtual
+ remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ remove_successor (receiver< T > &r)tbb::flow::interface8::broadcast_node< T > inline virtual
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline protected virtual
+ reset_receiver (reset_flags) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline protected virtual
+ run_and_put_task (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > friend
+ set_name (const char *name) (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ successor_count () (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T > inline virtual
+ successor_list_type typedef (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T >
+ successor_type typedef (defined in tbb::flow::interface8::broadcast_node< T > )tbb::flow::interface8::broadcast_node< T >
+ try_consume ()tbb::flow::interface8::sender< T > inline virtual
+ try_get (T &)tbb::flow::interface8::sender< T > inline virtual
+ try_put (const T &t)tbb::flow::interface8::receiver< T > inline
+ try_put_task (const T &t)tbb::flow::interface8::broadcast_node< T > inline protected virtual
+ try_release ()tbb::flow::interface8::sender< T > inline virtual
+ try_reserve (T &)tbb::flow::interface8::sender< T > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
+ ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
diff --git a/doc/html/a00378.html b/doc/html/a00378.html
index adcda40522..611cb6abdb 100644
--- a/doc/html/a00378.html
+++ b/doc/html/a00378.html
@@ -33,26 +33,114 @@
-
This is the complete list of members for tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::buffer_node< T, A > , including all inherited members.
- allocator_type typedef (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
- allow_multimapping enum value (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
- concurrent_unordered_map_traits () (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > inline protected
- concurrent_unordered_map_traits (const hash_compare &hc) (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > inline protected
- get_key (const std::pair< Type1, Type2 > &value) (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > inline protected static
- hash_compare typedef (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
- key_type typedef (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
- my_hash_compare (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
- value_type typedef (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
+ add_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ add_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_pred_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_pred_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_succ_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_succ_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ buffer_node (graph &g)tbb::flow::interface8::buffer_node< T, A > inline
+ buffer_node (const buffer_node &src)tbb::flow::interface8::buffer_node< T, A > inline
+ built_predecessors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ built_predecessors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ built_successors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ built_successors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ class_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ con_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline
+ copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ del_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ del_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ enqueue_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
+ extract () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ FAILED enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ forward_task ()tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ forwarder_busy (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ grab_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ handle_operations (buffer_operation *op_list) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ handler_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ input_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ internal::aggregating_functor< class_type, buffer_operation > (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > friend
+ internal::broadcast_cache (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > friend
+ internal::forward_task_bypass< buffer_node< T, A > > (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > friend
+ internal::round_robin_cache (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > friend
+ internal_add_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_add_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_add_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_consume (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_copy_preds (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_copy_succs (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_del_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_del_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_delete_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_forward_task (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_pop (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_pred_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_push (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_reg_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_release (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_rem_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_reserve (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_succ_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
+ my_aggregator (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ my_built_predecessors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ my_successors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ op_stat enum name (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ op_type enum name (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ output_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ predecessor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ predecessor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ predecessor_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ put_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ reg_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ register_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ rel_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ rem_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ remove_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ req_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ res_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ reset_receiver (reset_flags) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ run_and_put_task (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > friend
+ set_name (const char *name) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ size_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ SUCCEEDED enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ successor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ successor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ successor_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ try_consume ()tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_fwd_task enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ try_get (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_put (const T &t)tbb::flow::interface8::receiver< T > inline
+ try_put_task (const T &t)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ try_release ()tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_reserve (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ WAIT enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ ~buffer_node () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
+ ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
diff --git a/doc/html/a00379.html b/doc/html/a00379.html
index a16dfd33d4..0b1ceae47e 100644
--- a/doc/html/a00379.html
+++ b/doc/html/a00379.html
@@ -33,21 +33,27 @@
-
This is the complete list of members for tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::buffer_node< T, A >::buffer_operation , including all inherited members.
- concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare friend
- my_hash_compare (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare protected
- operator() (const value_type &left, const value_type &right) const (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare inline
- value_compare (const hash_compare &comparator) (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare inline
+ buffer_operation (const T &e, op_type t) (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation inline
+ cnt_val (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+ elem (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+ elem (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+ ltask (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+ p (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+ pvec (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+ r (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+ svec (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+ type (defined in tbb::flow::interface8::buffer_node< T, A >::buffer_operation )tbb::flow::interface8::buffer_node< T, A >::buffer_operation
diff --git a/doc/html/a00381.html b/doc/html/a00381.html
index 451eb444b6..447b4befe9 100644
--- a/doc/html/a00381.html
+++ b/doc/html/a00381.html
@@ -33,44 +33,113 @@
-
This is the complete list of members for tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::queue_node< T, A > , including all inherited members.
- allocator_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- concurrent_unordered_multimap (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline explicit
- concurrent_unordered_multimap (const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multimap (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multimap (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multimap (const concurrent_unordered_multimap &table) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multimap (concurrent_unordered_multimap &&table) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multimap (const concurrent_unordered_multimap &table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multimap (concurrent_unordered_multimap &&table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
- const_iterator typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- const_local_iterator typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- const_pointer typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- const_reference typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- difference_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- hasher typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- iterator typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- key_compare typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- key_equal typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- key_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- local_iterator typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- mapped_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- operator= (const concurrent_unordered_multimap &table) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
- operator= (concurrent_unordered_multimap &&table) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
- pointer typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- reference typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- size_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
- value_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ add_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ add_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ base_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
+ blt_pred_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_pred_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_succ_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_succ_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ buffer_node (graph &g)tbb::flow::interface8::buffer_node< T, A > inline
+ buffer_node (const buffer_node &src)tbb::flow::interface8::buffer_node< T, A > inline
+ built_predecessors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ built_predecessors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ built_successors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ built_successors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ class_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ con_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline
+ copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ del_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ del_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ enqueue_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
+ extract () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ FAILED enum value (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
+ forward_task ()tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ forwarder_busy (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ grab_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ handle_operations (buffer_operation *op_list) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ handler_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ input_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A >
+ internal_add_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_add_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_add_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_consume (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
+ internal_copy_preds (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_copy_succs (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_del_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_del_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_delete_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_forward_task (queue_operation *op)tbb::flow::interface8::queue_node< T, A > inline protected virtual
+ internal_pop (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
+ internal_pred_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_push (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_reg_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_release (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_rem_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_reserve (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
+ internal_succ_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
+ my_aggregator (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ my_built_predecessors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ my_successors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ op_stat enum name (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
+ op_type enum name (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ output_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A >
+ predecessor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ predecessor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ predecessor_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ put_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ queue_node (graph &g)tbb::flow::interface8::queue_node< T, A > inline
+ queue_node (const queue_node &src)tbb::flow::interface8::queue_node< T, A > inline
+ queue_operation typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
+ reg_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ register_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ rel_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ rem_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ remove_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ req_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ res_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
+ reset_receiver (reset_flags) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ set_name (const char *name) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline virtual
+ size_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
+ SUCCEEDED enum value (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
+ successor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ successor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ successor_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A >
+ try_consume ()tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_fwd_task enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ try_get (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_put (const T &t)tbb::flow::interface8::receiver< T > inline
+ try_put_task (const T &t)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ try_release ()tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_reserve (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ WAIT enum value (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
+ ~buffer_node () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
+ ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
diff --git a/doc/html/a00382.html b/doc/html/a00382.html
index 60aa51f86c..45800618ba 100644
--- a/doc/html/a00382.html
+++ b/doc/html/a00382.html
@@ -33,27 +33,116 @@
-
This is the complete list of members for tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::sequencer_node< T, A > , including all inherited members.
- allocator_type typedef (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
- allow_multimapping enum value (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
- concurrent_unordered_set_traits () (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > inline protected
- concurrent_unordered_set_traits (const hash_compare &hc) (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > inline protected
- get_key (const value_type &value) (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > inline protected static
- hash_compare typedef (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
- key_type typedef (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
- my_hash_compare (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
- value_compare typedef (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
- value_type typedef (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
+ add_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ add_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ base_type typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
+ blt_pred_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_pred_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_succ_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_succ_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ buffer_node (graph &g)tbb::flow::interface8::buffer_node< T, A > inline
+ buffer_node (const buffer_node &src)tbb::flow::interface8::buffer_node< T, A > inline
+ built_predecessors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ built_predecessors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ built_successors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ built_successors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ class_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ con_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline
+ copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ del_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ del_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ enqueue_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
+ extract () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ FAILED enum value (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
+ forward_task ()tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ forwarder_busy (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ grab_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ handle_operations (buffer_operation *op_list) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ handler_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ input_type typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A >
+ internal_add_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_add_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_add_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_consume (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
+ internal_copy_preds (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_copy_succs (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_del_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_del_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_delete_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_forward_task (queue_operation *op)tbb::flow::interface8::queue_node< T, A > inline protected virtual
+ internal_pop (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
+ internal_pred_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_reg_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_release (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_rem_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_reserve (queue_operation *op) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
+ internal_succ_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
+ my_aggregator (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ my_built_predecessors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ my_successors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ op_stat enum name (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
+ op_type enum name (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ output_type typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A >
+ predecessor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ predecessor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ predecessor_type typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ put_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ queue_node (graph &g)tbb::flow::interface8::queue_node< T, A > inline
+ queue_node (const queue_node &src)tbb::flow::interface8::queue_node< T, A > inline
+ queue_operation typedef (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > protected
+ reg_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ register_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ rel_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ rem_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ remove_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ req_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ res_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::queue_node< T, A > )tbb::flow::interface8::queue_node< T, A > inline protected virtual
+ reset_receiver (reset_flags) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ sequencer_node (graph &g, const Sequencer &s)tbb::flow::interface8::sequencer_node< T, A > inline
+ sequencer_node (const sequencer_node &src)tbb::flow::interface8::sequencer_node< T, A > inline
+ sequencer_operation typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
+ set_name (const char *name) (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > inline virtual
+ size_type typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
+ SUCCEEDED enum value (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
+ successor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ successor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ successor_type typedef (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A >
+ try_consume ()tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_fwd_task enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ try_get (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_put (const T &t)tbb::flow::interface8::receiver< T > inline
+ try_put_task (const T &t)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ try_release ()tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_reserve (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ WAIT enum value (defined in tbb::flow::interface8::sequencer_node< T, A > )tbb::flow::interface8::sequencer_node< T, A > protected
+ ~buffer_node () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
+ ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
+ ~sequencer_node ()tbb::flow::interface8::sequencer_node< T, A > inline
diff --git a/doc/html/a00383.html b/doc/html/a00383.html
index 0e0849070c..1217f67a65 100644
--- a/doc/html/a00383.html
+++ b/doc/html/a00383.html
@@ -33,44 +33,114 @@
-
This is the complete list of members for tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::priority_queue_node< T, Compare, A > , including all inherited members.
- allocator_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- concurrent_unordered_set (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline explicit
- concurrent_unordered_set (const Allocator &a) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_set (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_set (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_set (const concurrent_unordered_set &table) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_set (concurrent_unordered_set &&table) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_set (const concurrent_unordered_set &table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_set (concurrent_unordered_set &&table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
- const_iterator typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- const_local_iterator typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- const_pointer typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- const_reference typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- difference_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- hasher typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- iterator typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- key_compare typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- key_equal typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- key_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- local_iterator typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- mapped_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- operator= (const concurrent_unordered_set &table) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
- operator= (concurrent_unordered_set &&table) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
- pointer typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- reference typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- size_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
- value_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ add_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ add_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ base_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A >
+ blt_pred_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_pred_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_succ_cnt enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ blt_succ_cpy enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ buffer_node (graph &g)tbb::flow::interface8::buffer_node< T, A > inline
+ buffer_node (const buffer_node &src)tbb::flow::interface8::buffer_node< T, A > inline
+ built_predecessors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ built_predecessors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ built_successors () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ built_successors_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ class_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ con_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ copy_predecessors (predecessor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline
+ copy_predecessors (predecessor_list_type &)=0 (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > pure virtual
+ copy_successors (successor_list_type &v) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ del_blt_pred enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ del_blt_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ enqueue_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
+ extract () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ FAILED enum value (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
+ forward_task ()tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ forwarder_busy (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ grab_forwarding_task (buffer_operation &op_data) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ handle_operations (prio_operation *op_list) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
+ handler_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ input_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A >
+ internal_add_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_add_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_add_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_add_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_consume (prio_operation *op) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
+ internal_copy_preds (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_copy_succs (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_del_built_pred (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_del_built_succ (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_delete_built_predecessor (predecessor_type &p) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_delete_built_successor (successor_type &r) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ internal_forward_task (prio_operation *op)tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
+ internal_pop (prio_operation *op) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
+ internal_pred_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_push (prio_operation *op) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
+ internal_reg_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_release (prio_operation *op) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
+ internal_rem_succ (buffer_operation *op)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ internal_reserve (prio_operation *op) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
+ internal_succ_cnt (buffer_operation *op) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ is_continue_receiver () (defined in tbb::flow::interface8::receiver< T > )tbb::flow::interface8::receiver< T > inline protected virtual
+ item_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
+ my_aggregator (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ my_built_predecessors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ my_successors (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ op_stat enum name (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
+ op_type enum name (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ output_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A >
+ predecessor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ predecessor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ predecessor_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ prio_operation typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
+ priority_queue_node (graph &g)tbb::flow::interface8::priority_queue_node< T, Compare, A > inline
+ priority_queue_node (const priority_queue_node &src)tbb::flow::interface8::priority_queue_node< T, Compare, A > inline
+ put_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ reg_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ register_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ register_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ rel_res enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ rem_succ enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ remove_predecessor (predecessor_type &)tbb::flow::interface8::receiver< T > inline virtual
+ remove_successor (successor_type &r)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ req_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ res_item enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline protected virtual
+ reset_receiver (reset_flags) (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ set_name (const char *name) (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > inline virtual
+ size_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
+ SUCCEEDED enum value (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
+ successor_count () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ successor_list_type typedef (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A >
+ successor_type typedef (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A >
+ try_consume ()tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_fwd_task enum value (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > protected
+ try_get (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_put (const T &t)tbb::flow::interface8::receiver< T > inline
+ try_put_task (const T &t)tbb::flow::interface8::buffer_node< T, A > inline protected virtual
+ try_release ()tbb::flow::interface8::buffer_node< T, A > inline virtual
+ try_reserve (T &v)tbb::flow::interface8::buffer_node< T, A > inline virtual
+ WAIT enum value (defined in tbb::flow::interface8::priority_queue_node< T, Compare, A > )tbb::flow::interface8::priority_queue_node< T, Compare, A > protected
+ ~buffer_node () (defined in tbb::flow::interface8::buffer_node< T, A > )tbb::flow::interface8::buffer_node< T, A > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ ~receiver ()tbb::flow::interface8::receiver< T > inline virtual
+ ~sender () (defined in tbb::flow::interface8::sender< T > )tbb::flow::interface8::sender< T > inline virtual
diff --git a/doc/html/a00384.html b/doc/html/a00384.html
index 5cdea28725..24432d8b1a 100644
--- a/doc/html/a00384.html
+++ b/doc/html/a00384.html
@@ -33,44 +33,22 @@
-
This is the complete list of members for tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::join_node< OutputTuple, reserving > , including all inherited members.
- allocator_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- concurrent_unordered_multiset (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline explicit
- concurrent_unordered_multiset (const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multiset (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multiset (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multiset (const concurrent_unordered_multiset &table) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multiset (concurrent_unordered_multiset &&table) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multiset (const concurrent_unordered_multiset &table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_multiset (concurrent_unordered_multiset &&table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
- const_iterator typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- const_local_iterator typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- const_pointer typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- const_reference typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- difference_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- hasher typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- iterator typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- key_compare typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- key_equal typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- key_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- local_iterator typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- mapped_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- operator= (const concurrent_unordered_multiset &table) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
- operator= (concurrent_unordered_multiset &&table) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
- pointer typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- reference typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- size_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
- value_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ input_ports_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, reserving > )tbb::flow::interface8::join_node< OutputTuple, reserving >
+ join_node (graph &g) (defined in tbb::flow::interface8::join_node< OutputTuple, reserving > )tbb::flow::interface8::join_node< OutputTuple, reserving > inline
+ join_node (const join_node &other) (defined in tbb::flow::interface8::join_node< OutputTuple, reserving > )tbb::flow::interface8::join_node< OutputTuple, reserving > inline
+ output_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, reserving > )tbb::flow::interface8::join_node< OutputTuple, reserving >
+ set_name (const char *name) (defined in tbb::flow::interface8::join_node< OutputTuple, reserving > )tbb::flow::interface8::join_node< OutputTuple, reserving > inline
diff --git a/doc/html/a00385.html b/doc/html/a00385.html
index 18090e44ca..32fc294da2 100644
--- a/doc/html/a00385.html
+++ b/doc/html/a00385.html
@@ -33,31 +33,22 @@
-
This is the complete list of members for tbb::interface5::reader_writer_lock , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::join_node< OutputTuple, queueing > , including all inherited members.
- active enum value (defined in tbb::interface5::reader_writer_lock )tbb::interface5::reader_writer_lock
- invalid enum value (defined in tbb::interface5::reader_writer_lock )tbb::interface5::reader_writer_lock
- lock ()tbb::interface5::reader_writer_lock
- lock_read ()tbb::interface5::reader_writer_lock
- reader_writer_lock ()tbb::interface5::reader_writer_lock inline
- scoped_lock (defined in tbb::interface5::reader_writer_lock )tbb::interface5::reader_writer_lock friend
- scoped_lock_read (defined in tbb::interface5::reader_writer_lock )tbb::interface5::reader_writer_lock friend
- status_t enum nametbb::interface5::reader_writer_lock
- try_lock ()tbb::interface5::reader_writer_lock
- try_lock_read ()tbb::interface5::reader_writer_lock
- unlock ()tbb::interface5::reader_writer_lock
- waiting enum value (defined in tbb::interface5::reader_writer_lock )tbb::interface5::reader_writer_lock
- waiting_nonblocking enum value (defined in tbb::interface5::reader_writer_lock )tbb::interface5::reader_writer_lock
- ~reader_writer_lock ()tbb::interface5::reader_writer_lock inline
+ input_ports_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, queueing > )tbb::flow::interface8::join_node< OutputTuple, queueing >
+ join_node (graph &g) (defined in tbb::flow::interface8::join_node< OutputTuple, queueing > )tbb::flow::interface8::join_node< OutputTuple, queueing > inline
+ join_node (const join_node &other) (defined in tbb::flow::interface8::join_node< OutputTuple, queueing > )tbb::flow::interface8::join_node< OutputTuple, queueing > inline
+ output_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, queueing > )tbb::flow::interface8::join_node< OutputTuple, queueing >
+ set_name (const char *name) (defined in tbb::flow::interface8::join_node< OutputTuple, queueing > )tbb::flow::interface8::join_node< OutputTuple, queueing > inline
diff --git a/doc/html/a00386.html b/doc/html/a00386.html
index 23af3a6188..5e01248d1f 100644
--- a/doc/html/a00386.html
+++ b/doc/html/a00386.html
@@ -33,22 +33,31 @@
-
This is the complete list of members for tbb::interface5::reader_writer_lock::scoped_lock , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > , including all inherited members.
- operator delete (void *p) (defined in tbb::interface5::reader_writer_lock::scoped_lock )tbb::interface5::reader_writer_lock::scoped_lock inline
- operator new (size_t s) (defined in tbb::interface5::reader_writer_lock::scoped_lock )tbb::interface5::reader_writer_lock::scoped_lock inline
- reader_writer_lock (defined in tbb::interface5::reader_writer_lock::scoped_lock )tbb::interface5::reader_writer_lock::scoped_lock friend
- scoped_lock (reader_writer_lock &lock)tbb::interface5::reader_writer_lock::scoped_lock inline
- ~scoped_lock ()tbb::interface5::reader_writer_lock::scoped_lock inline
+ input_ports_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > >
+ join_node (graph &g) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7, __TBB_B8 b8) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ join_node (graph &g, __TBB_B0 b0, __TBB_B1 b1, __TBB_B2 b2, __TBB_B3 b3, __TBB_B4 b4, __TBB_B5 b5, __TBB_B6 b6, __TBB_B7 b7, __TBB_B8 b8, __TBB_B9 b9) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ join_node (const join_node &other) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
+ output_type typedef (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > >
+ set_name (const char *name) (defined in tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > )tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > > inline
diff --git a/doc/html/a00387.html b/doc/html/a00387.html
index f6b1bab802..e551440b77 100644
--- a/doc/html/a00387.html
+++ b/doc/html/a00387.html
@@ -33,22 +33,23 @@
-
This is the complete list of members for tbb::interface5::reader_writer_lock::scoped_lock_read , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > , including all inherited members.
- operator delete (void *p) (defined in tbb::interface5::reader_writer_lock::scoped_lock_read )tbb::interface5::reader_writer_lock::scoped_lock_read inline
- operator new (size_t s) (defined in tbb::interface5::reader_writer_lock::scoped_lock_read )tbb::interface5::reader_writer_lock::scoped_lock_read inline
- reader_writer_lock (defined in tbb::interface5::reader_writer_lock::scoped_lock_read )tbb::interface5::reader_writer_lock::scoped_lock_read friend
- scoped_lock_read (reader_writer_lock &lock)tbb::interface5::reader_writer_lock::scoped_lock_read inline
- ~scoped_lock_read ()tbb::interface5::reader_writer_lock::scoped_lock_read inline
+ indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > inline
+ indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > inline
+ InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
+ output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
+ set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > inline
+ unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
diff --git a/doc/html/a00388.html b/doc/html/a00388.html
index af05f34495..c421439c9e 100644
--- a/doc/html/a00388.html
+++ b/doc/html/a00388.html
@@ -33,19 +33,23 @@
-
This is the complete list of members for tbb::interface5::internal::use_element_copy_constructor< T, C > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::indexer_node< T0 > , including all inherited members.
diff --git a/doc/html/a00389.html b/doc/html/a00389.html
index 48d05b1766..e18b4699db 100644
--- a/doc/html/a00389.html
+++ b/doc/html/a00389.html
@@ -33,18 +33,23 @@
-
This is the complete list of members for tbb::interface5::internal::use_element_copy_constructor< T, false > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1 > , including all inherited members.
- type typedef (defined in tbb::interface5::internal::use_element_copy_constructor< T, false > )tbb::interface5::internal::use_element_copy_constructor< T, false >
+ indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 > inline
+ indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 > inline
+ InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 >
+ output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 >
+ set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 > inline
+ unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1 > )tbb::flow::interface8::indexer_node< T0, T1 >
diff --git a/doc/html/a00390.html b/doc/html/a00390.html
index 0029102e53..e45b20a206 100644
--- a/doc/html/a00390.html
+++ b/doc/html/a00390.html
@@ -33,26 +33,23 @@
-
This is the complete list of members for tbb::interface6::aggregator_operation , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2 > , including all inherited members.
- agg_finished enum value (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation
- agg_waiting enum value (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation
- aggregator_ext (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation friend
- aggregator_operation () (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation inline
- aggregator_operation_status enum name (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation
- finish ()tbb::interface6::aggregator_operation inline
- next () (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation inline
- set_next (aggregator_operation *n) (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation inline
- start ()tbb::interface6::aggregator_operation inline
+ indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 > inline
+ indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 > inline
+ InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 >
+ output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 >
+ set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 > inline
+ unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2 > )tbb::flow::interface8::indexer_node< T0, T1, T2 >
diff --git a/doc/html/a00391.html b/doc/html/a00391.html
index 4b93f749a1..2c921f39f0 100644
--- a/doc/html/a00391.html
+++ b/doc/html/a00391.html
@@ -33,20 +33,23 @@
-
This is the complete list of members for tbb::interface6::aggregator_ext< handler_type > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > , including all inherited members.
- aggregator_ext (const handler_type &h) (defined in tbb::interface6::aggregator_ext< handler_type > )tbb::interface6::aggregator_ext< handler_type > inline
- execute_impl (aggregator_operation &op)tbb::interface6::aggregator_ext< handler_type > inline protected
- process (aggregator_operation *op)tbb::interface6::aggregator_ext< handler_type > inline
+ indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > inline
+ indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > inline
+ InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 >
+ output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 >
+ set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > inline
+ unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3 >
diff --git a/doc/html/a00392.html b/doc/html/a00392.html
index 3b797e73fc..adac27abb5 100644
--- a/doc/html/a00392.html
+++ b/doc/html/a00392.html
@@ -33,22 +33,23 @@
-
This is the complete list of members for tbb::interface6::aggregator , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > , including all inherited members.
- aggregator () (defined in tbb::interface6::aggregator )tbb::interface6::aggregator inline
- aggregator_ext (const internal::basic_handler &h) (defined in tbb::interface6::aggregator_ext< internal::basic_handler > )tbb::interface6::aggregator_ext< internal::basic_handler > inline private
- execute (const Body &b)tbb::interface6::aggregator inline
- execute_impl (aggregator_operation &op)tbb::interface6::aggregator_ext< internal::basic_handler > inline private
- process (aggregator_operation *op)tbb::interface6::aggregator_ext< internal::basic_handler > inline private
+ indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > inline
+ indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > inline
+ InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >
+ output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >
+ set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > inline
+ unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >
diff --git a/doc/html/a00393.html b/doc/html/a00393.html
index ea80506ec2..764b1834da 100644
--- a/doc/html/a00393.html
+++ b/doc/html/a00393.html
@@ -33,21 +33,23 @@
-
This is the complete list of members for tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > , including all inherited members.
- concurrent_lru_cache (value_function_type f, std::size_t number_of_lru_history_items) (defined in tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > )tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > inline
- handle typedef (defined in tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > )tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type >
- operator[] (key_type k) (defined in tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > )tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > inline
- tbb::internal::aggregating_functor< self_type, aggregated_operation_type > (defined in tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > )tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > friend
+ indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > inline
+ indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > inline
+ InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 >
+ output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 >
+ set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > inline
+ unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 >
diff --git a/doc/html/a00394.html b/doc/html/a00394.html
index 99eeb1828a..1df1b2b500 100644
--- a/doc/html/a00394.html
+++ b/doc/html/a00394.html
@@ -33,57 +33,23 @@
-
This is the complete list of members for tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > , including all inherited members.
- allocator_type typedeftbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- begin ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- begin () const tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- clear ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- combine (combine_func_t f_combine) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- combine_each (combine_func_t f_combine) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- const_iterator typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- const_pointer typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- const_range_type typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- const_reference typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- difference_type typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- empty () const tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- end ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- end () const tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- enumerable_thread_specific (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > friend
- enumerable_thread_specific ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- enumerable_thread_specific (Finit finit)tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- enumerable_thread_specific (const T &exemplar)tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- enumerable_thread_specific (T &&exemplar) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- enumerable_thread_specific (P1 &&arg1, P &&...args)tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- enumerable_thread_specific (const enumerable_thread_specific &other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- enumerable_thread_specific (const enumerable_thread_specific< T, Alloc, Cachetype > &other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- enumerable_thread_specific (enumerable_thread_specific &&other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- enumerable_thread_specific (enumerable_thread_specific< T, Alloc, Cachetype > &&other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- iterator typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- local ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- local (bool &exists)tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- operator= (const enumerable_thread_specific &other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- operator= (const enumerable_thread_specific< T, Alloc, Cachetype > &other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- operator= (enumerable_thread_specific &&other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- operator= (enumerable_thread_specific< T, Alloc, Cachetype > &&other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- pointer typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- range (size_t grainsize=1)tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- range (size_t grainsize=1) const tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- range_type typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- reference typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- size () const tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
- size_type typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- value_type typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
- ~enumerable_thread_specific ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > inline
+ indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > inline
+ InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >
+ output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >
+ set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > inline
+ unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >
diff --git a/doc/html/a00395.html b/doc/html/a00395.html
index 9122011429..44ef48aa7f 100644
--- a/doc/html/a00395.html
+++ b/doc/html/a00395.html
@@ -33,34 +33,23 @@
-
This is the complete list of members for tbb::interface6::flattened2d< Container > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > , including all inherited members.
- allocator_type typedef (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container >
- begin () (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container > inline
- begin () const (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container > inline
- const_iterator typedef (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container >
- const_pointer typedef (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container >
- const_reference typedef (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container >
- difference_type typedef (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container >
- end () (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container > inline
- end () const (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container > inline
- flattened2d (const Container &c, typename Container::const_iterator b, typename Container::const_iterator e) (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container > inline
- flattened2d (const Container &c) (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container > inline
- iterator typedef (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container >
- pointer typedef (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container >
- reference typedef (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container >
- size () const (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container > inline
- size_type typedeftbb::interface6::flattened2d< Container >
- value_type typedef (defined in tbb::interface6::flattened2d< Container > )tbb::interface6::flattened2d< Container >
+ indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > inline
+ indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > inline
+ InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
+ output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
+ set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > inline
+ unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
diff --git a/doc/html/a00396.html b/doc/html/a00396.html
index ab1a37cb5d..6b85a4b599 100644
--- a/doc/html/a00396.html
+++ b/doc/html/a00396.html
@@ -33,41 +33,23 @@
-
This is the complete list of members for tbb::interface6::memory_pool_allocator< T, P > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > , including all inherited members.
- address (reference x) const (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
- address (const_reference x) const (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
- allocate (size_type n, const void *=0)tbb::interface6::memory_pool_allocator< T, P > inline
- const_pointer typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
- const_reference typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
- construct (U *p, Args &&...args)tbb::interface6::memory_pool_allocator< T, P > inline
- construct (pointer p, value_type &&value) (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
- construct (pointer p, const value_type &value) (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
- deallocate (pointer p, size_type)tbb::interface6::memory_pool_allocator< T, P > inline
- destroy (pointer p)tbb::interface6::memory_pool_allocator< T, P > inline
- difference_type typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
- max_size () const tbb::interface6::memory_pool_allocator< T, P > inline
- memory_pool_allocator (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > friend
- memory_pool_allocator (pool_type &pool) (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
- memory_pool_allocator (const memory_pool_allocator &src) (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
- memory_pool_allocator (const memory_pool_allocator< U, P > &src) (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
- my_pool (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > protected
- operator!= (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > friend
- operator== (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > friend
- pointer typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
- pool_type typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > protected
- reference typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
- size_type typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
- value_type typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
+ indexer_node (graph &g) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > inline
+ indexer_node (const indexer_node &other) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > inline
+ InputTuple typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
+ output_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
+ set_name (const char *name) (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > inline
+ unfolded_type typedef (defined in tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > )tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
diff --git a/doc/html/a00397.html b/doc/html/a00397.html
index 54797ef1c1..2f761c1757 100644
--- a/doc/html/a00397.html
+++ b/doc/html/a00397.html
@@ -33,18 +33,37 @@
-
This is the complete list of members for tbb::interface6::memory_pool_allocator< T, P >::rebind< U > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > , including all inherited members.
- other typedef (defined in tbb::interface6::memory_pool_allocator< T, P >::rebind< U > )tbb::interface6::memory_pool_allocator< T, P >::rebind< U >
+ add_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
+ add_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
+ add_visible_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
+ add_visible_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
+ composite_node (graph &g, const char *type_name="composite_node") (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
+ composite_node (graph &g) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
+ extract () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline virtual
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_ports () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
+ input_ports_type typedef (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_ports () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
+ output_ports_type typedef (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ reset_node (reset_flags) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline protected virtual
+ set_external_ports (T1 &&input_ports_tuple, T2 &&output_ports_tuple) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline
+ set_name (const char *name) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline virtual
+ ~composite_node () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
diff --git a/doc/html/a00398.html b/doc/html/a00398.html
index 0ae696ed12..547b157bba 100644
--- a/doc/html/a00398.html
+++ b/doc/html/a00398.html
@@ -33,28 +33,35 @@
-
This is the complete list of members for tbb::interface6::memory_pool_allocator< void, P > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > , including all inherited members.
- const_pointer typedef (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P >
- memory_pool_allocator (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > friend
- memory_pool_allocator (pool_type &pool) (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > inline
- memory_pool_allocator (const memory_pool_allocator &src) (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > inline
- memory_pool_allocator (const memory_pool_allocator< U, P > &src) (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > inline
- my_pool (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > protected
- operator!= (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > friend
- operator== (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > friend
- pointer typedef (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P >
- pool_type typedef (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P >
- value_type typedef (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P >
+ add_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
+ add_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
+ add_visible_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
+ add_visible_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
+ composite_node (graph &g, const char *type_name="composite_node") (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
+ composite_node (graph &g) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
+ extract () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline virtual
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_ports () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
+ input_ports_type typedef (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> >
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ reset_node (reset_flags) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline protected virtual
+ set_external_ports (T &&input_ports_tuple) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline
+ set_name (const char *name) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline virtual
+ ~composite_node () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > )tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
diff --git a/doc/html/a00399.html b/doc/html/a00399.html
index 3f7b71f658..fb4d92648d 100644
--- a/doc/html/a00399.html
+++ b/doc/html/a00399.html
@@ -33,18 +33,35 @@
-
This is the complete list of members for tbb::interface6::memory_pool_allocator< void, P >::rebind< U > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > , including all inherited members.
- other typedef (defined in tbb::interface6::memory_pool_allocator< void, P >::rebind< U > )tbb::interface6::memory_pool_allocator< void, P >::rebind< U >
+ add_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
+ add_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
+ add_visible_nodes (const NodeTypes &...n) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
+ add_visible_nodes (Nodes &...) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
+ composite_node (graph &g, const char *type_name="composite_node") (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
+ composite_node (graph &g) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
+ extract () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline virtual
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_ports () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
+ output_ports_type typedef (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ reset_node (reset_flags) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline protected virtual
+ set_external_ports (T &&output_ports_tuple) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline
+ set_name (const char *name) (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline virtual
+ ~composite_node () (defined in tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > )tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
diff --git a/doc/html/a00400.html b/doc/html/a00400.html
index 3afa403775..6b9f7cee14 100644
--- a/doc/html/a00400.html
+++ b/doc/html/a00400.html
@@ -33,19 +33,65 @@
-
This is the complete list of members for tbb::interface6::memory_pool< Alloc > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > , including all inherited members.
- memory_pool (const Alloc &src=Alloc())tbb::interface6::memory_pool< Alloc >
- ~memory_pool ()tbb::interface6::memory_pool< Alloc > inline
+ async_commit ()tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline virtual
+ async_gateway () (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline
+ async_gateway_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+ async_node (graph &g, size_t concurrency, Body body) (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline
+ async_node (const async_node &other) (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline
+ async_reserve ()tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline virtual
+ async_try_put (const output_type &i)tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline virtual
+ base_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > protected
+ built_successors () (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline virtual
+ built_successors_type typedeftbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+ copy_function_object () (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline
+ copy_successors (successor_list_type &l) (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline virtual
+ extract () (defined in tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > inline virtual
+ fInput_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator >
+ graph_node (graph &g) (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline
+ input_queue_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator >
+ input_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+ internal_add_built_successor (successor_type &r) (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline
+ internal_add_built_successor (successor_type &)=0 (defined in tbb::flow::interface8::sender< Output > )tbb::flow::interface8::sender< Output > pure virtual
+ internal_delete_built_successor (successor_type &r) (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline
+ internal_delete_built_successor (successor_type &)=0 (defined in tbb::flow::interface8::sender< Output > )tbb::flow::interface8::sender< Output > pure virtual
+ mfn_input_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > protected
+ multifunction_node (graph &g, size_t concurrency, Body body) (defined in tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > inline
+ multifunction_node (const multifunction_node &other) (defined in tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > inline
+ my_graph (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ N (defined in tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > protected static
+ next (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ output_ports_type typedef (defined in tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator > )tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator >
+ output_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+ predecessor_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+ prev (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node protected
+ register_successor (successor_type &r)tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline
+ sender< Output >::register_successor (successor_type &r)=0tbb::flow::interface8::sender< Output > pure virtual
+ remove_successor (successor_type &r)tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline
+ sender< Output >::remove_successor (successor_type &r)=0tbb::flow::interface8::sender< Output > pure virtual
+ reset_node (reset_flags f) (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline protected virtual
+ set_name (const char *name) (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline virtual
+ successor_count () (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline virtual
+ successor_list_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+ successor_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+ try_consume ()tbb::flow::interface8::sender< Output > inline virtual
+ try_get (Output &)tbb::flow::interface8::sender< Output > inline virtual
+ try_release ()tbb::flow::interface8::sender< Output > inline virtual
+ try_reserve (Output &)tbb::flow::interface8::sender< Output > inline virtual
+ ~async_gateway () (defined in tbb::flow::interface8::internal::async_gateway< Output > )tbb::flow::interface8::internal::async_gateway< Output > inline virtual
+ ~async_node () (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > inline virtual
+ ~graph_node () (defined in tbb::flow::interface8::graph_node )tbb::flow::interface8::graph_node inline virtual
+ ~sender () (defined in tbb::flow::interface8::sender< Output > )tbb::flow::interface8::sender< Output > inline virtual
diff --git a/doc/html/a00401.html b/doc/html/a00401.html
index 6ee01232f3..71fe18270d 100644
--- a/doc/html/a00401.html
+++ b/doc/html/a00401.html
@@ -33,19 +33,23 @@
-
This is the complete list of members for tbb::interface6::fixed_pool , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor , including all inherited members.
- fixed_pool (void *buf, size_t size)tbb::interface6::fixed_pool inline
- ~fixed_pool ()tbb::interface6::fixed_pool inline
+ operator() () (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor inline
+ output_port_type typedef (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor
+ port (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor
+ result (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor
+ try_put_functor (output_port_type &p, const Output &v) (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor inline
+ value (defined in tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor )tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor
diff --git a/doc/html/a00402.html b/doc/html/a00402.html
index 7e97ac3e9e..31c5e9b741 100644
--- a/doc/html/a00402.html
+++ b/doc/html/a00402.html
@@ -33,19 +33,35 @@
-
This is the complete list of members for tbb::interface6::flow_control , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::opencl_buffer_impl< Factory > , including all inherited members.
diff --git a/doc/html/a00403.html b/doc/html/a00403.html
index bcae87d843..777a5c62d9 100644
--- a/doc/html/a00403.html
+++ b/doc/html/a00403.html
@@ -33,26 +33,52 @@
-
This is the complete list of members for tbb::interface6::filter_t< T, U > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::opencl_graph , including all inherited members.
- clear () (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
- filter_t () (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
- filter_t (const filter_t< T, U > &rhs) (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
- filter_t (tbb::filter::mode mode, const Body &body) (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
- internal::pipeline_proxy (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > friend
- make_filter (tbb::filter::mode, const Body &)tbb::interface6::filter_t< T, U > friend
- operator& (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > friend
- operator= (const filter_t< T, U > &rhs) (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
- ~filter_t () (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
+ add_task_to_reset_list (task *tp) (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ available_devices ()tbb::flow::interface8::opencl_graph
+ begin ()tbb::flow::interface8::graph inline
+ begin () const tbb::flow::interface8::graph inline
+ cbegin () const tbb::flow::interface8::graph inline
+ cend () const tbb::flow::interface8::graph inline
+ const_iterator typedef (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph
+ decrement_wait_count ()tbb::flow::interface8::graph inline
+ end ()tbb::flow::interface8::graph inline
+ end () const tbb::flow::interface8::graph inline
+ exception_thrown () (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ get_opencl_foundation () (defined in tbb::flow::interface8::opencl_graph )tbb::flow::interface8::opencl_graph protected
+ graph ()tbb::flow::interface8::graph inline
+ graph (task_group_context &use_this_context)tbb::flow::interface8::graph inline explicit
+ increment_wait_count ()tbb::flow::interface8::graph inline
+ is_active () (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ is_cancelled ()tbb::flow::interface8::graph inline
+ iterator typedef (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph
+ my_opencl_foundation (defined in tbb::flow::interface8::opencl_graph )tbb::flow::interface8::opencl_graph protected
+ opencl_buffer (defined in tbb::flow::interface8::opencl_graph )tbb::flow::interface8::opencl_graph friend
+ opencl_factory (defined in tbb::flow::interface8::opencl_graph )tbb::flow::interface8::opencl_graph friend
+ opencl_factory () (defined in tbb::flow::interface8::opencl_graph )tbb::flow::interface8::opencl_graph
+ opencl_graph ()tbb::flow::interface8::opencl_graph inline
+ opencl_graph (task_group_context &context)tbb::flow::interface8::opencl_graph inline explicit
+ opencl_image2d (defined in tbb::flow::interface8::opencl_graph )tbb::flow::interface8::opencl_graph friend
+ opencl_node (defined in tbb::flow::interface8::opencl_graph )tbb::flow::interface8::opencl_graph friend
+ reset (reset_flags f=rf_reset_protocol) (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ root_task ()tbb::flow::interface8::graph inline
+ run (Receiver &r, Body body)tbb::flow::interface8::graph inline
+ run (Body body)tbb::flow::interface8::graph inline
+ set_active (bool a=true) (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ set_name (const char *name) (defined in tbb::flow::interface8::graph )tbb::flow::interface8::graph inline
+ wait_for_all ()tbb::flow::interface8::graph inline
+ ~graph ()tbb::flow::interface8::graph inline
+ ~opencl_graph ()tbb::flow::interface8::opencl_graph
diff --git a/doc/html/a00404.html b/doc/html/a00404.html
index 39eaa5364c..930754e832 100644
--- a/doc/html/a00404.html
+++ b/doc/html/a00404.html
@@ -33,33 +33,35 @@
-
This is the complete list of members for tbb::interface6::runtime_loader , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::dependency_msg< T, Factory > , including all inherited members.
- ec_bad_arg enum valuetbb::interface6::runtime_loader
- ec_bad_call enum valuetbb::interface6::runtime_loader
- ec_bad_lib enum valuetbb::interface6::runtime_loader
- ec_bad_ver enum valuetbb::interface6::runtime_loader
- ec_no_lib enum valuetbb::interface6::runtime_loader
- ec_ok enum valuetbb::interface6::runtime_loader
- em_abort enum valuetbb::interface6::runtime_loader
- em_status enum valuetbb::interface6::runtime_loader
- em_throw enum valuetbb::interface6::runtime_loader
- error_code enum nametbb::interface6::runtime_loader
- error_mode enum nametbb::interface6::runtime_loader
- load (char const *path[], int min_ver=TBB_INTERFACE_VERSION, int max_ver=INT_MAX)tbb::interface6::runtime_loader
- runtime_loader (error_mode mode=em_abort)tbb::interface6::runtime_loader
- runtime_loader (char const *path[], int min_ver=TBB_INTERFACE_VERSION, int max_ver=INT_MAX, error_mode mode=em_abort)tbb::interface6::runtime_loader
- status ()tbb::interface6::runtime_loader
- ~runtime_loader ()tbb::interface6::runtime_loader
+ clear_event () const (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ data (bool wait=true) (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ data (bool wait=true) const (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ dependency_msg ()=default (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory >
+ dependency_msg (const T &data) (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline explicit
+ dependency_msg (opencl_graph &g, const T &data) (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ dependency_msg (const T &data, cl_event event) (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ dependency_msg (const dependency_msg &dmsg) (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ dependency_msg (dependency_msg &&dmsg) (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ get_event () const (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ operator const T & () const (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ operator T & () (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ operator= (const dependency_msg &dmsg) (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ register_callback (Callback c) const (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ set_event (cl_event e) const (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ set_graph (graph &g) (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
+ value_type typedef (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory >
+ ~dependency_msg () (defined in tbb::flow::interface8::dependency_msg< T, Factory > )tbb::flow::interface8::dependency_msg< T, Factory > inline
diff --git a/doc/html/a00405.html b/doc/html/a00405.html
index b90c326270..43686e69ac 100644
--- a/doc/html/a00405.html
+++ b/doc/html/a00405.html
@@ -33,32 +33,28 @@
-
This is the complete list of members for tbb::interface6::task_scheduler_observer , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::proxy_dependency_receiver< T, Factory > , including all inherited members.
- allow_sleep enum value (defined in tbb::interface6::task_scheduler_observer )tbb::interface6::task_scheduler_observer
- internal::observer_list (defined in tbb::interface6::task_scheduler_observer )tbb::interface6::task_scheduler_observer friend
- internal::observer_proxy (defined in tbb::interface6::task_scheduler_observer )tbb::interface6::task_scheduler_observer friend
- internal::task_scheduler_observer_v3 (defined in tbb::interface6::task_scheduler_observer )tbb::interface6::task_scheduler_observer friend
- is_observing () const tbb::internal::task_scheduler_observer_v3 inline
- keep_awake enum value (defined in tbb::interface6::task_scheduler_observer )tbb::interface6::task_scheduler_observer
- may_sleep ()tbb::interface6::task_scheduler_observer inline virtual
- observe (bool state=true)tbb::interface6::task_scheduler_observer inline
- on_scheduler_entry (bool)tbb::internal::task_scheduler_observer_v3 inline virtual
- on_scheduler_exit (bool)tbb::internal::task_scheduler_observer_v3 inline virtual
- task_scheduler_observer (bool local=false)tbb::interface6::task_scheduler_observer inline
- task_scheduler_observer (task_arena &a)tbb::interface6::task_scheduler_observer inline
- task_scheduler_observer_v3 ()tbb::internal::task_scheduler_observer_v3 inline
- ~task_scheduler_observer ()tbb::interface6::task_scheduler_observer inline virtual
- ~task_scheduler_observer_v3 ()tbb::internal::task_scheduler_observer_v3 inline virtual
+ dependency_predecessor_type typedef (defined in tbb::flow::interface8::proxy_dependency_receiver< T, Factory > )tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
+ is_continue_receiver () (defined in tbb::flow::interface8::proxy_dependency_receiver< T, Factory > )tbb::flow::interface8::proxy_dependency_receiver< T, Factory > inline protected virtual
+ ordinary_receiver () (defined in tbb::flow::interface8::receiver< dependency_msg< T, Factory > > )tbb::flow::interface8::receiver< dependency_msg< T, Factory > > inline
+ proxy typedef (defined in tbb::flow::interface8::receiver< dependency_msg< T, Factory > > )tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+ proxy_dependency_receiver (receiver< T > &r) (defined in tbb::flow::interface8::proxy_dependency_receiver< T, Factory > )tbb::flow::interface8::proxy_dependency_receiver< T, Factory > inline
+ receiver () (defined in tbb::flow::interface8::receiver< dependency_msg< T, Factory > > )tbb::flow::interface8::receiver< dependency_msg< T, Factory > > inline
+ register_predecessor (dependency_predecessor_type &s)tbb::flow::interface8::proxy_dependency_receiver< T, Factory > inline virtual
+ remove_predecessor (dependency_predecessor_type &s)tbb::flow::interface8::proxy_dependency_receiver< T, Factory > inline virtual
+ reset_receiver (reset_flags f=rf_reset_protocol)tbb::flow::interface8::proxy_dependency_receiver< T, Factory > inline protected virtual
+ try_put (const T &t)tbb::flow::interface8::receiver< dependency_msg< T, Factory > > inline
+ try_put_task (const dependency_msg< T, Factory > &d)tbb::flow::interface8::proxy_dependency_receiver< T, Factory > inline virtual
diff --git a/doc/html/a00406.html b/doc/html/a00406.html
index 065fe094b9..7dd335d423 100644
--- a/doc/html/a00406.html
+++ b/doc/html/a00406.html
@@ -33,28 +33,27 @@
-
This is the complete list of members for tbb::interface6::internal::basic_operation_base , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::receiver< dependency_msg< T, Factory > > , including all inherited members.
- agg_finished enum value (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation
- agg_waiting enum value (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation
- aggregator_operation () (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation inline
- aggregator_operation_status enum name (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation
- basic_handler (defined in tbb::interface6::internal::basic_operation_base )tbb::interface6::internal::basic_operation_base friend
- basic_operation_base () (defined in tbb::interface6::internal::basic_operation_base )tbb::interface6::internal::basic_operation_base inline
- finish ()tbb::interface6::aggregator_operation inline
- next () (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation inline
- set_next (aggregator_operation *n) (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation inline
- start ()tbb::interface6::aggregator_operation inline
- ~basic_operation_base () (defined in tbb::interface6::internal::basic_operation_base )tbb::interface6::internal::basic_operation_base inline virtual
+ dependency_predecessor_type typedeftbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+ is_continue_receiver () (defined in tbb::flow::interface8::receiver< dependency_msg< T, Factory > > )tbb::flow::interface8::receiver< dependency_msg< T, Factory > > inline protected virtual
+ ordinary_receiver () (defined in tbb::flow::interface8::receiver< dependency_msg< T, Factory > > )tbb::flow::interface8::receiver< dependency_msg< T, Factory > > inline
+ proxy typedef (defined in tbb::flow::interface8::receiver< dependency_msg< T, Factory > > )tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+ receiver () (defined in tbb::flow::interface8::receiver< dependency_msg< T, Factory > > )tbb::flow::interface8::receiver< dependency_msg< T, Factory > > inline
+ register_predecessor (dependency_predecessor_type &)tbb::flow::interface8::receiver< dependency_msg< T, Factory > > inline virtual
+ remove_predecessor (dependency_predecessor_type &)tbb::flow::interface8::receiver< dependency_msg< T, Factory > > inline virtual
+ reset_receiver (reset_flags f=rf_reset_protocol)=0tbb::flow::interface8::receiver< dependency_msg< T, Factory > > protected pure virtual
+ try_put (const T &t)tbb::flow::interface8::receiver< dependency_msg< T, Factory > > inline
+ try_put_task (const dependency_msg< T, Factory > &)=0tbb::flow::interface8::receiver< dependency_msg< T, Factory > > pure virtual
diff --git a/doc/html/a00407.html b/doc/html/a00407.html
index 60b348da28..9510c434d1 100644
--- a/doc/html/a00407.html
+++ b/doc/html/a00407.html
@@ -33,28 +33,29 @@
-
This is the complete list of members for tbb::interface6::internal::basic_operation< Body > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::proxy_dependency_sender< T, Factory > , including all inherited members.
- agg_finished enum value (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation
- agg_waiting enum value (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation
- aggregator_operation () (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation inline
- aggregator_operation_status enum name (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation
- basic_operation (const Body &b) (defined in tbb::interface6::internal::basic_operation< Body > )tbb::interface6::internal::basic_operation< Body > inline
- basic_operation_base () (defined in tbb::interface6::internal::basic_operation_base )tbb::interface6::internal::basic_operation_base inline
- finish ()tbb::interface6::aggregator_operation inline
- next () (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation inline
- set_next (aggregator_operation *n) (defined in tbb::interface6::aggregator_operation )tbb::interface6::aggregator_operation inline
- start ()tbb::interface6::aggregator_operation inline
- ~basic_operation_base () (defined in tbb::interface6::internal::basic_operation_base )tbb::interface6::internal::basic_operation_base inline virtual
+ dependency_successor_type typedef (defined in tbb::flow::interface8::proxy_dependency_sender< T, Factory > )tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+ has_host_successors () (defined in tbb::flow::interface8::sender< dependency_msg< T, Factory > > )tbb::flow::interface8::sender< dependency_msg< T, Factory > > inline
+ ordinary_sender () (defined in tbb::flow::interface8::sender< dependency_msg< T, Factory > > )tbb::flow::interface8::sender< dependency_msg< T, Factory > > inline
+ proxy typedef (defined in tbb::flow::interface8::sender< dependency_msg< T, Factory > > )tbb::flow::interface8::sender< dependency_msg< T, Factory > >
+ proxy_dependency_sender (sender< T > &s) (defined in tbb::flow::interface8::proxy_dependency_sender< T, Factory > )tbb::flow::interface8::proxy_dependency_sender< T, Factory > inline
+ register_successor (dependency_successor_type &r)tbb::flow::interface8::proxy_dependency_sender< T, Factory > inline virtual
+ remove_successor (dependency_successor_type &r)tbb::flow::interface8::proxy_dependency_sender< T, Factory > inline virtual
+ sender () (defined in tbb::flow::interface8::sender< dependency_msg< T, Factory > > )tbb::flow::interface8::sender< dependency_msg< T, Factory > > inline
+ try_consume ()tbb::flow::interface8::proxy_dependency_sender< T, Factory > inline
+ try_get (dependency_msg< T, Factory > &d)tbb::flow::interface8::proxy_dependency_sender< T, Factory > inline virtual
+ try_release ()tbb::flow::interface8::proxy_dependency_sender< T, Factory > inline
+ try_reserve (dependency_msg< T, Factory > &d)tbb::flow::interface8::proxy_dependency_sender< T, Factory > inline virtual
diff --git a/doc/html/a00408.html b/doc/html/a00408.html
index 630512ac43..f01d078cc9 100644
--- a/doc/html/a00408.html
+++ b/doc/html/a00408.html
@@ -33,19 +33,26 @@
-
This is the complete list of members for tbb::interface6::internal::basic_handler , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::sender< dependency_msg< T, Factory > > , including all inherited members.
- basic_handler () (defined in tbb::interface6::internal::basic_handler )tbb::interface6::internal::basic_handler inline
- operator() (aggregator_operation *op_list) const (defined in tbb::interface6::internal::basic_handler )tbb::interface6::internal::basic_handler inline
+ dependency_successor_type typedeftbb::flow::interface8::sender< dependency_msg< T, Factory > >
+ has_host_successors () (defined in tbb::flow::interface8::sender< dependency_msg< T, Factory > > )tbb::flow::interface8::sender< dependency_msg< T, Factory > > inline
+ ordinary_sender () (defined in tbb::flow::interface8::sender< dependency_msg< T, Factory > > )tbb::flow::interface8::sender< dependency_msg< T, Factory > > inline
+ proxy typedef (defined in tbb::flow::interface8::sender< dependency_msg< T, Factory > > )tbb::flow::interface8::sender< dependency_msg< T, Factory > >
+ register_successor (dependency_successor_type &r)=0tbb::flow::interface8::sender< dependency_msg< T, Factory > > pure virtual
+ remove_successor (dependency_successor_type &r)=0tbb::flow::interface8::sender< dependency_msg< T, Factory > > pure virtual
+ sender () (defined in tbb::flow::interface8::sender< dependency_msg< T, Factory > > )tbb::flow::interface8::sender< dependency_msg< T, Factory > > inline
+ try_get (dependency_msg< T, Factory > &)tbb::flow::interface8::sender< dependency_msg< T, Factory > > inline virtual
+ try_reserve (dependency_msg< T, Factory > &)tbb::flow::interface8::sender< dependency_msg< T, Factory > > inline virtual
diff --git a/doc/html/a00409.html b/doc/html/a00409.html
index 96d5ff01fe..155adb75fe 100644
--- a/doc/html/a00409.html
+++ b/doc/html/a00409.html
@@ -33,31 +33,48 @@
-
This is the complete list of members for tbb::interface7::task_arena , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::opencl_device , including all inherited members.
diff --git a/doc/html/a00410.html b/doc/html/a00410.html
index fb189c11b8..90eaf5690c 100644
--- a/doc/html/a00410.html
+++ b/doc/html/a00410.html
@@ -33,24 +33,30 @@
-
This is the complete list of members for tbb::interface9::global_control , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::opencl_device_list , including all inherited members.
diff --git a/doc/html/a00411.html b/doc/html/a00411.html
index 41b633e442..28bc8851b8 100644
--- a/doc/html/a00411.html
+++ b/doc/html/a00411.html
@@ -33,26 +33,19 @@
-
This is the complete list of members for tbb::internal::critical_section_v4 , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::callback_base , including all inherited members.
diff --git a/doc/html/a00412.html b/doc/html/a00412.html
index c0b923b882..6355659b83 100644
--- a/doc/html/a00412.html
+++ b/doc/html/a00412.html
@@ -33,19 +33,21 @@
-
This is the complete list of members for tbb::internal::critical_section_v4::scoped_lock , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::callback< Callback, T > , including all inherited members.
diff --git a/doc/html/a00413.html b/doc/html/a00413.html
index a16734bddd..3cfbe83ea6 100644
--- a/doc/html/a00413.html
+++ b/doc/html/a00413.html
@@ -33,18 +33,32 @@
-
This is the complete list of members for tbb::internal::task_handle_task< F > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::opencl_memory< Factory > , including all inherited members.
diff --git a/doc/html/a00414.html b/doc/html/a00414.html
index 64f6de5143..9c30cdb217 100644
--- a/doc/html/a00414.html
+++ b/doc/html/a00414.html
@@ -33,28 +33,36 @@
-
This is the complete list of members for tbb::internal::task_group_base , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::opencl_buffer< T, Factory > , including all inherited members.
- cancel () (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
- internal_run (F &f) (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline protected
- internal_run_and_wait (F &f) (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline protected
- is_canceling () (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
- my_context (defined in tbb::internal::task_group_base )tbb::internal::task_group_base protected
- my_root (defined in tbb::internal::task_group_base )tbb::internal::task_group_base protected
- owner () (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline protected
- run (task_handle< F > &h) (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
- task_group_base (uintptr_t traits=0) (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
- wait () (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
- ~task_group_base () __TBB_NOEXCEPT(false) (defined in tbb::internal::task_group_base )tbb::internal::task_group_base inline
+ access () const (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ begin () const (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ data () const (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ end () const (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ iterator typedef (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory >
+ memory_object () const (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ memory_object_type typedef (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory >
+ native_object () const (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ native_object_type typedef (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory >
+ opencl_buffer () (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ opencl_buffer (opencl_graph &g, size_t size) (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory >
+ opencl_buffer (Factory &f, size_t size) (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ opencl_factory (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > friend
+ opencl_factory_type typedef (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory >
+ operator== (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > friend
+ operator[] (ptrdiff_t k) (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ receive (const dependency_msg< opencl_buffer, Factory > &dependency) const (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ send (opencl_device device, dependency_msg< opencl_buffer, Factory > &dependency) const (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
+ size () const (defined in tbb::flow::interface8::opencl_buffer< T, Factory > )tbb::flow::interface8::opencl_buffer< T, Factory > inline
diff --git a/doc/html/a00415.html b/doc/html/a00415.html
index b265164006..d7ef0dcae5 100644
--- a/doc/html/a00415.html
+++ b/doc/html/a00415.html
@@ -33,26 +33,24 @@
-
This is the complete list of members for tbb::internal::task_scheduler_observer_v3 , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::opencl_factory< DeviceFilter > , including all inherited members.
diff --git a/doc/html/a00416.html b/doc/html/a00416.html
index cae00c4071..412c9ec812 100644
--- a/doc/html/a00416.html
+++ b/doc/html/a00416.html
@@ -33,22 +33,18 @@
-
This is the complete list of members for tbb::internal::tbb_exception_ptr , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::default_opencl_factory_device_filter , including all inherited members.
diff --git a/doc/html/a00417.html b/doc/html/a00417.html
index 32b58013a6..c6ee99fb8c 100644
--- a/doc/html/a00417.html
+++ b/doc/html/a00417.html
@@ -33,19 +33,21 @@
-
This is the complete list of members for tbb::internal::thread_closure_base , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::default_opencl_factory , including all inherited members.
diff --git a/doc/html/a00418.html b/doc/html/a00418.html
index 6777f60916..1d454492ca 100644
--- a/doc/html/a00418.html
+++ b/doc/html/a00418.html
@@ -33,22 +33,21 @@
-
This is the complete list of members for tbb::internal::thread_closure_0< F > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::opencl_foundation , including all inherited members.
diff --git a/doc/html/a00419.html b/doc/html/a00419.html
index 52a4e83cd5..3d9864af75 100644
--- a/doc/html/a00419.html
+++ b/doc/html/a00419.html
@@ -33,23 +33,22 @@
-
This is the complete list of members for tbb::internal::thread_closure_1< F, X > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::opencl_program< Factory > , including all inherited members.
diff --git a/doc/html/a00420.html b/doc/html/a00420.html
index 7e69b3606c..c57ecbaf0e 100644
--- a/doc/html/a00420.html
+++ b/doc/html/a00420.html
@@ -33,24 +33,18 @@
-
This is the complete list of members for tbb::internal::thread_closure_2< F, X, Y > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::port_ref_impl< N1, N2 > , including all inherited members.
- arg1 (defined in tbb::internal::thread_closure_2< F, X, Y > )tbb::internal::thread_closure_2< F, X, Y >
- arg2 (defined in tbb::internal::thread_closure_2< F, X, Y > )tbb::internal::thread_closure_2< F, X, Y >
- function (defined in tbb::internal::thread_closure_2< F, X, Y > )tbb::internal::thread_closure_2< F, X, Y >
- operator delete (void *ptr) (defined in tbb::internal::thread_closure_base )tbb::internal::thread_closure_base inline
- operator new (size_t size) (defined in tbb::internal::thread_closure_base )tbb::internal::thread_closure_base inline
- start_routine (void *c)tbb::internal::thread_closure_2< F, X, Y > inline static
- thread_closure_2 (const F &f, const X &x, const Y &y) (defined in tbb::internal::thread_closure_2< F, X, Y > )tbb::internal::thread_closure_2< F, X, Y > inline
+ size (defined in tbb::flow::interface8::port_ref_impl< N1, N2 > )tbb::flow::interface8::port_ref_impl< N1, N2 > static
diff --git a/doc/html/a00421.html b/doc/html/a00421.html
index f8050a145d..b9e7495e25 100644
--- a/doc/html/a00421.html
+++ b/doc/html/a00421.html
@@ -33,36 +33,18 @@
-
This is the complete list of members for tbb::internal::tbb_thread_v3 , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::num_arguments< T > , including all inherited members.
diff --git a/doc/html/a00422.html b/doc/html/a00422.html
index cf813a9a4a..e1992ecb9a 100644
--- a/doc/html/a00422.html
+++ b/doc/html/a00422.html
@@ -33,29 +33,18 @@
-
This is the complete list of members for tbb::internal::tbb_thread_v3::id , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::num_arguments< port_ref_impl< N1, N2 >(*)()> , including all inherited members.
diff --git a/doc/html/a00423.html b/doc/html/a00423.html
index 3cb3fe73ce..9ba94aa92d 100644
--- a/doc/html/a00423.html
+++ b/doc/html/a00423.html
@@ -33,44 +33,18 @@
-
This is the complete list of members for tbb::strict_ppl::concurrent_queue< T, A > , including all inherited members.
+
This is the complete list of members for tbb::flow::interface8::num_arguments< port_ref_impl< N1, N2 > > , including all inherited members.
- allocator_type typedeftbb::strict_ppl::concurrent_queue< T, A >
- clear ()tbb::strict_ppl::concurrent_queue< T, A >
- concurrent_queue (const allocator_type &a=allocator_type())tbb::strict_ppl::concurrent_queue< T, A > inline explicit
- concurrent_queue (InputIterator begin, InputIterator end, const allocator_type &a=allocator_type())tbb::strict_ppl::concurrent_queue< T, A > inline
- concurrent_queue (const concurrent_queue &src, const allocator_type &a=allocator_type())tbb::strict_ppl::concurrent_queue< T, A > inline
- concurrent_queue (concurrent_queue &&src)tbb::strict_ppl::concurrent_queue< T, A > inline
- concurrent_queue (concurrent_queue &&src, const allocator_type &a) (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
- const_iterator typedef (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A >
- const_reference typedeftbb::strict_ppl::concurrent_queue< T, A >
- difference_type typedeftbb::strict_ppl::concurrent_queue< T, A >
- emplace (Arguments &&...args) (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
- empty () const tbb::strict_ppl::concurrent_queue< T, A > inline
- get_allocator () const tbb::strict_ppl::concurrent_queue< T, A > inline
- internal::concurrent_queue_iterator (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > friend
- iterator typedef (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A >
- push (const T &source)tbb::strict_ppl::concurrent_queue< T, A > inline
- push (T &&source) (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
- reference typedeftbb::strict_ppl::concurrent_queue< T, A >
- size_type typedeftbb::strict_ppl::concurrent_queue< T, A >
- try_pop (T &result)tbb::strict_ppl::concurrent_queue< T, A > inline
- unsafe_begin () (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
- unsafe_begin () const (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
- unsafe_end () (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
- unsafe_end () const (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
- unsafe_size () const tbb::strict_ppl::concurrent_queue< T, A > inline
- value_type typedeftbb::strict_ppl::concurrent_queue< T, A >
- ~concurrent_queue ()tbb::strict_ppl::concurrent_queue< T, A >
+ value (defined in tbb::flow::interface8::num_arguments< port_ref_impl< N1, N2 > > )tbb::flow::interface8::num_arguments< port_ref_impl< N1, N2 > > static
diff --git a/doc/html/a00424.html b/doc/html/a00424.html
new file mode 100644
index 0000000000..ec86c3d706
--- /dev/null
+++ b/doc/html/a00424.html
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::flow::interface8::key_from_policy< JP > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00425.html b/doc/html/a00425.html
new file mode 100644
index 0000000000..ef8425a4d8
--- /dev/null
+++ b/doc/html/a00425.html
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::flow::interface8::key_from_policy< key_matching< Key > > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00426.html b/doc/html/a00426.html
new file mode 100644
index 0000000000..25779b73a2
--- /dev/null
+++ b/doc/html/a00426.html
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::flow::interface8::key_from_policy< key_matching< Key & > > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00427.html b/doc/html/a00427.html
new file mode 100644
index 0000000000..cfda054d79
--- /dev/null
+++ b/doc/html/a00427.html
@@ -0,0 +1,60 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::flow::interface8::opencl_device_with_key< Key > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00428.html b/doc/html/a00428.html
new file mode 100644
index 0000000000..4f1e95b2e6
--- /dev/null
+++ b/doc/html/a00428.html
@@ -0,0 +1,69 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > , including all inherited members.
+
+ opencl_node (opencl_graph &g, const opencl_program< Factory > &p, const std::string &kernel_name, DeviceSelector d, Factory &f) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ opencl_node (opencl_graph &g, const opencl_program< Factory > &p, const std::string &kernel_name, Factory &f) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ opencl_node (const opencl_node &node) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ opencl_node (opencl_node &&node) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ reset_node (reset_flags=rf_reset_protocol) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline protected
+ set_args (Args &&...args) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ set_ndranges (std::initializer_list< T > global_work_size) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ set_ndranges (GlobalNDRange &&global_work_size) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ set_ndranges (std::initializer_list< T > global_work_size, LocalNDRange &&local_work_size) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ set_ndranges (std::initializer_list< T1 > global_work_size, std::initializer_list< T2 > local_work_size) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ set_ndranges (GlobalNDRange &&global_work_size, LocalNDRange &&local_work_size) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ set_ndranges (GlobalNDRange &&global_work_size, std::initializer_list< T > local_work_size) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+ ~opencl_node () (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory > inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00429.html b/doc/html/a00429.html
new file mode 100644
index 0000000000..0e96286409
--- /dev/null
+++ b/doc/html/a00429.html
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::flow::interface8::opencl_node< tuple< Ports...>, JP > , including all inherited members.
+
+ opencl_node (opencl_graph &g, const std::string &kernel) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP > inline
+ opencl_node (opencl_graph &g, const opencl_program< default_opencl_factory > &p, const std::string &kernel) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP > inline
+ opencl_node (opencl_graph &g, const opencl_program< default_opencl_factory > &p, const std::string &kernel, DeviceSelector d) (defined in tbb::flow::interface8::opencl_node< tuple< Ports...>, JP > )tbb::flow::interface8::opencl_node< tuple< Ports...>, JP > inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00430.html b/doc/html/a00430.html
new file mode 100644
index 0000000000..5ad70c23d6
--- /dev/null
+++ b/doc/html/a00430.html
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::flow::interface8::opencl_node< tuple< Ports...> > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00431.html b/doc/html/a00431.html
new file mode 100644
index 0000000000..7c4d844f41
--- /dev/null
+++ b/doc/html/a00431.html
@@ -0,0 +1,64 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::flow::interface8::internal::edge_container< C > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00432.html b/doc/html/a00432.html
new file mode 100644
index 0000000000..31cdfc7c80
--- /dev/null
+++ b/doc/html/a00432.html
@@ -0,0 +1,61 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::flow::interface8::internal::async_gateway< Output > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00433.html b/doc/html/a00433.html
new file mode 100644
index 0000000000..2e22bf7203
--- /dev/null
+++ b/doc/html/a00433.html
@@ -0,0 +1,62 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > , including all inherited members.
+
+ async_body (const Body &body, async_gateway_type *gateway) (defined in tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > )tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > inline
+ async_body (const async_body &other) (defined in tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > )tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > inline
+ async_gateway_type typedef (defined in tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > )tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body >
+ get_body () (defined in tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > )tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > inline
+ operator() (const Input &v, Ports &) (defined in tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > )tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > inline
+ set_async_gateway (async_gateway_type *gateway) (defined in tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > )tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body > inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00434.html b/doc/html/a00434.html
new file mode 100644
index 0000000000..4e285cc64e
--- /dev/null
+++ b/doc/html/a00434.html
@@ -0,0 +1,143 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > , including all inherited members.
+
+ accessor_location (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
+ accessor_location (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
+ allocate_node_copy_construct (node_allocator_type &allocator, const Key &key, const T *t) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected static
+ allocate_node_default_construct (node_allocator_type &allocator, const Key &key, const T *) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected static
+ allocate_node_emplace_construct (node_allocator_type &allocator, Args &&...args) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected static
+ allocate_node_move_construct (node_allocator_type &allocator, const Key &key, const T *t) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected static
+ allocator_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ begin () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ begin () const (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ bucket_count () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ clear ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ concurrent_hash_map (const allocator_type &a=allocator_type())tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ concurrent_hash_map (size_type n, const allocator_type &a=allocator_type())tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ concurrent_hash_map (const concurrent_hash_map &table, const allocator_type &a=allocator_type())tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ concurrent_hash_map (concurrent_hash_map &&table)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ concurrent_hash_map (concurrent_hash_map &&table, const allocator_type &a)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ concurrent_hash_map (I first, I last, const allocator_type &a=allocator_type())tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ concurrent_hash_map (std::initializer_list< value_type > il, const allocator_type &a=allocator_type())tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ const_accessor (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
+ const_iterator typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ const_pointer typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ const_range_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ const_reference typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ count (const Key &key) const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ delete_node (node_base *n) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
+ difference_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ do_not_allocate_node (node_allocator_type &, const Key &, const T *) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected static
+ emplace (const_accessor &result, Args &&...args)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ emplace (accessor &result, Args &&...args)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ emplace (Args &&...args)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ empty () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ end () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ end () const (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ equal_range (const Key &key) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ equal_range (const Key &key) const (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ erase (const Key &key)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ erase (const_accessor &item_accessor)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ erase (accessor &item_accessor)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ exclude (const_accessor &item_accessor)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
+ find (const_accessor &result, const Key &key) const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ find (accessor &result, const Key &key)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ generic_emplace (Accessor &&result, Args &&...args) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
+ generic_move_insert (Accessor &&result, value_type &&value) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
+ get_allocator () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ insert (const_accessor &result, const Key &key)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ insert (accessor &result, const Key &key)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ insert (const_accessor &result, const value_type &value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ insert (accessor &result, const value_type &value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ insert (const value_type &value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ insert (const_accessor &result, value_type &&value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ insert (accessor &result, value_type &&value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ insert (value_type &&value)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ insert (I first, I last)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ insert (std::initializer_list< value_type > il)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ internal::hash_map_iterator (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
+ internal::hash_map_range (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
+ internal_copy (const concurrent_hash_map &source)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
+ internal_copy (I first, I last) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
+ internal_equal_range (const Key &key, I end) const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
+ internal_fast_find (const Key &key) const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
+ is_write_access_needed (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
+ is_write_access_needed (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
+ is_write_access_needed (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > friend
+ iterator typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ key_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ lookup (bool op_insert, const Key &key, const T *t, const_accessor *result, bool write, node *(*allocate_node)(node_allocator_type &, const Key &, const T *), node *tmp_n=0)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
+ mapped_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ max_size () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ my_allocator (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
+ my_hash_compare (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
+ node_allocator_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > protected
+ operator= (const concurrent_hash_map &table)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ operator= (concurrent_hash_map &&table)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ operator= (std::initializer_list< value_type > il)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ pointer typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ range (size_type grainsize=1) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ range (size_type grainsize=1) const (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ range_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ reference typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ rehash (size_type n=0)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ rehash_bucket (bucket *b_new, const hashcode_t h) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
+ search_bucket (const key_type &key, bucket *b) const (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline protected
+ size () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+ size_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ swap (concurrent_hash_map &table)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ value_type typedef (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+ ~concurrent_hash_map ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00435.html b/doc/html/a00435.html
new file mode 100644
index 0000000000..ab5c8ba11f
--- /dev/null
+++ b/doc/html/a00435.html
@@ -0,0 +1,66 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor , including all inherited members.
+
+ const_accessor ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+ empty () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+ is_writer () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline protected
+ my_hash (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor protected
+ my_node (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor protected
+ operator* () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor inline
+ operator-> () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor inline
+ release ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+ value_type typedeftbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor
+ ~const_accessor ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00436.html b/doc/html/a00436.html
new file mode 100644
index 0000000000..ecfeae340c
--- /dev/null
+++ b/doc/html/a00436.html
@@ -0,0 +1,57 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00288.html b/doc/html/a00437.html
similarity index 51%
rename from doc/html/a00288.html
rename to doc/html/a00437.html
index 4f199734bd..cfcf8bd42e 100644
--- a/doc/html/a00288.html
+++ b/doc/html/a00437.html
@@ -33,22 +33,21 @@
-
This is the complete list of members for tbb::parallel_while< Body > , including all inherited members.
+
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor , including all inherited members.
- add (const value_type &item)tbb::parallel_while< Body >
- parallel_while ()tbb::parallel_while< Body > inline
- run (Stream &stream, const Body &body)tbb::parallel_while< Body >
- value_type typedeftbb::parallel_while< Body >
- ~parallel_while ()tbb::parallel_while< Body > inline
+ acquire (concurrent_hash_map *base, const hashcode_t h, bool writer=false)tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor inline
+ bucket_accessor (concurrent_hash_map *base, const hashcode_t h, bool writer=false) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor inline
+ is_writer ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor inline
+ operator() ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor inline
diff --git a/doc/html/a00438.html b/doc/html/a00438.html
new file mode 100644
index 0000000000..73e70430da
--- /dev/null
+++ b/doc/html/a00438.html
@@ -0,0 +1,60 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave , including all inherited members.
+
+ call_clear_on_leave (concurrent_hash_map *a_ch_map) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave inline
+ dismiss () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave inline
+ my_ch_map (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave
+ ~call_clear_on_leave () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00439.html b/doc/html/a00439.html
new file mode 100644
index 0000000000..155c8106c3
--- /dev/null
+++ b/doc/html/a00439.html
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor , including all inherited members.
+
+ accessor (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor friend
+ concurrent_hash_map< Key, T, HashCompare, Allocator > (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor friend
+ const_accessor ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+ empty () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+ is_writer () (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline protected
+ my_hash (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor protected
+ my_node (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor protected
+ operator* () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+ operator-> () const tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+ release ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+ value_type typedeftbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+ ~const_accessor ()tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00440.html b/doc/html/a00440.html
new file mode 100644
index 0000000000..712cb4ac4e
--- /dev/null
+++ b/doc/html/a00440.html
@@ -0,0 +1,66 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node , including all inherited members.
+
+ item (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node
+ node (const Key &key) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
+ node (const Key &key, const T &t) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
+ node (const Key &key, T &&t) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
+ node (value_type &&i) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
+ node (Args &&...args) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
+ node (value_type &i) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
+ node (const value_type &i) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
+ operator delete (void *ptr, node_allocator_type &a) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
+ operator new (size_t, node_allocator_type &a) (defined in tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node )tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00441.html b/doc/html/a00441.html
new file mode 100644
index 0000000000..779e920c30
--- /dev/null
+++ b/doc/html/a00441.html
@@ -0,0 +1,84 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_priority_queue< T, Compare, A > , including all inherited members.
+
+ allocator_type typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
+ assign (InputIterator begin, InputIterator end)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ assign (std::initializer_list< T > il)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ clear ()tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ concurrent_priority_queue (const allocator_type &a=allocator_type())tbb::interface5::concurrent_priority_queue< T, Compare, A > inline explicit
+ concurrent_priority_queue (size_type init_capacity, const allocator_type &a=allocator_type())tbb::interface5::concurrent_priority_queue< T, Compare, A > inline explicit
+ concurrent_priority_queue (InputIterator begin, InputIterator end, const allocator_type &a=allocator_type())tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ concurrent_priority_queue (std::initializer_list< T > init_list, const allocator_type &a=allocator_type())tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ concurrent_priority_queue (const concurrent_priority_queue &src)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline explicit
+ concurrent_priority_queue (const concurrent_priority_queue &src, const allocator_type &a)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ concurrent_priority_queue (concurrent_priority_queue &&src)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ concurrent_priority_queue (concurrent_priority_queue &&src, const allocator_type &a)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ const_reference typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
+ difference_type typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
+ emplace (Args &&...args)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ empty () const tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ get_allocator () const tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ operator= (const concurrent_priority_queue &src)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ operator= (concurrent_priority_queue &&src)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ operator= (std::initializer_list< T > il)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ push (const_reference elem)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ push (value_type &&elem)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ reference typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
+ size () const tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ size_type typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
+ swap (concurrent_priority_queue &q)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ try_pop (reference elem)tbb::interface5::concurrent_priority_queue< T, Compare, A > inline
+ value_type typedeftbb::interface5::concurrent_priority_queue< T, Compare, A >
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00442.html b/doc/html/a00442.html
new file mode 100644
index 0000000000..a004576102
--- /dev/null
+++ b/doc/html/a00442.html
@@ -0,0 +1,65 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > , including all inherited members.
+
+ allocator_type typedef (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
+ allow_multimapping enum value (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
+ concurrent_unordered_map_traits () (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > inline protected
+ concurrent_unordered_map_traits (const hash_compare &hc) (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > inline protected
+ get_key (const std::pair< Type1, Type2 > &value) (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > inline protected static
+ hash_compare typedef (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
+ key_type typedef (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
+ my_hash_compare (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
+ value_type typedef (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > protected
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00443.html b/doc/html/a00443.html
new file mode 100644
index 0000000000..6d703188d3
--- /dev/null
+++ b/doc/html/a00443.html
@@ -0,0 +1,60 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare , including all inherited members.
+
+ concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping > (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare friend
+ my_hash_compare (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare protected
+ operator() (const value_type &left, const value_type &right) const (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare inline
+ value_compare (const hash_compare &comparator) (defined in tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare )tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00380.html b/doc/html/a00444.html
similarity index 74%
rename from doc/html/a00380.html
rename to doc/html/a00444.html
index 7788c6a9d0..e5931e39d3 100644
--- a/doc/html/a00380.html
+++ b/doc/html/a00444.html
@@ -33,7 +33,7 @@
-
This is the complete list of members for tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > , including all inherited members.
+
This is the complete list of members for tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > , including all inherited members.
- allocator_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- at (const key_type &key) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- at (const key_type &key) const (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_map (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline explicit
- concurrent_unordered_map (const Allocator &a) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_map (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_map (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_map (const concurrent_unordered_map &table) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_map (concurrent_unordered_map &&table) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_map (const concurrent_unordered_map &table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- concurrent_unordered_map (concurrent_unordered_map &&table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- const_iterator typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- const_local_iterator typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- const_pointer typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- const_reference typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- difference_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- hasher typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- iterator typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- key_compare typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- key_equal typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- key_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- local_iterator typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- mapped_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- operator= (const concurrent_unordered_map &table) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- operator= (concurrent_unordered_map &&table) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- operator[] (const key_type &key) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
- pointer typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- reference typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- size_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
- value_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ allocator_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ at (const key_type &key) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ at (const key_type &key) const (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_map (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline explicit
+ concurrent_unordered_map (const Allocator &a) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_map (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_map (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_map (const concurrent_unordered_map &table) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_map (concurrent_unordered_map &&table) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_map (const concurrent_unordered_map &table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_map (concurrent_unordered_map &&table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ const_iterator typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ const_local_iterator typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ const_pointer typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ const_reference typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ difference_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ hasher typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ iterator typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ key_compare typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ key_equal typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ key_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ local_iterator typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ mapped_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ operator= (const concurrent_unordered_map &table) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ operator= (concurrent_unordered_map &&table) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ operator[] (const key_type &key) (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > inline
+ pointer typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ reference typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ size_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+ value_type typedef (defined in tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
diff --git a/doc/html/a00445.html b/doc/html/a00445.html
new file mode 100644
index 0000000000..62d5db93a5
--- /dev/null
+++ b/doc/html/a00445.html
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > , including all inherited members.
+
+ allocator_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ concurrent_unordered_multimap (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline explicit
+ concurrent_unordered_multimap (const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multimap (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multimap (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type())tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multimap (const concurrent_unordered_multimap &table) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multimap (concurrent_unordered_multimap &&table) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multimap (const concurrent_unordered_multimap &table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multimap (concurrent_unordered_multimap &&table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
+ const_iterator typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ const_local_iterator typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ const_pointer typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ const_reference typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ difference_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ hasher typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ iterator typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ key_compare typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ key_equal typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ key_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ local_iterator typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ mapped_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ operator= (const concurrent_unordered_multimap &table) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
+ operator= (concurrent_unordered_multimap &&table) (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > inline
+ pointer typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ reference typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ size_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+ value_type typedef (defined in tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00446.html b/doc/html/a00446.html
new file mode 100644
index 0000000000..72bdc5e985
--- /dev/null
+++ b/doc/html/a00446.html
@@ -0,0 +1,66 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > , including all inherited members.
+
+ allocator_type typedef (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
+ allow_multimapping enum value (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
+ concurrent_unordered_set_traits () (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > inline protected
+ concurrent_unordered_set_traits (const hash_compare &hc) (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > inline protected
+ get_key (const value_type &value) (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > inline protected static
+ hash_compare typedef (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
+ key_type typedef (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
+ my_hash_compare (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
+ value_compare typedef (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
+ value_type typedef (defined in tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > )tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping > protected
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00447.html b/doc/html/a00447.html
new file mode 100644
index 0000000000..20651efa8d
--- /dev/null
+++ b/doc/html/a00447.html
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > , including all inherited members.
+
+ allocator_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ concurrent_unordered_set (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline explicit
+ concurrent_unordered_set (const Allocator &a) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_set (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_set (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_set (const concurrent_unordered_set &table) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_set (concurrent_unordered_set &&table) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_set (const concurrent_unordered_set &table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_set (concurrent_unordered_set &&table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
+ const_iterator typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ const_local_iterator typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ const_pointer typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ const_reference typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ difference_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ hasher typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ iterator typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ key_compare typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ key_equal typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ key_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ local_iterator typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ mapped_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ operator= (const concurrent_unordered_set &table) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
+ operator= (concurrent_unordered_set &&table) (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > inline
+ pointer typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ reference typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ size_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+ value_type typedef (defined in tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00448.html b/doc/html/a00448.html
new file mode 100644
index 0000000000..59e4b265d8
--- /dev/null
+++ b/doc/html/a00448.html
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > , including all inherited members.
+
+ allocator_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ concurrent_unordered_multiset (size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline explicit
+ concurrent_unordered_multiset (const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multiset (Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &_Hasher=hasher(), const key_equal &_Key_equality=key_equal(), const allocator_type &a=allocator_type()) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multiset (std::initializer_list< value_type > il, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multiset (const concurrent_unordered_multiset &table) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multiset (concurrent_unordered_multiset &&table) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multiset (const concurrent_unordered_multiset &table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
+ concurrent_unordered_multiset (concurrent_unordered_multiset &&table, const Allocator &a) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
+ const_iterator typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ const_local_iterator typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ const_pointer typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ const_reference typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ difference_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ hasher typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ iterator typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ key_compare typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ key_equal typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ key_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ local_iterator typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ mapped_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ operator= (const concurrent_unordered_multiset &table) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
+ operator= (concurrent_unordered_multiset &&table) (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > inline
+ pointer typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ reference typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ size_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+ value_type typedef (defined in tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > )tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00449.html b/doc/html/a00449.html
new file mode 100644
index 0000000000..8b0e0d6e0c
--- /dev/null
+++ b/doc/html/a00449.html
@@ -0,0 +1,70 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::reader_writer_lock , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00450.html b/doc/html/a00450.html
new file mode 100644
index 0000000000..dc5e74b633
--- /dev/null
+++ b/doc/html/a00450.html
@@ -0,0 +1,61 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::reader_writer_lock::scoped_lock , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00282.html b/doc/html/a00451.html
similarity index 50%
rename from doc/html/a00282.html
rename to doc/html/a00451.html
index 2c2c3c50b6..28b3ea8aa3 100644
--- a/doc/html/a00282.html
+++ b/doc/html/a00451.html
@@ -33,23 +33,22 @@
-
This is the complete list of members for tbb::null_mutex::scoped_lock , including all inherited members.
+
This is the complete list of members for tbb::interface5::reader_writer_lock::scoped_lock_read , including all inherited members.
diff --git a/doc/html/a00452.html b/doc/html/a00452.html
new file mode 100644
index 0000000000..845e45342b
--- /dev/null
+++ b/doc/html/a00452.html
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface5::internal::use_element_copy_constructor< T, C > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00265.html b/doc/html/a00453.html
similarity index 71%
rename from doc/html/a00265.html
rename to doc/html/a00453.html
index 9557a579b8..e74459fcc8 100644
--- a/doc/html/a00265.html
+++ b/doc/html/a00453.html
@@ -33,19 +33,18 @@
-
This is the complete list of members for tbb::aligned_space< T, N > , including all inherited members.
+
This is the complete list of members for tbb::interface5::internal::use_element_copy_constructor< T, false > , including all inherited members.
diff --git a/doc/html/a00454.html b/doc/html/a00454.html
new file mode 100644
index 0000000000..d26e934413
--- /dev/null
+++ b/doc/html/a00454.html
@@ -0,0 +1,65 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::aggregator_operation , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00273.html b/doc/html/a00455.html
similarity index 59%
rename from doc/html/a00273.html
rename to doc/html/a00455.html
index e0c5e312f4..678a767c64 100644
--- a/doc/html/a00273.html
+++ b/doc/html/a00455.html
@@ -33,20 +33,20 @@
-
This is the complete list of members for tbb::cache_aligned_allocator< void > , including all inherited members.
+
This is the complete list of members for tbb::interface6::aggregator_ext< handler_type > , including all inherited members.
diff --git a/doc/html/a00456.html b/doc/html/a00456.html
new file mode 100644
index 0000000000..b5c029cf17
--- /dev/null
+++ b/doc/html/a00456.html
@@ -0,0 +1,61 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::aggregator , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00457.html b/doc/html/a00457.html
new file mode 100644
index 0000000000..20a876f0be
--- /dev/null
+++ b/doc/html/a00457.html
@@ -0,0 +1,60 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > , including all inherited members.
+
+ concurrent_lru_cache (value_function_type f, std::size_t number_of_lru_history_items) (defined in tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > )tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > inline
+ handle typedef (defined in tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > )tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type >
+ operator[] (key_type k) (defined in tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > )tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > inline
+ tbb::internal::aggregating_functor< self_type, aggregated_operation_type > (defined in tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > )tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type > friend
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00458.html b/doc/html/a00458.html
new file mode 100644
index 0000000000..bda7e42b68
--- /dev/null
+++ b/doc/html/a00458.html
@@ -0,0 +1,96 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > , including all inherited members.
+
+ allocator_type typedeftbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ begin ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ begin () const tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ clear ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ combine (combine_func_t f_combine) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ combine_each (combine_func_t f_combine) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ const_iterator typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ const_pointer typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ const_range_type typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ const_reference typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ difference_type typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ empty () const tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ end ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ end () const tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ enumerable_thread_specific (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > friend
+ enumerable_thread_specific ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ enumerable_thread_specific (Finit finit)tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ enumerable_thread_specific (const T &exemplar)tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ enumerable_thread_specific (T &&exemplar) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ enumerable_thread_specific (P1 &&arg1, P &&...args)tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ enumerable_thread_specific (const enumerable_thread_specific &other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ enumerable_thread_specific (const enumerable_thread_specific< T, Alloc, Cachetype > &other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ enumerable_thread_specific (enumerable_thread_specific &&other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ enumerable_thread_specific (enumerable_thread_specific< T, Alloc, Cachetype > &&other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ iterator typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ local ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ local (bool &exists)tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ operator= (const enumerable_thread_specific &other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ operator= (const enumerable_thread_specific< T, Alloc, Cachetype > &other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ operator= (enumerable_thread_specific &&other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ operator= (enumerable_thread_specific< T, Alloc, Cachetype > &&other) (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ pointer typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ range (size_t grainsize=1)tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ range (size_t grainsize=1) const tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ range_type typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ reference typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ size () const tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+ size_type typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ value_type typedef (defined in tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > )tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+ ~enumerable_thread_specific ()tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00459.html b/doc/html/a00459.html
new file mode 100644
index 0000000000..ee3ff081fe
--- /dev/null
+++ b/doc/html/a00459.html
@@ -0,0 +1,73 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::flattened2d< Container > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00460.html b/doc/html/a00460.html
new file mode 100644
index 0000000000..bbe5444db8
--- /dev/null
+++ b/doc/html/a00460.html
@@ -0,0 +1,80 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::memory_pool_allocator< T, P > , including all inherited members.
+
+ address (reference x) const (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
+ address (const_reference x) const (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
+ allocate (size_type n, const void *=0)tbb::interface6::memory_pool_allocator< T, P > inline
+ const_pointer typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
+ const_reference typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
+ construct (U *p, Args &&...args)tbb::interface6::memory_pool_allocator< T, P > inline
+ construct (pointer p, value_type &&value) (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
+ construct (pointer p, const value_type &value) (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
+ deallocate (pointer p, size_type)tbb::interface6::memory_pool_allocator< T, P > inline
+ destroy (pointer p)tbb::interface6::memory_pool_allocator< T, P > inline
+ difference_type typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
+ max_size () const tbb::interface6::memory_pool_allocator< T, P > inline
+ memory_pool_allocator (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > friend
+ memory_pool_allocator (pool_type &pool) (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
+ memory_pool_allocator (const memory_pool_allocator &src) (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
+ memory_pool_allocator (const memory_pool_allocator< U, P > &src) (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > inline
+ my_pool (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > protected
+ operator!= (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > friend
+ operator== (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > friend
+ pointer typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
+ pool_type typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P > protected
+ reference typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
+ size_type typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
+ value_type typedef (defined in tbb::interface6::memory_pool_allocator< T, P > )tbb::interface6::memory_pool_allocator< T, P >
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00272.html b/doc/html/a00461.html
similarity index 73%
rename from doc/html/a00272.html
rename to doc/html/a00461.html
index 56fd708d54..472faa6718 100644
--- a/doc/html/a00272.html
+++ b/doc/html/a00461.html
@@ -33,18 +33,18 @@
-
This is the complete list of members for tbb::cache_aligned_allocator< T >::rebind< U > , including all inherited members.
+
This is the complete list of members for tbb::interface6::memory_pool_allocator< T, P >::rebind< U > , including all inherited members.
diff --git a/doc/html/a00462.html b/doc/html/a00462.html
new file mode 100644
index 0000000000..5ea3c4ac46
--- /dev/null
+++ b/doc/html/a00462.html
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::memory_pool_allocator< void, P > , including all inherited members.
+
+ const_pointer typedef (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P >
+ memory_pool_allocator (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > friend
+ memory_pool_allocator (pool_type &pool) (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > inline
+ memory_pool_allocator (const memory_pool_allocator &src) (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > inline
+ memory_pool_allocator (const memory_pool_allocator< U, P > &src) (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > inline
+ my_pool (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > protected
+ operator!= (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > friend
+ operator== (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P > friend
+ pointer typedef (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P >
+ pool_type typedef (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P >
+ value_type typedef (defined in tbb::interface6::memory_pool_allocator< void, P > )tbb::interface6::memory_pool_allocator< void, P >
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00463.html b/doc/html/a00463.html
new file mode 100644
index 0000000000..e270a2a07f
--- /dev/null
+++ b/doc/html/a00463.html
@@ -0,0 +1,57 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::memory_pool_allocator< void, P >::rebind< U > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00464.html b/doc/html/a00464.html
new file mode 100644
index 0000000000..409e547612
--- /dev/null
+++ b/doc/html/a00464.html
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::memory_pool< Alloc > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00465.html b/doc/html/a00465.html
new file mode 100644
index 0000000000..e12d3f4bc7
--- /dev/null
+++ b/doc/html/a00465.html
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::fixed_pool , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00285.html b/doc/html/a00466.html
similarity index 69%
rename from doc/html/a00285.html
rename to doc/html/a00466.html
index 297be21161..01dbb021cd 100644
--- a/doc/html/a00285.html
+++ b/doc/html/a00466.html
@@ -33,19 +33,19 @@
-
This is the complete list of members for tbb::parallel_do_feeder< Item > , including all inherited members.
+
This is the complete list of members for tbb::interface6::flow_control , including all inherited members.
diff --git a/doc/html/a00467.html b/doc/html/a00467.html
new file mode 100644
index 0000000000..06882fdb49
--- /dev/null
+++ b/doc/html/a00467.html
@@ -0,0 +1,65 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::filter_t< T, U > , including all inherited members.
+
+ clear () (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
+ filter_t () (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
+ filter_t (const filter_t< T, U > &rhs) (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
+ filter_t (tbb::filter::mode mode, const Body &body) (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
+ internal::pipeline_proxy (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > friend
+ make_filter (tbb::filter::mode, const Body &)tbb::interface6::filter_t< T, U > friend
+ operator& (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > friend
+ operator= (const filter_t< T, U > &rhs) (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
+ ~filter_t () (defined in tbb::interface6::filter_t< T, U > )tbb::interface6::filter_t< T, U > inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00468.html b/doc/html/a00468.html
new file mode 100644
index 0000000000..eb26e870c9
--- /dev/null
+++ b/doc/html/a00468.html
@@ -0,0 +1,72 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::runtime_loader , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00469.html b/doc/html/a00469.html
new file mode 100644
index 0000000000..d48f5db069
--- /dev/null
+++ b/doc/html/a00469.html
@@ -0,0 +1,71 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::task_scheduler_observer , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00470.html b/doc/html/a00470.html
new file mode 100644
index 0000000000..39a5b000bf
--- /dev/null
+++ b/doc/html/a00470.html
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::internal::basic_operation_base , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00471.html b/doc/html/a00471.html
new file mode 100644
index 0000000000..a8dfcef34c
--- /dev/null
+++ b/doc/html/a00471.html
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::internal::basic_operation< Body > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00472.html b/doc/html/a00472.html
new file mode 100644
index 0000000000..ad2b8a3045
--- /dev/null
+++ b/doc/html/a00472.html
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface6::internal::basic_handler , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00473.html b/doc/html/a00473.html
new file mode 100644
index 0000000000..1bfffbee89
--- /dev/null
+++ b/doc/html/a00473.html
@@ -0,0 +1,71 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface7::task_arena , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00474.html b/doc/html/a00474.html
new file mode 100644
index 0000000000..906bddc88d
--- /dev/null
+++ b/doc/html/a00474.html
@@ -0,0 +1,63 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::interface9::global_control , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00475.html b/doc/html/a00475.html
new file mode 100644
index 0000000000..2a9e7793b1
--- /dev/null
+++ b/doc/html/a00475.html
@@ -0,0 +1,65 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::internal::critical_section_v4 , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00476.html b/doc/html/a00476.html
new file mode 100644
index 0000000000..556470ed9d
--- /dev/null
+++ b/doc/html/a00476.html
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::internal::critical_section_v4::scoped_lock , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00287.html b/doc/html/a00477.html
similarity index 74%
rename from doc/html/a00287.html
rename to doc/html/a00477.html
index 5c2edd94a3..40baa0fc4a 100644
--- a/doc/html/a00287.html
+++ b/doc/html/a00477.html
@@ -33,18 +33,18 @@
-
This is the complete list of members for tbb::final_scan_tag , including all inherited members.
+
This is the complete list of members for tbb::internal::task_handle_task< F > , including all inherited members.
diff --git a/doc/html/a00478.html b/doc/html/a00478.html
new file mode 100644
index 0000000000..0749b2b8a8
--- /dev/null
+++ b/doc/html/a00478.html
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::internal::task_group_base , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00479.html b/doc/html/a00479.html
new file mode 100644
index 0000000000..3eef4e70a7
--- /dev/null
+++ b/doc/html/a00479.html
@@ -0,0 +1,65 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::internal::task_scheduler_observer_v3 , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00267.html b/doc/html/a00480.html
similarity index 54%
rename from doc/html/a00267.html
rename to doc/html/a00480.html
index 307f098e86..010b27545a 100644
--- a/doc/html/a00267.html
+++ b/doc/html/a00480.html
@@ -33,21 +33,22 @@
-
This is the complete list of members for tbb::atomic< void * > , including all inherited members.
+
This is the complete list of members for tbb::internal::tbb_exception_ptr , including all inherited members.
diff --git a/doc/html/a00481.html b/doc/html/a00481.html
new file mode 100644
index 0000000000..56e6c01ded
--- /dev/null
+++ b/doc/html/a00481.html
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::internal::thread_closure_base , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00482.html b/doc/html/a00482.html
new file mode 100644
index 0000000000..73e5c650ae
--- /dev/null
+++ b/doc/html/a00482.html
@@ -0,0 +1,61 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::internal::thread_closure_0< F > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00483.html b/doc/html/a00483.html
new file mode 100644
index 0000000000..3af199bca1
--- /dev/null
+++ b/doc/html/a00483.html
@@ -0,0 +1,62 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::internal::thread_closure_1< F, X > , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00484.html b/doc/html/a00484.html
new file mode 100644
index 0000000000..7dffd7b5b5
--- /dev/null
+++ b/doc/html/a00484.html
@@ -0,0 +1,63 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::internal::thread_closure_2< F, X, Y > , including all inherited members.
+
+ arg1 (defined in tbb::internal::thread_closure_2< F, X, Y > )tbb::internal::thread_closure_2< F, X, Y >
+ arg2 (defined in tbb::internal::thread_closure_2< F, X, Y > )tbb::internal::thread_closure_2< F, X, Y >
+ function (defined in tbb::internal::thread_closure_2< F, X, Y > )tbb::internal::thread_closure_2< F, X, Y >
+ operator delete (void *ptr) (defined in tbb::internal::thread_closure_base )tbb::internal::thread_closure_base inline
+ operator new (size_t size) (defined in tbb::internal::thread_closure_base )tbb::internal::thread_closure_base inline
+ start_routine (void *c)tbb::internal::thread_closure_2< F, X, Y > inline static
+ thread_closure_2 (const F &f, const X &x, const Y &y) (defined in tbb::internal::thread_closure_2< F, X, Y > )tbb::internal::thread_closure_2< F, X, Y > inline
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00485.html b/doc/html/a00485.html
new file mode 100644
index 0000000000..a901bd4753
--- /dev/null
+++ b/doc/html/a00485.html
@@ -0,0 +1,75 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::internal::tbb_thread_v3 , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00486.html b/doc/html/a00486.html
new file mode 100644
index 0000000000..ab7a4d647c
--- /dev/null
+++ b/doc/html/a00486.html
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::internal::tbb_thread_v3::id , including all inherited members.
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/a00487.html b/doc/html/a00487.html
new file mode 100644
index 0000000000..7cf8655c06
--- /dev/null
+++ b/doc/html/a00487.html
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+Member List
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tbb::strict_ppl::concurrent_queue< T, A > , including all inherited members.
+
+ allocator_type typedeftbb::strict_ppl::concurrent_queue< T, A >
+ clear ()tbb::strict_ppl::concurrent_queue< T, A >
+ concurrent_queue (const allocator_type &a=allocator_type())tbb::strict_ppl::concurrent_queue< T, A > inline explicit
+ concurrent_queue (InputIterator begin, InputIterator end, const allocator_type &a=allocator_type())tbb::strict_ppl::concurrent_queue< T, A > inline
+ concurrent_queue (const concurrent_queue &src, const allocator_type &a=allocator_type())tbb::strict_ppl::concurrent_queue< T, A > inline
+ concurrent_queue (concurrent_queue &&src)tbb::strict_ppl::concurrent_queue< T, A > inline
+ concurrent_queue (concurrent_queue &&src, const allocator_type &a) (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
+ const_iterator typedef (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A >
+ const_reference typedeftbb::strict_ppl::concurrent_queue< T, A >
+ difference_type typedeftbb::strict_ppl::concurrent_queue< T, A >
+ emplace (Arguments &&...args) (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
+ empty () const tbb::strict_ppl::concurrent_queue< T, A > inline
+ get_allocator () const tbb::strict_ppl::concurrent_queue< T, A > inline
+ internal::concurrent_queue_iterator (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > friend
+ iterator typedef (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A >
+ push (const T &source)tbb::strict_ppl::concurrent_queue< T, A > inline
+ push (T &&source) (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
+ reference typedeftbb::strict_ppl::concurrent_queue< T, A >
+ size_type typedeftbb::strict_ppl::concurrent_queue< T, A >
+ try_pop (T &result)tbb::strict_ppl::concurrent_queue< T, A > inline
+ unsafe_begin () (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
+ unsafe_begin () const (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
+ unsafe_end () (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
+ unsafe_end () const (defined in tbb::strict_ppl::concurrent_queue< T, A > )tbb::strict_ppl::concurrent_queue< T, A > inline
+ unsafe_size () const tbb::strict_ppl::concurrent_queue< T, A > inline
+ value_type typedeftbb::strict_ppl::concurrent_queue< T, A >
+ ~concurrent_queue ()tbb::strict_ppl::concurrent_queue< T, A >
+
+
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
+registered trademarks or trademarks of Intel Corporation or its
+subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
diff --git a/doc/html/annotated.html b/doc/html/annotated.html
index d85034b622..6e75e75572 100644
--- a/doc/html/annotated.html
+++ b/doc/html/annotated.html
@@ -39,188 +39,220 @@
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 1 2 3 4 5 ]
-rml The namespace rml contains components of low-level memory pool interface
-MemPoolPolicy
-tbb The namespace tbb contains all components of the library
+rml The namespace rml contains components of low-level memory pool interface
+MemPoolPolicy
+tbb The namespace tbb contains all components of the library
flow
interface8
internal
-successor_cache
-broadcast_cache
-round_robin_cache
-edge_container
-async_gateway Pure virtual template class that defines interface for async communication
-null_type
-continue_msg An empty class used for messages that mean "I'm done"
-sender Pure virtual template class that defines a sender of messages of type T
-receiver Pure virtual template class that defines a receiver of messages of type T
-limiter_node Forwards messages only if the threshold has not been reached
-run_and_put_task
-continue_receiver Base class for receivers of completion messages
-graph_iterator
-graph The graph class
-graph_node The base of all graph nodes
-source_node An executable node that acts as a source, i.e. it has no predecessors
+successor_cache
+broadcast_cache
+round_robin_cache
+edge_container
+async_gateway Pure virtual template class that defines interface for async communication
+async_body
+null_type
+continue_msg An empty class used for messages that mean "I'm done"
+sender Pure virtual template class that defines a sender of messages of type T
+receiver Pure virtual template class that defines a receiver of messages of type T
+limiter_node Forwards messages only if the threshold has not been reached
+run_and_put_task
+continue_receiver Base class for receivers of completion messages
+graph_iterator
+graph The graph class
+graph_node The base of all graph nodes
+source_node An executable node that acts as a source, i.e. it has no predecessors
allocate_buffer
allocate_buffer< queueing >
-function_node Implements a function node that supports Input -> Output
-multifunction_node Implements a function node that supports Input -> (set of outputs)
-split_node Split_node: accepts a tuple as input, forwards each element of the tuple to its
-continue_node Implements an executable node that supports continue_msg -> Output
-overwrite_node
-write_once_node
-broadcast_node Forwards messages of type T to all successors
-buffer_node Forwards messages in arbitrary order
-buffer_operation
-queue_node Forwards messages in FIFO order
-sequencer_node Forwards messages in sequence order
-priority_queue_node Forwards messages in priority order
-join_node
-join_node< OutputTuple, reserving >
-join_node< OutputTuple, queueing >
-join_node< OutputTuple, key_matching< K, KHash > >
-indexer_node
-indexer_node< T0 >
-indexer_node< T0, T1 >
-indexer_node< T0, T1, T2 >
-indexer_node< T0, T1, T2, T3 >
-indexer_node< T0, T1, T2, T3, T4 >
-indexer_node< T0, T1, T2, T3, T4, T5 >
-indexer_node< T0, T1, T2, T3, T4, T5, T6 >
-indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
-indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
-composite_node
-composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
-composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> >
-composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> >
-async_node Implements a async node
+function_node Implements a function node that supports Input -> Output
+multifunction_node Implements a function node that supports Input -> (set of outputs)
+split_node Split_node: accepts a tuple as input, forwards each element of the tuple to its
+continue_node Implements an executable node that supports continue_msg -> Output
+overwrite_node
+write_once_node
+broadcast_node Forwards messages of type T to all successors
+buffer_node Forwards messages in arbitrary order
+buffer_operation
+queue_node Forwards messages in FIFO order
+sequencer_node Forwards messages in sequence order
+priority_queue_node Forwards messages in priority order
+join_node
+join_node< OutputTuple, reserving >
+join_node< OutputTuple, queueing >
+join_node< OutputTuple, key_matching< K, KHash > >
+indexer_node
+indexer_node< T0 >
+indexer_node< T0, T1 >
+indexer_node< T0, T1, T2 >
+indexer_node< T0, T1, T2, T3 >
+indexer_node< T0, T1, T2, T3, T4 >
+indexer_node< T0, T1, T2, T3, T4, T5 >
+indexer_node< T0, T1, T2, T3, T4, T5, T6 >
+indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
+indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
+composite_node
+composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
+composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> >
+composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> >
+async_node Implements async node
+try_put_functor
+opencl_buffer_impl
+opencl_graph
+dependency_msg
+proxy_dependency_receiver
+receiver< dependency_msg< T, Factory > >
+proxy_dependency_sender
+sender< dependency_msg< T, Factory > >
+opencl_device
+opencl_device_list
+callback_base
+callback
+opencl_memory
+opencl_buffer
+opencl_factory
+default_opencl_factory_device_filter
+default_opencl_factory
+opencl_foundation
+opencl_program
+port_ref_impl
+num_arguments
+num_arguments< port_ref_impl< N1, N2 >(*)()>
+num_arguments< port_ref_impl< N1, N2 > >
+opencl_node
+key_from_policy
+key_from_policy< key_matching< Key > >
+key_from_policy< key_matching< Key & > >
+opencl_device_with_key
+opencl_node< tuple< Ports...>, JP, Factory >
+opencl_node< tuple< Ports...>, JP >
+opencl_node< tuple< Ports...> >
interface5
internal
-use_element_copy_constructor
-use_element_copy_constructor< T, false >
-concurrent_hash_map Unordered map from Key to T
+use_element_copy_constructor
+use_element_copy_constructor< T, false >
+concurrent_hash_map Unordered map from Key to T
accessor Allows write access to elements and combines data access, locking, and garbage collection
accessor_not_used
-bucket_accessor Bucket accessor is to find, rehash, acquire a lock, and access a bucket
-call_clear_on_leave
-const_accessor Combines data access, locking, and garbage collection
-node
-concurrent_priority_queue Concurrent priority queue
-concurrent_unordered_map_traits
-value_compare
-concurrent_unordered_map
-concurrent_unordered_multimap
-concurrent_unordered_set_traits
-concurrent_unordered_set
-concurrent_unordered_multiset
-reader_writer_lock Writer-preference reader-writer lock with local-only spinning on readers
-scoped_lock The scoped lock pattern for write locks
-scoped_lock_read The scoped lock pattern for read locks
+bucket_accessor Bucket accessor is to find, rehash, acquire a lock, and access a bucket
+call_clear_on_leave
+const_accessor Combines data access, locking, and garbage collection
+node
+concurrent_priority_queue Concurrent priority queue
+concurrent_unordered_map_traits
+value_compare
+concurrent_unordered_map
+concurrent_unordered_multimap
+concurrent_unordered_set_traits
+concurrent_unordered_set
+concurrent_unordered_multiset
+reader_writer_lock Writer-preference reader-writer lock with local-only spinning on readers
+scoped_lock The scoped lock pattern for write locks
+scoped_lock_read The scoped lock pattern for read locks
interface6
internal
-basic_operation_base
-basic_operation
-basic_handler
-concrete_filter
+basic_operation_base
+basic_operation
+basic_handler
+concrete_filter
aggregator_operation
aggregator_ext Aggregator base class and expert interface
aggregator Basic aggregator interface
-concurrent_lru_cache
-enumerable_thread_specific The enumerable_thread_specific container
-flattened2d
-memory_pool_allocator Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
-rebind
-memory_pool_allocator< void, P > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
-rebind
-memory_pool Thread-safe growable pool allocator for variable-size requests
-fixed_pool
-flow_control Input_filter control to signal end-of-input for parallel_pipeline
-filter_t Class representing a chain of type-safe pipeline filters
-runtime_loader Load TBB at runtime
-task_scheduler_observer
+concurrent_lru_cache
+enumerable_thread_specific The enumerable_thread_specific container
+flattened2d
+memory_pool_allocator Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
+rebind
+memory_pool_allocator< void, P > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
+rebind
+memory_pool Thread-safe growable pool allocator for variable-size requests
+fixed_pool
+flow_control Input_filter control to signal end-of-input for parallel_pipeline
+filter_t Class representing a chain of type-safe pipeline filters
+runtime_loader Load TBB at runtime
+task_scheduler_observer
interface7
-task_arena
+task_arena
interface9
-global_control
+global_control
internal
-critical_section_v4
-scoped_lock
-task_handle_task
-task_group_base
-task_scheduler_observer_v3
-tbb_exception_ptr Exception container that preserves the exact copy of the original exception
-thread_closure_base
-thread_closure_0
-thread_closure_1 Structure used to pass user function with 1 argument to thread
-thread_closure_2
-tbb_thread_v3 Versioned thread class
-id
+critical_section_v4
+scoped_lock
+task_handle_task
+task_group_base
+task_scheduler_observer_v3
+tbb_exception_ptr Exception container that preserves the exact copy of the original exception
+thread_closure_base
+thread_closure_0
+thread_closure_1 Structure used to pass user function with 1 argument to thread
+thread_closure_2
+tbb_thread_v3 Versioned thread class
+id
strict_ppl
-concurrent_queue A high-performance thread-safe non-blocking concurrent queue
+concurrent_queue A high-performance thread-safe non-blocking concurrent queue
aligned_space Block of space aligned sufficiently to construct an array T with N elements
-atomic Primary template for atomic
-atomic< void * > Specialization for atomic<void*> , for sake of not allowing arithmetic or operator->
-blocked_range A range over which to iterate
-blocked_range2d A 2-dimensional range that models the Range concept
-blocked_range3d A 3-dimensional range that models the Range concept
-cache_aligned_allocator Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
-rebind
-cache_aligned_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
-rebind
-combinable Thread-local storage with optional reduction
-concurrent_bounded_queue A high-performance thread-safe blocking concurrent bounded queue
-concurrent_vector Concurrent vector container
-vector_iterator
-mutex Wrapper around the platform's native reader-writer lock
-scoped_lock The scoped locking pattern
-null_mutex A mutex which does nothing
-scoped_lock Represents acquisition of a mutex
-null_rw_mutex A rw mutex which does nothing
-scoped_lock Represents acquisition of a mutex
-parallel_do_feeder Class the user supplied algorithm body uses to add new tasks
-task_group_context
-pre_scan_tag Used to indicate that the initial scan is being performed
-final_scan_tag Used to indicate that the final scan is being performed
-parallel_while Parallel iteration over a stream, with optional addition of more work
-filter A stage in a pipeline
-thread_bound_filter A stage in a pipeline served by a user thread
-pipeline A processing pipeline that applies filters to items
-queuing_mutex Queuing mutex with local-only spinning
-scoped_lock The scoped locking pattern
-queuing_rw_mutex Queuing reader-writer mutex with local-only spinning
-scoped_lock The scoped locking pattern
-recursive_mutex
-scoped_lock The scoped locking pattern
-scalable_allocator Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
-rebind
-scalable_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
-rebind
-spin_mutex A lock that occupies a single byte
-scoped_lock Represents acquisition of a mutex
-spin_rw_mutex_v3 Fast, unfair, spinning reader-writer lock with backoff and writer-preference
-scoped_lock The scoped locking pattern
-task_handle
-task_group
-structured_task_group
-task_scheduler_init Class delimiting the scope of task scheduler activity
-tbb_allocator Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
-rebind
-tbb_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
-rebind
-zero_allocator Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
-rebind
-zero_allocator< void, Allocator > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
-rebind
-bad_last_alloc Exception for concurrent containers
-improper_lock Exception for PPL locks
-user_abort Exception for user-initiated abort
-missing_wait Exception for missing wait on structured_task_group
-invalid_multiple_scheduling Exception for repeated scheduling of the same task_handle
-tbb_exception Interface to be implemented by all exceptions TBB recognizes and propagates across the threads
-captured_exception This class is used by TBB to propagate information about unhandled exceptions into the root thread
-movable_exception Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread
-tick_count Absolute timestamp
-interval_t Relative time interval
+atomic Primary template for atomic
+atomic< void * > Specialization for atomic<void*> , for sake of not allowing arithmetic or operator->
+blocked_range A range over which to iterate
+blocked_range2d A 2-dimensional range that models the Range concept
+blocked_range3d A 3-dimensional range that models the Range concept
+cache_aligned_allocator Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
+rebind
+cache_aligned_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
+rebind
+combinable Thread-local storage with optional reduction
+concurrent_bounded_queue A high-performance thread-safe blocking concurrent bounded queue
+concurrent_vector Concurrent vector container
+vector_iterator
+mutex Wrapper around the platform's native reader-writer lock
+scoped_lock The scoped locking pattern
+null_mutex A mutex which does nothing
+scoped_lock Represents acquisition of a mutex
+null_rw_mutex A rw mutex which does nothing
+scoped_lock Represents acquisition of a mutex
+parallel_do_feeder Class the user supplied algorithm body uses to add new tasks
+task_group_context
+pre_scan_tag Used to indicate that the initial scan is being performed
+final_scan_tag Used to indicate that the final scan is being performed
+parallel_while Parallel iteration over a stream, with optional addition of more work
+filter A stage in a pipeline
+thread_bound_filter A stage in a pipeline served by a user thread
+pipeline A processing pipeline that applies filters to items
+queuing_mutex Queuing mutex with local-only spinning
+scoped_lock The scoped locking pattern
+queuing_rw_mutex Queuing reader-writer mutex with local-only spinning
+scoped_lock The scoped locking pattern
+recursive_mutex
+scoped_lock The scoped locking pattern
+scalable_allocator Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
+rebind
+scalable_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
+rebind
+spin_mutex A lock that occupies a single byte
+scoped_lock Represents acquisition of a mutex
+spin_rw_mutex_v3 Fast, unfair, spinning reader-writer lock with backoff and writer-preference
+scoped_lock The scoped locking pattern
+task_handle
+task_group
+structured_task_group
+task_scheduler_init Class delimiting the scope of task scheduler activity
+tbb_allocator Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
+rebind
+tbb_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
+rebind
+zero_allocator Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
+rebind
+zero_allocator< void, Allocator > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
+rebind
+bad_last_alloc Exception for concurrent containers
+improper_lock Exception for PPL locks
+user_abort Exception for user-initiated abort
+missing_wait Exception for missing wait on structured_task_group
+invalid_multiple_scheduling Exception for repeated scheduling of the same task_handle
+tbb_exception Interface to be implemented by all exceptions TBB recognizes and propagates across the threads
+captured_exception This class is used by TBB to propagate information about unhandled exceptions into the root thread
+movable_exception Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread
+tick_count Absolute timestamp
+interval_t Relative time interval
__TBB_malloc_proxy_caller
diff --git a/doc/html/classes.html b/doc/html/classes.html
index 39ec88ac0d..5e48dc37e4 100644
--- a/doc/html/classes.html
+++ b/doc/html/classes.html
@@ -37,78 +37,88 @@
Class Index
-
+
-concurrent_priority_queue (tbb::interface5) indexer_node< T0, T1, T2, T3, T4 > (tbb::flow::interface8) queuing_mutex (tbb )
+concurrent_unordered_multiset (tbb::interface5) join_node< OutputTuple, key_matching< K, KHash > > (tbb::flow::interface8) pipeline (tbb ) split_node (tbb::flow::interface8)
+concurrent_unordered_set (tbb::interface5) join_node< OutputTuple, queueing > (tbb::flow::interface8) port_ref_impl (tbb::flow::interface8) structured_task_group (tbb )
+concurrent_hash_map::accessor (tbb::interface5) concurrent_unordered_set_traits (tbb::interface5) join_node< OutputTuple, reserving > (tbb::flow::interface8) pre_scan_tag (tbb ) successor_cache (tbb::flow::interface8::internal)
+concurrent_hash_map::accessor_not_used (tbb::interface5) concurrent_vector (tbb )
+priority_queue_node (tbb::flow::interface8)
-concurrent_queue (tbb::strict_ppl) indexer_node< T0, T1, T2, T3, T4, T5 > (tbb::flow::interface8) queuing_rw_mutex (tbb )
-concurrent_hash_map::accessor (tbb::interface5) concurrent_unordered_map (tbb::interface5) indexer_node< T0, T1, T2, T3, T4, T5, T6 > (tbb::flow::interface8)
-task_arena (tbb::interface7)
-concurrent_hash_map::accessor_not_used (tbb::interface5) concurrent_unordered_map_traits (tbb::interface5) indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > (tbb::flow::interface8) task_group (tbb )
-aggregator (tbb::interface6) concurrent_unordered_multimap (tbb::interface5) indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > (tbb::flow::interface8) reader_writer_lock (tbb::interface5) task_group_base (tbb::internal)
-aggregator_ext (tbb::interface6) concurrent_unordered_multiset (tbb::interface5) tick_count::interval_t (tbb ) zero_allocator< void, Allocator >::rebind (tbb ) task_group_context (tbb )
-aggregator_operation (tbb::interface6) concurrent_unordered_set (tbb::interface5) invalid_multiple_scheduling (tbb ) cache_aligned_allocator::rebind (tbb ) task_handle (tbb )
-aligned_space (tbb ) concurrent_unordered_set_traits (tbb::interface5)
-tbb_allocator::rebind (tbb ) task_handle_task (tbb::internal)
-allocate_buffer (tbb::flow::interface8) concurrent_vector (tbb ) memory_pool_allocator::rebind (tbb::interface6) task_scheduler_init (tbb )
-allocate_buffer< queueing > (tbb::flow::interface8) concurrent_hash_map::const_accessor (tbb::interface5) join_node (tbb::flow::interface8) memory_pool_allocator< void, P >::rebind (tbb::interface6) task_scheduler_observer (tbb::interface6)
-async_gateway (tbb::flow::interface8::internal) continue_msg (tbb::flow::interface8) join_node< OutputTuple, key_matching< K, KHash > > (tbb::flow::interface8) zero_allocator::rebind (tbb ) task_scheduler_observer_v3 (tbb::internal)
-async_node (tbb::flow::interface8) continue_node (tbb::flow::interface8) join_node< OutputTuple, queueing > (tbb::flow::interface8) tbb_allocator< void >::rebind (tbb ) tbb_allocator (tbb )
-atomic (tbb ) continue_receiver (tbb::flow::interface8) join_node< OutputTuple, reserving > (tbb::flow::interface8) scalable_allocator< void >::rebind (tbb ) tbb_allocator< void > (tbb )
-atomic< void * > (tbb ) critical_section_v4 (tbb::internal)
-scalable_allocator::rebind (tbb ) tbb_exception (tbb )
+aggregator (tbb::interface6) concurrent_hash_map::const_accessor (tbb::interface5) proxy_dependency_receiver (tbb::flow::interface8)
+aggregator_ext (tbb::interface6) continue_msg (tbb::flow::interface8) key_from_policy (tbb::flow::interface8) proxy_dependency_sender (tbb::flow::interface8) task_arena (tbb::interface7)
+aggregator_operation (tbb::interface6) continue_node (tbb::flow::interface8) key_from_policy< key_matching< Key & > > (tbb::flow::interface8)
+task_group (tbb )
+aligned_space (tbb ) continue_receiver (tbb::flow::interface8) key_from_policy< key_matching< Key > > (tbb::flow::interface8) task_group_base (tbb::internal)
+allocate_buffer (tbb::flow::interface8) critical_section_v4 (tbb::internal)
+queue_node (tbb::flow::interface8) task_group_context (tbb )
+allocate_buffer< queueing > (tbb::flow::interface8)
+queuing_mutex (tbb ) task_handle (tbb )
+async_body (tbb::flow::interface8::internal) limiter_node (tbb::flow::interface8) queuing_rw_mutex (tbb ) task_handle_task (tbb::internal)
+async_gateway (tbb::flow::interface8::internal) default_opencl_factory (tbb::flow::interface8)
+
+task_scheduler_init (tbb )
+async_node (tbb::flow::interface8) default_opencl_factory_device_filter (tbb::flow::interface8) task_scheduler_observer (tbb::interface6)
+atomic (tbb ) dependency_msg (tbb::flow::interface8) memory_pool (tbb::interface6) reader_writer_lock (tbb::interface5) task_scheduler_observer_v3 (tbb::internal)
+atomic< void * > (tbb )
+memory_pool_allocator (tbb::interface6) zero_allocator::rebind (tbb ) tbb_allocator (tbb )
-
-cache_aligned_allocator< void >::rebind (tbb ) tbb_exception_ptr (tbb::internal)
-limiter_node (tbb::flow::interface8) receiver (tbb::flow::interface8) tbb_thread_v3 (tbb::internal)
-bad_last_alloc (tbb ) edge_container (tbb::flow::interface8::internal)
-recursive_mutex (tbb ) thread_bound_filter (tbb )
-basic_handler (tbb::interface6::internal) concurrent_vector::push_back_helper::element_construction_guard (tbb ) round_robin_cache (tbb::flow::interface8::internal) thread_closure_0 (tbb::internal)
-basic_operation (tbb::interface6::internal) enumerable_thread_specific (tbb::interface6) memory_pool (tbb::interface6) run_and_put_task (tbb::flow::interface8) thread_closure_1 (tbb::internal)
-basic_operation_base (tbb::interface6::internal)
-memory_pool_allocator (tbb::interface6) runtime_loader (tbb::interface6) thread_closure_2 (tbb::internal)
-blocked_range (tbb ) memory_pool_allocator< void, P > (tbb::interface6)
-thread_closure_base (tbb::internal)
-blocked_range2d (tbb ) filter (tbb ) MemPoolPolicy (rml ) tick_count (tbb )
-blocked_range3d (tbb ) filter_t (tbb::interface6) missing_wait (tbb ) scalable_allocator (tbb )
-
-broadcast_cache (tbb::flow::interface8::internal) final_scan_tag (tbb ) movable_exception (tbb ) scalable_allocator< void > (tbb )
-broadcast_node (tbb::flow::interface8) fixed_pool (tbb::interface6) multifunction_node (tbb::flow::interface8) critical_section_v4::scoped_lock (tbb::internal) use_element_copy_constructor (tbb::interface5::internal)
-concurrent_hash_map::bucket_accessor (tbb::interface5) flattened2d (tbb::interface6) mutex (tbb ) spin_rw_mutex_v3::scoped_lock (tbb ) use_element_copy_constructor< T, false > (tbb::interface5::internal)
-buffer_node (tbb::flow::interface8) flow_control (tbb::interface6)
-recursive_mutex::scoped_lock (tbb ) user_abort (tbb )
-buffer_node::buffer_operation (tbb::flow::interface8) function_node (tbb::flow::interface8) null_rw_mutex::scoped_lock (tbb )
+memory_pool_allocator< void, P > (tbb::interface6) tbb_allocator< void >::rebind (tbb ) tbb_allocator< void > (tbb )
+edge_container (tbb::flow::interface8::internal) MemPoolPolicy (rml ) tbb_allocator::rebind (tbb ) tbb_exception (tbb )
+bad_last_alloc (tbb ) concurrent_vector::push_back_helper::element_construction_guard (tbb ) missing_wait (tbb ) scalable_allocator< void >::rebind (tbb ) tbb_exception_ptr (tbb::internal)
+basic_handler (tbb::interface6::internal) enumerable_thread_specific (tbb::interface6) movable_exception (tbb ) scalable_allocator::rebind (tbb ) tbb_thread_v3 (tbb::internal)
+basic_operation (tbb::interface6::internal)
+multifunction_node (tbb::flow::interface8) cache_aligned_allocator< void >::rebind (tbb ) thread_bound_filter (tbb )
+basic_operation_base (tbb::interface6::internal) mutex (tbb ) cache_aligned_allocator::rebind (tbb ) thread_closure_0 (tbb::internal)
+blocked_range (tbb ) filter (tbb )
+memory_pool_allocator::rebind (tbb::interface6) thread_closure_1 (tbb::internal)
+blocked_range2d (tbb ) filter_t (tbb::interface6) memory_pool_allocator< void, P >::rebind (tbb::interface6) thread_closure_2 (tbb::internal)
+blocked_range3d (tbb ) final_scan_tag (tbb ) concurrent_hash_map::node (tbb::interface5) zero_allocator< void, Allocator >::rebind (tbb ) thread_closure_base (tbb::internal)
+broadcast_cache (tbb::flow::interface8::internal) fixed_pool (tbb::interface6) null_mutex (tbb ) receiver (tbb::flow::interface8) tick_count (tbb )
+broadcast_node (tbb::flow::interface8) flattened2d (tbb::interface6) null_rw_mutex (tbb ) receiver< dependency_msg< T, Factory > > (tbb::flow::interface8) async_node::try_put_functor (tbb::flow::interface8)
+concurrent_hash_map::bucket_accessor (tbb::interface5) flow_control (tbb::interface6) null_type (tbb::flow::interface8) recursive_mutex (tbb )
+buffer_node (tbb::flow::interface8) function_node (tbb::flow::interface8) num_arguments (tbb::flow::interface8) round_robin_cache (tbb::flow::interface8::internal)
+buffer_node::buffer_operation (tbb::flow::interface8)
+num_arguments< port_ref_impl< N1, N2 > > (tbb::flow::interface8) run_and_put_task (tbb::flow::interface8) use_element_copy_constructor (tbb::interface5::internal)
-
-concurrent_hash_map::node (tbb::interface5) mutex::scoped_lock (tbb )
-null_mutex (tbb ) queuing_mutex::scoped_lock (tbb ) concurrent_unordered_map_traits::value_compare (tbb::interface5)
-cache_aligned_allocator (tbb ) global_control (tbb::interface9) null_rw_mutex (tbb ) spin_mutex::scoped_lock (tbb ) vector_iterator (tbb )
-cache_aligned_allocator< void > (tbb ) graph (tbb::flow::interface8) null_type (tbb::flow::interface8) reader_writer_lock::scoped_lock (tbb::interface5)
+num_arguments< port_ref_impl< N1, N2 >(*)()> (tbb::flow::interface8) runtime_loader (tbb::interface6) use_element_copy_constructor< T, false > (tbb::interface5::internal)
+global_control (tbb::interface9)
+
+user_abort (tbb )
+cache_aligned_allocator (tbb ) graph (tbb::flow::interface8)
+
+cache_aligned_allocator< void > (tbb ) graph_iterator (tbb::flow::interface8) opencl_buffer (tbb::flow::interface8) scalable_allocator (tbb )
+concurrent_hash_map::call_clear_on_leave (tbb::interface5) graph_node (tbb::flow::interface8) opencl_buffer_impl (tbb::flow::interface8) scalable_allocator< void > (tbb ) concurrent_unordered_map_traits::value_compare (tbb::interface5)
+callback (tbb::flow::interface8)
+opencl_device (tbb::flow::interface8) mutex::scoped_lock (tbb ) vector_iterator (tbb )
+callback_base (tbb::flow::interface8) opencl_device_list (tbb::flow::interface8) critical_section_v4::scoped_lock (tbb::internal)
-concurrent_hash_map::call_clear_on_leave (tbb::interface5) graph_iterator (tbb::flow::interface8)
-queuing_rw_mutex::scoped_lock (tbb )
-captured_exception (tbb ) graph_node (tbb::flow::interface8) null_mutex::scoped_lock (tbb ) write_once_node (tbb::flow::interface8)
-combinable (tbb )
-overwrite_node (tbb::flow::interface8) reader_writer_lock::scoped_lock_read (tbb::interface5)
+captured_exception (tbb ) tbb_thread_v3::id (tbb::internal) opencl_device_with_key (tbb::flow::interface8) null_rw_mutex::scoped_lock (tbb )
+combinable (tbb ) improper_lock (tbb ) opencl_factory (tbb::flow::interface8) reader_writer_lock::scoped_lock (tbb::interface5) write_once_node (tbb::flow::interface8)
+composite_node (tbb::flow::interface8) indexer_node (tbb::flow::interface8) opencl_foundation (tbb::flow::interface8) null_mutex::scoped_lock (tbb )
-composite_node (tbb::flow::interface8)
-sender (tbb::flow::interface8)
-composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > (tbb::flow::interface8) tbb_thread_v3::id (tbb::internal) sequencer_node (tbb::flow::interface8) zero_allocator (tbb )
-composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > (tbb::flow::interface8) improper_lock (tbb ) parallel_do_feeder (tbb ) source_node (tbb::flow::interface8) zero_allocator< void, Allocator > (tbb )
-composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > (tbb::flow::interface8) indexer_node (tbb::flow::interface8) parallel_while (tbb ) spin_mutex (tbb )
+composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> > (tbb::flow::interface8) indexer_node< T0 > (tbb::flow::interface8) opencl_graph (tbb::flow::interface8) queuing_rw_mutex::scoped_lock (tbb )
+composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> > (tbb::flow::interface8) indexer_node< T0, T1 > (tbb::flow::interface8) opencl_memory (tbb::flow::interface8) recursive_mutex::scoped_lock (tbb ) zero_allocator (tbb )
+composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> > (tbb::flow::interface8) indexer_node< T0, T1, T2 > (tbb::flow::interface8) opencl_node (tbb::flow::interface8) spin_rw_mutex_v3::scoped_lock (tbb ) zero_allocator< void, Allocator > (tbb )
+concrete_filter (tbb::interface6::internal) indexer_node< T0, T1, T2, T3 > (tbb::flow::interface8) opencl_node< tuple< Ports...> > (tbb::flow::interface8) queuing_mutex::scoped_lock (tbb )
-concrete_filter (tbb::interface6::internal) indexer_node< T0 > (tbb::flow::interface8) pipeline (tbb ) spin_rw_mutex_v3 (tbb )
-concurrent_bounded_queue (tbb ) indexer_node< T0, T1 > (tbb::flow::interface8) pre_scan_tag (tbb ) split_node (tbb::flow::interface8) __TBB_malloc_proxy_caller
-concurrent_hash_map (tbb::interface5) indexer_node< T0, T1, T2 > (tbb::flow::interface8) priority_queue_node (tbb::flow::interface8) structured_task_group (tbb )
-concurrent_lru_cache (tbb::interface6) indexer_node< T0, T1, T2, T3 > (tbb::flow::interface8)
-successor_cache (tbb::flow::interface8::internal)
+concurrent_bounded_queue (tbb ) indexer_node< T0, T1, T2, T3, T4 > (tbb::flow::interface8) opencl_node< tuple< Ports...>, JP > (tbb::flow::interface8) spin_mutex::scoped_lock (tbb )
+concurrent_hash_map (tbb::interface5) indexer_node< T0, T1, T2, T3, T4, T5 > (tbb::flow::interface8) opencl_node< tuple< Ports...>, JP, Factory > (tbb::flow::interface8) reader_writer_lock::scoped_lock_read (tbb::interface5) __TBB_malloc_proxy_caller
+concurrent_lru_cache (tbb::interface6) indexer_node< T0, T1, T2, T3, T4, T5, T6 > (tbb::flow::interface8) opencl_program (tbb::flow::interface8) sender (tbb::flow::interface8)
+concurrent_priority_queue (tbb::interface5) indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 > (tbb::flow::interface8) overwrite_node (tbb::flow::interface8) sender< dependency_msg< T, Factory > > (tbb::flow::interface8)
+concurrent_queue (tbb::strict_ppl) indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 > (tbb::flow::interface8)
+sequencer_node (tbb::flow::interface8)
+concurrent_unordered_map (tbb::interface5) tick_count::interval_t (tbb ) source_node (tbb::flow::interface8)
+concurrent_unordered_map_traits (tbb::interface5) invalid_multiple_scheduling (tbb ) parallel_do_feeder (tbb ) spin_mutex (tbb )
+concurrent_unordered_multimap (tbb::interface5)
+parallel_while (tbb ) spin_rw_mutex_v3 (tbb )
-queue_node (tbb::flow::interface8)
+join_node (tbb::flow::interface8)
-
+
diff --git a/doc/html/dir_87119f26c7695cbc270003e99bc7f49f.html b/doc/html/dir_87119f26c7695cbc270003e99bc7f49f.html
index 62603e49bf..85948b313a 100644
--- a/doc/html/dir_87119f26c7695cbc270003e99bc7f49f.html
+++ b/doc/html/dir_87119f26c7695cbc270003e99bc7f49f.html
@@ -37,118 +37,120 @@
-file aggregator.h
+file aggregator.h
-file aligned_space.h
+file aligned_space.h
-file atomic.h
+file atomic.h
-file blocked_range.h
+file blocked_range.h
-file blocked_range2d.h
+file blocked_range2d.h
-file blocked_range3d.h
+file blocked_range3d.h
-file cache_aligned_allocator.h
+file cache_aligned_allocator.h
-file combinable.h
+file combinable.h
-file concurrent_hash_map.h
+file concurrent_hash_map.h
-file concurrent_lru_cache.h
+file concurrent_lru_cache.h
-file concurrent_priority_queue.h
+file concurrent_priority_queue.h
-file concurrent_queue.h
+file concurrent_queue.h
-file concurrent_unordered_map.h
+file concurrent_unordered_map.h
-file concurrent_unordered_set.h
+file concurrent_unordered_set.h
-file concurrent_vector.h
+file concurrent_vector.h
-file critical_section.h
+file critical_section.h
-file enumerable_thread_specific.h
+file enumerable_thread_specific.h
-file flow_graph.h
- The graph related classes and functions.
+file flow_graph.h
+ The graph related classes and functions.
-file global_control.h
+file flow_graph_opencl_node.h
-file memory_pool.h
+file global_control.h
-file mutex.h
+file memory_pool.h
-file null_mutex.h
+file mutex.h
-file null_rw_mutex.h
+file null_mutex.h
-file parallel_do.h
+file null_rw_mutex.h
-file parallel_for.h
+file parallel_do.h
-file parallel_for_each.h
+file parallel_for.h
-file parallel_invoke.h
+file parallel_for_each.h
-file parallel_reduce.h
+file parallel_invoke.h
-file parallel_scan.h
+file parallel_reduce.h
-file parallel_sort.h
+file parallel_scan.h
-file parallel_while.h
+file parallel_sort.h
-file partitioner.h
+file parallel_while.h
-file pipeline.h
+file partitioner.h
-file queuing_mutex.h
+file pipeline.h
-file queuing_rw_mutex.h
+file queuing_mutex.h
-file reader_writer_lock.h
+file queuing_rw_mutex.h
-file recursive_mutex.h
+file reader_writer_lock.h
-file runtime_loader.h
+file recursive_mutex.h
-file scalable_allocator.h
+file runtime_loader.h
-file spin_mutex.h
+file scalable_allocator.h
-file spin_rw_mutex.h
+file spin_mutex.h
-file task.h
+file spin_rw_mutex.h
-file task_arena.h
+file task.h
-file task_group.h
+file task_arena.h
-file task_scheduler_init.h
+file task_group.h
-file task_scheduler_observer.h
+file task_scheduler_init.h
-file tbb.h
+file task_scheduler_observer.h
-file tbb_allocator.h
+file tbb.h
-file tbb_config.h
+file tbb_allocator.h
-file tbb_exception.h
+file tbb_config.h
-file tbb_machine.h
+file tbb_exception.h
-file tbb_profiling.h
+file tbb_machine.h
-file tbb_stddef.h
+file tbb_profiling.h
-file tbb_thread.h
+file tbb_stddef.h
-file tbbmalloc_proxy.h
+file tbb_thread.h
-file tick_count.h
+file tbbmalloc_proxy.h
+
+file tick_count.h
diff --git a/doc/html/files.html b/doc/html/files.html
index 31752bd9a3..f8203a0b25 100644
--- a/doc/html/files.html
+++ b/doc/html/files.html
@@ -38,9 +38,9 @@
Here is a list of all documented files with brief descriptions:
diff --git a/doc/html/functions.html b/doc/html/functions.html
index 3d0bb4528f..3d9ae901d3 100644
--- a/doc/html/functions.html
+++ b/doc/html/functions.html
@@ -75,57 +75,67 @@
- a -
abort()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
acquire()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
-, tbb::queuing_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::mutex::scoped_lock
-, tbb::recursive_mutex::scoped_lock
-, tbb::spin_mutex::scoped_lock
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
+, tbb::queuing_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
+, tbb::mutex::scoped_lock
+, tbb::recursive_mutex::scoped_lock
+, tbb::spin_mutex::scoped_lock
activate()
-: tbb::flow::interface8::source_node< Output >
+: tbb::flow::interface8::source_node< Output >
add()
-: tbb::parallel_do_feeder< Item >
-, tbb::parallel_while< Body >
+: tbb::parallel_do_feeder< Item >
+, tbb::parallel_while< Body >
add_filter()
-: tbb::pipeline
+: tbb::pipeline
allocate()
-: tbb::tbb_allocator< T >
-, tbb::internal::tbb_exception_ptr
-, tbb::cache_aligned_allocator< T >
-, tbb::interface6::memory_pool_allocator< T, P >
-, tbb::scalable_allocator< T >
+: tbb::tbb_allocator< T >
+, tbb::internal::tbb_exception_ptr
+, tbb::cache_aligned_allocator< T >
+, tbb::interface6::memory_pool_allocator< T, P >
+, tbb::scalable_allocator< T >
allocator_type
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
-, tbb::tbb_allocator< T >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::tbb_allocator< T >
assign()
-: tbb::concurrent_vector< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::concurrent_vector< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::concurrent_vector< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-async_node()
-: tbb::flow::interface8::async_node< Input, Output, Allocator >
+ async_commit()
+: tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+, tbb::flow::interface8::internal::async_gateway< Output >
+
+async_reserve()
+: tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+, tbb::flow::interface8::internal::async_gateway< Output >
async_try_put()
-: tbb::flow::interface8::async_node< Input, Output, Allocator >
-, tbb::flow::interface8::internal::async_gateway< Output >
+: tbb::flow::interface8::internal::async_gateway< Output >
+, tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
at()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
automatic
-: tbb::task_scheduler_init
+: tbb::task_scheduler_init
+
+available_devices()
+: tbb::flow::interface8::opencl_graph
diff --git a/doc/html/functions_0x62.html b/doc/html/functions_0x62.html
index f8654b7c13..3af043bc29 100644
--- a/doc/html/functions_0x62.html
+++ b/doc/html/functions_0x62.html
@@ -75,29 +75,30 @@
- b -
back()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
begin()
-: tbb::blocked_range< Value >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
-, tbb::flow::interface8::graph
-, tbb::concurrent_vector< T, A >
-, tbb::flow::interface8::graph
+: tbb::blocked_range< Value >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::flow::interface8::graph
+, tbb::concurrent_vector< T, A >
+, tbb::flow::interface8::graph
, tbb::aligned_space< T, N >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
blocked_range()
-: tbb::blocked_range< Value >
+: tbb::blocked_range< Value >
bucket_count()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
buffer_node()
-: tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::buffer_node< T, A >
built_successors_type
-: tbb::flow::interface8::sender< T >
+: tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
diff --git a/doc/html/functions_0x63.html b/doc/html/functions_0x63.html
index 6903063aa9..25064b2d85 100644
--- a/doc/html/functions_0x63.html
+++ b/doc/html/functions_0x63.html
@@ -75,90 +75,90 @@
- c -
capacity()
-: tbb::concurrent_bounded_queue< T, A >
-, tbb::concurrent_vector< T, A >
+: tbb::concurrent_bounded_queue< T, A >
+, tbb::concurrent_vector< T, A >
cbegin()
-: tbb::flow::interface8::graph
-, tbb::concurrent_vector< T, A >
+: tbb::flow::interface8::graph
+, tbb::concurrent_vector< T, A >
cend()
-: tbb::concurrent_vector< T, A >
-, tbb::flow::interface8::graph
+: tbb::concurrent_vector< T, A >
+, tbb::flow::interface8::graph
clear()
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
-, tbb::pipeline
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::pipeline
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
cols()
-: tbb::blocked_range2d< RowValue, ColValue >
-, tbb::blocked_range3d< PageValue, RowValue, ColValue >
+: tbb::blocked_range2d< RowValue, ColValue >
+, tbb::blocked_range3d< PageValue, RowValue, ColValue >
concurrent_bounded_queue()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
concurrent_hash_map()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
concurrent_priority_queue()
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
concurrent_queue()
-: tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::strict_ppl::concurrent_queue< T, A >
concurrent_unordered_map()
-: tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+: tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
concurrent_unordered_multimap()
-: tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+: tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
concurrent_unordered_multiset()
-: tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+: tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
concurrent_unordered_set()
-: tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+: tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
concurrent_vector()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
const_accessor()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
const_iterator
-: tbb::blocked_range< Value >
+: tbb::blocked_range< Value >
const_reference
-: tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
construct()
-: tbb::tbb_allocator< T >
-, tbb::cache_aligned_allocator< T >
-, tbb::interface6::memory_pool_allocator< T, P >
+: tbb::tbb_allocator< T >
+, tbb::cache_aligned_allocator< T >
+, tbb::interface6::memory_pool_allocator< T, P >
continue_node()
-: tbb::flow::interface8::continue_node< Output >
+: tbb::flow::interface8::continue_node< Output >
continue_receiver()
-: tbb::flow::interface8::continue_receiver
+: tbb::flow::interface8::continue_receiver
count()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
crbegin()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
crend()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
current_thread_index()
-: tbb::interface7::task_arena
+: tbb::interface7::task_arena
diff --git a/doc/html/functions_0x64.html b/doc/html/functions_0x64.html
index 6b4476e494..77266444bf 100644
--- a/doc/html/functions_0x64.html
+++ b/doc/html/functions_0x64.html
@@ -75,46 +75,52 @@
- d -
deallocate()
-: tbb::cache_aligned_allocator< T >
-, tbb::interface6::memory_pool_allocator< T, P >
-, tbb::tbb_allocator< T >
-, tbb::scalable_allocator< T >
+: tbb::cache_aligned_allocator< T >
+, tbb::interface6::memory_pool_allocator< T, P >
+, tbb::tbb_allocator< T >
+, tbb::scalable_allocator< T >
debug_wait_until_empty()
-: tbb::interface7::task_arena
+: tbb::interface7::task_arena
decrement
-: tbb::flow::interface8::limiter_node< T >
+: tbb::flow::interface8::limiter_node< T >
decrement_wait_count()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
default_num_threads()
-: tbb::task_scheduler_init
+: tbb::task_scheduler_init
deferred
-: tbb::task_scheduler_init
+: tbb::task_scheduler_init
+
+dependency_predecessor_type
+: tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+
+dependency_successor_type
+: tbb::flow::interface8::sender< dependency_msg< T, Factory > >
destroy()
-: tbb::movable_exception< ExceptionData >
-, tbb::internal::tbb_exception_ptr
-, tbb::cache_aligned_allocator< T >
-, tbb::interface6::memory_pool_allocator< T, P >
-, tbb::tbb_allocator< T >
-, tbb::tbb_exception
-, tbb::captured_exception
+: tbb::tbb_exception
+, tbb::captured_exception
+, tbb::movable_exception< ExceptionData >
+, tbb::internal::tbb_exception_ptr
+, tbb::cache_aligned_allocator< T >
+, tbb::interface6::memory_pool_allocator< T, P >
+, tbb::tbb_allocator< T >
detach()
-: tbb::internal::tbb_thread_v3
+: tbb::internal::tbb_thread_v3
difference_type
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::concurrent_bounded_queue< T, A >
downgrade_to_reader()
-: tbb::spin_rw_mutex_v3::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
+: tbb::queuing_rw_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
diff --git a/doc/html/functions_0x65.html b/doc/html/functions_0x65.html
index 1379bf4aca..c28155ba4a 100644
--- a/doc/html/functions_0x65.html
+++ b/doc/html/functions_0x65.html
@@ -75,84 +75,84 @@
- e -
ec_bad_arg
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
ec_bad_call
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
ec_bad_lib
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
ec_bad_ver
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
ec_no_lib
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
ec_ok
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
em_abort
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
em_status
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
em_throw
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
emplace()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
emplace_back()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
empty()
-: tbb::blocked_range2d< RowValue, ColValue >
-, tbb::blocked_range3d< PageValue, RowValue, ColValue >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
-, tbb::blocked_range< Value >
+: tbb::blocked_range2d< RowValue, ColValue >
+, tbb::blocked_range3d< PageValue, RowValue, ColValue >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::blocked_range< Value >
end()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
, tbb::aligned_space< T, N >
-, tbb::blocked_range< Value >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::blocked_range< Value >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
enqueue()
-: tbb::interface7::task_arena
+: tbb::interface7::task_arena
enumerable_thread_specific()
-: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
erase()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
error_code
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
error_mode
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
exact_exception_propagation
-: tbb::filter
+: tbb::filter
exclude()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
execute()
-: tbb::flow::interface8::continue_receiver
-, tbb::interface7::task_arena
+: tbb::flow::interface8::continue_receiver
+, tbb::interface7::task_arena
, tbb::interface6::aggregator
execute_impl()
diff --git a/doc/html/functions_0x66.html b/doc/html/functions_0x66.html
index b7ec1d9a3f..1534290a04 100644
--- a/doc/html/functions_0x66.html
+++ b/doc/html/functions_0x66.html
@@ -75,34 +75,34 @@
- f -
filter_is_bound
-: tbb::filter
+: tbb::filter
filter_is_out_of_order
-: tbb::filter
+: tbb::filter
filter_is_serial
-: tbb::filter
+: tbb::filter
filter_may_emit_null
-: tbb::filter
+: tbb::filter
find()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
finish()
: tbb::interface6::aggregator_operation
fixed_pool()
-: tbb::interface6::fixed_pool
+: tbb::interface6::fixed_pool
forward_task()
-: tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::buffer_node< T, A >
front()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
function_node()
-: tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+: tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
diff --git a/doc/html/functions_0x67.html b/doc/html/functions_0x67.html
index e9ab88d147..b2830fe779 100644
--- a/doc/html/functions_0x67.html
+++ b/doc/html/functions_0x67.html
@@ -75,26 +75,26 @@
- g -
get_allocator()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::concurrent_vector< T, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::concurrent_vector< T, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
grainsize()
-: tbb::blocked_range< Value >
+: tbb::blocked_range< Value >
graph()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
graph_iterator()
-: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
grow_by()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
grow_to_at_least()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
diff --git a/doc/html/functions_0x68.html b/doc/html/functions_0x68.html
index 891903880e..8e4b1b7524 100644
--- a/doc/html/functions_0x68.html
+++ b/doc/html/functions_0x68.html
@@ -75,7 +75,7 @@
- h -
diff --git a/doc/html/functions_0x69.html b/doc/html/functions_0x69.html
index 8af7e7591d..b4745359ba 100644
--- a/doc/html/functions_0x69.html
+++ b/doc/html/functions_0x69.html
@@ -75,69 +75,69 @@
- i -
increment_wait_count()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
initialize()
-: tbb::interface7::task_arena
-, tbb::task_scheduler_init
-, tbb::interface7::task_arena
+: tbb::interface7::task_arena
+, tbb::task_scheduler_init
+, tbb::interface7::task_arena
input_type
-: tbb::flow::interface8::receiver< T >
-, tbb::flow::interface8::continue_receiver
+: tbb::flow::interface8::receiver< T >
+, tbb::flow::interface8::continue_receiver
insert()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
internal_construct()
-: tbb::spin_mutex
+: tbb::spin_mutex
internal_copy()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
internal_equal_range()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
internal_fast_find()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
internal_forward_task()
-: tbb::flow::interface8::queue_node< T, A >
-, tbb::flow::interface8::buffer_node< T, A >
-, tbb::flow::interface8::priority_queue_node< T, Compare, A >
+: tbb::flow::interface8::queue_node< T, A >
+, tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::priority_queue_node< T, Compare, A >
internal_reg_succ()
-: tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::buffer_node< T, A >
internal_rem_succ()
-: tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::buffer_node< T, A >
interval_t()
-: tbb::tick_count::interval_t
+: tbb::tick_count::interval_t
is_active()
-: tbb::interface7::task_arena
-, tbb::task_scheduler_init
+: tbb::interface7::task_arena
+, tbb::task_scheduler_init
is_cancelled()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
is_divisible()
-: tbb::blocked_range< Value >
-, tbb::blocked_range2d< RowValue, ColValue >
-, tbb::blocked_range3d< PageValue, RowValue, ColValue >
+: tbb::blocked_range< Value >
+, tbb::blocked_range2d< RowValue, ColValue >
+, tbb::blocked_range3d< PageValue, RowValue, ColValue >
is_observing()
-: tbb::internal::task_scheduler_observer_v3
+: tbb::internal::task_scheduler_observer_v3
is_splittable_in_proportion
-: tbb::blocked_range2d< RowValue, ColValue >
-, tbb::blocked_range3d< PageValue, RowValue, ColValue >
-, tbb::blocked_range< Value >
+: tbb::blocked_range2d< RowValue, ColValue >
+, tbb::blocked_range3d< PageValue, RowValue, ColValue >
+, tbb::blocked_range< Value >
is_writer
-: tbb::spin_rw_mutex_v3::scoped_lock
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
+: tbb::spin_rw_mutex_v3::scoped_lock
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
diff --git a/doc/html/functions_0x6a.html b/doc/html/functions_0x6a.html
index 40f40af503..8625b9b873 100644
--- a/doc/html/functions_0x6a.html
+++ b/doc/html/functions_0x6a.html
@@ -75,7 +75,7 @@
- j -
diff --git a/doc/html/functions_0x6c.html b/doc/html/functions_0x6c.html
index 48a2ddf40c..6748a1ec1b 100644
--- a/doc/html/functions_0x6c.html
+++ b/doc/html/functions_0x6c.html
@@ -75,28 +75,28 @@
- l -
limiter_node
-: tbb::flow::interface8::receiver< T >
-, tbb::flow::interface8::limiter_node< T >
+: tbb::flow::interface8::receiver< T >
+, tbb::flow::interface8::limiter_node< T >
load()
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
local()
-: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
lock()
-: tbb::recursive_mutex
-, tbb::spin_rw_mutex_v3
-, tbb::interface5::reader_writer_lock
-, tbb::spin_mutex
-, tbb::mutex
+: tbb::recursive_mutex
+, tbb::spin_rw_mutex_v3
+, tbb::interface5::reader_writer_lock
+, tbb::spin_mutex
+, tbb::mutex
lock_read()
-: tbb::spin_rw_mutex_v3
-, tbb::interface5::reader_writer_lock
+: tbb::spin_rw_mutex_v3
+, tbb::interface5::reader_writer_lock
lookup()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
diff --git a/doc/html/functions_0x6d.html b/doc/html/functions_0x6d.html
index d349b5cef4..02482370b1 100644
--- a/doc/html/functions_0x6d.html
+++ b/doc/html/functions_0x6d.html
@@ -75,36 +75,36 @@
- m -
make_filter
-: tbb::interface6::filter_t< T, U >
+: tbb::interface6::filter_t< T, U >
malloc_type
-: tbb::tbb_allocator< T >
+: tbb::tbb_allocator< T >
max_size()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::tbb_allocator< T >
-, tbb::concurrent_vector< T, A >
-, tbb::cache_aligned_allocator< T >
-, tbb::interface6::memory_pool_allocator< T, P >
-, tbb::scalable_allocator< T >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::tbb_allocator< T >
+, tbb::concurrent_vector< T, A >
+, tbb::cache_aligned_allocator< T >
+, tbb::interface6::memory_pool_allocator< T, P >
+, tbb::scalable_allocator< T >
may_sleep()
-: tbb::interface6::task_scheduler_observer
+: tbb::interface6::task_scheduler_observer
memory_pool()
-: tbb::interface6::memory_pool< Alloc >
+: tbb::interface6::memory_pool< Alloc >
move()
-: tbb::tbb_exception
-, tbb::movable_exception< ExceptionData >
-, tbb::captured_exception
+: tbb::tbb_exception
+, tbb::movable_exception< ExceptionData >
+, tbb::captured_exception
mutex
-: tbb::spin_rw_mutex_v3::scoped_lock
-, tbb::mutex
+: tbb::spin_rw_mutex_v3::scoped_lock
+, tbb::mutex
my_exception_data
-: tbb::movable_exception< ExceptionData >
+: tbb::movable_exception< ExceptionData >
diff --git a/doc/html/functions_0x6e.html b/doc/html/functions_0x6e.html
index d55aaf5f4e..5427c6c26f 100644
--- a/doc/html/functions_0x6e.html
+++ b/doc/html/functions_0x6e.html
@@ -75,16 +75,16 @@
- n -
diff --git a/doc/html/functions_0x6f.html b/doc/html/functions_0x6f.html
index e1c4b482b8..f8554fb768 100644
--- a/doc/html/functions_0x6f.html
+++ b/doc/html/functions_0x6f.html
@@ -75,70 +75,71 @@
- o -
observe()
-: tbb::internal::task_scheduler_observer_v3
-, tbb::interface6::task_scheduler_observer
+: tbb::internal::task_scheduler_observer_v3
+, tbb::interface6::task_scheduler_observer
on_scheduler_entry()
-: tbb::internal::task_scheduler_observer_v3
+: tbb::internal::task_scheduler_observer_v3
on_scheduler_exit()
-: tbb::internal::task_scheduler_observer_v3
+: tbb::internal::task_scheduler_observer_v3
+
+opencl_graph()
+: tbb::flow::interface8::opencl_graph
operator delete()
-: tbb::tbb_exception
+: tbb::tbb_exception
operator!=()
-: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
operator()()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
operator*()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor
-, tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+, tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
operator+
-: tbb::tick_count::interval_t
+: tbb::tick_count::interval_t
operator++()
-: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
operator+=()
-: tbb::tick_count::interval_t
+: tbb::tick_count::interval_t
operator-
-: tbb::tick_count::interval_t
-, tbb::tick_count
-, tbb::tick_count::interval_t
+: tbb::tick_count::interval_t
+, tbb::tick_count
operator-=()
-: tbb::tick_count::interval_t
+: tbb::tick_count::interval_t
operator->()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor
-, tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
operator=()
-: tbb::concurrent_vector< T, A >
-, tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
-, tbb::concurrent_vector< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::concurrent_vector< T, A >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::concurrent_vector< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::concurrent_vector< T, A >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
operator==()
-: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
operator[]()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
output_type
-: tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::sender< T >
+: tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::source_node< Output >
diff --git a/doc/html/functions_0x70.html b/doc/html/functions_0x70.html
index 398d45f82f..ec64969fa8 100644
--- a/doc/html/functions_0x70.html
+++ b/doc/html/functions_0x70.html
@@ -75,42 +75,42 @@
- p -
page_range_type
-: tbb::blocked_range3d< PageValue, RowValue, ColValue >
+: tbb::blocked_range3d< PageValue, RowValue, ColValue >
pages()
-: tbb::blocked_range3d< PageValue, RowValue, ColValue >
+: tbb::blocked_range3d< PageValue, RowValue, ColValue >
parallel_while()
-: tbb::parallel_while< Body >
+: tbb::parallel_while< Body >
pipeline()
-: tbb::pipeline
+: tbb::pipeline
pop()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
predecessor_type
-: tbb::flow::interface8::receiver< T >
-, tbb::flow::interface8::continue_receiver
+: tbb::flow::interface8::receiver< T >
+, tbb::flow::interface8::continue_receiver
priority_queue_node()
-: tbb::flow::interface8::priority_queue_node< T, Compare, A >
+: tbb::flow::interface8::priority_queue_node< T, Compare, A >
process()
: tbb::interface6::aggregator_ext< handler_type >
process_item()
-: tbb::thread_bound_filter
+: tbb::thread_bound_filter
push()
-: tbb::concurrent_bounded_queue< T, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::concurrent_bounded_queue< T, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
push_back()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
diff --git a/doc/html/functions_0x71.html b/doc/html/functions_0x71.html
index 839cc98ab8..92adcbed07 100644
--- a/doc/html/functions_0x71.html
+++ b/doc/html/functions_0x71.html
@@ -75,13 +75,13 @@
- q -
diff --git a/doc/html/functions_0x72.html b/doc/html/functions_0x72.html
index 8070c61cda..92d38850a3 100644
--- a/doc/html/functions_0x72.html
+++ b/doc/html/functions_0x72.html
@@ -75,98 +75,112 @@
- r -
range()
-: tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
rbegin()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
reader_writer_lock()
-: tbb::interface5::reader_writer_lock
+: tbb::interface5::reader_writer_lock
recursive_mutex()
-: tbb::recursive_mutex
+: tbb::recursive_mutex
reference
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
register_predecessor()
-: tbb::flow::interface8::receiver< T >
-, tbb::flow::interface8::continue_receiver
-, tbb::flow::interface8::limiter_node< T >
+: tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
+, tbb::flow::interface8::receiver< T >
+, tbb::flow::interface8::continue_receiver
+, tbb::flow::interface8::limiter_node< T >
+, tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
register_successor()
-: tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::overwrite_node< T >
-, tbb::flow::interface8::broadcast_node< T >
-, tbb::flow::interface8::buffer_node< T, A >
-, tbb::flow::interface8::limiter_node< T >
-, tbb::flow::interface8::sender< T >
+: tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::overwrite_node< T >
+, tbb::flow::interface8::broadcast_node< T >
+, tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::limiter_node< T >
+, tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+, tbb::flow::interface8::sender< dependency_msg< T, Factory > >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
rehash()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
release()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
-, tbb::mutex::scoped_lock
-, tbb::queuing_mutex::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::recursive_mutex::scoped_lock
-, tbb::spin_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
+: tbb::spin_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+, tbb::mutex::scoped_lock
+, tbb::queuing_mutex::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
+, tbb::recursive_mutex::scoped_lock
remove_predecessor()
-: tbb::flow::interface8::limiter_node< T >
-, tbb::flow::interface8::receiver< T >
-, tbb::flow::interface8::continue_receiver
+: tbb::flow::interface8::receiver< T >
+, tbb::flow::interface8::continue_receiver
+, tbb::flow::interface8::limiter_node< T >
+, tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+, tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
remove_successor()
-: tbb::flow::interface8::broadcast_node< T >
-, tbb::flow::interface8::sender< T >
-, tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::overwrite_node< T >
-, tbb::flow::interface8::buffer_node< T, A >
-, tbb::flow::interface8::limiter_node< T >
+: tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+, tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::overwrite_node< T >
+, tbb::flow::interface8::broadcast_node< T >
+, tbb::flow::interface8::limiter_node< T >
+, tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+, tbb::flow::interface8::sender< dependency_msg< T, Factory > >
+, tbb::flow::interface8::sender< T >
rend()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
reserve()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
reset_node()
-: tbb::flow::interface8::source_node< Output >
+: tbb::flow::interface8::source_node< Output >
+
+reset_receiver()
+: tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+, tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
resize()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
resolution()
-: tbb::tick_count
+: tbb::tick_count
root_task()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
row_range_type
-: tbb::blocked_range2d< RowValue, ColValue >
+: tbb::blocked_range2d< RowValue, ColValue >
rows()
-: tbb::blocked_range3d< PageValue, RowValue, ColValue >
-, tbb::blocked_range2d< RowValue, ColValue >
+: tbb::blocked_range2d< RowValue, ColValue >
+, tbb::blocked_range3d< PageValue, RowValue, ColValue >
run()
-: tbb::pipeline
-, tbb::flow::interface8::graph
-, tbb::pipeline
-, tbb::parallel_while< Body >
-, tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
+, tbb::pipeline
+, tbb::flow::interface8::graph
+, tbb::pipeline
+, tbb::parallel_while< Body >
run_and_put_task
-: tbb::flow::interface8::receiver< T >
+: tbb::flow::interface8::receiver< T >
runtime_loader()
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
diff --git a/doc/html/functions_0x73.html b/doc/html/functions_0x73.html
index c4e0fa6de4..12d14baa27 100644
--- a/doc/html/functions_0x73.html
+++ b/doc/html/functions_0x73.html
@@ -75,82 +75,82 @@
- s -
scoped_lock()
-: tbb::mutex::scoped_lock
-, tbb::queuing_mutex::scoped_lock
-, tbb::recursive_mutex::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::spin_mutex::scoped_lock
-, tbb::queuing_mutex::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
-, tbb::interface5::reader_writer_lock::scoped_lock
+: tbb::mutex::scoped_lock
+, tbb::queuing_mutex::scoped_lock
+, tbb::recursive_mutex::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
+, tbb::spin_mutex::scoped_lock
+, tbb::queuing_mutex::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
+, tbb::interface5::reader_writer_lock::scoped_lock
scoped_lock_read()
-: tbb::interface5::reader_writer_lock::scoped_lock_read
+: tbb::interface5::reader_writer_lock::scoped_lock_read
seconds()
-: tbb::tick_count::interval_t
+: tbb::tick_count::interval_t
sequencer_node()
-: tbb::flow::interface8::sequencer_node< T, A >
+: tbb::flow::interface8::sequencer_node< T, A >
set_capacity()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
set_state()
-: tbb::mutex
+: tbb::mutex
shrink_to_fit()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
size()
-: tbb::blocked_range< Value >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::blocked_range< Value >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
size_type
-: tbb::interface6::flattened2d< Container >
-, tbb::blocked_range< Value >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
+: tbb::interface6::flattened2d< Container >
+, tbb::blocked_range< Value >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
source_node()
-: tbb::flow::interface8::source_node< Output >
+: tbb::flow::interface8::source_node< Output >
spin_mutex()
-: tbb::spin_mutex
+: tbb::spin_mutex
spin_rw_mutex_v3()
-: tbb::spin_rw_mutex_v3
+: tbb::spin_rw_mutex_v3
start()
: tbb::interface6::aggregator_operation
start_routine()
-: tbb::internal::thread_closure_2< F, X, Y >
-, tbb::internal::thread_closure_1< F, X >
+: tbb::internal::thread_closure_2< F, X, Y >
+, tbb::internal::thread_closure_1< F, X >
state
-: tbb::spin_rw_mutex_v3
+: tbb::spin_rw_mutex_v3
status()
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
status_t
-: tbb::interface5::reader_writer_lock
+: tbb::interface5::reader_writer_lock
successor_type
-: tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::sender< T >
+: tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::sender< T >
swap()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::concurrent_vector< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::concurrent_vector< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
diff --git a/doc/html/functions_0x74.html b/doc/html/functions_0x74.html
index a2e60b531a..f4773b81fc 100644
--- a/doc/html/functions_0x74.html
+++ b/doc/html/functions_0x74.html
@@ -75,91 +75,100 @@
- t -
task_arena()
-: tbb::interface7::task_arena
+: tbb::interface7::task_arena
task_scheduler_observer()
-: tbb::interface6::task_scheduler_observer
+: tbb::interface6::task_scheduler_observer
task_scheduler_observer_v3()
-: tbb::internal::task_scheduler_observer_v3
+: tbb::internal::task_scheduler_observer_v3
tbb_thread_v3()
-: tbb::internal::tbb_thread_v3
+: tbb::internal::tbb_thread_v3
terminate()
-: tbb::interface7::task_arena
-, tbb::task_scheduler_init
+: tbb::interface7::task_arena
+, tbb::task_scheduler_init
thread_stack_size
-: tbb::task_scheduler_init
+: tbb::task_scheduler_init
throw_self()
-: tbb::internal::tbb_exception_ptr
-, tbb::tbb_exception
-, tbb::captured_exception
-, tbb::movable_exception< ExceptionData >
+: tbb::movable_exception< ExceptionData >
+, tbb::internal::tbb_exception_ptr
+, tbb::tbb_exception
+, tbb::captured_exception
tick_count()
-: tbb::tick_count
+: tbb::tick_count
try_acquire()
-: tbb::mutex::scoped_lock
-, tbb::queuing_mutex::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::recursive_mutex::scoped_lock
-, tbb::spin_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
+: tbb::mutex::scoped_lock
+, tbb::queuing_mutex::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
+, tbb::recursive_mutex::scoped_lock
+, tbb::spin_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
try_consume()
-: tbb::flow::interface8::sender< T >
-, tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
try_get()
-: tbb::flow::interface8::sender< T >
-, tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::overwrite_node< T >
-, tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::sender< dependency_msg< T, Factory > >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+, tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::overwrite_node< T >
try_lock()
-: tbb::interface5::reader_writer_lock
-, tbb::recursive_mutex
-, tbb::spin_mutex
-, tbb::spin_rw_mutex_v3
-, tbb::mutex
+: tbb::mutex
+, tbb::interface5::reader_writer_lock
+, tbb::recursive_mutex
+, tbb::spin_mutex
+, tbb::spin_rw_mutex_v3
try_lock_read()
-: tbb::interface5::reader_writer_lock
-, tbb::spin_rw_mutex_v3
+: tbb::interface5::reader_writer_lock
+, tbb::spin_rw_mutex_v3
try_pop()
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::concurrent_bounded_queue< T, A >
try_process_item()
-: tbb::thread_bound_filter
+: tbb::thread_bound_filter
try_push()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
try_put()
-: tbb::flow::interface8::receiver< T >
+: tbb::flow::interface8::receiver< T >
+, tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
try_put_task()
-: tbb::flow::interface8::broadcast_node< T >
-, tbb::flow::interface8::limiter_node< T >
-, tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::broadcast_node< T >
+, tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
+, tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+, tbb::flow::interface8::limiter_node< T >
+, tbb::flow::interface8::buffer_node< T, A >
try_release()
-: tbb::flow::interface8::sender< T >
-, tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+, tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::buffer_node< T, A >
try_reserve()
-: tbb::flow::interface8::buffer_node< T, A >
-, tbb::flow::interface8::sender< T >
-, tbb::flow::interface8::source_node< Output >
+: tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+, tbb::flow::interface8::sender< dependency_msg< T, Factory > >
+, tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::source_node< Output >
diff --git a/doc/html/functions_0x75.html b/doc/html/functions_0x75.html
index 1bfb2d5bac..717e182cbe 100644
--- a/doc/html/functions_0x75.html
+++ b/doc/html/functions_0x75.html
@@ -75,18 +75,18 @@
- u -
unlock()
-: tbb::mutex
-, tbb::interface5::reader_writer_lock
-, tbb::spin_mutex
-, tbb::spin_rw_mutex_v3
-, tbb::recursive_mutex
+: tbb::mutex
+, tbb::interface5::reader_writer_lock
+, tbb::spin_mutex
+, tbb::spin_rw_mutex_v3
+, tbb::recursive_mutex
unsafe_size()
-: tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::strict_ppl::concurrent_queue< T, A >
upgrade_to_writer()
-: tbb::queuing_rw_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
+: tbb::queuing_rw_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
diff --git a/doc/html/functions_0x76.html b/doc/html/functions_0x76.html
index 8ebb821d13..6a4d31aa29 100644
--- a/doc/html/functions_0x76.html
+++ b/doc/html/functions_0x76.html
@@ -75,11 +75,11 @@
- v -
value_type
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
-, tbb::parallel_while< Body >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+, tbb::parallel_while< Body >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor
diff --git a/doc/html/functions_0x77.html b/doc/html/functions_0x77.html
index 2fc979231f..7d769ff1fb 100644
--- a/doc/html/functions_0x77.html
+++ b/doc/html/functions_0x77.html
@@ -75,15 +75,15 @@
- w -
diff --git a/doc/html/functions_0x7e.html b/doc/html/functions_0x7e.html
index 187cb394b6..e13a26c4d4 100644
--- a/doc/html/functions_0x7e.html
+++ b/doc/html/functions_0x7e.html
@@ -75,88 +75,91 @@
- ~ -
~combinable()
-: tbb::combinable< T >
+: tbb::combinable< T >
~concurrent_bounded_queue()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
~concurrent_hash_map()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
~concurrent_queue()
-: tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::strict_ppl::concurrent_queue< T, A >
~concurrent_vector()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
~const_accessor()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
~continue_receiver()
-: tbb::flow::interface8::continue_receiver
+: tbb::flow::interface8::continue_receiver
~enumerable_thread_specific()
-: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
~fixed_pool()
-: tbb::interface6::fixed_pool
+: tbb::interface6::fixed_pool
~graph()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
~memory_pool()
-: tbb::interface6::memory_pool< Alloc >
+: tbb::interface6::memory_pool< Alloc >
+
+~opencl_graph()
+: tbb::flow::interface8::opencl_graph
~parallel_while()
-: tbb::parallel_while< Body >
+: tbb::parallel_while< Body >
~pipeline()
-: tbb::pipeline
+: tbb::pipeline
~queuing_rw_mutex()
-: tbb::queuing_rw_mutex
+: tbb::queuing_rw_mutex
~reader_writer_lock()
-: tbb::interface5::reader_writer_lock
+: tbb::interface5::reader_writer_lock
~receiver()
-: tbb::flow::interface8::receiver< T >
+: tbb::flow::interface8::receiver< T >
~runtime_loader()
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
~scoped_lock()
-: tbb::spin_mutex::scoped_lock
-, tbb::mutex::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::interface5::reader_writer_lock::scoped_lock
-, tbb::recursive_mutex::scoped_lock
-, tbb::queuing_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
+: tbb::mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
+, tbb::queuing_mutex::scoped_lock
+, tbb::interface5::reader_writer_lock::scoped_lock
+, tbb::recursive_mutex::scoped_lock
+, tbb::spin_mutex::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
~scoped_lock_read()
-: tbb::interface5::reader_writer_lock::scoped_lock_read
+: tbb::interface5::reader_writer_lock::scoped_lock_read
~sequencer_node()
-: tbb::flow::interface8::sequencer_node< T, A >
+: tbb::flow::interface8::sequencer_node< T, A >
~source_node()
-: tbb::flow::interface8::source_node< Output >
+: tbb::flow::interface8::source_node< Output >
~spin_rw_mutex_v3()
-: tbb::spin_rw_mutex_v3
+: tbb::spin_rw_mutex_v3
~task_arena()
-: tbb::interface7::task_arena
+: tbb::interface7::task_arena
~task_scheduler_init()
-: tbb::task_scheduler_init
+: tbb::task_scheduler_init
~task_scheduler_observer()
-: tbb::interface6::task_scheduler_observer
+: tbb::interface6::task_scheduler_observer
~task_scheduler_observer_v3()
-: tbb::internal::task_scheduler_observer_v3
+: tbb::internal::task_scheduler_observer_v3
diff --git a/doc/html/functions_enum.html b/doc/html/functions_enum.html
index 5256249c2c..ac40448d25 100644
--- a/doc/html/functions_enum.html
+++ b/doc/html/functions_enum.html
@@ -46,16 +46,16 @@
diff --git a/doc/html/functions_eval.html b/doc/html/functions_eval.html
index a1ed5c8afe..e30318433d 100644
--- a/doc/html/functions_eval.html
+++ b/doc/html/functions_eval.html
@@ -46,31 +46,31 @@
diff --git a/doc/html/functions_func.html b/doc/html/functions_func.html
index 25ba6e47a5..e5bb6191fb 100644
--- a/doc/html/functions_func.html
+++ b/doc/html/functions_func.html
@@ -74,53 +74,59 @@
- a -
abort()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
acquire()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
-, tbb::queuing_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::mutex::scoped_lock
-, tbb::recursive_mutex::scoped_lock
-, tbb::spin_mutex::scoped_lock
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
+, tbb::queuing_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
+, tbb::mutex::scoped_lock
+, tbb::recursive_mutex::scoped_lock
+, tbb::spin_mutex::scoped_lock
activate()
-: tbb::flow::interface8::source_node< Output >
+: tbb::flow::interface8::source_node< Output >
add()
-: tbb::parallel_do_feeder< Item >
-, tbb::parallel_while< Body >
+: tbb::parallel_do_feeder< Item >
+, tbb::parallel_while< Body >
add_filter()
-: tbb::pipeline
+: tbb::pipeline
allocate()
-: tbb::tbb_allocator< T >
-, tbb::internal::tbb_exception_ptr
-, tbb::cache_aligned_allocator< T >
-, tbb::interface6::memory_pool_allocator< T, P >
-, tbb::scalable_allocator< T >
+: tbb::tbb_allocator< T >
+, tbb::internal::tbb_exception_ptr
+, tbb::cache_aligned_allocator< T >
+, tbb::interface6::memory_pool_allocator< T, P >
+, tbb::scalable_allocator< T >
allocator_type()
-: tbb::tbb_allocator< T >
+: tbb::tbb_allocator< T >
assign()
-: tbb::concurrent_vector< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::concurrent_vector< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::concurrent_vector< T, A >
-async_node()
-: tbb::flow::interface8::async_node< Input, Output, Allocator >
+ async_commit()
+: tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+, tbb::flow::interface8::internal::async_gateway< Output >
+
+async_reserve()
+: tbb::flow::interface8::internal::async_gateway< Output >
+, tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
async_try_put()
-: tbb::flow::interface8::async_node< Input, Output, Allocator >
-, tbb::flow::interface8::internal::async_gateway< Output >
+: tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+, tbb::flow::interface8::internal::async_gateway< Output >
at()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
+
+available_devices()
+: tbb::flow::interface8::opencl_graph
diff --git a/doc/html/functions_func_0x62.html b/doc/html/functions_func_0x62.html
index 0b991a65a5..b0b3328330 100644
--- a/doc/html/functions_func_0x62.html
+++ b/doc/html/functions_func_0x62.html
@@ -74,26 +74,26 @@
- b -
back()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
begin()
-: tbb::blocked_range< Value >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
-, tbb::flow::interface8::graph
-, tbb::concurrent_vector< T, A >
-, tbb::flow::interface8::graph
+: tbb::blocked_range< Value >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::flow::interface8::graph
+, tbb::concurrent_vector< T, A >
+, tbb::flow::interface8::graph
, tbb::aligned_space< T, N >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
blocked_range()
-: tbb::blocked_range< Value >
+: tbb::blocked_range< Value >
bucket_count()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
buffer_node()
-: tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::buffer_node< T, A >
diff --git a/doc/html/functions_func_0x63.html b/doc/html/functions_func_0x63.html
index 3b5acd8299..1d77406cdb 100644
--- a/doc/html/functions_func_0x63.html
+++ b/doc/html/functions_func_0x63.html
@@ -74,82 +74,82 @@
- c -
capacity()
-: tbb::concurrent_bounded_queue< T, A >
-, tbb::concurrent_vector< T, A >
+: tbb::concurrent_bounded_queue< T, A >
+, tbb::concurrent_vector< T, A >
cbegin()
-: tbb::flow::interface8::graph
-, tbb::concurrent_vector< T, A >
+: tbb::flow::interface8::graph
+, tbb::concurrent_vector< T, A >
cend()
-: tbb::concurrent_vector< T, A >
-, tbb::flow::interface8::graph
+: tbb::concurrent_vector< T, A >
+, tbb::flow::interface8::graph
clear()
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
-, tbb::pipeline
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::pipeline
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
cols()
-: tbb::blocked_range2d< RowValue, ColValue >
-, tbb::blocked_range3d< PageValue, RowValue, ColValue >
+: tbb::blocked_range2d< RowValue, ColValue >
+, tbb::blocked_range3d< PageValue, RowValue, ColValue >
concurrent_bounded_queue()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
concurrent_hash_map()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
concurrent_priority_queue()
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
concurrent_queue()
-: tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::strict_ppl::concurrent_queue< T, A >
concurrent_unordered_map()
-: tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+: tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
concurrent_unordered_multimap()
-: tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+: tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
concurrent_unordered_multiset()
-: tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+: tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
concurrent_unordered_set()
-: tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+: tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
concurrent_vector()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
const_accessor()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
construct()
-: tbb::tbb_allocator< T >
-, tbb::cache_aligned_allocator< T >
-, tbb::interface6::memory_pool_allocator< T, P >
+: tbb::tbb_allocator< T >
+, tbb::cache_aligned_allocator< T >
+, tbb::interface6::memory_pool_allocator< T, P >
continue_node()
-: tbb::flow::interface8::continue_node< Output >
+: tbb::flow::interface8::continue_node< Output >
continue_receiver()
-: tbb::flow::interface8::continue_receiver
+: tbb::flow::interface8::continue_receiver
count()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
crbegin()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
crend()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
current_thread_index()
-: tbb::interface7::task_arena
+: tbb::interface7::task_arena
diff --git a/doc/html/functions_func_0x64.html b/doc/html/functions_func_0x64.html
index 2cbbdeda3d..c8025fe531 100644
--- a/doc/html/functions_func_0x64.html
+++ b/doc/html/functions_func_0x64.html
@@ -74,35 +74,35 @@
- d -
deallocate()
-: tbb::cache_aligned_allocator< T >
-, tbb::interface6::memory_pool_allocator< T, P >
-, tbb::tbb_allocator< T >
-, tbb::scalable_allocator< T >
+: tbb::cache_aligned_allocator< T >
+, tbb::interface6::memory_pool_allocator< T, P >
+, tbb::tbb_allocator< T >
+, tbb::scalable_allocator< T >
debug_wait_until_empty()
-: tbb::interface7::task_arena
+: tbb::interface7::task_arena
decrement_wait_count()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
default_num_threads()
-: tbb::task_scheduler_init
+: tbb::task_scheduler_init
destroy()
-: tbb::tbb_exception
-, tbb::internal::tbb_exception_ptr
-, tbb::cache_aligned_allocator< T >
-, tbb::interface6::memory_pool_allocator< T, P >
-, tbb::movable_exception< ExceptionData >
-, tbb::tbb_allocator< T >
-, tbb::captured_exception
+: tbb::tbb_exception
+, tbb::internal::tbb_exception_ptr
+, tbb::cache_aligned_allocator< T >
+, tbb::interface6::memory_pool_allocator< T, P >
+, tbb::movable_exception< ExceptionData >
+, tbb::tbb_allocator< T >
+, tbb::captured_exception
detach()
-: tbb::internal::tbb_thread_v3
+: tbb::internal::tbb_thread_v3
downgrade_to_reader()
-: tbb::spin_rw_mutex_v3::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
+: tbb::spin_rw_mutex_v3::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
diff --git a/doc/html/functions_func_0x65.html b/doc/html/functions_func_0x65.html
index 5592c052a1..36618b47e7 100644
--- a/doc/html/functions_func_0x65.html
+++ b/doc/html/functions_func_0x65.html
@@ -74,49 +74,49 @@
- e -
emplace()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
emplace_back()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
empty()
-: tbb::blocked_range3d< PageValue, RowValue, ColValue >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::blocked_range< Value >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::blocked_range2d< RowValue, ColValue >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::blocked_range3d< PageValue, RowValue, ColValue >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::blocked_range< Value >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::blocked_range2d< RowValue, ColValue >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
end()
: tbb::aligned_space< T, N >
-, tbb::flow::interface8::graph
-, tbb::blocked_range< Value >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
-, tbb::flow::interface8::graph
+, tbb::flow::interface8::graph
+, tbb::blocked_range< Value >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::flow::interface8::graph
enqueue()
-: tbb::interface7::task_arena
+: tbb::interface7::task_arena
enumerable_thread_specific()
-: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
erase()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
exclude()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
execute()
-: tbb::interface7::task_arena
-, tbb::flow::interface8::continue_receiver
-, tbb::interface7::task_arena
+: tbb::interface7::task_arena
+, tbb::flow::interface8::continue_receiver
+, tbb::interface7::task_arena
, tbb::interface6::aggregator
execute_impl()
diff --git a/doc/html/functions_func_0x66.html b/doc/html/functions_func_0x66.html
index 072857aa40..e7253a7d11 100644
--- a/doc/html/functions_func_0x66.html
+++ b/doc/html/functions_func_0x66.html
@@ -74,22 +74,22 @@
- f -
find()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
finish()
: tbb::interface6::aggregator_operation
fixed_pool()
-: tbb::interface6::fixed_pool
+: tbb::interface6::fixed_pool
forward_task()
-: tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::buffer_node< T, A >
front()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
function_node()
-: tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
+: tbb::flow::interface8::function_node< Input, Output, Policy, Allocator >
diff --git a/doc/html/functions_func_0x67.html b/doc/html/functions_func_0x67.html
index f4f7e7c594..0495f54d91 100644
--- a/doc/html/functions_func_0x67.html
+++ b/doc/html/functions_func_0x67.html
@@ -74,26 +74,26 @@
- g -
get_allocator()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::concurrent_vector< T, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::concurrent_vector< T, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
grainsize()
-: tbb::blocked_range< Value >
+: tbb::blocked_range< Value >
graph()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
graph_iterator()
-: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
grow_by()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
grow_to_at_least()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
diff --git a/doc/html/functions_func_0x68.html b/doc/html/functions_func_0x68.html
index ebcbd0d639..d15d983b54 100644
--- a/doc/html/functions_func_0x68.html
+++ b/doc/html/functions_func_0x68.html
@@ -74,7 +74,7 @@
- h -
diff --git a/doc/html/functions_func_0x69.html b/doc/html/functions_func_0x69.html
index e0418531cf..1b41f98af8 100644
--- a/doc/html/functions_func_0x69.html
+++ b/doc/html/functions_func_0x69.html
@@ -74,59 +74,59 @@
- i -
increment_wait_count()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
initialize()
-: tbb::interface7::task_arena
-, tbb::task_scheduler_init
-, tbb::interface7::task_arena
+: tbb::interface7::task_arena
+, tbb::task_scheduler_init
+, tbb::interface7::task_arena
insert()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
internal_construct()
-: tbb::spin_mutex
+: tbb::spin_mutex
internal_copy()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
internal_equal_range()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
internal_fast_find()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
internal_forward_task()
-: tbb::flow::interface8::buffer_node< T, A >
-, tbb::flow::interface8::queue_node< T, A >
-, tbb::flow::interface8::priority_queue_node< T, Compare, A >
+: tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::queue_node< T, A >
+, tbb::flow::interface8::priority_queue_node< T, Compare, A >
internal_reg_succ()
-: tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::buffer_node< T, A >
internal_rem_succ()
-: tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::buffer_node< T, A >
interval_t()
-: tbb::tick_count::interval_t
+: tbb::tick_count::interval_t
is_active()
-: tbb::interface7::task_arena
-, tbb::task_scheduler_init
+: tbb::interface7::task_arena
+, tbb::task_scheduler_init
is_cancelled()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
is_divisible()
-: tbb::blocked_range< Value >
-, tbb::blocked_range2d< RowValue, ColValue >
-, tbb::blocked_range3d< PageValue, RowValue, ColValue >
+: tbb::blocked_range< Value >
+, tbb::blocked_range2d< RowValue, ColValue >
+, tbb::blocked_range3d< PageValue, RowValue, ColValue >
is_observing()
-: tbb::internal::task_scheduler_observer_v3
+: tbb::internal::task_scheduler_observer_v3
is_writer()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
diff --git a/doc/html/functions_func_0x6a.html b/doc/html/functions_func_0x6a.html
index bd28be0442..3910928924 100644
--- a/doc/html/functions_func_0x6a.html
+++ b/doc/html/functions_func_0x6a.html
@@ -74,7 +74,7 @@
- j -
diff --git a/doc/html/functions_func_0x6c.html b/doc/html/functions_func_0x6c.html
index 6dc10e9d31..e843609b9b 100644
--- a/doc/html/functions_func_0x6c.html
+++ b/doc/html/functions_func_0x6c.html
@@ -74,27 +74,27 @@
- l -
limiter_node()
-: tbb::flow::interface8::limiter_node< T >
+: tbb::flow::interface8::limiter_node< T >
load()
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
local()
-: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
lock()
-: tbb::recursive_mutex
-, tbb::spin_mutex
-, tbb::interface5::reader_writer_lock
-, tbb::spin_rw_mutex_v3
-, tbb::mutex
+: tbb::recursive_mutex
+, tbb::spin_mutex
+, tbb::interface5::reader_writer_lock
+, tbb::spin_rw_mutex_v3
+, tbb::mutex
lock_read()
-: tbb::interface5::reader_writer_lock
-, tbb::spin_rw_mutex_v3
+: tbb::interface5::reader_writer_lock
+, tbb::spin_rw_mutex_v3
lookup()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
diff --git a/doc/html/functions_func_0x6d.html b/doc/html/functions_func_0x6d.html
index 38951b2adb..4a33a0263d 100644
--- a/doc/html/functions_func_0x6d.html
+++ b/doc/html/functions_func_0x6d.html
@@ -74,26 +74,26 @@
- m -
max_size()
-: tbb::cache_aligned_allocator< T >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::interface6::memory_pool_allocator< T, P >
-, tbb::scalable_allocator< T >
-, tbb::concurrent_vector< T, A >
-, tbb::tbb_allocator< T >
+: tbb::cache_aligned_allocator< T >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::interface6::memory_pool_allocator< T, P >
+, tbb::scalable_allocator< T >
+, tbb::concurrent_vector< T, A >
+, tbb::tbb_allocator< T >
may_sleep()
-: tbb::interface6::task_scheduler_observer
+: tbb::interface6::task_scheduler_observer
memory_pool()
-: tbb::interface6::memory_pool< Alloc >
+: tbb::interface6::memory_pool< Alloc >
move()
-: tbb::movable_exception< ExceptionData >
-, tbb::captured_exception
-, tbb::tbb_exception
+: tbb::movable_exception< ExceptionData >
+, tbb::captured_exception
+, tbb::tbb_exception
mutex()
-: tbb::mutex
+: tbb::mutex
diff --git a/doc/html/functions_func_0x6e.html b/doc/html/functions_func_0x6e.html
index 41945b98a7..5ce7b35c98 100644
--- a/doc/html/functions_func_0x6e.html
+++ b/doc/html/functions_func_0x6e.html
@@ -74,12 +74,12 @@
- n -
diff --git a/doc/html/functions_func_0x6f.html b/doc/html/functions_func_0x6f.html
index 80bbfa5e56..94a0dfb5d5 100644
--- a/doc/html/functions_func_0x6f.html
+++ b/doc/html/functions_func_0x6f.html
@@ -74,59 +74,60 @@
- o -
observe()
-: tbb::internal::task_scheduler_observer_v3
-, tbb::interface6::task_scheduler_observer
+: tbb::internal::task_scheduler_observer_v3
+, tbb::interface6::task_scheduler_observer
on_scheduler_entry()
-: tbb::internal::task_scheduler_observer_v3
+: tbb::internal::task_scheduler_observer_v3
on_scheduler_exit()
-: tbb::internal::task_scheduler_observer_v3
+: tbb::internal::task_scheduler_observer_v3
+
+opencl_graph()
+: tbb::flow::interface8::opencl_graph
operator delete()
-: tbb::tbb_exception
+: tbb::tbb_exception
operator!=()
-: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
operator()()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor
operator*()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor
-, tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+, tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
operator++()
-: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
operator+=()
-: tbb::tick_count::interval_t
+: tbb::tick_count::interval_t
operator-=()
-: tbb::tick_count::interval_t
+: tbb::tick_count::interval_t
operator->()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor
-, tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor
operator=()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::concurrent_vector< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::concurrent_vector< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::concurrent_vector< T, A >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
operator==()
-: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+: tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
operator[]()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
diff --git a/doc/html/functions_func_0x70.html b/doc/html/functions_func_0x70.html
index b02723f3cf..7fd04d8edd 100644
--- a/doc/html/functions_func_0x70.html
+++ b/doc/html/functions_func_0x70.html
@@ -74,34 +74,34 @@
- p -
pages()
-: tbb::blocked_range3d< PageValue, RowValue, ColValue >
+: tbb::blocked_range3d< PageValue, RowValue, ColValue >
parallel_while()
-: tbb::parallel_while< Body >
+: tbb::parallel_while< Body >
pipeline()
-: tbb::pipeline
+: tbb::pipeline
pop()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
priority_queue_node()
-: tbb::flow::interface8::priority_queue_node< T, Compare, A >
+: tbb::flow::interface8::priority_queue_node< T, Compare, A >
process()
: tbb::interface6::aggregator_ext< handler_type >
process_item()
-: tbb::thread_bound_filter
+: tbb::thread_bound_filter
push()
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
push_back()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
diff --git a/doc/html/functions_func_0x71.html b/doc/html/functions_func_0x71.html
index afe80ca044..f45709702e 100644
--- a/doc/html/functions_func_0x71.html
+++ b/doc/html/functions_func_0x71.html
@@ -74,13 +74,13 @@
- q -
diff --git a/doc/html/functions_func_0x72.html b/doc/html/functions_func_0x72.html
index 34a23a4f2c..2887f8e056 100644
--- a/doc/html/functions_func_0x72.html
+++ b/doc/html/functions_func_0x72.html
@@ -74,87 +74,101 @@
- r -
range()
-: tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
rbegin()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
reader_writer_lock()
-: tbb::interface5::reader_writer_lock
+: tbb::interface5::reader_writer_lock
recursive_mutex()
-: tbb::recursive_mutex
+: tbb::recursive_mutex
register_predecessor()
-: tbb::flow::interface8::receiver< T >
-, tbb::flow::interface8::continue_receiver
-, tbb::flow::interface8::limiter_node< T >
+: tbb::flow::interface8::receiver< T >
+, tbb::flow::interface8::continue_receiver
+, tbb::flow::interface8::limiter_node< T >
+, tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+, tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
register_successor()
-: tbb::flow::interface8::buffer_node< T, A >
-, tbb::flow::interface8::limiter_node< T >
-, tbb::flow::interface8::sender< T >
-, tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::overwrite_node< T >
-, tbb::flow::interface8::broadcast_node< T >
+: tbb::flow::interface8::overwrite_node< T >
+, tbb::flow::interface8::broadcast_node< T >
+, tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::limiter_node< T >
+, tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+, tbb::flow::interface8::sender< dependency_msg< T, Factory > >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+, tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::source_node< Output >
rehash()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
release()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
-, tbb::mutex::scoped_lock
-, tbb::queuing_mutex::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::recursive_mutex::scoped_lock
-, tbb::spin_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+, tbb::mutex::scoped_lock
+, tbb::queuing_mutex::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
+, tbb::recursive_mutex::scoped_lock
+, tbb::spin_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
remove_predecessor()
-: tbb::flow::interface8::receiver< T >
-, tbb::flow::interface8::continue_receiver
-, tbb::flow::interface8::limiter_node< T >
+: tbb::flow::interface8::continue_receiver
+, tbb::flow::interface8::limiter_node< T >
+, tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+, tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
+, tbb::flow::interface8::receiver< T >
remove_successor()
-: tbb::flow::interface8::broadcast_node< T >
-, tbb::flow::interface8::buffer_node< T, A >
-, tbb::flow::interface8::limiter_node< T >
-, tbb::flow::interface8::overwrite_node< T >
-, tbb::flow::interface8::sender< T >
-, tbb::flow::interface8::source_node< Output >
+: tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::overwrite_node< T >
+, tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::limiter_node< T >
+, tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+, tbb::flow::interface8::broadcast_node< T >
+, tbb::flow::interface8::sender< dependency_msg< T, Factory > >
rend()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
reserve()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
reset_node()
-: tbb::flow::interface8::source_node< Output >
+: tbb::flow::interface8::source_node< Output >
+
+reset_receiver()
+: tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+, tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
resize()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
resolution()
-: tbb::tick_count
+: tbb::tick_count
root_task()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
rows()
-: tbb::blocked_range2d< RowValue, ColValue >
-, tbb::blocked_range3d< PageValue, RowValue, ColValue >
+: tbb::blocked_range3d< PageValue, RowValue, ColValue >
+, tbb::blocked_range2d< RowValue, ColValue >
run()
-: tbb::pipeline
-, tbb::flow::interface8::graph
-, tbb::pipeline
-, tbb::flow::interface8::graph
-, tbb::parallel_while< Body >
+: tbb::flow::interface8::graph
+, tbb::pipeline
+, tbb::parallel_while< Body >
+, tbb::pipeline
+, tbb::flow::interface8::graph
runtime_loader()
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
diff --git a/doc/html/functions_func_0x73.html b/doc/html/functions_func_0x73.html
index fdb0987205..eac67a2387 100644
--- a/doc/html/functions_func_0x73.html
+++ b/doc/html/functions_func_0x73.html
@@ -74,65 +74,65 @@
- s -
scoped_lock()
-: tbb::mutex::scoped_lock
-, tbb::queuing_mutex::scoped_lock
-, tbb::recursive_mutex::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::spin_mutex::scoped_lock
-, tbb::queuing_mutex::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
-, tbb::interface5::reader_writer_lock::scoped_lock
+: tbb::mutex::scoped_lock
+, tbb::queuing_mutex::scoped_lock
+, tbb::recursive_mutex::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
+, tbb::spin_mutex::scoped_lock
+, tbb::queuing_mutex::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
+, tbb::interface5::reader_writer_lock::scoped_lock
scoped_lock_read()
-: tbb::interface5::reader_writer_lock::scoped_lock_read
+: tbb::interface5::reader_writer_lock::scoped_lock_read
seconds()
-: tbb::tick_count::interval_t
+: tbb::tick_count::interval_t
sequencer_node()
-: tbb::flow::interface8::sequencer_node< T, A >
+: tbb::flow::interface8::sequencer_node< T, A >
set_capacity()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
set_state()
-: tbb::mutex
+: tbb::mutex
shrink_to_fit()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
size()
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::blocked_range< Value >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::concurrent_vector< T, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::blocked_range< Value >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::concurrent_vector< T, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
source_node()
-: tbb::flow::interface8::source_node< Output >
+: tbb::flow::interface8::source_node< Output >
spin_mutex()
-: tbb::spin_mutex
+: tbb::spin_mutex
spin_rw_mutex_v3()
-: tbb::spin_rw_mutex_v3
+: tbb::spin_rw_mutex_v3
start()
: tbb::interface6::aggregator_operation
start_routine()
-: tbb::internal::thread_closure_1< F, X >
-, tbb::internal::thread_closure_2< F, X, Y >
+: tbb::internal::thread_closure_1< F, X >
+, tbb::internal::thread_closure_2< F, X, Y >
status()
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
swap()
-: tbb::concurrent_vector< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::concurrent_vector< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
diff --git a/doc/html/functions_func_0x74.html b/doc/html/functions_func_0x74.html
index 2701b61db5..751063fdeb 100644
--- a/doc/html/functions_func_0x74.html
+++ b/doc/html/functions_func_0x74.html
@@ -74,88 +74,97 @@
- t -
task_arena()
-: tbb::interface7::task_arena
+: tbb::interface7::task_arena
task_scheduler_observer()
-: tbb::interface6::task_scheduler_observer
+: tbb::interface6::task_scheduler_observer
task_scheduler_observer_v3()
-: tbb::internal::task_scheduler_observer_v3
+: tbb::internal::task_scheduler_observer_v3
tbb_thread_v3()
-: tbb::internal::tbb_thread_v3
+: tbb::internal::tbb_thread_v3
terminate()
-: tbb::interface7::task_arena
-, tbb::task_scheduler_init
+: tbb::interface7::task_arena
+, tbb::task_scheduler_init
throw_self()
-: tbb::tbb_exception
-, tbb::captured_exception
-, tbb::movable_exception< ExceptionData >
-, tbb::internal::tbb_exception_ptr
+: tbb::internal::tbb_exception_ptr
+, tbb::tbb_exception
+, tbb::captured_exception
+, tbb::movable_exception< ExceptionData >
tick_count()
-: tbb::tick_count
+: tbb::tick_count
try_acquire()
-: tbb::mutex::scoped_lock
-, tbb::queuing_mutex::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::recursive_mutex::scoped_lock
-, tbb::spin_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
+: tbb::mutex::scoped_lock
+, tbb::queuing_mutex::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
+, tbb::recursive_mutex::scoped_lock
+, tbb::spin_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
try_consume()
-: tbb::flow::interface8::sender< T >
-, tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
try_get()
-: tbb::flow::interface8::sender< T >
-, tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::overwrite_node< T >
-, tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::sender< dependency_msg< T, Factory > >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+, tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::overwrite_node< T >
+, tbb::flow::interface8::buffer_node< T, A >
try_lock()
-: tbb::interface5::reader_writer_lock
-, tbb::recursive_mutex
-, tbb::spin_mutex
-, tbb::spin_rw_mutex_v3
-, tbb::mutex
+: tbb::mutex
+, tbb::interface5::reader_writer_lock
+, tbb::recursive_mutex
+, tbb::spin_mutex
+, tbb::spin_rw_mutex_v3
try_lock_read()
-: tbb::spin_rw_mutex_v3
-, tbb::interface5::reader_writer_lock
+: tbb::spin_rw_mutex_v3
+, tbb::interface5::reader_writer_lock
try_pop()
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
try_process_item()
-: tbb::thread_bound_filter
+: tbb::thread_bound_filter
try_push()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
try_put()
-: tbb::flow::interface8::receiver< T >
+: tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+, tbb::flow::interface8::receiver< T >
try_put_task()
-: tbb::flow::interface8::broadcast_node< T >
-, tbb::flow::interface8::limiter_node< T >
-, tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
+, tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+, tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::limiter_node< T >
+, tbb::flow::interface8::broadcast_node< T >
try_release()
-: tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::buffer_node< T, A >
-, tbb::flow::interface8::sender< T >
+: tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+, tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::source_node< Output >
try_reserve()
-: tbb::flow::interface8::sender< T >
-, tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::buffer_node< T, A >
+: tbb::flow::interface8::buffer_node< T, A >
+, tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+, tbb::flow::interface8::sender< T >
+, tbb::flow::interface8::sender< dependency_msg< T, Factory > >
diff --git a/doc/html/functions_func_0x75.html b/doc/html/functions_func_0x75.html
index 17bcd77893..f6b59b5562 100644
--- a/doc/html/functions_func_0x75.html
+++ b/doc/html/functions_func_0x75.html
@@ -74,18 +74,18 @@
- u -
unlock()
-: tbb::mutex
-, tbb::interface5::reader_writer_lock
-, tbb::spin_mutex
-, tbb::spin_rw_mutex_v3
-, tbb::recursive_mutex
+: tbb::mutex
+, tbb::interface5::reader_writer_lock
+, tbb::spin_mutex
+, tbb::spin_rw_mutex_v3
+, tbb::recursive_mutex
unsafe_size()
-: tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::strict_ppl::concurrent_queue< T, A >
upgrade_to_writer()
-: tbb::queuing_rw_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
+: tbb::queuing_rw_mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
diff --git a/doc/html/functions_func_0x77.html b/doc/html/functions_func_0x77.html
index 83de221287..f2db5b4176 100644
--- a/doc/html/functions_func_0x77.html
+++ b/doc/html/functions_func_0x77.html
@@ -74,15 +74,15 @@
- w -
diff --git a/doc/html/functions_func_0x7e.html b/doc/html/functions_func_0x7e.html
index 5c03d97e6f..8e5b9847bb 100644
--- a/doc/html/functions_func_0x7e.html
+++ b/doc/html/functions_func_0x7e.html
@@ -74,88 +74,91 @@
- ~ -
~combinable()
-: tbb::combinable< T >
+: tbb::combinable< T >
~concurrent_bounded_queue()
-: tbb::concurrent_bounded_queue< T, A >
+: tbb::concurrent_bounded_queue< T, A >
~concurrent_hash_map()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >
~concurrent_queue()
-: tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::strict_ppl::concurrent_queue< T, A >
~concurrent_vector()
-: tbb::concurrent_vector< T, A >
+: tbb::concurrent_vector< T, A >
~const_accessor()
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
~continue_receiver()
-: tbb::flow::interface8::continue_receiver
+: tbb::flow::interface8::continue_receiver
~enumerable_thread_specific()
-: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+: tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
~fixed_pool()
-: tbb::interface6::fixed_pool
+: tbb::interface6::fixed_pool
~graph()
-: tbb::flow::interface8::graph
+: tbb::flow::interface8::graph
~memory_pool()
-: tbb::interface6::memory_pool< Alloc >
+: tbb::interface6::memory_pool< Alloc >
+
+~opencl_graph()
+: tbb::flow::interface8::opencl_graph
~parallel_while()
-: tbb::parallel_while< Body >
+: tbb::parallel_while< Body >
~pipeline()
-: tbb::pipeline
+: tbb::pipeline
~queuing_rw_mutex()
-: tbb::queuing_rw_mutex
+: tbb::queuing_rw_mutex
~reader_writer_lock()
-: tbb::interface5::reader_writer_lock
+: tbb::interface5::reader_writer_lock
~receiver()
-: tbb::flow::interface8::receiver< T >
+: tbb::flow::interface8::receiver< T >
~runtime_loader()
-: tbb::interface6::runtime_loader
+: tbb::interface6::runtime_loader
~scoped_lock()
-: tbb::spin_mutex::scoped_lock
-, tbb::mutex::scoped_lock
-, tbb::queuing_rw_mutex::scoped_lock
-, tbb::interface5::reader_writer_lock::scoped_lock
-, tbb::recursive_mutex::scoped_lock
-, tbb::queuing_mutex::scoped_lock
-, tbb::spin_rw_mutex_v3::scoped_lock
+: tbb::mutex::scoped_lock
+, tbb::spin_rw_mutex_v3::scoped_lock
+, tbb::queuing_mutex::scoped_lock
+, tbb::interface5::reader_writer_lock::scoped_lock
+, tbb::recursive_mutex::scoped_lock
+, tbb::spin_mutex::scoped_lock
+, tbb::queuing_rw_mutex::scoped_lock
~scoped_lock_read()
-: tbb::interface5::reader_writer_lock::scoped_lock_read
+: tbb::interface5::reader_writer_lock::scoped_lock_read
~sequencer_node()
-: tbb::flow::interface8::sequencer_node< T, A >
+: tbb::flow::interface8::sequencer_node< T, A >
~source_node()
-: tbb::flow::interface8::source_node< Output >
+: tbb::flow::interface8::source_node< Output >
~spin_rw_mutex_v3()
-: tbb::spin_rw_mutex_v3
+: tbb::spin_rw_mutex_v3
~task_arena()
-: tbb::interface7::task_arena
+: tbb::interface7::task_arena
~task_scheduler_init()
-: tbb::task_scheduler_init
+: tbb::task_scheduler_init
~task_scheduler_observer()
-: tbb::interface6::task_scheduler_observer
+: tbb::interface6::task_scheduler_observer
~task_scheduler_observer_v3()
-: tbb::internal::task_scheduler_observer_v3
+: tbb::internal::task_scheduler_observer_v3
diff --git a/doc/html/functions_rela.html b/doc/html/functions_rela.html
index 0b6f2719ba..afcb756851 100644
--- a/doc/html/functions_rela.html
+++ b/doc/html/functions_rela.html
@@ -46,20 +46,20 @@
diff --git a/doc/html/functions_type.html b/doc/html/functions_type.html
index fa3e6e86b3..407e814f5f 100644
--- a/doc/html/functions_type.html
+++ b/doc/html/functions_type.html
@@ -63,111 +63,118 @@
- a -
allocator_type
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
- b -
- c -
const_iterator
-: tbb::blocked_range< Value >
+: tbb::blocked_range< Value >
const_reference
-: tbb::concurrent_bounded_queue< T, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::concurrent_bounded_queue< T, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
- d -
+dependency_predecessor_type
+: tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+
+dependency_successor_type
+: tbb::flow::interface8::sender< dependency_msg< T, Factory > >
+
difference_type
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::concurrent_bounded_queue< T, A >
- i -
- n -
- o -
- p -
- r -
reference
-: tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::concurrent_bounded_queue< T, A >
+: tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::concurrent_bounded_queue< T, A >
row_range_type
-: tbb::blocked_range2d< RowValue, ColValue >
+: tbb::blocked_range2d< RowValue, ColValue >
- s -
size_type
-: tbb::blocked_range< Value >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::interface6::flattened2d< Container >
-, tbb::strict_ppl::concurrent_queue< T, A >
+: tbb::blocked_range< Value >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::interface6::flattened2d< Container >
+, tbb::strict_ppl::concurrent_queue< T, A >
successor_type
-: tbb::flow::interface8::source_node< Output >
-, tbb::flow::interface8::sender< T >
+: tbb::flow::interface8::source_node< Output >
+, tbb::flow::interface8::sender< T >
- v -
value_type
-: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
-, tbb::parallel_while< Body >
-, tbb::concurrent_bounded_queue< T, A >
-, tbb::strict_ppl::concurrent_queue< T, A >
-, tbb::interface5::concurrent_priority_queue< T, Compare, A >
+: tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor
+, tbb::parallel_while< Body >
+, tbb::concurrent_bounded_queue< T, A >
+, tbb::strict_ppl::concurrent_queue< T, A >
+, tbb::interface5::concurrent_priority_queue< T, Compare, A >
, tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor
diff --git a/doc/html/functions_vars.html b/doc/html/functions_vars.html
index 2ce81ff08a..7221928c66 100644
--- a/doc/html/functions_vars.html
+++ b/doc/html/functions_vars.html
@@ -46,48 +46,48 @@
automatic
-: tbb::task_scheduler_init
+: tbb::task_scheduler_init
decrement
-: tbb::flow::interface8::limiter_node< T >
+: tbb::flow::interface8::limiter_node< T >
deferred
-: tbb::task_scheduler_init
+: tbb::task_scheduler_init
exact_exception_propagation
-: tbb::filter
+: tbb::filter
filter_is_bound
-: tbb::filter
+: tbb::filter
filter_is_out_of_order
-: tbb::filter
+: tbb::filter
filter_is_serial
-: tbb::filter
+: tbb::filter
filter_may_emit_null
-: tbb::filter
+: tbb::filter
is_splittable_in_proportion
-: tbb::blocked_range< Value >
-, tbb::blocked_range2d< RowValue, ColValue >
-, tbb::blocked_range3d< PageValue, RowValue, ColValue >
+: tbb::blocked_range< Value >
+, tbb::blocked_range2d< RowValue, ColValue >
+, tbb::blocked_range3d< PageValue, RowValue, ColValue >
is_writer
-: tbb::spin_rw_mutex_v3::scoped_lock
+: tbb::spin_rw_mutex_v3::scoped_lock
mutex
-: tbb::spin_rw_mutex_v3::scoped_lock
+: tbb::spin_rw_mutex_v3::scoped_lock
my_exception_data
-: tbb::movable_exception< ExceptionData >
+: tbb::movable_exception< ExceptionData >
state
-: tbb::spin_rw_mutex_v3
+: tbb::spin_rw_mutex_v3
thread_stack_size
-: tbb::task_scheduler_init
+: tbb::task_scheduler_init
diff --git a/doc/html/globals.html b/doc/html/globals.html
index 1ccf7f9627..77b4672c06 100644
--- a/doc/html/globals.html
+++ b/doc/html/globals.html
@@ -40,37 +40,37 @@
Here is a list of all documented file members with links to the documentation:
diff --git a/doc/html/globals_func.html b/doc/html/globals_func.html
index abd569b1ff..dedc1e759b 100644
--- a/doc/html/globals_func.html
+++ b/doc/html/globals_func.html
@@ -40,37 +40,37 @@
diff --git a/doc/html/hierarchy.html b/doc/html/hierarchy.html
index 1a921156c4..5d9b91b7c6 100644
--- a/doc/html/hierarchy.html
+++ b/doc/html/hierarchy.html
@@ -42,257 +42,303 @@
__TBB_malloc_proxy_caller
tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor_not_used
aggregated_operation
-tbb::flow::interface8::buffer_node< T, A >::buffer_operation
+tbb::flow::interface8::buffer_node< T, A >::buffer_operation
tbb::interface6::aggregator_operation
-tbb::interface6::internal::basic_operation_base
-tbb::interface6::internal::basic_operation< Body >
+tbb::interface6::internal::basic_operation_base
+tbb::interface6::internal::basic_operation< Body >
tbb::aligned_space< T, N > Block of space aligned sufficiently to construct an array T with N elements
tbb::flow::interface8::allocate_buffer< T >
tbb::flow::interface8::allocate_buffer< queueing >
Allocator
-tbb::zero_allocator< T, Allocator > Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
-tbb::zero_allocator< void, Allocator > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
+tbb::zero_allocator< T, Allocator > Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
+tbb::zero_allocator< void, Allocator > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
allocator_base
-tbb::concurrent_vector< padded_element, padded_allocator_type >
-tbb::concurrent_vector< T, A > Concurrent vector container
-tbb::flow::interface8::internal::async_gateway< Output > Pure virtual template class that defines interface for async communication
-tbb::flow::interface8::async_node< Input, Output, Allocator > Implements a async node
-async_input
-tbb::flow::interface8::async_node< Input, Output, Allocator > Implements a async node
+tbb::concurrent_vector< padded_element, padded_allocator_type >
+tbb::concurrent_vector< T, A > Concurrent vector container
+tbb::flow::interface8::internal::async_body< Input, Ports, AsyncGateway, Body >
+tbb::flow::interface8::internal::async_gateway< Output > Pure virtual template class that defines interface for async communication
+tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > Implements async node
atomic_impl
-tbb::atomic< internal::Token >
-tbb::atomic< intptr_t >
-tbb::atomic< state_t >
-tbb::atomic< status_t >
-tbb::atomic< tbb::interface5::reader_writer_lock::scoped_lock * >
-tbb::atomic< tbb::interface5::reader_writer_lock::scoped_lock_read * >
-tbb::atomic< tbb::interface6::aggregator_operation * >
-tbb::atomic< tbb::queuing_mutex::scoped_lock * >
-tbb::atomic< tbb::queuing_rw_mutex::scoped_lock * >
-tbb::atomic< uintptr_t >
-tbb::atomic< T > Primary template for atomic
-tbb::atomic< void * > Specialization for atomic<void*> , for sake of not allowing arithmetic or operator->
+tbb::atomic< internal::Token >
+tbb::atomic< intptr_t >
+tbb::atomic< state_t >
+tbb::atomic< status_t >
+tbb::atomic< tbb::flow::interface8::opencl_device::device_id_type >
+tbb::atomic< tbb::interface5::reader_writer_lock::scoped_lock * >
+tbb::atomic< tbb::interface5::reader_writer_lock::scoped_lock_read * >
+tbb::atomic< tbb::interface6::aggregator_operation * >
+tbb::atomic< tbb::queuing_mutex::scoped_lock * >
+tbb::atomic< tbb::queuing_rw_mutex::scoped_lock * >
+tbb::atomic< uintptr_t >
+tbb::atomic< T > Primary template for atomic
+tbb::atomic< void * > Specialization for atomic<void*> , for sake of not allowing arithmetic or operator->
bad_alloc
-tbb::bad_last_alloc Exception for concurrent containers
-tbb::interface6::internal::basic_handler
+tbb::bad_last_alloc Exception for concurrent containers
+tbb::interface6::internal::basic_handler
binary_function
-tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare
-tbb::blocked_range< Value > A range over which to iterate
-tbb::blocked_range2d< RowValue, ColValue > A 2-dimensional range that models the Range concept
-tbb::blocked_range3d< PageValue, RowValue, ColValue > A 3-dimensional range that models the Range concept
-tbb::blocked_range< ColValue >
-tbb::blocked_range< I >
-tbb::blocked_range< PageValue >
-tbb::blocked_range< RowValue >
-tbb::flow::interface8::internal::broadcast_cache< T, M >
-tbb::flow::interface8::internal::broadcast_cache< input_type >
-tbb::flow::interface8::internal::broadcast_cache< input_type, tbb::null_rw_mutex >
-tbb::flow::interface8::internal::broadcast_cache< output_type >
-tbb::flow::interface8::internal::broadcast_cache< T >
-tbb::cache_aligned_allocator< T > Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
-tbb::cache_aligned_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
-tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave
-tbb::combinable< T > Thread-local storage with optional reduction
-tbb::flow::interface8::composite_node< InputTuple, OutputTuple >
-tbb::interface6::internal::concrete_filter< T, U, Body >
-tbb::interface5::concurrent_priority_queue< T, Compare, A > Concurrent priority queue
-concurrent_queue_base_v3
-tbb::strict_ppl::concurrent_queue< T, A > A high-performance thread-safe non-blocking concurrent queue
-concurrent_queue_base_v8
-tbb::concurrent_bounded_queue< T, A > A high-performance thread-safe blocking concurrent bounded queue
-concurrent_unordered_base
-tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
-tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
-tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
-tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
-tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >
-tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping >
-concurrent_vector_base
-tbb::concurrent_vector< padded_element, padded_allocator_type >
-tbb::concurrent_vector< T, A > Concurrent vector container
-continue_input
-tbb::flow::interface8::continue_node< Output > Implements an executable node that supports continue_msg -> Output
-tbb::flow::interface8::continue_msg An empty class used for messages that mean "I'm done"
-tbb::flow::interface8::internal::edge_container< C >
-tbb::flow::interface8::internal::edge_container< predecessor_type >
-tbb::flow::interface8::internal::edge_container< tbb::flow::interface8::sender >
-ets_base
-tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > The enumerable_thread_specific container
-exception
-tbb::improper_lock Exception for PPL locks
-tbb::invalid_multiple_scheduling Exception for repeated scheduling of the same task_handle
-tbb::missing_wait Exception for missing wait on structured_task_group
-tbb::tbb_exception Interface to be implemented by all exceptions TBB recognizes and propagates across the threads
-tbb::captured_exception This class is used by TBB to propagate information about unhandled exceptions into the root thread
-tbb::movable_exception< ExceptionData > Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread
-tbb::user_abort Exception for user-initiated abort
-tbb::interface6::filter_t< T, U > Class representing a chain of type-safe pipeline filters
-tbb::final_scan_tag Used to indicate that the final scan is being performed
-tbb::interface6::flattened2d< Container >
-tbb::interface6::flow_control Input_filter control to signal end-of-input for parallel_pipeline
-function_input
-tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > Implements a function node that supports Input -> Output
-function_output
-tbb::flow::interface8::async_node< Input, Output, Allocator > Implements a async node
-tbb::flow::interface8::continue_node< Output > Implements an executable node that supports continue_msg -> Output
-tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > Implements a function node that supports Input -> Output
-tbb::interface9::global_control
-tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
-hash_map_base
-tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > Unordered map from Key to T
-tbb::internal::tbb_thread_v3::id
-tbb::tick_count::interval_t Relative time interval
-tbb::flow::interface8::join_node< OutputTuple, JP >
-tbb::interface6::memory_pool_allocator< T, P > Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
-tbb::interface6::memory_pool_allocator< void, P > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
-rml::MemPoolPolicy
-multifunction_input
-tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator >
-tbb::flow::interface8::split_node< TupleType, Allocator > Split_node: accepts a tuple as input, forwards each element of the tuple to its
-tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > Implements a function node that supports Input -> (set of outputs)
-mutex_copy_deprecated_and_disabled
-tbb::mutex Wrapper around the platform's native reader-writer lock
-tbb::null_mutex A mutex which does nothing
-tbb::null_rw_mutex A rw mutex which does nothing
-tbb::queuing_mutex Queuing mutex with local-only spinning
-tbb::queuing_rw_mutex Queuing reader-writer mutex with local-only spinning
-tbb::recursive_mutex
-tbb::spin_mutex A lock that occupies a single byte
-tbb::spin_rw_mutex_v3 Fast, unfair, spinning reader-writer lock with backoff and writer-preference
-no_assign
-tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type >
-tbb::task_handle< F >
-no_assign
-tbb::interface6::internal::basic_operation< Body >
-no_assign
-tbb::flow::interface8::graph_node The base of all graph nodes
-tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator >
-tbb::flow::interface8::async_node< Input, Output, Allocator > Implements a async node
-tbb::flow::interface8::broadcast_node< T > Forwards messages of type T to all successors
-tbb::flow::interface8::buffer_node< T, A > Forwards messages in arbitrary order
-tbb::flow::interface8::priority_queue_node< T, Compare, A > Forwards messages in priority order
-tbb::flow::interface8::queue_node< T, A > Forwards messages in FIFO order
-tbb::flow::interface8::sequencer_node< T, A > Forwards messages in sequence order
-tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
-tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> >
-tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> >
-tbb::flow::interface8::continue_node< Output > Implements an executable node that supports continue_msg -> Output
-tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > Implements a function node that supports Input -> Output
-tbb::flow::interface8::limiter_node< T > Forwards messages only if the threshold has not been reached
-tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > Implements a function node that supports Input -> (set of outputs)
-tbb::flow::interface8::overwrite_node< T >
-tbb::flow::interface8::write_once_node< T >
-tbb::flow::interface8::source_node< Output > An executable node that acts as a source, i.e. it has no predecessors
-no_copy
-tbb::interface6::aggregator_ext< internal::basic_handler >
-tbb::interface6::aggregator Basic aggregator interface
-tbb::concurrent_vector< T, A >::push_back_helper::element_construction_guard
-tbb::filter A stage in a pipeline
-tbb::thread_bound_filter A stage in a pipeline served by a user thread
-tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
-tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> >
-tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> >
-tbb::flow::interface8::graph The graph class
-tbb::interface5::reader_writer_lock Writer-preference reader-writer lock with local-only spinning on readers
-tbb::interface5::reader_writer_lock::scoped_lock The scoped lock pattern for write locks
-tbb::interface5::reader_writer_lock::scoped_lock_read The scoped lock pattern for read locks
-tbb::interface6::aggregator_ext< handler_type > Aggregator base class and expert interface
-tbb::interface6::runtime_loader Load TBB at runtime
-tbb::internal::critical_section_v4
-tbb::internal::critical_section_v4::scoped_lock
-tbb::internal::task_group_base
-tbb::structured_task_group
-tbb::task_group
-tbb::mutex::scoped_lock The scoped locking pattern
-tbb::null_mutex::scoped_lock Represents acquisition of a mutex
-tbb::null_rw_mutex::scoped_lock Represents acquisition of a mutex
-tbb::parallel_do_feeder< Item > Class the user supplied algorithm body uses to add new tasks
-tbb::parallel_while< Body > Parallel iteration over a stream, with optional addition of more work
-tbb::queuing_mutex::scoped_lock The scoped locking pattern
-tbb::queuing_rw_mutex::scoped_lock The scoped locking pattern
-tbb::recursive_mutex::scoped_lock The scoped locking pattern
-tbb::spin_mutex::scoped_lock Represents acquisition of a mutex
-tbb::spin_rw_mutex_v3::scoped_lock The scoped locking pattern
-tbb::task_scheduler_init Class delimiting the scope of task scheduler activity
-node_base
-tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node
-tbb::flow::interface8::null_type
-tbb::pipeline A processing pipeline that applies filters to items
-pool_base
-tbb::interface6::fixed_pool
-tbb::interface6::memory_pool< Alloc > Thread-safe growable pool allocator for variable-size requests
-tbb::pre_scan_tag Used to indicate that the initial scan is being performed
-tbb::cache_aligned_allocator< void >::rebind< U >
-tbb::scalable_allocator< T >::rebind< U >
-tbb::scalable_allocator< void >::rebind< U >
-tbb::tbb_allocator< void >::rebind< U >
-tbb::zero_allocator< T, Allocator >::rebind< U >
-tbb::interface6::memory_pool_allocator< void, P >::rebind< U >
-tbb::interface6::memory_pool_allocator< T, P >::rebind< U >
-tbb::tbb_allocator< T >::rebind< U >
-tbb::cache_aligned_allocator< T >::rebind< U >
-tbb::zero_allocator< void, Allocator >::rebind< U >
-tbb::flow::interface8::receiver< T > Pure virtual template class that defines a receiver of messages of type T
-tbb::flow::interface8::broadcast_node< T > Forwards messages of type T to all successors
-tbb::flow::interface8::buffer_node< T, A > Forwards messages in arbitrary order
-tbb::flow::interface8::limiter_node< T > Forwards messages only if the threshold has not been reached
-tbb::flow::interface8::overwrite_node< T >
-tbb::flow::interface8::receiver< continue_msg >
-tbb::flow::interface8::continue_receiver Base class for receivers of completion messages
-reservable_item_buffer
-tbb::flow::interface8::buffer_node< T, A > Forwards messages in arbitrary order
-tbb::flow::interface8::internal::round_robin_cache< T, M >
-tbb::flow::interface8::internal::round_robin_cache< T, tbb::null_rw_mutex >
-tbb::flow::interface8::run_and_put_task< R, B >
-tbb::scalable_allocator< T > Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
-tbb::scalable_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
-scoped_t
-tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor Bucket accessor is to find, rehash, acquire a lock, and access a bucket
-scoped_t
-tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor Combines data access, locking, and garbage collection
-tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor Allows write access to elements and combines data access, locking, and garbage collection
-tbb::flow::interface8::sender< T > Pure virtual template class that defines a sender of messages of type T
-tbb::flow::interface8::broadcast_node< T > Forwards messages of type T to all successors
-tbb::flow::interface8::buffer_node< T, A > Forwards messages in arbitrary order
-tbb::flow::interface8::limiter_node< T > Forwards messages only if the threshold has not been reached
-tbb::flow::interface8::overwrite_node< T >
-tbb::flow::interface8::sender< Output >
-tbb::flow::interface8::source_node< Output > An executable node that acts as a source, i.e. it has no predecessors
-tbb::flow::interface8::internal::successor_cache< T, M >
-task
-tbb::internal::task_handle_task< F >
-task_arena_base
-tbb::interface7::task_arena
-tbb::task_group_context
-tbb::internal::task_scheduler_observer_v3
-tbb::interface6::task_scheduler_observer
-tbb::tbb_allocator< T > Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
-tbb::tbb_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
-tbb::internal::tbb_exception_ptr Exception container that preserves the exact copy of the original exception
-tbb::internal::tbb_thread_v3 Versioned thread class
-tbb::internal::thread_closure_base
-tbb::internal::thread_closure_0< F >
-tbb::internal::thread_closure_1< F, X > Structure used to pass user function with 1 argument to thread
-tbb::internal::thread_closure_2< F, X, Y >
-tbb::tick_count Absolute timestamp
-unfolded_indexer_node
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
-tbb::flow::interface8::indexer_node< T0 >
-tbb::flow::interface8::indexer_node< T0, T1 >
-tbb::flow::interface8::indexer_node< T0, T1, T2 >
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3 >
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 >
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
-tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
-unfolded_join_node
-tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > >
-tbb::flow::interface8::join_node< OutputTuple, queueing >
-tbb::flow::interface8::join_node< OutputTuple, reserving >
-tbb::interface5::internal::use_element_copy_constructor< T, C >
-tbb::interface5::internal::use_element_copy_constructor< T, false >
-tbb::vector_iterator< Container, Value >
+tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >::value_compare
+tbb::blocked_range< Value > A range over which to iterate
+tbb::blocked_range2d< RowValue, ColValue > A 2-dimensional range that models the Range concept
+tbb::blocked_range3d< PageValue, RowValue, ColValue > A 3-dimensional range that models the Range concept
+tbb::blocked_range< ColValue >
+tbb::blocked_range< I >
+tbb::blocked_range< PageValue >
+tbb::blocked_range< RowValue >
+tbb::flow::interface8::internal::broadcast_cache< T, M >
+tbb::flow::interface8::internal::broadcast_cache< input_type >
+tbb::flow::interface8::internal::broadcast_cache< input_type, tbb::null_rw_mutex >
+tbb::flow::interface8::internal::broadcast_cache< output_type >
+tbb::flow::interface8::internal::broadcast_cache< T >
+tbb::cache_aligned_allocator< T > Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
+tbb::cache_aligned_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::call_clear_on_leave
+tbb::combinable< T > Thread-local storage with optional reduction
+tbb::flow::interface8::composite_node< InputTuple, OutputTuple >
+tbb::flow::interface8::composite_node< tuple< dependency_msg< Ports, Factory >...>, tuple< dependency_msg< Ports, Factory >...> >
+tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, Factory >
+tbb::interface6::internal::concrete_filter< T, U, Body >
+tbb::interface5::concurrent_priority_queue< T, Compare, A > Concurrent priority queue
+concurrent_queue_base_v3
+tbb::strict_ppl::concurrent_queue< T, A > A high-performance thread-safe non-blocking concurrent queue
+concurrent_queue_base_v8
+tbb::concurrent_bounded_queue< T, A > A high-performance thread-safe blocking concurrent bounded queue
+concurrent_unordered_base
+tbb::interface5::concurrent_unordered_map< Key, T, Hasher, Key_equality, Allocator >
+tbb::interface5::concurrent_unordered_multimap< Key, T, Hasher, Key_equality, Allocator >
+tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >
+tbb::interface5::concurrent_unordered_set< Key, Hasher, Key_equality, Allocator >
+tbb::interface5::concurrent_unordered_map_traits< Key, T, Hash_compare, Allocator, Allow_multimapping >
+tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping >
+concurrent_vector_base
+tbb::concurrent_vector< padded_element, padded_allocator_type >
+tbb::concurrent_vector< T, A > Concurrent vector container
+continue_input
+tbb::flow::interface8::continue_node< Output > Implements an executable node that supports continue_msg -> Output
+tbb::flow::interface8::continue_msg An empty class used for messages that mean "I'm done"
+tbb::flow::interface8::default_opencl_factory_device_filter
+tbb::flow::interface8::dependency_msg< T, Factory >
+tbb::flow::interface8::internal::edge_container< C >
+tbb::flow::interface8::internal::edge_container< predecessor_type >
+tbb::flow::interface8::internal::edge_container< tbb::flow::interface8::sender >
+ets_base
+tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type > The enumerable_thread_specific container
+exception
+tbb::improper_lock Exception for PPL locks
+tbb::invalid_multiple_scheduling Exception for repeated scheduling of the same task_handle
+tbb::missing_wait Exception for missing wait on structured_task_group
+tbb::tbb_exception Interface to be implemented by all exceptions TBB recognizes and propagates across the threads
+tbb::captured_exception This class is used by TBB to propagate information about unhandled exceptions into the root thread
+tbb::movable_exception< ExceptionData > Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread
+tbb::user_abort Exception for user-initiated abort
+tbb::interface6::filter_t< T, U > Class representing a chain of type-safe pipeline filters
+tbb::final_scan_tag Used to indicate that the final scan is being performed
+tbb::interface6::flattened2d< Container >
+tbb::interface6::flow_control Input_filter control to signal end-of-input for parallel_pipeline
+function_input
+tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > Implements a function node that supports Input -> Output
+function_output
+tbb::flow::interface8::continue_node< Output > Implements an executable node that supports continue_msg -> Output
+tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > Implements a function node that supports Input -> Output
+tbb::interface9::global_control
+tbb::flow::interface8::graph_iterator< GraphContainerType, GraphNodeType >
+hash_map_base
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A > Unordered map from Key to T
+tbb::internal::tbb_thread_v3::id
+tbb::tick_count::interval_t Relative time interval
+tbb::flow::interface8::join_node< OutputTuple, JP >
+tbb::flow::interface8::join_node< kernel_input_tuple, JP >
+tbb::flow::interface8::key_from_policy< JP >
+tbb::flow::interface8::key_from_policy< key_matching< Key & > >
+tbb::flow::interface8::key_from_policy< key_matching< Key > >
+tbb::interface6::memory_pool_allocator< T, P > Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
+tbb::interface6::memory_pool_allocator< void, P > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
+rml::MemPoolPolicy
+multifunction_input
+tbb::flow::interface8::multifunction_node< indexer_node_output_type, kernel_input_tuple >
+tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator >
+tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > Implements async node
+tbb::flow::interface8::multifunction_node< kernel_input_tuple, output_tuple >
+tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator >
+tbb::flow::interface8::split_node< TupleType, Allocator > Split_node: accepts a tuple as input, forwards each element of the tuple to its
+tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > Implements a function node that supports Input -> (set of outputs)
+mutex_copy_deprecated_and_disabled
+tbb::mutex Wrapper around the platform's native reader-writer lock
+tbb::null_mutex A mutex which does nothing
+tbb::null_rw_mutex A rw mutex which does nothing
+tbb::queuing_mutex Queuing mutex with local-only spinning
+tbb::queuing_rw_mutex Queuing reader-writer mutex with local-only spinning
+tbb::recursive_mutex
+tbb::spin_mutex A lock that occupies a single byte
+tbb::spin_rw_mutex_v3 Fast, unfair, spinning reader-writer lock with backoff and writer-preference
+no_assign
+tbb::interface6::internal::basic_operation< Body >
+no_assign
+tbb::flow::interface8::graph_node The base of all graph nodes
+tbb::flow::interface8::multifunction_node< indexer_node_output_type, kernel_input_tuple >
+tbb::flow::interface8::multifunction_node< Input, tuple< Output >, Policy, Allocator >
+tbb::flow::interface8::multifunction_node< kernel_input_tuple, output_tuple >
+tbb::flow::interface8::multifunction_node< TupleType, TupleType, rejecting, Allocator >
+tbb::flow::interface8::broadcast_node< T > Forwards messages of type T to all successors
+tbb::flow::interface8::buffer_node< T, A > Forwards messages in arbitrary order
+tbb::flow::interface8::priority_queue_node< T, Compare, A > Forwards messages in priority order
+tbb::flow::interface8::queue_node< T, A > Forwards messages in FIFO order
+tbb::flow::interface8::sequencer_node< T, A > Forwards messages in sequence order
+tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
+tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> >
+tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> >
+tbb::flow::interface8::continue_node< Output > Implements an executable node that supports continue_msg -> Output
+tbb::flow::interface8::function_node< Input, Output, Policy, Allocator > Implements a function node that supports Input -> Output
+tbb::flow::interface8::limiter_node< T > Forwards messages only if the threshold has not been reached
+tbb::flow::interface8::multifunction_node< Input, Output, Policy, Allocator > Implements a function node that supports Input -> (set of outputs)
+tbb::flow::interface8::overwrite_node< T >
+tbb::flow::interface8::write_once_node< T >
+tbb::flow::interface8::source_node< Output > An executable node that acts as a source, i.e. it has no predecessors
+tbb::flow::interface8::opencl_foundation
+tbb::flow::interface8::opencl_program< Factory >
+tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
+tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+tbb::interface6::concurrent_lru_cache< key_type, value_type, value_functor_type >
+tbb::task_handle< F >
+no_copy
+tbb::interface6::aggregator_ext< internal::basic_handler >
+tbb::interface6::aggregator Basic aggregator interface
+tbb::concurrent_vector< T, A >::push_back_helper::element_construction_guard
+tbb::filter A stage in a pipeline
+tbb::thread_bound_filter A stage in a pipeline served by a user thread
+tbb::flow::interface8::callback_base
+tbb::flow::interface8::callback< Callback, T >
+tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple< OutputTypes...> >
+tbb::flow::interface8::composite_node< tbb::flow::tuple< InputTypes...>, tbb::flow::tuple<> >
+tbb::flow::interface8::composite_node< tbb::flow::tuple<>, tbb::flow::tuple< OutputTypes...> >
+tbb::flow::interface8::graph The graph class
+tbb::flow::interface8::opencl_graph
+tbb::interface5::reader_writer_lock Writer-preference reader-writer lock with local-only spinning on readers
+tbb::interface5::reader_writer_lock::scoped_lock The scoped lock pattern for write locks
+tbb::interface5::reader_writer_lock::scoped_lock_read The scoped lock pattern for read locks
+tbb::interface6::aggregator_ext< handler_type > Aggregator base class and expert interface
+tbb::interface6::runtime_loader Load TBB at runtime
+tbb::internal::critical_section_v4
+tbb::internal::critical_section_v4::scoped_lock
+tbb::internal::task_group_base
+tbb::structured_task_group
+tbb::task_group
+tbb::mutex::scoped_lock The scoped locking pattern
+tbb::null_mutex::scoped_lock Represents acquisition of a mutex
+tbb::null_rw_mutex::scoped_lock Represents acquisition of a mutex
+tbb::parallel_do_feeder< Item > Class the user supplied algorithm body uses to add new tasks
+tbb::parallel_while< Body > Parallel iteration over a stream, with optional addition of more work
+tbb::queuing_mutex::scoped_lock The scoped locking pattern
+tbb::queuing_rw_mutex::scoped_lock The scoped locking pattern
+tbb::recursive_mutex::scoped_lock The scoped locking pattern
+tbb::spin_mutex::scoped_lock Represents acquisition of a mutex
+tbb::spin_rw_mutex_v3::scoped_lock The scoped locking pattern
+tbb::task_scheduler_init Class delimiting the scope of task scheduler activity
+node_base
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node
+tbb::flow::interface8::null_type
+tbb::flow::interface8::num_arguments< T >
+tbb::flow::interface8::num_arguments< port_ref_impl< N1, N2 > >
+tbb::flow::interface8::num_arguments< port_ref_impl< N1, N2 >(*)()>
+tbb::flow::interface8::opencl_buffer< T, Factory >
+tbb::flow::interface8::opencl_device
+tbb::flow::interface8::opencl_device_list
+tbb::flow::interface8::opencl_device_with_key< Key >
+tbb::flow::interface8::opencl_factory< DeviceFilter >
+tbb::flow::interface8::opencl_factory< default_opencl_factory_device_filter >
+tbb::flow::interface8::default_opencl_factory
+tbb::flow::interface8::opencl_memory< Factory >
+tbb::flow::interface8::opencl_buffer_impl< Factory >
+tbb::flow::interface8::opencl_node< Args >
+tbb::flow::interface8::opencl_node< tuple< Ports...>, JP, default_opencl_factory >
+tbb::flow::interface8::opencl_node< tuple< Ports...>, JP >
+tbb::flow::interface8::opencl_node< tuple< Ports...>, queueing, default_opencl_factory >
+tbb::flow::interface8::opencl_node< tuple< Ports...> >
+tbb::pipeline A processing pipeline that applies filters to items
+pool_base
+tbb::interface6::fixed_pool
+tbb::interface6::memory_pool< Alloc > Thread-safe growable pool allocator for variable-size requests
+tbb::flow::interface8::port_ref_impl< N1, N2 >
+tbb::pre_scan_tag Used to indicate that the initial scan is being performed
+tbb::zero_allocator< void, Allocator >::rebind< U >
+tbb::interface6::memory_pool_allocator< void, P >::rebind< U >
+tbb::interface6::memory_pool_allocator< T, P >::rebind< U >
+tbb::cache_aligned_allocator< T >::rebind< U >
+tbb::cache_aligned_allocator< void >::rebind< U >
+tbb::scalable_allocator< T >::rebind< U >
+tbb::scalable_allocator< void >::rebind< U >
+tbb::tbb_allocator< T >::rebind< U >
+tbb::tbb_allocator< void >::rebind< U >
+tbb::zero_allocator< T, Allocator >::rebind< U >
+tbb::flow::interface8::receiver< T > Pure virtual template class that defines a receiver of messages of type T
+tbb::flow::interface8::broadcast_node< T > Forwards messages of type T to all successors
+tbb::flow::interface8::buffer_node< T, A > Forwards messages in arbitrary order
+tbb::flow::interface8::limiter_node< T > Forwards messages only if the threshold has not been reached
+tbb::flow::interface8::overwrite_node< T >
+tbb::flow::interface8::receiver< continue_msg >
+tbb::flow::interface8::continue_receiver Base class for receivers of completion messages
+tbb::flow::interface8::receiver< dependency_msg< T, Factory > >
+tbb::flow::interface8::proxy_dependency_receiver< T, Factory >
+tbb::flow::interface8::receiver< tbb::flow::interface8::dependency_msg< T, Factory > >
+reservable_item_buffer
+tbb::flow::interface8::buffer_node< T, A > Forwards messages in arbitrary order
+tbb::flow::interface8::internal::round_robin_cache< T, M >
+tbb::flow::interface8::internal::round_robin_cache< T, tbb::null_rw_mutex >
+tbb::flow::interface8::run_and_put_task< R, B >
+tbb::scalable_allocator< T > Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
+tbb::scalable_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
+scoped_t
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor Combines data access, locking, and garbage collection
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor Allows write access to elements and combines data access, locking, and garbage collection
+scoped_t
+tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::bucket_accessor Bucket accessor is to find, rehash, acquire a lock, and access a bucket
+tbb::flow::interface8::sender< T > Pure virtual template class that defines a sender of messages of type T
+tbb::flow::interface8::broadcast_node< T > Forwards messages of type T to all successors
+tbb::flow::interface8::buffer_node< T, A > Forwards messages in arbitrary order
+tbb::flow::interface8::limiter_node< T > Forwards messages only if the threshold has not been reached
+tbb::flow::interface8::overwrite_node< T >
+tbb::flow::interface8::sender< dependency_msg< T, Factory > >
+tbb::flow::interface8::proxy_dependency_sender< T, Factory >
+tbb::flow::interface8::sender< Output >
+tbb::flow::interface8::async_node< Input, Output, Policy, Allocator > Implements async node
+tbb::flow::interface8::source_node< Output > An executable node that acts as a source, i.e. it has no predecessors
+tbb::flow::interface8::sender< tbb::flow::interface8::dependency_msg< T, Factory > >
+tbb::flow::interface8::internal::successor_cache< T, M >
+task
+tbb::internal::task_handle_task< F >
+task_arena_base
+tbb::interface7::task_arena
+tbb::task_group_context
+tbb::internal::task_scheduler_observer_v3
+tbb::interface6::task_scheduler_observer
+tbb::tbb_allocator< T > Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5
+tbb::tbb_allocator< void > Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1
+tbb::internal::tbb_exception_ptr Exception container that preserves the exact copy of the original exception
+tbb::internal::tbb_thread_v3 Versioned thread class
+tbb::internal::thread_closure_base
+tbb::internal::thread_closure_0< F >
+tbb::internal::thread_closure_1< F, X > Structure used to pass user function with 1 argument to thread
+tbb::internal::thread_closure_2< F, X, Y >
+tbb::tick_count Absolute timestamp
+tbb::flow::interface8::async_node< Input, Output, Policy, Allocator >::try_put_functor
+unfolded_indexer_node
+tbb::flow::interface8::indexer_node< dependency_msg< Ports, Factory >...>
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 >
+tbb::flow::interface8::indexer_node< T0 >
+tbb::flow::interface8::indexer_node< T0, T1 >
+tbb::flow::interface8::indexer_node< T0, T1, T2 >
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3 >
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4 >
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5 >
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6 >
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7 >
+tbb::flow::interface8::indexer_node< T0, T1, T2, T3, T4, T5, T6, T7, T8 >
+unfolded_join_node
+tbb::flow::interface8::join_node< OutputTuple, key_matching< K, KHash > >
+tbb::flow::interface8::join_node< OutputTuple, queueing >
+tbb::flow::interface8::join_node< OutputTuple, reserving >
+tbb::interface5::internal::use_element_copy_constructor< T, C >
+tbb::interface5::internal::use_element_copy_constructor< T, false >
+tbb::vector_iterator< Container, Value >
diff --git a/doc/html/modules.html b/doc/html/modules.html
index 76f8b41f29..4998949799 100644
--- a/doc/html/modules.html
+++ b/doc/html/modules.html
@@ -32,12 +32,12 @@
Here is a list of all modules:
diff --git a/doc/html/namespacemembers.html b/doc/html/namespacemembers.html
index e622cadb12..810898a032 100644
--- a/doc/html/namespacemembers.html
+++ b/doc/html/namespacemembers.html
@@ -58,90 +58,90 @@
- _ -
__TBB_DECL_ATOMIC_ALT()
-: tbb
+: tbb
- a -
- e -
ets_key_usage_type
-: tbb
+: tbb
- f -
- m -
memory_semantics
-: tbb
+: tbb
- p -
parallel_deterministic_reduce()
-: tbb
+: tbb
parallel_do()
-: tbb
+: tbb
parallel_for()
-: tbb
+: tbb
parallel_for_each()
-: tbb
+: tbb
parallel_invoke()
-: tbb
+: tbb
parallel_reduce()
-: tbb
+: tbb
parallel_scan()
-: tbb
+: tbb
parallel_sort()
-: tbb
+: tbb
- r -
- s -
speculative_spin_mutex
-: tbb
+: tbb
- t -
TBB_runtime_interface_version()
-: tbb
+: tbb
tbb_thread
-: tbb
+: tbb
diff --git a/doc/html/namespacemembers_enum.html b/doc/html/namespacemembers_enum.html
index 6e7c677508..24a7dd5187 100644
--- a/doc/html/namespacemembers_enum.html
+++ b/doc/html/namespacemembers_enum.html
@@ -43,10 +43,10 @@
ets_key_usage_type
-: tbb
+: tbb
memory_semantics
-: tbb
+: tbb
diff --git a/doc/html/namespacemembers_eval.html b/doc/html/namespacemembers_eval.html
index 63609de362..522a5b41ad 100644
--- a/doc/html/namespacemembers_eval.html
+++ b/doc/html/namespacemembers_eval.html
@@ -43,16 +43,16 @@
diff --git a/doc/html/namespacemembers_func.html b/doc/html/namespacemembers_func.html
index 6c65b7fe7c..94e3f30e10 100644
--- a/doc/html/namespacemembers_func.html
+++ b/doc/html/namespacemembers_func.html
@@ -52,42 +52,42 @@
- _ -
__TBB_DECL_ATOMIC_ALT()
-: tbb
+: tbb
- p -
parallel_deterministic_reduce()
-: tbb
+: tbb
parallel_do()
-: tbb
+: tbb
parallel_for()
-: tbb
+: tbb
parallel_for_each()
-: tbb
+: tbb
parallel_invoke()
-: tbb
+: tbb
parallel_reduce()
-: tbb
+: tbb
parallel_scan()
-: tbb
+: tbb
parallel_sort()
-: tbb
+: tbb
- t -
TBB_runtime_interface_version()
-: tbb
+: tbb
diff --git a/doc/html/namespacemembers_type.html b/doc/html/namespacemembers_type.html
index 561c26e84d..85c0b0aab6 100644
--- a/doc/html/namespacemembers_type.html
+++ b/doc/html/namespacemembers_type.html
@@ -43,10 +43,10 @@
speculative_spin_mutex
-: tbb
+: tbb
tbb_thread
-: tbb
+: tbb
diff --git a/doc/html/namespaces.html b/doc/html/namespaces.html
index fdc3a6773a..71c3533b07 100644
--- a/doc/html/namespaces.html
+++ b/doc/html/namespaces.html
@@ -38,8 +38,8 @@
diff --git a/examples/common/gui/xvideo.cpp b/examples/common/gui/xvideo.cpp
index de62123853..841b3c9969 100644
--- a/examples/common/gui/xvideo.cpp
+++ b/examples/common/gui/xvideo.cpp
@@ -244,12 +244,13 @@ bool video::init_window(int xsize, int ysize)
goto fail;
}
}
- // Note: It may be more efficient to adopt the server's byte order
- // and swap once per get_color() call instead of once per pixel.
- const uint32_t probe = 0x03020100;
- const bool big_endian = (((const char*)(&probe))[0]==0x03);
- ximage->byte_order = big_endian ? MSBFirst : LSBFirst;
-
+ if( ximage ) {
+ // Note: It may be more efficient to adopt the server's byte order
+ // and swap once per get_color() call instead of once per pixel.
+ const uint32_t probe = 0x03020100;
+ const bool big_endian = (((const char*)(&probe))[0]==0x03);
+ ximage->byte_order = big_endian ? MSBFirst : LSBFirst;
+ }
printf("Note: using %s with %s visual for %d-bit color depth\n", vidstr, vis==DefaultVisual(dpy, theScreen)?"default":"non-default", dispdepth);
running = true;
return true;
diff --git a/examples/graph/cholesky/Makefile b/examples/graph/cholesky/Makefile
new file mode 100644
index 0000000000..fa66bc75c1
--- /dev/null
+++ b/examples/graph/cholesky/Makefile
@@ -0,0 +1,51 @@
+# Copyright 2005-2015 Intel Corporation. All Rights Reserved.
+#
+# This file is part of Threading Building Blocks. Threading Building Blocks is free software;
+# you can redistribute it and/or modify it under the terms of the GNU General Public License
+# version 2 as published by the Free Software Foundation. Threading Building Blocks is
+# distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the
+# implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+# See the GNU General Public License for more details. You should have received a copy of
+# the GNU General Public License along with Threading Building Blocks; if not, write to the
+# Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+#
+# As a special exception, you may use this file as part of a free software library without
+# restriction. Specifically, if other files instantiate templates or use macros or inline
+# functions from this file, or you compile this file and link it with other files to produce
+# an executable, this file does not by itself cause the resulting executable to be covered
+# by the GNU General Public License. This exception does not however invalidate any other
+# reasons why the executable file might be covered by the GNU General Public License.
+
+# GNU Makefile that builds and runs example.
+run_cmd=
+PROG=cholesky
+ARGS=4 2
+
+# The C++ compiler
+ifneq (,$(shell which icpc 2>/dev/null))
+CXX=icpc
+endif # which icpc
+
+ifeq ($(shell uname), Linux)
+LIBS+= -lrt
+endif
+
+# MKL support
+override MKL_LIBS += -lmkl_rt
+
+# C++0x support
+override CXXFLAGS += -std=c++0x
+
+all: release test
+
+release: *.cpp
+ $(CXX) -O2 -DNDEBUG $(CXXFLAGS) -o $(PROG) $^ -ltbb $(MKL_LIBS) $(LIBS)
+
+debug: *.cpp
+ $(CXX) -O0 -g -DTBB_USE_DEBUG $(CXXFLAGS) -o $(PROG) $^ -ltbb_debug $(MKL_LIBS) $(LIBS)
+
+clean:
+ $(RM) $(PROG) *.o *.d
+
+test:
+ $(run_cmd) ./$(PROG) $(ARGS)
diff --git a/examples/graph/cholesky/Makefile.windows b/examples/graph/cholesky/Makefile.windows
new file mode 100644
index 0000000000..a084c9fd5b
--- /dev/null
+++ b/examples/graph/cholesky/Makefile.windows
@@ -0,0 +1,48 @@
+# Copyright 2005-2015 Intel Corporation. All Rights Reserved.
+#
+# This file is part of Threading Building Blocks. Threading Building Blocks is free software;
+# you can redistribute it and/or modify it under the terms of the GNU General Public License
+# version 2 as published by the Free Software Foundation. Threading Building Blocks is
+# distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the
+# implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+# See the GNU General Public License for more details. You should have received a copy of
+# the GNU General Public License along with Threading Building Blocks; if not, write to the
+# Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+#
+# As a special exception, you may use this file as part of a free software library without
+# restriction. Specifically, if other files instantiate templates or use macros or inline
+# functions from this file, or you compile this file and link it with other files to produce
+# an executable, this file does not by itself cause the resulting executable to be covered
+# by the GNU General Public License. This exception does not however invalidate any other
+# reasons why the executable file might be covered by the GNU General Public License.
+
+# Common Makefile that builds and runs example.
+
+# Just specify your program basename
+PROG=Cholesky
+ARGS=4 2
+
+# Trying to find if icl.exe is set
+CXX1 = $(TBB_CXX)-
+CXX2 = $(CXX1:icl.exe-=icl.exe)
+CXX = $(CXX2:-=cl.exe)
+
+# MKL support
+override MKL_LIBS += mkl_rt.lib
+
+# The C++ compiler options
+MYCXXFLAGS = /TP /EHsc /W3 /nologo /D _CONSOLE /D _MBCS /D WIN32 /D _WIN32_WINNT=0x0501 $(CXXFLAGS)
+MYLDFLAGS = /INCREMENTAL:NO /NOLOGO /DEBUG /FIXED:NO $(LDFLAGS)
+
+all: release test
+release: compiler_check
+ $(CXX) *.cpp /MD /O2 /D NDEBUG $(MYCXXFLAGS) /link tbb.lib $(MKL_LIBS) $(LIBS) $(MYLDFLAGS) /OUT:$(PROG).exe
+debug: compiler_check
+ $(CXX) *.cpp /MDd /Od /Zi /D TBB_USE_DEBUG /D _DEBUG $(MYCXXFLAGS) /link tbb_debug.lib $(MKL_LIBS) $(LIBS) $(MYLDFLAGS) /OUT:$(PROG).exe
+clean:
+ @cmd.exe /C del $(PROG).exe *.obj *.?db *.manifest
+test:
+ $(PROG) $(ARGS)
+compiler_check:
+ @echo compiler_test>compiler_test && @$(CXX) /E compiler_test >nul 2>&1 || echo "$(CXX) command not found. Check if CXX=$(CXX) is set properly"
+ @cmd.exe /C del compiler_test
diff --git a/examples/graph/cholesky/cholesky.cpp b/examples/graph/cholesky/cholesky.cpp
new file mode 100644
index 0000000000..2207c498ad
--- /dev/null
+++ b/examples/graph/cholesky/cholesky.cpp
@@ -0,0 +1,714 @@
+/*
+ Copyright 2005-2015 Intel Corporation. All Rights Reserved.
+
+ This file is part of Threading Building Blocks. Threading Building Blocks is free software;
+ you can redistribute it and/or modify it under the terms of the GNU General Public License
+ version 2 as published by the Free Software Foundation. Threading Building Blocks is
+ distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the
+ implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ See the GNU General Public License for more details. You should have received a copy of
+ the GNU General Public License along with Threading Building Blocks; if not, write to the
+ Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
+ As a special exception, you may use this file as part of a free software library without
+ restriction. Specifically, if other files instantiate templates or use macros or inline
+ functions from this file, or you compile this file and link it with other files to produce
+ an executable, this file does not by itself cause the resulting executable to be covered
+ by the GNU General Public License. This exception does not however invalidate any other
+ reasons why the executable file might be covered by the GNU General Public License.
+*/
+
+#include
+#include
+#include
+#include
+#include
+#include
+
+#include "mkl_lapack.h"
+#include "mkl.h"
+
+#include "tbb/tbb_config.h"
+#include "tbb/flow_graph.h"
+#include "tbb/tick_count.h"
+#include "tbb/task_scheduler_init.h"
+
+// Application command line arguments parsing
+#include "../../common/utility/utility.h"
+
+/************************************************************
+ FORWARD DECLARATIONS
+************************************************************/
+
+/**********************************************
+ Read or generate a positive-definite matrix
+ -- reads from file if fname != NULL
+ -- sets n to matrix size
+ -- allocates and reads values in to A
+ -- otherwise generates a matrix
+ -- uses n to determine size
+ -- allocates and generates values in to A
+**********************************************/
+void matrix_init( double * &A, int &n, const char *fname );
+
+/**********************************************
+ Writes a lower triangular matrix to a file
+ -- first line of file is n
+ -- subsequently 1 row per line
+**********************************************/
+void matrix_write ( double *A, int n, const char *fname, bool is_triangular = false );
+
+/************************************************************
+ GLOBAL VARIABLES
+************************************************************/
+bool g_benchmark_run = false;
+int g_num_tbb_threads = tbb::task_scheduler_init::default_num_threads();
+int g_n = -1, g_b = -1, g_num_trials = 1;
+char *g_input_file_name = NULL;
+char *g_output_prefix = NULL;
+std::string g_alg_name;
+
+// Creates tiled array
+static double ***create_tile_array( double *A, int n, int b ) {
+ const int p = n/b;
+ double ***tile = (double ***)calloc( sizeof( double ** ), p );
+
+ for ( int j = 0; j < p; ++j ) {
+ tile[j] = (double **)calloc( sizeof( double * ), p );
+ }
+
+ for ( int j = 0; j < p; ++j ) {
+ for ( int i = 0; i < p; ++i ) {
+ double *temp_block = (double *)calloc( sizeof( double ), b*b );
+
+ for ( int A_j = j*b, T_j = 0; T_j < b; ++A_j, ++T_j ) {
+ for ( int A_i = i*b, T_i = 0; T_i < b; ++A_i, ++T_i ) {
+ temp_block[T_j*b+T_i] = A[A_j*n+A_i];
+ }
+ }
+
+ tile[j][i] = temp_block;
+ }
+ }
+ return tile;
+}
+
+static void collapse_tile_array( double ***tile, double *A, int n, int b ) {
+ const int p = n/b;
+
+ for ( int j = 0; j < p; ++j ) {
+ for ( int i = 0; i < p; ++i ) {
+ double *temp_block = tile[j][i];
+
+ for ( int A_j = j*b, T_j = 0; T_j < b; ++A_j, ++T_j ) {
+ for ( int A_i = i*b, T_i = 0; T_i < b; ++A_i, ++T_i ) {
+ A[A_j*n+A_i] = temp_block[T_j*b+T_i];
+ }
+ }
+
+ free( temp_block );
+ tile[j][i] = NULL;
+ }
+
+ free( tile[j] );
+ }
+
+ free( tile );
+}
+
+/************************************************************
+ Helper base class: algorithm
+************************************************************/
+class algorithm {
+
+ std::string name;
+ bool is_tiled;
+
+ bool check_if_valid( double *A0, double *C, double *A, int n ) {
+ char transa = 'n', transb = 't';
+ double alpha = 1;
+ double beta = 0;
+
+ for ( int i = 0; i < n; ++i ) {
+ for ( int j = i+1; j < n; ++j ) {
+ A0[j*n+i] = 0.;
+ }
+ }
+
+ dgemm ( &transa, &transb, &n, &n, &n, &alpha, A0, &n, A0, &n, &beta, C, &n );
+
+ for ( int j = 0; j < n; ++j ) {
+ for ( int i = 0; i < n; ++i ) {
+ const double epsilon = std::abs( A[j*n+i]*0.1 );
+
+ if ( std::abs( C[j*n+i] - A[j*n+i] ) > epsilon ) {
+ printf( "ERROR: %s did not validate at C(%d,%d) = %lf != A(%d,%d) = %lf\n",
+ name.c_str(), i, j, C[j*n+i], i, j, A[j*n+i] );
+ printf( "ERROR: %g; %g < %g < %g\n", epsilon, A[j*n+i] - epsilon, C[j*n+i], A[j*n+i] + epsilon );
+ return false;
+ }
+ }
+ }
+ return true;
+ }
+
+public:
+ algorithm( const std::string& alg_name, bool t ) : name(alg_name), is_tiled(t) {}
+
+ double operator() ( double *A, int n, int b, int trials ) {
+ tbb::tick_count t0, t1;
+ double elapsed_time = 0.0;
+ double *A0 = (double *)calloc( sizeof( double ), n*n );
+ double *C = (double *)calloc( sizeof( double ), n*n );
+
+ for ( int t = 0; t < trials+1; ++t ) {
+ if ( is_tiled ) {
+ double ***tile = create_tile_array( A, n, b );
+ t0 = tbb::tick_count::now();
+ func( tile, n, b );
+ t1 = tbb::tick_count::now();
+
+ collapse_tile_array( tile, A0, n, b );
+ }
+ else {
+ memcpy( A0, A, sizeof( double )*n*n );
+ t0 = tbb::tick_count::now();
+ func( A0, n, b );
+ t1 = tbb::tick_count::now();
+ }
+
+ if ( t ) elapsed_time += (t1-t0).seconds();
+
+ if( !g_benchmark_run && !check_if_valid( A0, C, A, n ) ) {
+ if ( g_output_prefix ) {
+ std::string s( g_output_prefix );
+ s += "_" + name + ".txt";
+ matrix_write( A0, g_n, s.c_str(), true );
+ free( A0 );
+ free( C );
+ return 0.;
+ }
+ }
+ }
+
+ if ( g_output_prefix ) {
+ std::string s( g_output_prefix );
+ s += "_" + name + ".txt";
+ matrix_write( A0, g_n, s.c_str(), true );
+ }
+
+ printf( "%s %d %d %d %d %lf %lf\n", name.c_str(), g_num_tbb_threads, trials, n, b, elapsed_time, elapsed_time/trials );
+ free( A0 );
+ free( C );
+ return elapsed_time;
+ }
+
+protected:
+ // Main algorithm body function must be defined in any direved class
+ virtual void func( void * ptr, int n, int b ) = 0;
+};
+
+/***********************************************************/
+
+static void call_dpotf2( double ***tile, int b, int k ) {
+ double *A_block = tile[k][k];
+ char uplo = 'l';
+ int info = 0;
+ dpotf2( &uplo, &b, A_block, &b, &info );
+ return;
+}
+
+static void call_dtrsm( double ***tile, int b, int k, int j ) {
+ double *A_block = tile[k][j];
+ double *L_block = tile[k][k];
+ char uplo = 'l', side = 'r', transa = 't', diag = 'n';
+ double alpha = 1;
+ dtrsm( &side, &uplo, &transa, &diag, &b, &b, &alpha, L_block, &b, A_block, &b );
+ return;
+}
+
+static void call_dsyr2k( double ***tile, int b, int k, int j, int i ) {
+ double *A_block = tile[i][j];
+ char transa = 'n', transb = 't';
+ char uplo = 'l';
+ double alpha = -1;
+ double beta = 1;
+
+ if ( i == j ) { // Diagonal block
+ double *L_block = tile[k][i];
+ dsyrk( &uplo, &transa, &b, &b, &alpha, L_block, &b, &beta, A_block, &b );
+ } else { // Non-diagonal block
+ double *L2_block = tile[k][i];
+ double *L1_block = tile[k][j];
+ dgemm( &transa, &transb, &b, &b, &b, &alpha, L1_block, &b, L2_block, &b, &beta, A_block, &b );
+ }
+ return;
+}
+
+class algorithm_crout : public algorithm
+{
+public:
+ algorithm_crout() : algorithm("crout_cholesky", true) {}
+
+protected:
+ virtual void func( void * ptr, int n, int b ) {
+ double ***tile = (double ***)ptr;
+ const int p = n/b;
+
+ for ( int k = 0; k < p; ++k ) {
+ call_dpotf2( tile, b, k );
+
+ for ( int j = k+1; j < p; ++j ) {
+ call_dtrsm( tile, b, k, j );
+
+ for ( int i = k+1; i <= j; ++i ) {
+ call_dsyr2k( tile, b, k, j, i );
+ }
+ }
+ }
+ }
+};
+
+class algorithm_dpotrf : public algorithm
+{
+public:
+ algorithm_dpotrf() : algorithm("dpotrf_cholesky", false) {}
+
+protected:
+ virtual void func( void * ptr, int n, int /* b */ ) {
+ double *A = (double *)ptr;
+ int lda = n;
+ int info = 0;
+ char uplo = 'l';
+ dpotrf( &uplo, &n, A, &lda, &info );
+ }
+};
+
+/************************************************************
+ Begin data join graph based version of cholesky
+************************************************************/
+
+typedef union {
+ char a[4];
+ size_t tag;
+} tag_t;
+
+typedef double * tile_t;
+
+typedef std::pair< tag_t, tile_t > tagged_tile_t;
+typedef tbb::flow::tuple< tagged_tile_t > t1_t;
+typedef tbb::flow::tuple< tagged_tile_t, tagged_tile_t > t2_t;
+typedef tbb::flow::tuple< tagged_tile_t, tagged_tile_t, tagged_tile_t > t3_t;
+
+typedef tbb::flow::multifunction_node< tagged_tile_t, t1_t > dpotf2_node_t;
+typedef tbb::flow::multifunction_node< t2_t, t2_t > dtrsm_node_t;
+typedef tbb::flow::multifunction_node< t3_t, t3_t > dsyr2k_node_t;
+
+typedef tbb::flow::join_node< t2_t, tbb::flow::tag_matching > dtrsm_join_t;
+typedef tbb::flow::join_node< t3_t, tbb::flow::tag_matching > dsyr2k_join_t;
+
+class dpotf2_body {
+ int p;
+ int b;
+public:
+ dpotf2_body( int p_, int b_ ) : p(p_), b(b_) {}
+
+ void operator()( const tagged_tile_t &in, dpotf2_node_t::output_ports_type &ports ) {
+ int k = in.first.a[0];
+ tile_t A_block = in.second;
+ tag_t t;
+ t.tag = 0;
+ t.a[0] = k;
+ char uplo = 'l';
+ int info = 0;
+ dpotf2( &uplo, &b, A_block, &b, &info );
+
+ // Send to dtrsms in same column
+ // k == k j == k
+ t.a[2] = k;
+ for ( int j = k+1; j < p; ++j ) {
+ t.a[1] = j;
+ tbb::flow::get<0>( ports ).try_put( std::make_pair( t, A_block ) );
+ }
+ }
+};
+
+class dtrsm_body {
+ int p;
+ int b;
+public:
+ dtrsm_body( int p_, int b_ ) : p(p_), b(b_) {}
+
+ void operator()( const t2_t &in, dtrsm_node_t::output_ports_type &ports ) {
+ using tbb::flow::get;
+
+ tagged_tile_t in0 = get<0>( in );
+ tagged_tile_t in1 = get<1>( in );
+ int k = in0.first.a[0];
+ int j = in0.first.a[1];
+ tile_t L_block = in0.second;
+ tile_t A_block = in1.second;
+ tag_t t;
+ t.tag = 0;
+ t.a[0] = k;
+ char uplo = 'l', side = 'r', transa = 't', diag = 'n';
+ double alpha = 1;
+ dtrsm( &side, &uplo, &transa, &diag, &b, &b, &alpha, L_block, &b, A_block, &b);
+
+ // Send to rest of my row
+ t.a[1] = j;
+ for ( int i = k+1; i <= j; ++i ) {
+ t.a[2] = i;
+ get<0>( ports ).try_put( std::make_pair( t, A_block ) );
+ }
+
+ // Send to transposed row
+ t.a[2] = j;
+ for ( int i = j; i < p; ++i ) {
+ t.a[1] = i;
+ get<1>( ports ).try_put( std::make_pair( t, A_block ) );
+ }
+ }
+};
+
+class dsyr2k_body {
+ int p;
+ int b;
+public:
+ dsyr2k_body( int p_, int b_ ) : p(p_), b(b_) {}
+
+ void operator()( const t3_t &in, dsyr2k_node_t::output_ports_type &ports ) {
+ using tbb::flow::get;
+
+ tag_t t;
+ t.tag = 0;
+ char transa = 'n', transb = 't';
+ char uplo = 'l';
+ double alpha = -1;
+ double beta = 1;
+
+ tagged_tile_t in0 = get<0>( in );
+ tagged_tile_t in1 = get<1>( in );
+ tagged_tile_t in2 = get<2>( in );
+ int k = in2.first.a[0];
+ int j = in2.first.a[1];
+ int i = in2.first.a[2];
+
+ tile_t A_block = in2.second;
+ if ( i == j ) { // Diagonal block
+ tile_t L_block = in0.second;
+ dsyrk( &uplo, &transa, &b, &b, &alpha, L_block, &b, &beta, A_block, &b );
+ } else { // Non-diagonal block
+ tile_t L1_block = in0.second;
+ tile_t L2_block = in1.second;
+ dgemm( &transa, &transb, &b, &b, &b, &alpha, L1_block, &b, L2_block, &b, &beta, A_block, &b );
+ }
+
+ // All outputs flow to next step
+ t.a[0] = k+1;
+ t.a[1] = j;
+ t.a[2] = i;
+ if ( k != p-1 && j == k+1 && i == k+1 ) {
+ get<0>( ports ).try_put( std::make_pair( t, A_block ) );
+ }
+
+ if ( k < p-2 ) {
+ if ( i == k+1 && j > i ) {
+ t.a[0] = k+1;
+ t.a[1] = j;
+ get<1>( ports ).try_put( std::make_pair( t, A_block ) );
+ }
+
+ if ( j != k+1 && i != k+1 ) {
+ t.a[0] = k+1;
+ t.a[1] = j;
+ t.a[2] = i;
+ get<2>( ports ).try_put( std::make_pair( t, A_block ) );
+ }
+ }
+ }
+};
+
+struct tagged_tile_to_size_t {
+ size_t operator()( const tagged_tile_t &t ) {
+ return t.first.tag;
+ }
+};
+
+class algorithm_join : public algorithm
+{
+public:
+ algorithm_join() : algorithm("data_join_cholesky", true) {}
+
+protected:
+ virtual void func( void * ptr, int n, int b ) {
+ using tbb::flow::unlimited;
+ using tbb::flow::output_port;
+ using tbb::flow::input_port;
+
+ double ***tile = (double ***)ptr;
+ const int p = n/b;
+ tbb::flow::graph g;
+
+ dpotf2_node_t dpotf2_node( g, unlimited, dpotf2_body(p, b) );
+ dtrsm_node_t dtrsm_node( g, unlimited, dtrsm_body(p, b) );
+ dsyr2k_node_t dsyr2k_node( g, unlimited, dsyr2k_body(p, b) );
+ dtrsm_join_t dtrsm_join( g, tagged_tile_to_size_t(), tagged_tile_to_size_t() );
+ dsyr2k_join_t dsyr2k_join( g, tagged_tile_to_size_t(), tagged_tile_to_size_t(), tagged_tile_to_size_t() );
+
+ make_edge( output_port<0>( dsyr2k_node ), dpotf2_node );
+
+ make_edge( output_port<0>( dpotf2_node ), input_port<0>( dtrsm_join ) );
+ make_edge( output_port<1>( dsyr2k_node ), input_port<1>( dtrsm_join ) );
+ make_edge( dtrsm_join, dtrsm_node );
+
+ make_edge( output_port<0>( dtrsm_node ), input_port<0>( dsyr2k_join ) );
+ make_edge( output_port<1>( dtrsm_node ), input_port<1>( dsyr2k_join ) );
+ make_edge( output_port<2>( dsyr2k_node ), input_port<2>( dsyr2k_join ) );
+ make_edge( dsyr2k_join, dsyr2k_node );
+
+ // Now we need to send out the tiles to their first nodes
+ tag_t t;
+ t.tag = 0;
+ t.a[0] = 0;
+ t.a[1] = 0;
+ t.a[2] = 0;
+
+ // Send to feedback input of first dpotf2
+ // k == 0, j == 0, i == 0
+ dpotf2_node.try_put( std::make_pair( t, tile[0][0] ) );
+
+ // Send to feedback input (port 1) of each dtrsm
+ // k == 0, j == 1..p-1
+ for ( int j = 1; j < p; ++j ) {
+ t.a[1] = j;
+ input_port<1>( dtrsm_join ).try_put( std::make_pair( t, tile[0][j] ) );
+ }
+
+ // Send to feedback input (port 2) of each dsyr2k
+ // k == 0
+ for ( int i = 1; i < p; ++i ) {
+ t.a[2] = i;
+
+ for ( int j = i; j < p; ++j ) {
+ t.a[1] = j;
+ input_port<2>( dsyr2k_join ).try_put( std::make_pair( t, tile[i][j] ) );
+ }
+ }
+
+ g.wait_for_all();
+ }
+};
+
+/************************************************************
+ End data join graph based version of cholesky
+************************************************************/
+
+/************************************************************
+ Begin dependence graph based version of cholesky
+************************************************************/
+
+typedef tbb::flow::continue_node< tbb::flow::continue_msg > continue_type;
+typedef continue_type * continue_ptr_type;
+
+#if !__TBB_CPP11_LAMBDAS_PRESENT
+// Using helper functor classes (instead of built-in C++ 11 lambda functions)
+class call_dpotf2_functor
+{
+ double ***tile;
+ int b, k;
+public:
+ call_dpotf2_functor( double ***tile_, int b_, int k_ )
+ : tile(tile_), b(b_), k(k_) {}
+
+ void operator()( const tbb::flow::continue_msg & ) { call_dpotf2( tile, b, k ); }
+};
+
+class call_dtrsm_functor
+{
+ double ***tile;
+ int b, k, j;
+public:
+ call_dtrsm_functor( double ***tile_, int b_, int k_, int j_ )
+ : tile(tile_), b(b_), k(k_), j(j_) {}
+
+ void operator()( const tbb::flow::continue_msg & ) { call_dtrsm( tile, b, k, j ); }
+};
+
+class call_dsyr2k_functor
+{
+ double ***tile;
+ int b, k, j, i;
+public:
+ call_dsyr2k_functor( double ***tile_, int b_, int k_, int j_, int i_ )
+ : tile(tile_), b(b_), k(k_), j(j_), i(i_) {}
+
+ void operator()( const tbb::flow::continue_msg & ) { call_dsyr2k( tile, b, k, j, i ); }
+};
+
+#endif // !__TBB_CPP11_LAMBDAS_PRESENT
+
+class algorithm_depend : public algorithm
+{
+public:
+ algorithm_depend() : algorithm("depend_cholesky", true) {}
+
+protected:
+ virtual void func( void * ptr, int n, int b ) {
+ double ***tile = (double ***)ptr;
+
+ const int p = n/b;
+ continue_ptr_type *c = new continue_ptr_type[p];
+ continue_ptr_type **t = new continue_ptr_type *[p];
+ continue_ptr_type ***u = new continue_ptr_type **[p];
+
+ tbb::flow::graph g;
+ for ( int k = p-1; k >= 0; --k ) {
+ c[k] = new continue_type( g,
+#if __TBB_CPP11_LAMBDAS_PRESENT
+ [=]( const tbb::flow::continue_msg & ) { call_dpotf2( tile, b, k ); } );
+#else
+ call_dpotf2_functor( tile, b, k ) );
+#endif // __TBB_CPP11_LAMBDAS_PRESENT
+ t[k] = new continue_ptr_type[p];
+ u[k] = new continue_ptr_type *[p];
+
+ for ( int j = k+1; j < p; ++j ) {
+ t[k][j] = new continue_type( g,
+#if __TBB_CPP11_LAMBDAS_PRESENT
+ [=]( const tbb::flow::continue_msg & ) { call_dtrsm( tile, b, k, j ); } );
+#else
+ call_dtrsm_functor( tile, b, k, j ) );
+#endif // __TBB_CPP11_LAMBDAS_PRESENT
+ make_edge( *c[k], *t[k][j] );
+ u[k][j] = new continue_ptr_type[p];
+
+ for ( int i = k+1; i <= j; ++i ) {
+ u[k][j][i] = new continue_type( g,
+#if __TBB_CPP11_LAMBDAS_PRESENT
+ [=]( const tbb::flow::continue_msg & ) { call_dsyr2k( tile, b, k, j, i ); } );
+#else
+ call_dsyr2k_functor( tile, b, k, j, i ) );
+#endif // __TBB_CPP11_LAMBDAS_PRESENT
+
+ if ( k < p-2 && k+1 != j && k+1 != i ) {
+ make_edge( *u[k][j][i], *u[k+1][j][i] );
+ }
+
+ make_edge( *t[k][j], *u[k][j][i] );
+
+ if ( i != j ) {
+ make_edge( *t[k][i], *u[k][j][i] );
+ }
+
+ if ( k < p-2 && j > i && i == k+1 ) {
+ make_edge( *u[k][j][i], *t[i][j] );
+ }
+ }
+ }
+
+ if ( k != p-1 ) {
+ make_edge( *u[k][k+1][k+1], *c[k+1] );
+ }
+ }
+
+ c[0]->try_put( tbb::flow::continue_msg() );
+ g.wait_for_all();
+ }
+}; // class algorithm_depend
+
+/************************************************************
+ End dependence graph based version of cholesky
+************************************************************/
+
+bool process_args( int argc, char *argv[] ) {
+ utility::parse_cli_arguments( argc, argv,
+ utility::cli_argument_pack()
+ //"-h" option for displaying help is present implicitly
+ .positional_arg( g_n, "size", "the row/column size of NxN matrix (size <= 46000)" )
+ .positional_arg( g_b, "blocksize", "the block size; size must be a multiple of the blocksize" )
+ .positional_arg( g_num_trials, "num_trials", "the number of times to run each algorithm" )
+ .positional_arg( g_output_prefix, "output_prefix",
+ "if provided the prefix will be preappended to output files:\n"
+ " output_prefix_posdef.txt\n"
+ " output_prefix_X.txt; where X is the algorithm used\n"
+ " if output_prefix is not provided, no output will be written" )
+ .positional_arg( g_alg_name, "algorithm", "name of the used algorithm - can be dpotrf, crout, depend or join" )
+ .positional_arg( g_num_tbb_threads, "num_tbb_threads", "number of started TBB threads" )
+
+ .arg( g_input_file_name, "input_file", "if provided it will be read to get the input matrix" )
+ .arg( g_benchmark_run, "-x", "skips all validation" )
+ );
+
+ if ( g_n > 46000 ) {
+ printf( "ERROR: invalid 'size' value (must be less or equal 46000): %d\n", g_n );
+ return false;
+ }
+
+ if ( g_n%g_b != 0 ) {
+ printf( "ERROR: size %d must be a multiple of the blocksize %d\n", g_n, g_b );
+ return false;
+ }
+
+ if ( g_n/g_b > 256 ) {
+ // Because tile index size is 1 byte only in tag_t type
+ printf( "ERROR: size / blocksize must be less or equal 256, but %d / %d = %d\n", g_n, g_b, g_n/g_b );
+ return false;
+ }
+
+ if ( g_b == -1 || (g_n == -1 && g_input_file_name == NULL) ) {
+ return false;
+ }
+
+ return true;
+}
+
+int main(int argc, char *argv[]) {
+ typedef std::map< std::string, algorithm * > algmap_t;
+ algmap_t algmap;
+
+ // Init algorithms
+ algmap["dpotrf"] = new algorithm_dpotrf;
+ algmap["crout"] = new algorithm_crout;
+ algmap["depend"] = new algorithm_depend;
+ algmap["join"] = new algorithm_join;
+
+ if ( !process_args( argc, argv ) ) {
+ printf( "ERROR: Invalid arguments. Run: %s -h\n", argv[0] );
+ exit( 1 );
+ }
+
+ tbb::task_scheduler_init init( g_num_tbb_threads );
+ double *A = NULL;
+
+ // Read input matrix
+ matrix_init( A, g_n, g_input_file_name );
+
+ // Write input matrix if output_prefix is set and we didn't read from a file
+ if ( !g_input_file_name && g_output_prefix ) {
+ std::string s( g_output_prefix );
+ s += "_posdef.txt";
+ matrix_write( A, g_n, s.c_str() );
+ }
+
+ if ( g_alg_name.empty() ) {
+ for ( algmap_t::iterator i = algmap.begin(); i != algmap.end(); ++i ) {
+ algorithm* const alg = i->second;
+ (*alg)( A, g_n, g_b, g_num_trials );
+ }
+ }
+ else {
+ algorithm* const alg = algmap[g_alg_name];
+
+ if ( alg != NULL ) {
+ (*alg)( A, g_n, g_b, g_num_trials );
+ }
+ else {
+ printf( "ERROR: Invalid algorithm name: %s\n", g_alg_name.c_str() );
+ exit( 2 );
+ }
+ }
+
+ free( A );
+ return 0;
+}
diff --git a/examples/graph/cholesky/index.html b/examples/graph/cholesky/index.html
new file mode 100644
index 0000000000..b41a4abccc
--- /dev/null
+++ b/examples/graph/cholesky/index.html
@@ -0,0 +1,69 @@
+
+
+
+Overview
+This directory contains an example of several versions of Cholesky
+Factorization algorithm.
+
+dpotrf : An implementation that calls the Intel® Math Kernel Library (Intel® MKL) dpotrf function to directly perform the factorization. This can be a serial implementation or threaded implementation depending on the version of the Intel MKL library that is linked against.
+
+crout : A serial implementation that uses the Crout-Cholesky algorithm for factorization. The same approach is parallelized for the other Intel® Threading Building Blocks (Intel® TBB) based approaches below.
+
+depend : A parallel version of Crout-Cholesky factorization that uses an Intel TBB flow graph. This version uses a dependence graph made solely of continue_node objects. This an inspector-executor approach, where a loop nest that is similar to the serial implementation is used to create an unrolled version of the computation. Where the Intel MKL calls would have been made in the original serial implementation of Crout-Cholesky, instead nodes are created and these nodes are linked by edges to the other nodes that they are dependent upon. The resulting graph is relatively large, with a node for each instance of each Intel MKL call. For example, there are many nodes that call dtrsm; one for each invocation of dtrsm in the serial implementation. The is very little overhead in message management for this version and so it is often the highest performing.
+
+join : A parallel version of Crout-Cholesky factorization that uses an Intel TBB flow graph. This version uses a data flow approach. This is a small, compact graph that passes tiles along its edges. There is one node per type of Intel MKL call, plus join_nodes that combine the inputs required for each call. So for example, there is only a single node that applies all calls to dtrsm. This node is invoked when the tiles that hold the inputs and outputs for an invocation are matched together in the tag-matching join_node that precedes it. The tag represents the iteration values of the i, j, k loops in the serial implementation at that invocation of the call. There is some overhead in message matching and forwarding, so it may not perform as well as the dependence graph implementation.
+
+ This sample code requires a recent Intel TBB library (one that supports the flow graph). And also the Intel MKL library.
+Files
+
+cholesky.cpp
+Source code for example.
+ init.cpp
+Source code for example.
+ cholesky.h
+Header file for example.
+ Makefile
+Makefile for building example.
+
+
+Directories
+
+msvs
+Contains Microsoft* Visual Studio* 2010 workspace for building and running the
+ example (Windows* systems only).
+ xcode
+Contains Xcode* IDE workspace for building and running the example (OS X*
+ systems only).
+
+To Build
+General build directions can be found here .
+
+Usage
+
+cholesky [size=value ] [blocksize=value ] [num_trials=value ] [output_prefix=value ] [algorithm=value ] [num_tbb_threads=value ] [input_file=value ] [-x ] [-h ] [size [blocksize [num_trials [output_prefix [algorithm [num_tbb_threads ]]]]]]
+where:
+size - the row/column size of NxN matrix (size <= 46000)
+blocksize - the block size; size must be a multiple of the blocksize
+num_trials - the number of times to run each algorithm
+output_prefix - if provided the prefix will be preappended to output files:
+ output_prefix_posdef.txt and
+ output_prefix_X.txt ; where X is the algorithm used
+ if output_prefix is not provided, no output will be written
+algorithm - name of the used algorithm - can be dpotrf, crout, depend or join
+num_tbb_threads - number of started TBB threads
+input_file - if provided it will be read to get the input matrix
+-x - skips all validation
+-h - show this message
+
+
+
+Up to parent directory
+
+Copyright © 2005-2015 Intel Corporation. All Rights Reserved.
+
+Intel is a registered trademark or trademark of Intel Corporation
+or its subsidiaries in the United States and other countries.
+
+* Other names and brands may be claimed as the property of others.
+
+
diff --git a/examples/graph/cholesky/init.cpp b/examples/graph/cholesky/init.cpp
new file mode 100644
index 0000000000..b9095fedce
--- /dev/null
+++ b/examples/graph/cholesky/init.cpp
@@ -0,0 +1,138 @@
+/*
+ Copyright 2005-2015 Intel Corporation. All Rights Reserved.
+
+ This file is part of Threading Building Blocks. Threading Building Blocks is free software;
+ you can redistribute it and/or modify it under the terms of the GNU General Public License
+ version 2 as published by the Free Software Foundation. Threading Building Blocks is
+ distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the
+ implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ See the GNU General Public License for more details. You should have received a copy of
+ the GNU General Public License along with Threading Building Blocks; if not, write to the
+ Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
+ As a special exception, you may use this file as part of a free software library without
+ restriction. Specifically, if other files instantiate templates or use macros or inline
+ functions from this file, or you compile this file and link it with other files to produce
+ an executable, this file does not by itself cause the resulting executable to be covered
+ by the GNU General Public License. This exception does not however invalidate any other
+ reasons why the executable file might be covered by the GNU General Public License.
+*/
+
+#include
+#include
+#include
+#include
+#include
+
+static void posdef_gen( double * A, int n )
+{
+ /* Allocate memory for the matrix and its transpose */
+ double *L = (double *)calloc( sizeof( double ), n*n );
+ assert( L );
+
+ double *LT = (double *)calloc( sizeof( double ), n*n) ;
+ assert( LT );
+
+ memset( A, 0, sizeof( double )*n*n );
+
+ /* Generate a conditioned matrix and fill it with random numbers */
+ for ( int j = 0; j < n; ++j ) {
+ for ( int k = 0; k < j; ++k ) {
+ // The initial value has to be between [0,1].
+ L[k*n+j] = ( ( (j*k) / ((double)(j+1)) / ((double)(k+2)) * 2.0) - 1.0 ) / ((double)n);
+ }
+
+ L[j*n+j] = 1;
+ }
+
+ /* Compute transpose of the matrix */
+ for ( int i = 0; i < n; ++i ) {
+ for ( int j = 0; j < n; ++j ) {
+ LT[j*n+i] = L[i*n+j];
+ }
+ }
+ cblas_dgemm( CblasColMajor, CblasNoTrans, CblasNoTrans, n, n, n, 1, L, n, LT, n, 0, A, n );
+
+ free( L );
+ free( LT );
+}
+
+// Read the matrix from the input file
+void matrix_init( double * &A, int &n, const char *fname ) {
+ if( fname ) {
+ int i;
+ int j;
+ FILE *fp;
+
+ fp = fopen( fname, "r" );
+ if ( fp == NULL ) {
+ fprintf( stderr, "\nFile does not exist\n" );
+ exit( 0 );
+ }
+ if ( fscanf( fp, "%d", &n ) <= 0 ) {
+ fprintf( stderr,"\nCouldn't read n from %s\n", fname );
+ exit( 1 );
+ }
+ A = (double *)calloc( sizeof( double ), n*n );
+ for ( i = 0; i < n; ++i ) {
+ for ( j = 0; j <= i; ++j ) {
+ if( fscanf( fp, "%lf ", &A[i*n+j] ) <= 0) {
+ fprintf( stderr,"\nMatrix size incorrect %i %i\n", i, j );
+ exit( 1 );
+ }
+ if ( i != j ) {
+ A[j*n+i] = A[i*n+j];
+ }
+ }
+ }
+ fclose( fp );
+ } else {
+ A = (double *)calloc( sizeof( double ), n*n );
+ posdef_gen( A, n );
+ }
+}
+
+// write matrix to file
+void matrix_write ( double *A, int n, const char *fname, bool is_triangular = false )
+{
+ if( fname ) {
+ int i = 0;
+ int j = 0;
+ FILE *fp = NULL;
+
+ fp = fopen( fname, "w" );
+ if ( fp == NULL ) {
+ fprintf( stderr, "\nCould not open file %s for writing.\n", fname );
+ exit( 0 );
+ }
+ fprintf( fp, "%d\n", n );
+ for ( i = 0; i < n; ++i) {
+ for ( j = 0; j <= i; ++j ) {
+ fprintf( fp, "%lf ", A[j*n+i] );
+ }
+ if ( !is_triangular ) {
+ for ( ; j < n; ++j ) {
+ fprintf( fp, "%lf ", A[i*n+j] );
+ }
+ } else {
+ for ( ; j < n; ++j ) {
+ fprintf( fp, "%lf ", 0.0 );
+ }
+ }
+ fprintf( fp, "\n" );
+ }
+ if ( is_triangular ) {
+ fprintf( fp, "\n" );
+ for ( i = 0; i < n; ++i ) {
+ for ( j = 0; j < i; ++j ) {
+ fprintf( fp, "%lf ", 0.0 );
+ }
+ for ( ; j < n; ++j ) {
+ fprintf( fp, "%lf ", A[i*n+j] );
+ }
+ fprintf( fp, "\n" );
+ }
+ }
+ fclose( fp );
+ }
+}
diff --git a/examples/graph/cholesky/msvs/cholesky.sln b/examples/graph/cholesky/msvs/cholesky.sln
new file mode 100644
index 0000000000..fa06b532e0
--- /dev/null
+++ b/examples/graph/cholesky/msvs/cholesky.sln
@@ -0,0 +1,26 @@
+
+Microsoft Visual Studio Solution File, Format Version 11.00
+# Visual Studio 2010
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cholesky", "cholesky.vcxproj", "{3AA40693-F93D-4D4B-B32E-068F511A252E}"
+EndProject
+Global
+ GlobalSection(SolutionConfigurationPlatforms) = preSolution
+ Debug|Win32 = Debug|Win32
+ Debug|x64 = Debug|x64
+ Release|Win32 = Release|Win32
+ Release|x64 = Release|x64
+ EndGlobalSection
+ GlobalSection(ProjectConfigurationPlatforms) = postSolution
+ {3AA40693-F93D-4D4B-B32E-068F511A252E}.Debug|Win32.ActiveCfg = Debug|Win32
+ {3AA40693-F93D-4D4B-B32E-068F511A252E}.Debug|Win32.Build.0 = Debug|Win32
+ {3AA40693-F93D-4D4B-B32E-068F511A252E}.Debug|x64.ActiveCfg = Debug|x64
+ {3AA40693-F93D-4D4B-B32E-068F511A252E}.Debug|x64.Build.0 = Debug|x64
+ {3AA40693-F93D-4D4B-B32E-068F511A252E}.Release|Win32.ActiveCfg = Release|Win32
+ {3AA40693-F93D-4D4B-B32E-068F511A252E}.Release|Win32.Build.0 = Release|Win32
+ {3AA40693-F93D-4D4B-B32E-068F511A252E}.Release|x64.ActiveCfg = Release|x64
+ {3AA40693-F93D-4D4B-B32E-068F511A252E}.Release|x64.Build.0 = Release|x64
+ EndGlobalSection
+ GlobalSection(SolutionProperties) = preSolution
+ HideSolutionNode = FALSE
+ EndGlobalSection
+EndGlobal
diff --git a/examples/graph/cholesky/msvs/cholesky.vcxproj b/examples/graph/cholesky/msvs/cholesky.vcxproj
new file mode 100644
index 0000000000..d852704f99
--- /dev/null
+++ b/examples/graph/cholesky/msvs/cholesky.vcxproj
@@ -0,0 +1,202 @@
+
+
+
+
+ Debug
+ Win32
+
+
+ Debug
+ x64
+
+
+ Release
+ Win32
+
+
+ Release
+ x64
+
+
+
+ cholesky
+ {3AA40693-F93D-4D4B-B32E-068F511A252E}
+ cholesky
+ Win32Proj
+
+
+
+
+ Application
+ MultiByte
+
+
+ Application
+ MultiByte
+
+
+ Application
+ MultiByte
+
+
+ Application
+ MultiByte
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ <_ProjectFileVersion>10.0.40219.1
+ $(TEMP)\tbb_examples\$(Configuration)\
+ $(TEMP)\tbb_examples\$(SolutionName)\$(Configuration)\
+ false
+ $(TEMP)\tbb_examples\$(Platform)\$(Configuration)\
+ $(TEMP)\tbb_examples\$(SolutionName)\$(Platform)\$(Configuration)\
+ false
+ $(TEMP)\tbb_examples\$(Configuration)\
+ $(TEMP)\tbb_examples\$(SolutionName)\$(Configuration)\
+ false
+ $(TEMP)\tbb_examples\$(Platform)\$(Configuration)\
+ $(TEMP)\tbb_examples\$(SolutionName)\$(Platform)\$(Configuration)\
+ false
+ AllRules.ruleset
+
+
+ AllRules.ruleset
+
+
+ AllRules.ruleset
+
+
+ AllRules.ruleset
+
+
+
+
+
+ Disabled
+ $(TBBROOT)\include;$(MKLROOT)\include;$(SolutionDir)\..\..\..\..\include;%(AdditionalIncludeDirectories)
+ WIN32;_DEBUG;_CONSOLE;TBB_USE_DEBUG;%(PreprocessorDefinitions)
+ MultiThreadedDebugDLL
+
+
+ ProgramDatabase
+ GenerateParallelCode
+
+
+ tbb_debug.lib;mkl_rt.lib;%(AdditionalDependencies)
+ $(TBBROOT)\lib\ia32\vc_mt;$(TBBROOT)\lib\ia32\vc10;$(MKLROOT)\lib\ia32;$(SolutionDir)\..\..\..\..\lib\ia32\vc_mt;$(SolutionDir)\..\..\..\..\lib\ia32\vc10;%(AdditionalLibraryDirectories)
+ true
+ Console
+ MachineX86
+ false
+
+
+ Copying DLLs and PDBs
+ call "$(SolutionDir)\..\..\..\common\copy_libraries.bat" ia32 debug "$(OutDir)"
+
+
+
+
+ X64
+
+
+ Disabled
+ $(TBBROOT)\include;$(MKLROOT)\include;$(SolutionDir)\..\..\..\..\include;%(AdditionalIncludeDirectories)
+ WIN64;_DEBUG;_CONSOLE;TBB_USE_DEBUG;%(PreprocessorDefinitions)
+ MultiThreadedDebugDLL
+
+
+ ProgramDatabase
+ GenerateParallelCode
+
+
+ tbb_debug.lib;mkl_rt.lib;%(AdditionalDependencies)
+ $(TBBROOT)\lib\intel64\vc_mt;$(TBBROOT)\lib\intel64\vc10;$(MKLROOT)\lib\intel64;$(SolutionDir)\..\..\..\..\lib\intel64\vc_mt;$(SolutionDir)\..\..\..\..\lib\intel64\vc10;%(AdditionalLibraryDirectories)
+ true
+ Console
+ MachineX64
+ false
+
+
+ Copying DLLs and PDBs
+ call "$(SolutionDir)\..\..\..\common\copy_libraries.bat" intel64 debug "$(OutDir)"
+
+
+
+
+ $(TBBROOT)\include;$(MKLROOT)\include;$(SolutionDir)\..\..\..\..\include;%(AdditionalIncludeDirectories)
+ WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)
+ MultiThreadedDLL
+
+
+ ProgramDatabase
+ GenerateParallelCode
+
+
+ tbb.lib;mkl_rt.lib;%(AdditionalDependencies)
+ $(TBBROOT)\lib\ia32\vc_mt;$(TBBROOT)\lib\ia32\vc10;$(MKLROOT)\lib\ia32;$(SolutionDir)\..\..\..\..\lib\ia32\vc_mt;$(SolutionDir)\..\..\..\..\lib\ia32\vc10;%(AdditionalLibraryDirectories)
+ true
+ Console
+ true
+ true
+ MachineX86
+ false
+
+
+ Copying DLLs and PDBs
+ call "$(SolutionDir)\..\..\..\common\copy_libraries.bat" ia32 release "$(OutDir)"
+
+
+
+
+ X64
+
+
+ $(TBBROOT)\include;$(MKLROOT)\include;$(SolutionDir)\..\..\..\..\include;%(AdditionalIncludeDirectories)
+ WIN64;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)
+ MultiThreadedDLL
+
+
+ ProgramDatabase
+ GenerateParallelCode
+
+
+ tbb.lib;mkl_rt.lib;%(AdditionalDependencies)
+ $(TBBROOT)\lib\intel64\vc_mt;$(TBBROOT)\lib\intel64\vc10;$(MKLROOT)\lib\intel64;$(SolutionDir)\..\..\..\..\lib\intel64\vc_mt;$(SolutionDir)\..\..\..\..\lib\intel64\vc10;%(AdditionalLibraryDirectories)
+ true
+ Console
+ true
+ true
+ MachineX64
+ false
+
+
+ Copying DLLs and PDBs
+ call "$(SolutionDir)\..\..\..\common\copy_libraries.bat" intel64 release "$(OutDir)"
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/examples/graph/cholesky/xcode/cholesky.xcodeproj/project.pbxproj b/examples/graph/cholesky/xcode/cholesky.xcodeproj/project.pbxproj
new file mode 100644
index 0000000000..63a3b2cb54
--- /dev/null
+++ b/examples/graph/cholesky/xcode/cholesky.xcodeproj/project.pbxproj
@@ -0,0 +1,309 @@
+// !$*UTF8*$!
+{
+ archiveVersion = 1;
+ classes = {
+ };
+ objectVersion = 46;
+ objects = {
+
+/* Begin PBXBuildFile section */
+ A1F593A60B8F042A00073279 /* Cholesky.cpp in Sources */ = {isa = PBXBuildFile; fileRef = A1F593A50B8F042A00073279 /* Cholesky.cpp */; };
+ A1F593A60B8F053A00073279 /* init.cpp in Sources */ = {isa = PBXBuildFile; fileRef = A1F593A50B8F053A00073279 /* init.cpp */; };
+ A1F593B70B8F06F900073279 /* libtbb.dylib in Frameworks */ = {isa = PBXBuildFile; fileRef = A1F593B30B8F06F900073279 /* libtbb.dylib */; };
+ A1F593BB0B8F072500073279 /* libtbb.dylib in CopyFiles */ = {isa = PBXBuildFile; fileRef = A1F593B30B8F06F900073279 /* libtbb.dylib */; };
+/* End PBXBuildFile section */
+
+/* Begin PBXCopyFilesBuildPhase section */
+ 8DD76F690486A84900D96B5E /* CopyFiles */ = {
+ isa = PBXCopyFilesBuildPhase;
+ buildActionMask = 12;
+ dstPath = "";
+ dstSubfolderSpec = 16;
+ files = (
+ A1F593BB0B8F072500073279 /* libtbb.dylib in CopyFiles */,
+ );
+ runOnlyForDeploymentPostprocessing = 0;
+ };
+/* End PBXCopyFilesBuildPhase section */
+
+/* Begin PBXFileReference section */
+ 8DD76F6C0486A84900D96B5E /* Cholesky */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = Cholesky; sourceTree = BUILT_PRODUCTS_DIR; };
+ A1F593A50B8F042A00073279 /* Cholesky.cpp */ = {isa = PBXFileReference; fileEncoding = 30; lastKnownFileType = sourcecode.cpp.cpp; name = Cholesky.cpp; path = ../Cholesky.cpp; sourceTree = SOURCE_ROOT; };
+ A1F593A50B8F053A00073279 /* init.cpp */ = {isa = PBXFileReference; fileEncoding = 30; lastKnownFileType = sourcecode.cpp.cpp; name = init.cpp; path = ../init.cpp; sourceTree = SOURCE_ROOT; };
+ A1F593B30B8F06F900073279 /* libtbb.dylib */ = {isa = PBXFileReference; lastKnownFileType = "compiled.mach-o.dylib"; name = libtbb.dylib; path = ../../../../lib/libtbb.dylib; sourceTree = SOURCE_ROOT; };
+/* End PBXFileReference section */
+
+/* Begin PBXFrameworksBuildPhase section */
+ 8DD76F660486A84900D96B5E /* Frameworks */ = {
+ isa = PBXFrameworksBuildPhase;
+ buildActionMask = 2147483647;
+ files = (
+ A1F593B70B8F06F900073279 /* libtbb.dylib in Frameworks */,
+ );
+ runOnlyForDeploymentPostprocessing = 0;
+ };
+/* End PBXFrameworksBuildPhase section */
+
+/* Begin PBXGroup section */
+ 08FB7794FE84155DC02AAC07 /* Cholesky */ = {
+ isa = PBXGroup;
+ children = (
+ 08FB7795FE84155DC02AAC07 /* Source */,
+ A1F593B20B8F06F900073279 /* External Frameworks and Libraries */,
+ 1AB674ADFE9D54B511CA2CBB /* Products */,
+ );
+ name = Cholesky;
+ sourceTree = "";
+ };
+ 08FB7795FE84155DC02AAC07 /* Source */ = {
+ isa = PBXGroup;
+ children = (
+ A1F593A50B8F042A00073279 /* Cholesky.cpp */,
+ A1F593A50B8F053A00073279 /* init.cpp */,
+ );
+ name = Source;
+ sourceTree = "";
+ };
+ 1AB674ADFE9D54B511CA2CBB /* Products */ = {
+ isa = PBXGroup;
+ children = (
+ 8DD76F6C0486A84900D96B5E /* Cholesky */,
+ );
+ name = Products;
+ sourceTree = "";
+ };
+ A1F593B20B8F06F900073279 /* External Frameworks and Libraries */ = {
+ isa = PBXGroup;
+ children = (
+ A1F593B30B8F06F900073279 /* libtbb.dylib */,
+ );
+ name = "External Frameworks and Libraries";
+ sourceTree = "";
+ };
+/* End PBXGroup section */
+
+/* Begin PBXNativeTarget section */
+ 8DD76F620486A84900D96B5E /* Cholesky */ = {
+ isa = PBXNativeTarget;
+ buildConfigurationList = 1DEB923108733DC60010E9CD /* Build configuration list for PBXNativeTarget "Cholesky" */;
+ buildPhases = (
+ 8DD76F640486A84900D96B5E /* Sources */,
+ 8DD76F660486A84900D96B5E /* Frameworks */,
+ 8DD76F690486A84900D96B5E /* CopyFiles */,
+ );
+ buildRules = (
+ );
+ dependencies = (
+ );
+ name = Cholesky;
+ productInstallPath = "$(HOME)/bin";
+ productName = Cholesky;
+ productReference = 8DD76F6C0486A84900D96B5E /* Cholesky */;
+ productType = "com.apple.product-type.tool";
+ };
+/* End PBXNativeTarget section */
+
+/* Begin PBXProject section */
+ 08FB7793FE84155DC02AAC07 /* Project object */ = {
+ isa = PBXProject;
+ attributes = {
+ LastUpgradeCheck = 0410;
+ };
+ buildConfigurationList = 1DEB923508733DC60010E9CD /* Build configuration list for PBXProject "cholesky" */;
+ compatibilityVersion = "Xcode 3.2";
+ developmentRegion = English;
+ hasScannedForEncodings = 1;
+ knownRegions = (
+ en,
+ );
+ mainGroup = 08FB7794FE84155DC02AAC07 /* Cholesky */;
+ projectDirPath = "";
+ projectRoot = "";
+ targets = (
+ 8DD76F620486A84900D96B5E /* Cholesky */,
+ );
+ };
+/* End PBXProject section */
+
+/* Begin PBXSourcesBuildPhase section */
+ 8DD76F640486A84900D96B5E /* Sources */ = {
+ isa = PBXSourcesBuildPhase;
+ buildActionMask = 2147483647;
+ files = (
+ A1F593A60B8F042A00073279 /* Cholesky.cpp in Sources */,
+ A1F593A60B8F053A00073279 /* init.cpp in Sources */,
+ );
+ runOnlyForDeploymentPostprocessing = 0;
+ };
+/* End PBXSourcesBuildPhase section */
+
+/* Begin XCBuildConfiguration section */
+ 1DEB923208733DC60010E9CD /* Debug */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ COPY_PHASE_STRIP = NO;
+ GCC_DYNAMIC_NO_PIC = NO;
+ GCC_OPTIMIZATION_LEVEL = 0;
+ GCC_VERSION = "";
+ HEADER_SEARCH_PATHS = ../../../../include;
+ INSTALL_PATH = "$(HOME)/bin";
+ LIBRARY_SEARCH_PATHS = (
+ "$(inherited)",
+ ../../../../lib,
+ );
+ PRODUCT_NAME = Cholesky;
+ ZERO_LINK = NO;
+ };
+ name = Debug;
+ };
+ 1DEB923308733DC60010E9CD /* Release */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ GCC_GENERATE_DEBUGGING_SYMBOLS = NO;
+ GCC_VERSION = "";
+ HEADER_SEARCH_PATHS = ../../../../include;
+ INSTALL_PATH = "$(HOME)/bin";
+ LIBRARY_SEARCH_PATHS = (
+ "$(inherited)",
+ ../../../../lib,
+ );
+ PRODUCT_NAME = Cholesky;
+ ZERO_LINK = NO;
+ };
+ name = Release;
+ };
+ 1DEB923608733DC60010E9CD /* Debug */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ALWAYS_SEARCH_USER_PATHS = NO;
+ ARCHS = i386;
+ GCC_ENABLE_CPP_RTTI = YES;
+ GCC_MODEL_TUNING = "";
+ GCC_VERSION = 4.0;
+ GCC_WARN_ABOUT_RETURN_TYPE = YES;
+ GCC_WARN_UNUSED_VARIABLE = YES;
+ PRECOMPS_INCLUDE_HEADERS_FROM_BUILT_PRODUCTS_DIR = NO;
+ SYMROOT = "/tmp/tbb-$(USER)";
+ };
+ name = Debug;
+ };
+ 1DEB923708733DC60010E9CD /* Release */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ALWAYS_SEARCH_USER_PATHS = NO;
+ ARCHS = i386;
+ GCC_ENABLE_CPP_RTTI = YES;
+ GCC_MODEL_TUNING = "";
+ GCC_VERSION = 4.0;
+ GCC_WARN_ABOUT_RETURN_TYPE = YES;
+ GCC_WARN_UNUSED_VARIABLE = YES;
+ PRECOMPS_INCLUDE_HEADERS_FROM_BUILT_PRODUCTS_DIR = NO;
+ SYMROOT = "/tmp/tbb-$(USER)";
+ };
+ name = Release;
+ };
+ A1F593C60B8F0E6E00073279 /* Debug64 */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ARCHS = "$(ARCHS_STANDARD_64_BIT)";
+ COPY_PHASE_STRIP = NO;
+ GCC_DYNAMIC_NO_PIC = NO;
+ GCC_OPTIMIZATION_LEVEL = 0;
+ GCC_VERSION = "";
+ HEADER_SEARCH_PATHS = ../../../../include;
+ INSTALL_PATH = "$(HOME)/bin";
+ LIBRARY_SEARCH_PATHS = (
+ "$(inherited)",
+ ../../../../lib,
+ );
+ PRODUCT_NAME = Cholesky;
+ ZERO_LINK = NO;
+ };
+ name = Debug64;
+ };
+ A1F593C70B8F0E6E00073279 /* Release64 */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ARCHS = "$(ARCHS_STANDARD_64_BIT)";
+ GCC_GENERATE_DEBUGGING_SYMBOLS = NO;
+ GCC_VERSION = "";
+ HEADER_SEARCH_PATHS = ../../../../include;
+ INSTALL_PATH = "$(HOME)/bin";
+ LIBRARY_SEARCH_PATHS = (
+ "$(inherited)",
+ ../../../../lib,
+ );
+ PRODUCT_NAME = Cholesky;
+ ZERO_LINK = NO;
+ };
+ name = Release64;
+ };
+ A1F593C80B8F0E6E00073279 /* Debug64 */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ALWAYS_SEARCH_USER_PATHS = NO;
+ ARCHS = i386;
+ GCC_ENABLE_CPP_RTTI = YES;
+ GCC_MODEL_TUNING = "";
+ GCC_VERSION = 4.0;
+ GCC_WARN_ABOUT_RETURN_TYPE = YES;
+ GCC_WARN_UNUSED_VARIABLE = YES;
+ OTHER_CPLUSPLUSFLAGS = (
+ "$(OTHER_CFLAGS)",
+ "-m64",
+ );
+ OTHER_LDFLAGS = "-m64";
+ PRECOMPS_INCLUDE_HEADERS_FROM_BUILT_PRODUCTS_DIR = NO;
+ SYMROOT = "/tmp/tbb-$(USER)";
+ };
+ name = Debug64;
+ };
+ A1F593C90B8F0E6E00073279 /* Release64 */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ALWAYS_SEARCH_USER_PATHS = NO;
+ ARCHS = i386;
+ GCC_ENABLE_CPP_RTTI = YES;
+ GCC_MODEL_TUNING = "";
+ GCC_VERSION = 4.0;
+ GCC_WARN_ABOUT_RETURN_TYPE = YES;
+ GCC_WARN_UNUSED_VARIABLE = YES;
+ OTHER_CPLUSPLUSFLAGS = (
+ "$(OTHER_CFLAGS)",
+ "-m64",
+ );
+ OTHER_LDFLAGS = "-m64";
+ PRECOMPS_INCLUDE_HEADERS_FROM_BUILT_PRODUCTS_DIR = NO;
+ SYMROOT = "/tmp/tbb-$(USER)";
+ };
+ name = Release64;
+ };
+/* End XCBuildConfiguration section */
+
+/* Begin XCConfigurationList section */
+ 1DEB923108733DC60010E9CD /* Build configuration list for PBXNativeTarget "Cholesky" */ = {
+ isa = XCConfigurationList;
+ buildConfigurations = (
+ 1DEB923208733DC60010E9CD /* Debug */,
+ A1F593C60B8F0E6E00073279 /* Debug64 */,
+ 1DEB923308733DC60010E9CD /* Release */,
+ A1F593C70B8F0E6E00073279 /* Release64 */,
+ );
+ defaultConfigurationIsVisible = 0;
+ defaultConfigurationName = Release;
+ };
+ 1DEB923508733DC60010E9CD /* Build configuration list for PBXProject "Cholesky" */ = {
+ isa = XCConfigurationList;
+ buildConfigurations = (
+ 1DEB923608733DC60010E9CD /* Debug */,
+ A1F593C80B8F0E6E00073279 /* Debug64 */,
+ 1DEB923708733DC60010E9CD /* Release */,
+ A1F593C90B8F0E6E00073279 /* Release64 */,
+ );
+ defaultConfigurationIsVisible = 0;
+ defaultConfigurationName = Release;
+ };
+/* End XCConfigurationList section */
+ };
+ rootObject = 08FB7793FE84155DC02AAC07 /* Project object */;
+}
diff --git a/examples/graph/fgbzip2/fgbzip2.cpp b/examples/graph/fgbzip2/fgbzip2.cpp
index 360c976e3f..01245a083b 100644
--- a/examples/graph/fgbzip2/fgbzip2.cpp
+++ b/examples/graph/fgbzip2/fgbzip2.cpp
@@ -21,7 +21,7 @@
#include "tbb/tbb_config.h"
#include "../../common/utility/utility.h"
-#if __TBB_CPP11_LAMBDAS_PRESENT
+#if __TBB_PREVIEW_ASYNC_NODE && __TBB_CPP11_LAMBDAS_PRESENT
#include
#include
@@ -180,7 +180,7 @@ void fgCompressionAsyncIO( std::ifstream& inputStream, std::ofstream& outputStre
tbb::flow::graph g;
- async_file_reader_node file_reader( g, [&ioActivity]( const tbb::flow::continue_msg& msg, async_file_reader_node::async_gateway_type& asyncGateway ) {
+ async_file_reader_node file_reader( g, tbb::flow::unlimited, [&ioActivity]( const tbb::flow::continue_msg& msg, async_file_reader_node::async_gateway_type& asyncGateway ) {
ioActivity.start_read( asyncGateway );
} );
@@ -190,7 +190,7 @@ void fgCompressionAsyncIO( std::ifstream& inputStream, std::ofstream& outputStre
return buffer.seq_id;
});
- async_file_writer_node output_writer( g, [&ioActivity](const buffer_t& buffer, async_file_writer_node::async_gateway_type& asyncGateway ) {
+ async_file_writer_node output_writer( g, tbb::flow::unlimited, [&ioActivity](const buffer_t& buffer, async_file_writer_node::async_gateway_type& asyncGateway ) {
ioActivity.write( buffer );
});
@@ -307,4 +307,4 @@ int main() {
utility::report_skipped();
return 0;
}
-#endif /* __TBB_CPP11_LAMBDAS_PRESENT */
+#endif /* __TBB_PREVIEW_ASYNC_NODE && __TBB_CPP11_LAMBDAS_PRESENT */
diff --git a/examples/graph/index.html b/examples/graph/index.html
index 71cc09aeac..b1b804233b 100644
--- a/examples/graph/index.html
+++ b/examples/graph/index.html
@@ -16,6 +16,8 @@ Directories
A simple example of a Kohonen Self-Organizing Map using cancellation.
fgbzip2
A parallel implementation of bzip2 block-sorting file compressor.
+ cholesky
+Several versions of Cholesky Factorization algorithm implementation.
diff --git a/examples/pipeline/square/Makefile.windows b/examples/pipeline/square/Makefile.windows
index 4de0b434d2..2914ce78f9 100644
--- a/examples/pipeline/square/Makefile.windows
+++ b/examples/pipeline/square/Makefile.windows
@@ -29,7 +29,7 @@ CXX2 = $(CXX1:icl.exe-=icl.exe)
CXX = $(CXX2:-=cl.exe)
# The C++ compiler options
-MYCXXFLAGS = /TP /EHsc /W3 /nologo /D _CONSOLE /D _MBCS /D WIN32 $(CXXFLAGS) /D _CRT_SECURE_NO_DEPRECATE /arch:sse2
+MYCXXFLAGS = /TP /EHsc /W3 /nologo /D _CONSOLE /D _MBCS /D WIN32 $(CXXFLAGS) /D _CRT_SECURE_NO_DEPRECATE
MYLDFLAGS =/INCREMENTAL:NO /NOLOGO /DEBUG /FIXED:NO $(LDFLAGS)
SOURCES = square.cpp gen_input.cpp
diff --git a/include/serial/tbb/parallel_for.h b/include/serial/tbb/parallel_for.h
index 89e5483ba1..a0d5403cfa 100644
--- a/include/serial/tbb/parallel_for.h
+++ b/include/serial/tbb/parallel_for.h
@@ -43,7 +43,7 @@
namespace tbb {
namespace serial {
-namespace interface7 {
+namespace interface9 {
// parallel_for serial annotated implementation
@@ -104,28 +104,37 @@ void start_for< Range, Body, Partitioner >::execute() {
/** @ingroup algorithms **/
template
void parallel_for( const Range& range, const Body& body ) {
- serial::interface7::start_for::run(range,body,__TBB_DEFAULT_PARTITIONER());
+ serial::interface9::start_for::run(range,body,__TBB_DEFAULT_PARTITIONER());
}
//! Parallel iteration over range with simple partitioner.
/** @ingroup algorithms **/
template
void parallel_for( const Range& range, const Body& body, const simple_partitioner& partitioner ) {
- serial::interface7::start_for::run(range,body,partitioner);
+ serial::interface9::start_for::run(range,body,partitioner);
}
//! Parallel iteration over range with auto_partitioner.
/** @ingroup algorithms **/
template
void parallel_for( const Range& range, const Body& body, const auto_partitioner& partitioner ) {
- serial::interface7::start_for::run(range,body,partitioner);
+ serial::interface9::start_for::run(range,body,partitioner);
}
+#if TBB_PREVIEW_STATIC_PARTITIONER
+//! Parallel iteration over range with static_partitioner.
+/** @ingroup algorithms **/
+template
+void parallel_for( const Range& range, const Body& body, const static_partitioner& partitioner ) {
+ serial::interface9::start_for::run(range,body,partitioner);
+}
+#endif
+
//! Parallel iteration over range with affinity_partitioner.
/** @ingroup algorithms **/
template
void parallel_for( const Range& range, const Body& body, affinity_partitioner& partitioner ) {
- serial::interface7::start_for::run(range,body,partitioner);
+ serial::interface9::start_for::run(range,body,partitioner);
}
//! Implementation of parallel iteration over stepped range of integers with explicit step and partitioner (ignored)
@@ -160,6 +169,13 @@ template
void parallel_for(Index first, Index last, Index step, const Function& f, const auto_partitioner& p) {
parallel_for_impl(first, last, step, f, p);
}
+#if TBB_PREVIEW_STATIC_PARTITIONER
+//! Parallel iteration over a range of integers with explicit step and static partitioner
+template
+void parallel_for(Index first, Index last, Index step, const Function& f, const static_partitioner& p) {
+ parallel_for_impl(first, last, step, f, p);
+}
+#endif
//! Parallel iteration over a range of integers with explicit step and affinity partitioner
template
void parallel_for(Index first, Index last, Index step, const Function& f, affinity_partitioner& p) {
@@ -181,20 +197,27 @@ template
void parallel_for(Index first, Index last, const Function& f, const auto_partitioner& p) {
parallel_for_impl(first, last, static_cast(1), f, p);
}
+#if TBB_PREVIEW_STATIC_PARTITIONER
+//! Parallel iteration over a range of integers with default step and static partitioner
+template
+void parallel_for(Index first, Index last, const Function& f, const static_partitioner& p) {
+ parallel_for_impl(first, last, static_cast(1), f, p);
+}
+#endif
//! Parallel iteration over a range of integers with default step and affinity_partitioner
template
void parallel_for(Index first, Index last, const Function& f, affinity_partitioner& p) {
parallel_for_impl(first, last, static_cast(1), f, p);
}
-} // namespace interface7
+} // namespace interfaceX
-using interface7::parallel_for;
+using interface9::parallel_for;
} // namespace serial
#ifndef __TBB_NORMAL_EXECUTION
-using serial::interface7::parallel_for;
+using serial::interface9::parallel_for;
#endif
} // namespace tbb
diff --git a/include/tbb/concurrent_vector.h b/include/tbb/concurrent_vector.h
index 80a57f12de..ec27013e4f 100644
--- a/include/tbb/concurrent_vector.h
+++ b/include/tbb/concurrent_vector.h
@@ -84,7 +84,7 @@ namespace internal {
//! Exception helper function
template
void handle_unconstructed_elements(T* array, size_t n_of_elements){
- std::memset(array, 0, n_of_elements * sizeof(T));
+ std::memset( array, 0, n_of_elements * sizeof( T ) );
}
//! Base class of concurrent vector implementation.
diff --git a/include/tbb/flow_graph.h b/include/tbb/flow_graph.h
index f3466388a9..f7d44c9976 100644
--- a/include/tbb/flow_graph.h
+++ b/include/tbb/flow_graph.h
@@ -34,6 +34,10 @@
#include "internal/_aggregator_impl.h"
#include "tbb_profiling.h"
+#if __TBB_PREVIEW_ASYNC_NODE
+#include "task_arena.h"
+#endif
+
#if TBB_DEPRECATED_FLOW_ENQUEUE
#define FLOW_SPAWN(a) tbb::task::enqueue((a))
#else
@@ -147,7 +151,7 @@ static tbb::task * const SUCCESSFULLY_ENQUEUED = (task *)-1;
enum reset_flags {
rf_reset_protocol = 0,
rf_reset_bodies = 1<<0, // delete the current node body, reset to a copy of the initial node body.
- rf_clear_edges = 1<<1 // delete edges
+ rf_clear_edges = 1<<1 // delete edges
};
// enqueue left task if necessary. Returns the non-enqueued task if there is one.
@@ -182,7 +186,7 @@ class receiver {
//! Put an item to the receiver
bool try_put( const T& t ) {
task *res = try_put_task(t);
- if(!res) return false;
+ if (!res) return false;
if (res != SUCCESSFULLY_ENQUEUED) FLOW_SPAWN(*res);
return true;
}
@@ -216,10 +220,13 @@ class receiver {
template friend class limiter_node;
virtual void reset_receiver(reset_flags f = rf_reset_protocol) = 0;
- template
- friend class internal::successor_cache;
+ template friend class internal::successor_cache;
virtual bool is_continue_receiver() { return false; }
-}; // class receiver
+
+#if __TBB_PREVIEW_OPENCL_NODE
+ template< typename, typename > friend class proxy_dependency_receiver;
+#endif /* __TBB_PREVIEW_OPENCL_NODE */
+}; // class receiver
#if TBB_PREVIEW_FLOW_GRAPH_FEATURES
//* holder of edges both for caches and for those nodes which do not have predecessor caches.
@@ -336,7 +343,7 @@ class continue_receiver : public receiver< continue_msg > {
}
#endif /* TBB_PREVIEW_FLOW_GRAPH_FEATURES */
-
+
protected:
template< typename R, typename B > friend class run_and_put_task;
template friend class internal::broadcast_cache;
@@ -351,8 +358,7 @@ class continue_receiver : public receiver< continue_msg > {
my_current_count = 0;
}
task * res = execute();
- if(!res) return SUCCESSFULLY_ENQUEUED;
- return res;
+ return res? res : SUCCESSFULLY_ENQUEUED;
}
#if TBB_PREVIEW_FLOW_GRAPH_FEATURES
@@ -370,7 +376,7 @@ class continue_receiver : public receiver< continue_msg > {
/*override*/void reset_receiver( reset_flags f ) {
my_current_count = 0;
- if(f & rf_clear_edges) {
+ if (f & rf_clear_edges) {
#if TBB_PREVIEW_FLOW_GRAPH_FEATURES
my_built_predecessors.clear();
#endif
@@ -382,12 +388,22 @@ class continue_receiver : public receiver< continue_msg > {
/** This should be very fast or else spawn a task. This is
called while the sender is blocked in the try_put(). */
virtual task * execute() = 0;
- template
- friend class internal::successor_cache;
+ template friend class internal::successor_cache;
/*override*/ bool is_continue_receiver() { return true; }
}; // class continue_receiver
} // interface8
+
+#if __TBB_PREVIEW_MESSAGE_BASED_KEY_MATCHING
+ template
+ K key_from_message( const T &t ) {
+ return t.key();
+ }
+#endif /* __TBB_PREVIEW_MESSAGE_BASED_KEY_MATCHING */
+
+ using interface8::sender;
+ using interface8::receiver;
+ using interface8::continue_receiver;
} // flow
} // tbb
@@ -495,7 +511,7 @@ class graph : tbb::internal::no_copy {
run_and_put_task( Receiver &r, Body& body ) : my_receiver(r), my_body(body) {}
task *execute() {
task *res = my_receiver.try_put_task( my_body() );
- if(res == SUCCESSFULLY_ENQUEUED) res = NULL;
+ if (res == SUCCESSFULLY_ENQUEUED) res = NULL;
return res;
}
private:
@@ -504,10 +520,28 @@ class graph : tbb::internal::no_copy {
};
typedef std::list task_list_type;
+#if __TBB_PREVIEW_ASYNC_NODE
+ class wait_functor {
+ task* graph_root_task;
+ public:
+ wait_functor( task* t ) : graph_root_task(t) {}
+ void operator()() const { graph_root_task->wait_for_all(); }
+ };
+
+ void prepare_task_arena() {
+ my_task_arena = new tbb::task_arena(tbb::internal::attach());
+ if (!my_task_arena->is_active())
+ my_task_arena->initialize(); // create a new, default-initialized arena
+ __TBB_ASSERT(my_task_arena->is_active(), NULL);
+ }
+#endif
+
public:
//! Constructs a graph with isolated task_group_context
- explicit graph() : my_nodes(NULL), my_nodes_last(NULL)
- {
+ graph() : my_nodes(NULL), my_nodes_last(NULL) {
+#if __TBB_PREVIEW_ASYNC_NODE
+ prepare_task_arena();
+#endif
own_context = true;
cancelled = false;
caught_exception = false;
@@ -520,8 +554,10 @@ class graph : tbb::internal::no_copy {
//! Constructs a graph with use_this_context as context
explicit graph(task_group_context& use_this_context) :
- my_context(&use_this_context), my_nodes(NULL), my_nodes_last(NULL)
- {
+ my_context(&use_this_context), my_nodes(NULL), my_nodes_last(NULL) {
+#if __TBB_PREVIEW_ASYNC_NODE
+ prepare_task_arena();
+#endif
own_context = false;
my_root_task = ( new ( task::allocate_root(*my_context) ) empty_task );
my_root_task->set_ref_count(1);
@@ -536,6 +572,9 @@ class graph : tbb::internal::no_copy {
my_root_task->set_ref_count(0);
task::destroy( *my_root_task );
if (own_context) delete my_context;
+#if __TBB_PREVIEW_ASYNC_NODE
+ delete my_task_arena;
+#endif
}
#if TBB_PREVIEW_FLOW_GRAPH_TRACE
@@ -590,7 +629,11 @@ class graph : tbb::internal::no_copy {
#if TBB_USE_EXCEPTIONS
try {
#endif
+#if __TBB_PREVIEW_ASYNC_NODE
+ my_task_arena->execute(wait_functor(my_root_task));
+#else
my_root_task->wait_for_all();
+#endif
cancelled = my_context->is_group_execution_cancelled();
#if TBB_USE_EXCEPTIONS
}
@@ -602,8 +645,13 @@ class graph : tbb::internal::no_copy {
throw;
}
#endif
- my_context->reset(); // consistent with behavior in catch()
- my_root_task->set_ref_count(1);
+ // TODO: the "if" condition below is just a work-around to support the concurrent wait
+ // mode. The cancelation and exception mechanisms are still broken in this mode.
+ // Consider using task group not to re-implement the same functionality.
+ if ( !(my_context->traits() & task_group_context::concurrent_wait) ) {
+ my_context->reset(); // consistent with behavior in catch()
+ my_root_task->set_ref_count(1);
+ }
}
}
@@ -662,13 +710,17 @@ class graph : tbb::internal::no_copy {
bool my_is_active;
task_list_type my_reset_task_list;
-
graph_node *my_nodes, *my_nodes_last;
spin_mutex nodelist_mutex;
void register_node(graph_node *n);
void remove_node(graph_node *n);
+#if __TBB_PREVIEW_ASYNC_NODE
+ template < typename Input, typename Output, typename Policy, typename Allocator >
+ friend class async_node;
+ task_arena* my_task_arena;
+#endif
}; // class graph
template
@@ -758,6 +810,12 @@ inline void graph::reset( reset_flags f ) {
graph_node *my_p = &(*ii);
my_p->reset_node(f);
}
+#if __TBB_PREVIEW_ASYNC_NODE
+ // Reattach the arena. Might be useful to run the graph in a particular task_arena
+ // while not limiting graph lifetime to a single task_arena::execute() call.
+ delete my_task_arena;
+ prepare_task_arena();
+#endif
set_active(true);
// now spawn the tasks necessary to start the graph
for(task_list_type::iterator rti = my_reset_task_list.begin(); rti != my_reset_task_list.end(); ++rti) {
@@ -973,7 +1031,7 @@ class source_node : public graph_node, public sender< Output > {
bool my_has_cached_item;
output_type my_cached_item;
- // used by apply_body, can invoke body of node.
+ // used by apply_body_bypass, can invoke body of node.
bool try_reserve_apply_body(output_type &v) {
spin_mutex::scoped_lock lock(my_mutex);
if ( my_reserved ) {
@@ -1421,7 +1479,7 @@ class overwrite_node : public graph_node, public receiver, public sender {
my_buffer = v;
my_buffer_is_valid = true;
task * rtask = my_successors.try_put_task(v);
- if(!rtask) rtask = SUCCESSFULLY_ENQUEUED;
+ if (!rtask) rtask = SUCCESSFULLY_ENQUEUED;
return rtask;
}
@@ -1482,7 +1540,7 @@ class write_once_node : public overwrite_node {
this->my_buffer = v;
this->my_buffer_is_valid = true;
task *res = this->my_successors.try_put_task(v);
- if(!res) res = SUCCESSFULLY_ENQUEUED;
+ if (!res) res = SUCCESSFULLY_ENQUEUED;
return res;
}
}
@@ -1601,7 +1659,7 @@ class broadcast_node : public graph_node, public receiver, public sender {
//! build a task to run the successor if possible. Default is old behavior.
/*override*/ task *try_put_task(const T& t) {
task *new_task = my_successors.try_put_task(t);
- if(!new_task) new_task = SUCCESSFULLY_ENQUEUED;
+ if (!new_task) new_task = SUCCESSFULLY_ENQUEUED;
return new_task;
}
@@ -2558,7 +2616,7 @@ class limiter_node : public graph_node, public receiver< T >, public sender< T >
return NULL;
}
- //SUCCESS
+ //SUCCESS
// if we can reserve and can put, we consume the reservation
// we increment the count and decrement the tries
if ( (my_predecessors.try_reserve(v)) == true ){
@@ -2854,6 +2912,10 @@ class join_node > : public internal::unfolde
typedef OutputTuple output_type;
typedef typename unfolded_type::input_ports_type input_ports_type;
+#if __TBB_PREVIEW_MESSAGE_BASED_KEY_MATCHING
+ join_node(graph &g) : unfolded_type(g) {}
+#endif /* __TBB_PREVIEW_MESSAGE_BASED_KEY_MATCHING */
+
template
join_node(graph &g, __TBB_B0 b0, __TBB_B1 b1) : unfolded_type(g, b0, b1) {
tbb::internal::fgt_multiinput_node( tbb::internal::FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph,
@@ -3225,7 +3287,7 @@ inline void make_edge( T& output, V& input) {
}
//Makes an edge from port 0 of a multi-output predecessor to a receiver.
-template< typename T, typename R,
+template< typename T, typename R,
typename = typename T::output_ports_type >
inline void make_edge( T& output, receiver& input) {
make_edge(get<0>(output.output_ports()), input);
@@ -3364,12 +3426,12 @@ class composite_node , tbb::flow::tuple, tbb::flow::tuple<> > : pu
}
#endif
- input_ports_type input_ports() {
+ input_ports_type input_ports() {
__TBB_ASSERT(my_input_ports, "input ports not set, call set_external_ports to set input ports");
return *my_input_ports;
}
@@ -3511,7 +3573,7 @@ class composite_node , tbb::flow::tuple > : p
}
#endif
- output_ports_type output_ports() {
+ output_ports_type output_ports() {
__TBB_ASSERT(my_output_ports, "output ports not set, call set_external_ports to set output ports");
return *my_output_ports;
}
@@ -3538,53 +3600,117 @@ class async_gateway {
public:
typedef Output output_type;
- //! Submit signal from Async Activity to FG
- virtual bool async_try_put(const output_type &i ) = 0;
+ //! Submit signal from an asynchronous activity to FG
+ virtual bool async_try_put( const output_type &i ) = 0;
+ //! Increment reference count of graph to prevent premature return from wait_for_all
virtual void async_reserve() = 0;
+ //! Decrement reference count of graph to allow return from wait_for_all
virtual void async_commit() = 0;
virtual ~async_gateway() {}
};
+
+template
+class async_body {
+public:
+ typedef AsyncGateway async_gateway_type;
+
+ async_body(const Body &body, async_gateway_type *gateway) : my_body(body), my_async_gateway(gateway) { }
+
+ async_body(const async_body &other) : my_body(other.my_body), my_async_gateway(other.my_async_gateway) { }
+
+ void operator()( const Input &v, Ports & ) {
+ my_body(v, *my_async_gateway);
+ }
+
+ Body get_body() { return my_body; }
+
+ void set_async_gateway(async_gateway_type *gateway) {
+ my_async_gateway = gateway;
+ }
+
+private:
+ Body my_body;
+ async_gateway_type *my_async_gateway;
+};
+
}
-//! Implements a async node
-template < typename Input, typename Output, typename Allocator=cache_aligned_allocator >
-class async_node : public graph_node, public internal::async_input >, public internal::function_output, public internal::async_gateway {
+//! Implements async node
+template < typename Input, typename Output, typename Policy = queueing, typename Allocator=cache_aligned_allocator >
+class async_node : public multifunction_node< Input, tuple< Output >, Policy, Allocator >, public internal::async_gateway, public sender< Output > {
protected:
- using graph_node::my_graph;
+ typedef multifunction_node< Input, tuple< Output >, Policy, Allocator > base_type;
+
public:
typedef Input input_type;
typedef Output output_type;
- typedef async_node< input_type, output_type, Allocator > my_class;
typedef sender< input_type > predecessor_type;
typedef receiver< output_type > successor_type;
typedef internal::async_gateway< output_type > async_gateway_type;
- typedef internal::async_input async_input_type;
- typedef internal::function_output async_output_type;
+protected:
+ typedef typename internal::multifunction_input mfn_input_type;
- //! Constructor
- template< typename Body >
- async_node( graph &g, Body body ) :
- graph_node( g ), async_input_type( g, body ) {
- tbb::internal::fgt_node_with_body( tbb::internal::FLOW_ASYNC_NODE, &this->graph_node::my_graph,
- static_cast *>(this),
- static_cast *>(this), this->my_body );
+ struct try_put_functor {
+ typedef internal::multifunction_output output_port_type;
+ output_port_type *port;
+ const Output *value;
+ bool result;
+ try_put_functor(output_port_type &p, const Output &v) : port(&p), value(&v), result(false) { }
+ void operator()() {
+ result = port->try_put(*value);
+ }
+ };
+
+public:
+ template
+ async_node( graph &g, size_t concurrency, Body body ) :
+ base_type( g, concurrency, internal::async_body (body, this) ) {
+ tbb::internal::fgt_multioutput_node<1>( tbb::internal::FLOW_ASYNC_NODE,
+ &this->graph_node::my_graph,
+ static_cast *>(this),
+ this->output_ports() );
}
- //! Copy constructor
- async_node( const async_node& src ) :
- graph_node(src.graph_node::my_graph), async_input_type( src ), async_output_type(){
- tbb::internal::fgt_node_with_body( tbb::internal::FLOW_ASYNC_NODE, &this->graph_node::my_graph,
- static_cast *>(this),
- static_cast *>(this), this->my_body );
+ async_node( const async_node &other ) : base_type(other) {
+ typedef internal::multifunction_body mfn_body_type;
+ mfn_body_type &body_ref = *this->my_body;
+ body_ref.set_gateway(static_cast(this));
+ mfn_body_type &init_body_ref = *this->my_init_body;
+ init_body_ref.set_gateway(static_cast(this));
+ tbb::internal::fgt_multioutput_node<1>( tbb::internal::FLOW_ASYNC_NODE, &this->graph_node::my_graph, static_cast *>(this), this->output_ports() );
}
+ virtual ~async_node() {}
+
/* override */ async_gateway_type& async_gateway() {
return static_cast< async_gateway_type& >(*this);
- }
+ }
+
+ //! Implements async_gateway::async_try_put for an external activity to submit a message to FG
+ /*override*/ bool async_try_put(const output_type &i ) {
+ internal::multifunction_output &port_0 = internal::output_port<0>(*this);
+ graph &g = this->graph_node::my_graph;
+ tbb::internal::fgt_async_try_put_begin(static_cast *>(this), &port_0);
+ __TBB_ASSERT(g.my_task_arena && g.my_task_arena->is_active(), NULL);
+ try_put_functor tpf(port_0, i);
+ g.my_task_arena->execute(tpf);
+ tbb::internal::fgt_async_try_put_end(static_cast *>(this), &port_0);
+ return tpf.result;
+ }
+
+ /*override*/ void async_reserve() {
+ this->graph_node::my_graph.increment_wait_count();
+ tbb::internal::fgt_async_reserve(static_cast *>(this), &this->graph_node::my_graph);
+ }
+
+ /*override*/ void async_commit() {
+ this->graph_node::my_graph.decrement_wait_count();
+ tbb::internal::fgt_async_commit(static_cast *>(this), &this->graph_node::my_graph);
+ }
#if TBB_PREVIEW_FLOW_GRAPH_TRACE
/* override */ void set_name( const char *name ) {
@@ -3592,44 +3718,59 @@ class async_node : public graph_node, public internal::async_input friend class run_and_put_task;
- template friend class internal::broadcast_cache;
- template friend class internal::round_robin_cache;
- using async_input_type::try_put_task;
+ // Define sender< Output >
- /*override*/void reset_node( reset_flags f) {
- async_input_type::reset_async_input(f);
- if(f & rf_clear_edges) successors().clear();
- __TBB_ASSERT(!(f & rf_clear_edges) || successors().empty(), "function_node successors not empty");
- __TBB_ASSERT(!(f & rf_clear_edges) || this->my_predecessors.empty(), "function_node predecessors not empty");
+ //! Add a new successor to this node
+ /* override */ bool register_successor( successor_type &r ) {
+ return internal::output_port<0>(*this).register_successor(r);
+ }
+
+ //! Removes a successor from this node
+ /* override */ bool remove_successor( successor_type &r ) {
+ return internal::output_port<0>(*this).remove_successor(r);
+ }
+
+ template
+ Body copy_function_object() {
+ typedef internal::multifunction_body mfn_body_type;
+ typedef internal::async_body async_body_type;
+ mfn_body_type &body_ref = *this->my_body;
+ async_body_type ab = dynamic_cast< internal::multifunction_body_leaf & >(body_ref).get_body();
+ return ab.get_body();
}
+
#if TBB_PREVIEW_FLOW_GRAPH_FEATURES
- /*override*/void extract() {
- this->my_predecessors.built_predecessors().receiver_extract(*this);
- successors().built_successors().sender_extract(*this);
+ //! interface to record edges for traversal & deletion
+ typedef typename internal::edge_container built_successors_type;
+ typedef typename built_successors_type::edge_list_type successor_list_type;
+ /* override */ built_successors_type &built_successors() {
+ return internal::output_port<0>(*this).built_successors();
}
-#endif
- internal::broadcast_cache &successors () { return async_output_type::my_successors; }
+ /* override */ void internal_add_built_successor( successor_type &r ) {
+ internal::output_port<0>(*this).internal_add_built_successor(r);
+ }
- //! Submit signal from Async Activity to FG
- /*override*/ bool async_try_put(const output_type &i ) {
- // TODO: enqueue a task to a FG arena
- task *res = successors().try_put_task(i);
- if(!res) return false;
- if (res != SUCCESSFULLY_ENQUEUED) FLOW_SPAWN(*res);
- return true;
+ /* override */ void internal_delete_built_successor( successor_type &r ) {
+ internal::output_port<0>(*this).internal_delete_built_successor(r);
}
- /*override*/ void async_reserve() {
- my_graph.increment_wait_count();
+ /* override */ void copy_successors( successor_list_type &l ) {
+ internal::output_port<0>(*this).copy_successors(l);
}
- /*override*/ void async_commit() {
- my_graph.decrement_wait_count();
+ /* override */ size_t successor_count() {
+ return internal::output_port<0>(*this).successor_count();
}
-};
+#endif
+
+protected:
+
+ /*override*/ void reset_node( reset_flags f) {
+ base_type::reset_node(f);
+ }
+
+};
#endif // __TBB_PREVIEW_ASYNC_NODE
@@ -3643,9 +3784,6 @@ class async_node : public graph_node, public internal::async_input
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+
+#ifdef __APPLE__
+#include
+#else
+#include
+#endif
+
+namespace tbb {
+namespace flow {
+
+namespace interface8 {
+
+class opencl_foundation;
+class opencl_device_list;
+
+template
+class opencl_buffer_impl;
+
+class default_opencl_factory;
+
+class opencl_graph : public graph {
+public:
+ //! Constructs a graph with isolated task_group_context
+ opencl_graph() : my_opencl_foundation( NULL ) {}
+ //! Constructs a graph with an user context
+ explicit opencl_graph( task_group_context& context ) : graph( context ), my_opencl_foundation( NULL ) {}
+ //! Destroys a graph
+ ~opencl_graph();
+ //! Available devices
+ const opencl_device_list& available_devices();
+ default_opencl_factory& opencl_factory();
+protected:
+ opencl_foundation *my_opencl_foundation;
+ opencl_foundation &get_opencl_foundation();
+
+ template
+ friend class opencl_buffer;
+ template
+ friend class opencl_image2d;
+ template
+ friend class opencl_node;
+ template
+ friend class opencl_factory;
+};
+
+template
+class dependency_msg;
+
+template< typename T, typename Factory >
+class proxy_dependency_receiver;
+
+template< typename T, typename Factory >
+class receiver> {
+public:
+ //! The predecessor type for this node
+ typedef sender> dependency_predecessor_type;
+ typedef proxy_dependency_receiver proxy;
+
+ receiver() : my_ordinary_receiver( *this ) {}
+
+ //! Put an item to the receiver
+ bool try_put( const T& t ) {
+ return my_ordinary_receiver.try_put(t);
+ }
+
+ //! Put an item to the receiver
+ virtual task *try_put_task( const dependency_msg& ) = 0;
+
+ //! Add a predecessor to the node
+ virtual bool register_predecessor( dependency_predecessor_type & ) { return false; }
+
+ //! Remove a predecessor from the node
+ virtual bool remove_predecessor( dependency_predecessor_type & ) { return false; }
+
+protected:
+ //! put receiver back in initial state
+ virtual void reset_receiver( reset_flags f = rf_reset_protocol ) = 0;
+ virtual bool is_continue_receiver() { return false; }
+private:
+ class ordinary_receiver : public receiver < T >, tbb::internal::no_assign {
+ //! The predecessor type for this node
+ typedef sender predecessor_type;
+ public:
+ ordinary_receiver(receiver>& owner) : my_owner(owner) {}
+
+ //! Put an item to the receiver
+ /* override */ task *try_put_task( const T& t ) {
+ return my_owner.try_put_task( dependency_msg( t ) );
+ }
+
+ //! Add a predecessor to the node
+ /* override */ bool register_predecessor( predecessor_type &p ) {
+ tbb::spin_mutex::scoped_lock lock( my_predecessor_map_mutex );
+ typename predecessor_map_type::iterator it = my_predecessor_map.emplace( std::piecewise_construct_t(), std::make_tuple( &p ), std::tie( p ) );
+ if ( !my_owner.register_predecessor( it->second ) ) {
+ my_predecessor_map.erase( it );
+ return false;
+ }
+ return true;
+ }
+
+ //! Remove a predecessor from the node
+ /* override */ bool remove_predecessor( predecessor_type &p ) {
+ tbb::spin_mutex::scoped_lock lock( my_predecessor_map_mutex );
+ typename predecessor_map_type::iterator it = my_predecessor_map.find( &p );
+ __TBB_ASSERT( it != my_predecessor_map.end(), "Failed to find the predecessor" );
+ if ( !my_owner.remove_predecessor( it->second ) )
+ return false;
+ my_predecessor_map.erase( it );
+ return true;
+ }
+
+ protected:
+ //! put receiver back in initial state
+ /* override */ void reset_receiver( reset_flags f = rf_reset_protocol ) {
+ my_owner.reset_receiver( f );
+ };
+ /* override */ bool is_continue_receiver() {
+ return my_owner.is_continue_receiver();
+ }
+
+ private:
+ receiver>& my_owner;
+
+ typedef std::multimap predecessor_map_type;
+ predecessor_map_type my_predecessor_map;
+ tbb::spin_mutex my_predecessor_map_mutex;
+ };
+ ordinary_receiver my_ordinary_receiver;
+public:
+ ordinary_receiver& ordinary_receiver() { return my_ordinary_receiver; }
+};
+
+template< typename T, typename Factory >
+class proxy_dependency_sender;
+
+template< typename T, typename Factory >
+class proxy_dependency_receiver : public receiver < dependency_msg >, tbb::internal::no_assign {
+public:
+ typedef sender> dependency_predecessor_type;
+
+ proxy_dependency_receiver( receiver& r ) : my_r( r ) {}
+
+ //! Put an item to the receiver
+ /* override */ task *try_put_task( const dependency_msg &d ) {
+ receive_if_memory_object( d );
+ receiver *r = &my_r;
+ d.register_callback( [r]( const T& t ) {
+ r->try_put( t );
+ } );
+ d.clear_event();
+ return SUCCESSFULLY_ENQUEUED;
+ }
+
+ //! Add a predecessor to the node
+ /* override */ bool register_predecessor( dependency_predecessor_type &s ) {
+ return my_r.register_predecessor( s.ordinary_sender() );
+ }
+ //! Remove a predecessor from the node
+ /* override */ bool remove_predecessor( dependency_predecessor_type &s ) {
+ return my_r.remove_predecessor( s.ordinary_sender() );
+ }
+protected:
+ //! put receiver back in initial state
+ /* override */ void reset_receiver( reset_flags f = rf_reset_protocol ) {
+ my_r.reset_receiver( f );
+ };
+
+ /* override */ bool is_continue_receiver() {
+ return my_r.is_continue_receiver();
+ }
+private:
+ receiver &my_r;
+};
+
+template< typename T, typename Factory >
+class sender> {
+public:
+ sender() : my_ordinary_sender( *this ) {}
+
+ //! The successor type for this sender
+ typedef receiver> dependency_successor_type;
+ typedef proxy_dependency_sender proxy;
+
+ //! Add a new successor to this node
+ virtual bool register_successor( dependency_successor_type &r ) = 0;
+
+ //! Removes a successor from this node
+ virtual bool remove_successor( dependency_successor_type &r ) = 0;
+
+ //! Request an item from the sender
+ virtual bool try_get( dependency_msg & ) { return false; }
+
+ //! Reserves an item in the sender
+ virtual bool try_reserve( dependency_msg & ) { return false; }
+private:
+ class ordinary_sender : public sender < T >, tbb::internal::no_assign {
+ //! The successor type for this sender
+ typedef receiver successor_type;
+ public:
+ ordinary_sender(sender>& owner) : my_owner(owner) {}
+
+ //! Add a new successor to this node
+ /* override */ bool register_successor( successor_type &r ) {
+ tbb::spin_mutex::scoped_lock lock( my_successor_map_mutex );
+ typename successor_map_type::iterator it = my_successor_map.emplace( std::piecewise_construct_t(), std::make_tuple( &r ), std::tie( r ) );
+ if ( !my_owner.register_successor( it->second ) ) {
+ my_successor_map.erase( it );
+ return false;
+ }
+ return true;
+ }
+
+ //! Removes a successor from this node
+ /* override */ bool remove_successor( successor_type &r ) {
+ tbb::spin_mutex::scoped_lock lock( my_successor_map_mutex );
+ typename successor_map_type::iterator it = my_successor_map.find( &r );
+ __TBB_ASSERT( it != my_successor_map.end(), "The predecessor has already been registered" );
+ if ( !my_owner.remove_successor( it->second ) )
+ return false;
+ my_successor_map.erase( it );
+ return true;
+ }
+
+ //! Request an item from the sender
+ /* override */ bool try_get( T &t ) {
+ dependency_msg d;
+ if ( my_owner.try_get( d ) ) {
+ t = d.data();
+ return true;
+ }
+ return false;
+ }
+
+ /* override */ bool try_reserve( T &t ) {
+ dependency_msg d;
+ if ( my_owner.try_reserve( d ) ) {
+ t = d.data();
+ return true;
+ }
+ return false;
+ }
+
+ bool has_host_successors() {
+ tbb::spin_mutex::scoped_lock lock( my_successor_map_mutex );
+ return !my_successor_map.empty();
+ }
+ private:
+ sender>& my_owner;
+
+ typedef std::multimap successor_map_type;
+ successor_map_type my_successor_map;
+ tbb::spin_mutex my_successor_map_mutex;
+ };
+ ordinary_sender my_ordinary_sender;
+public:
+ ordinary_sender& ordinary_sender() { return my_ordinary_sender; }
+
+ bool has_host_successors() {
+ return my_ordinary_sender.has_host_successors();
+ }
+};
+
+template< typename T, typename Factory >
+class proxy_dependency_sender : public sender < dependency_msg >, tbb::internal::no_assign {
+public:
+ typedef receiver> dependency_successor_type;
+
+ proxy_dependency_sender( sender& s ) : my_s( s ) {}
+
+ //! Add a new successor to this node
+ /* override */ bool register_successor( dependency_successor_type &r ) {
+ return my_s.register_successor( r.ordinary_receiver() );
+ }
+
+ //! Removes a successor from this node
+ /* override */ bool remove_successor( dependency_successor_type &r ) {
+ return my_s.remove_successor( r.ordinary_receiver() );
+ }
+
+ //! Request an item from the sender
+ /* override */ bool try_get( dependency_msg &d ) {
+ return my_s.try_get( d.data() );
+ }
+
+ //! Reserves an item in the sender
+ /* override */ bool try_reserve( dependency_msg &d ) {
+ return my_s.try_reserve( d.data() );
+ }
+
+ //! Releases the reserved item
+ /* override */ bool try_release() {
+ return my_s.try_release();
+ }
+
+ //! Consumes the reserved item
+ /* override */ bool try_consume() {
+ return my_s.try_consume();
+ }
+private:
+ sender &my_s;
+};
+
+template
+inline void make_edge( sender &s, receiver> &r ) {
+ make_edge( s, r.ordinary_receiver() );
+}
+
+template
+inline void make_edge( sender> &s, receiver &r ) {
+ make_edge( s.ordinary_sender(), r );
+}
+
+template
+inline void remove_edge( sender &s, receiver> &r ) {
+ remove_edge( s, r.ordinary_receiver() );
+}
+
+template
+inline void remove_edge( sender> &s, receiver &r ) {
+ remove_edge( s.ordinary_sender(), r );
+}
+
+inline void enforce_cl_retcode( cl_int err, std::string msg ) {
+ if ( err != CL_SUCCESS ) {
+ std::cerr << msg << std::endl;
+ throw msg;
+ }
+}
+
+template
+T event_info( cl_event e, cl_event_info i ) {
+ T res;
+ enforce_cl_retcode( clGetEventInfo( e, i, sizeof( res ), &res, NULL ), "Failed to get OpenCL event information" );
+ return res;
+}
+
+template
+T device_info( cl_device_id d, cl_device_info i ) {
+ T res;
+ enforce_cl_retcode( clGetDeviceInfo( d, i, sizeof( res ), &res, NULL ), "Failed to get OpenCL device information" );
+ return res;
+}
+template <>
+std::string device_info( cl_device_id d, cl_device_info i ) {
+ size_t required;
+ enforce_cl_retcode( clGetDeviceInfo( d, i, 0, NULL, &required ), "Failed to get OpenCL device information" );
+
+ char *buff = (char*)alloca( required );
+ enforce_cl_retcode( clGetDeviceInfo( d, i, required, buff, NULL ), "Failed to get OpenCL device information" );
+
+ return buff;
+}
+template
+T platform_info( cl_platform_id p, cl_platform_info i ) {
+ T res;
+ enforce_cl_retcode( clGetPlatformInfo( p, i, sizeof( res ), &res, NULL ), "Failed to get OpenCL platform information" );
+ return res;
+}
+template <>
+std::string platform_info( cl_platform_id p, cl_platform_info i ) {
+ size_t required;
+ enforce_cl_retcode( clGetPlatformInfo( p, i, 0, NULL, &required ), "Failed to get OpenCL platform information" );
+
+ char *buff = (char*)alloca( required );
+ enforce_cl_retcode( clGetPlatformInfo( p, i, required, buff, NULL ), "Failed to get OpenCL platform information" );
+
+ return buff;
+}
+
+
+class opencl_device {
+ typedef size_t device_id_type;
+ enum : device_id_type {
+ unknown = device_id_type( -2 ),
+ host = device_id_type( -1 )
+ };
+public:
+ opencl_device() : my_device_id( unknown ) {}
+
+ std::string platform_profile() const {
+ return platform_info( platform(), CL_PLATFORM_PROFILE );
+ }
+ std::string platform_version() const {
+ return platform_info( platform(), CL_PLATFORM_VERSION );
+ }
+ std::string platform_name() const {
+ return platform_info( platform(), CL_PLATFORM_NAME );
+ }
+ std::string platform_vendor() const {
+ return platform_info( platform(), CL_PLATFORM_VENDOR );
+ }
+ std::string platform_extensions() const {
+ return platform_info( platform(), CL_PLATFORM_EXTENSIONS );
+ }
+
+ template
+ void info( cl_device_info i, T &t ) const {
+ t = device_info( my_cl_device_id, i );
+ }
+ std::string version() const {
+ // The version string format: OpenCL
+ return device_info( my_cl_device_id, CL_DEVICE_VERSION );
+ }
+ int major_version() const {
+ int major;
+ std::sscanf( version().c_str(), "OpenCL %d", &major );
+ return major;
+ }
+ int minor_version() const {
+ int major, minor;
+ std::sscanf( version().c_str(), "OpenCL %d.%d", &major, &minor );
+ return minor;
+ }
+ bool out_of_order_exec_mode_on_host_present() const {
+#if CL_VERSION_2_0
+ if ( major_version() >= 2 )
+ return (device_info( my_cl_device_id, CL_DEVICE_QUEUE_ON_HOST_PROPERTIES ) & CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE) != 0;
+ else
+#endif /* CL_VERSION_2_0 */
+ return (device_info( my_cl_device_id, CL_DEVICE_QUEUE_PROPERTIES ) & CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE) != 0;
+ }
+ bool out_of_order_exec_mode_on_device_present() const {
+#if CL_VERSION_2_0
+ if ( major_version() >= 2 )
+ return (device_info( my_cl_device_id, CL_DEVICE_QUEUE_ON_DEVICE_PROPERTIES ) & CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE) != 0;
+ else
+#endif /* CL_VERSION_2_0 */
+ return false;
+ }
+ std::array max_work_item_sizes() const {
+ return device_info>( my_cl_device_id, CL_DEVICE_MAX_WORK_ITEM_SIZES );
+ }
+ size_t max_work_group_size() const {
+ return device_info( my_cl_device_id, CL_DEVICE_MAX_WORK_GROUP_SIZE );
+ }
+ bool built_in_kernel_available( const std::string& k ) const {
+ const std::string semi = ";";
+ // Added semicolumns to force an exact match (to avoid a partial match, e.g. "add" is partly matched with "madd").
+ return (semi + built_in_kernels() + semi).find( semi + k + semi ) != std::string::npos;
+ }
+ std::string built_in_kernels() const {
+ return device_info( my_cl_device_id, CL_DEVICE_BUILT_IN_KERNELS );
+ }
+ std::string name() const {
+ return device_info( my_cl_device_id, CL_DEVICE_NAME );
+ }
+ cl_bool available() const {
+ return device_info( my_cl_device_id, CL_DEVICE_AVAILABLE );
+ }
+ cl_bool compiler_available() const {
+ return device_info( my_cl_device_id, CL_DEVICE_COMPILER_AVAILABLE );
+ }
+ cl_bool linker_available() const {
+ return device_info( my_cl_device_id, CL_DEVICE_LINKER_AVAILABLE );
+ }
+ bool extension_available( const std::string &ext ) const {
+ const std::string space = " ";
+ // Added space to force an exact match (to avoid a partial match, e.g. "ext" is partly matched with "ext2").
+ return (space + extensions() + space).find( space + ext + space ) != std::string::npos;
+ }
+ std::string extensions() const {
+ return device_info( my_cl_device_id, CL_DEVICE_EXTENSIONS );
+ }
+
+ cl_device_type type() const {
+ return device_info( my_cl_device_id, CL_DEVICE_TYPE );
+ }
+
+ std::string vendor() const {
+ return device_info( my_cl_device_id, CL_DEVICE_VENDOR );
+ }
+
+ cl_uint address_bits() const {
+ return device_info( my_cl_device_id, CL_DEVICE_ADDRESS_BITS );
+ }
+
+private:
+ opencl_device( cl_device_id d_id ) : my_device_id( unknown ), my_cl_device_id( d_id ) {}
+
+ cl_platform_id platform() const {
+ return device_info( my_cl_device_id, CL_DEVICE_PLATFORM );
+ }
+
+ device_id_type my_device_id;
+ cl_device_id my_cl_device_id;
+ cl_command_queue my_cl_command_queue;
+
+ friend bool operator==(opencl_device d1, opencl_device d2) { return d1.my_cl_device_id == d2.my_cl_device_id; }
+
+ template
+ friend class opencl_factory;
+ template
+ friend class opencl_memory;
+ template
+ friend class opencl_program;
+ friend class opencl_foundation;
+
+#if TBB_USE_ASSERT
+ template
+ friend class opencl_buffer;
+#endif
+};
+
+class opencl_device_list {
+ typedef std::vector container_type;
+public:
+ typedef container_type::iterator iterator;
+ typedef container_type::const_iterator const_iterator;
+ typedef container_type::size_type size_type;
+
+ opencl_device_list() {}
+ opencl_device_list( std::initializer_list il ) : my_container( il ) {}
+
+ void add( opencl_device d ) { my_container.push_back( d ); }
+ size_type size() const { return my_container.size(); }
+ iterator begin() { return my_container.begin(); }
+ iterator end() { return my_container.end(); }
+ const_iterator begin() const { return my_container.begin(); }
+ const_iterator end() const { return my_container.end(); }
+ const_iterator cbegin() const { return my_container.cbegin(); }
+ const_iterator cend() const { return my_container.cend(); }
+private:
+ container_type my_container;
+};
+
+class callback_base : tbb::internal::no_copy {
+public:
+ virtual void call() const = 0;
+ virtual ~callback_base() {}
+};
+
+template
+class callback : public callback_base {
+ graph &my_graph;
+ Callback my_callback;
+ T my_data;
+public:
+ callback( graph &g, Callback c, const T& t ) : my_graph( g ), my_callback( c ), my_data( t ) {
+ // Extend the graph lifetime until the callback completion.
+ my_graph.increment_wait_count();
+ }
+ ~callback() {
+ // Release the reference to the graph.
+ my_graph.decrement_wait_count();
+ }
+ /* override */ void call() const {
+ my_callback( my_data );
+ }
+};
+
+template
+class dependency_msg {
+public:
+ typedef T value_type;
+
+ dependency_msg() = default;
+ explicit dependency_msg( const T& data ) : my_data( data ) {}
+ dependency_msg( opencl_graph &g, const T& data ) : my_data( data ), my_graph( &g ) {}
+ dependency_msg( const T& data, cl_event event ) : my_data( data ), my_event( event ), my_is_event( true ) {
+ enforce_cl_retcode( clRetainEvent( my_event ), "Failed to retain an event" );
+ }
+ T& data( bool wait = true ) {
+ if ( my_is_event && wait ) {
+ enforce_cl_retcode( clWaitForEvents( 1, &my_event ), "Failed to wait for an event" );
+ enforce_cl_retcode( clReleaseEvent( my_event ), "Failed to release an event" );
+ my_is_event = false;
+ }
+ return my_data;
+ }
+
+ const T& data( bool wait = true ) const {
+ if ( my_is_event && wait ) {
+ enforce_cl_retcode( clWaitForEvents( 1, &my_event ), "Failed to wait for an event" );
+ enforce_cl_retcode( clReleaseEvent( my_event ), "Failed to release an event" );
+ my_is_event = false;
+ }
+ return my_data;
+ }
+
+ dependency_msg( const dependency_msg &dmsg ) : my_data( dmsg.my_data ), my_event( dmsg.my_event ), my_is_event( dmsg.my_is_event ), my_graph( dmsg.my_graph ) {
+ if ( my_is_event )
+ enforce_cl_retcode( clRetainEvent( my_event ), "Failed to retain an event" );
+ }
+
+ dependency_msg( dependency_msg &&dmsg ) : my_data( std::move(dmsg.my_data) ), my_event( dmsg.my_event ), my_is_event( dmsg.my_is_event ), my_graph( dmsg.my_graph ) {
+ dmsg.my_is_event = false;
+ }
+
+ dependency_msg& operator=(const dependency_msg &dmsg) {
+ my_data = dmsg.my_data;
+ my_event = dmsg.my_event;
+ my_is_event = dmsg.my_is_event;
+ my_graph = dmsg.my_graph;
+ if ( my_is_event )
+ enforce_cl_retcode( clRetainEvent( my_event ), "Failed to retain an event" );
+ return *this;
+ }
+
+ ~dependency_msg() {
+ if ( my_is_event )
+ enforce_cl_retcode( clReleaseEvent( my_event ), "Failed to release an event" );
+ }
+
+ cl_event const * get_event() const { return my_is_event ? &my_event : NULL; }
+ void set_event( cl_event e ) const {
+ if ( my_is_event ) {
+ cl_command_queue cq = event_info( my_event, CL_EVENT_COMMAND_QUEUE );
+ if ( cq != event_info( e, CL_EVENT_COMMAND_QUEUE ) )
+ enforce_cl_retcode( clFlush( cq ), "Failed to flush an OpenCL command queue" );
+ enforce_cl_retcode( clReleaseEvent( my_event ), "Failed to release an event" );
+ }
+ my_is_event = true;
+ my_event = e;
+ clRetainEvent( my_event );
+ }
+
+ void set_graph( graph &g ) {
+ my_graph = &g;
+ }
+
+ void clear_event() const {
+ if ( my_is_event ) {
+ enforce_cl_retcode( clFlush( event_info( my_event, CL_EVENT_COMMAND_QUEUE ) ), "Failed to flush an OpenCL command queue" );
+ enforce_cl_retcode( clReleaseEvent( my_event ), "Failed to release an event" );
+ }
+ my_is_event = false;
+ }
+
+ template
+ void register_callback( Callback c ) const {
+ __TBB_ASSERT( my_is_event, "The OpenCL event is not set" );
+ __TBB_ASSERT( my_graph, "The graph is not set" );
+ enforce_cl_retcode( clSetEventCallback( my_event, CL_COMPLETE, register_callback_func, new callback( *my_graph, c, my_data ) ), "Failed to set an OpenCL callback" );
+ }
+
+ operator T&() { return data(); }
+ operator const T&() const { return data(); }
+
+private:
+ static void CL_CALLBACK register_callback_func( cl_event, cl_int event_command_exec_status, void *data ) {
+ tbb::internal::suppress_unused_warning( event_command_exec_status );
+ __TBB_ASSERT( event_command_exec_status == CL_COMPLETE, NULL );
+ __TBB_ASSERT( data, NULL );
+ callback_base *c = static_cast(data);
+ c->call();
+ delete c;
+ }
+
+ T my_data;
+ mutable cl_event my_event;
+ mutable bool my_is_event = false;
+ graph *my_graph = NULL;
+};
+
+template
+K key_from_message( const dependency_msg &dmsg ) {
+ using tbb::flow::key_from_message;
+ const T &t = dmsg.data( false );
+ __TBB_STATIC_ASSERT( true, "" );
+ return key_from_message( t );
+}
+
+template
+class opencl_memory {
+public:
+ opencl_memory() {}
+ opencl_memory( Factory &f ) : my_host_ptr( NULL ), my_factory( &f ), my_sending_event_present( false ) {
+ my_curr_device_id = my_factory->devices().begin()->my_device_id;
+ }
+
+ ~opencl_memory() {
+ if ( my_sending_event_present ) enforce_cl_retcode( clReleaseEvent( my_sending_event ), "Failed to release an event for the OpenCL buffer" );
+ enforce_cl_retcode( clReleaseMemObject( my_cl_mem ), "Failed to release an memory object" );
+ }
+
+ cl_mem get_cl_mem() const {
+ return my_cl_mem;
+ }
+
+ void* get_host_ptr() {
+ if ( !my_host_ptr ) {
+ dependency_msg d = receive( NULL );
+ d.data();
+ __TBB_ASSERT( d.data() == my_host_ptr, NULL );
+ }
+ return my_host_ptr;
+ }
+
+ dependency_msg send( opencl_device d, const cl_event *e );
+ dependency_msg receive( const cl_event *e );
+ virtual void map_memory( opencl_device, dependency_msg & ) = 0;
+protected:
+ cl_mem my_cl_mem;
+ tbb::atomic my_curr_device_id;
+ void* my_host_ptr;
+ Factory *my_factory;
+
+ tbb::spin_mutex my_sending_lock;
+ bool my_sending_event_present;
+ cl_event my_sending_event;
+};
+
+template
+class opencl_buffer_impl : public opencl_memory {
+ size_t my_size;
+public:
+ opencl_buffer_impl( size_t size, Factory& f ) : opencl_memory( f ), my_size( size ) {
+ cl_int err;
+ this->my_cl_mem = clCreateBuffer( this->my_factory->context(), CL_MEM_ALLOC_HOST_PTR, size, NULL, &err );
+ enforce_cl_retcode( err, "Failed to create an OpenCL buffer" );
+ }
+
+ size_t size() const {
+ return my_size;
+ }
+
+ /* override */ void map_memory( opencl_device device, dependency_msg &dmsg ) {
+ this->my_factory->enque_map_buffer( device, *this, dmsg );
+ }
+
+#if TBB_USE_ASSERT
+ template
+ friend class opencl_buffer;
+#endif
+};
+
+enum access_type {
+ read_write,
+ write_only,
+ read_only
+};
+
+template
+class opencl_buffer {
+public:
+ typedef cl_mem native_object_type;
+ typedef opencl_buffer memory_object_type;
+ typedef Factory opencl_factory_type;
+
+ template using iterator = T*;
+
+ template
+ iterator access() const {
+ T* ptr = (T*)my_impl->get_host_ptr();
+ __TBB_ASSERT( ptr, NULL );
+ return iterator ( ptr );
+ }
+
+ T* data() const { return &access()[0]; }
+
+ template
+ iterator begin() const { return access (); }
+
+ template
+ iterator end() const { return access ()+my_impl->size()/sizeof(T); }
+
+ size_t size() const { return my_impl->size()/sizeof(T); }
+
+ T& operator[] ( ptrdiff_t k ) { return begin()[k]; }
+
+ opencl_buffer() {}
+ opencl_buffer( opencl_graph &g, size_t size );
+ opencl_buffer( Factory &f, size_t size ) : my_impl( std::make_shared( size*sizeof(T), f ) ) {}
+
+ cl_mem native_object() const {
+ return my_impl->get_cl_mem();
+ }
+
+ const opencl_buffer& memory_object() const {
+ return *this;
+ }
+
+ void send( opencl_device device, dependency_msg &dependency ) const {
+ __TBB_ASSERT( dependency.data( /*wait = */false ) == *this, NULL );
+ dependency_msg d = my_impl->send( device, dependency.get_event() );
+ const cl_event *e = d.get_event();
+ if ( e ) dependency.set_event( *e );
+ else dependency.clear_event();
+ }
+ void receive( const dependency_msg &dependency ) const {
+ __TBB_ASSERT( dependency.data( /*wait = */false ) == *this, NULL );
+ dependency_msg d = my_impl->receive( dependency.get_event() );
+ const cl_event *e = d.get_event();
+ if ( e ) dependency.set_event( *e );
+ else dependency.clear_event();
+ }
+
+private:
+ typedef opencl_buffer_impl