Perform an associative reduction operation across a data set.
Many serial algorithms sweep over a set of items to collect summary information.
The summary can be expressed as an associative operation over the data set, or at least is close enough to associative that reassociation does not matter.
This section describes the identifier conventions used by Intel® Threading Building Blocks.
The identifier convention in the library follows the style in the ISO C++ standard library. Identifiers are written in underscore_style, and concepts in PascalCase.
A partitioner specifies how a loop template should partition its work among threads.
SummaryA filter or composite filter used in conjunction with function parallel_pipeline.
template<typename T, typename U> class filter_t; template<typename T, typename U, typename Func>
Template classes for set containers that supports concurrent insertion and traversal.
A template class that is a graph_node, receiver<Input> and sender<Output>. A write_once_node represents a buffer of a single item that cannot be over-written. The first put to the node sets the value. The value may be cleared explicitly, after which a new value may be set. Gets from the node are non-destructive.
These operations must not be invoked concurrently on the same instance of enumerable_thread_specific.