1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>Class List</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.4.7 -->
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li id="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
</ul></div>
<div class="tabs">
<ul>
<li id="current"><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul></div>
<h1>Class List</h1>Here are the classes, structs, unions and interfaces with brief descriptions:<table>
<tr><td class="indexkey"><a class="el" href="a00225.html">tbb::affinity_partitioner</a></td><td class="indexvalue">An affinity partitioner </td></tr>
<tr><td class="indexkey"><a class="el" href="a00226.html">tbb::internal::affinity_partitioner_base_v3</a></td><td class="indexvalue">Defines entry point for affinity partitioner into tbb run-time library </td></tr>
<tr><td class="indexkey"><a class="el" href="a00227.html">tbb::aligned_space< T, N ></a></td><td class="indexvalue">Block of space aligned sufficiently to construct an array T with N elements </td></tr>
<tr><td class="indexkey"><a class="el" href="a00228.html">tbb::atomic< T ></a></td><td class="indexvalue">Primary template for atomic </td></tr>
<tr><td class="indexkey"><a class="el" href="a00229.html">tbb::atomic< void * ></a></td><td class="indexvalue">Specialization for <a class="el" href="a00229.html">atomic<void*></a>, for sake of not allowing arithmetic or operator-> </td></tr>
<tr><td class="indexkey"><a class="el" href="a00230.html">tbb::internal::atomic_backoff</a></td><td class="indexvalue">Class that implements exponential backoff </td></tr>
<tr><td class="indexkey"><a class="el" href="a00231.html">tbb::auto_partitioner</a></td><td class="indexvalue">An auto partitioner </td></tr>
<tr><td class="indexkey"><a class="el" href="a00232.html">tbb::bad_last_alloc</a></td><td class="indexvalue">Exception for concurrent containers </td></tr>
<tr><td class="indexkey"><a class="el" href="a00233.html">tbb::blocked_range< Value ></a></td><td class="indexvalue">A range over which to iterate </td></tr>
<tr><td class="indexkey"><a class="el" href="a00234.html">tbb::blocked_range2d< RowValue, ColValue ></a></td><td class="indexvalue">A 2-dimensional range that models the Range concept </td></tr>
<tr><td class="indexkey"><a class="el" href="a00235.html">tbb::blocked_range3d< PageValue, RowValue, ColValue ></a></td><td class="indexvalue">A 3-dimensional range that models the Range concept </td></tr>
<tr><td class="indexkey"><a class="el" href="a00236.html">tbb::flow::interface6::broadcast_node< T ></a></td><td class="indexvalue">Forwards messages of type T to all successors </td></tr>
<tr><td class="indexkey"><a class="el" href="a00237.html">tbb::flow::interface6::buffer_node< T, A ></a></td><td class="indexvalue">Forwards messages in arbitrary order </td></tr>
<tr><td class="indexkey"><a class="el" href="a00238.html">tbb::cache_aligned_allocator< T ></a></td><td class="indexvalue">Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5 </td></tr>
<tr><td class="indexkey"><a class="el" href="a00239.html">tbb::cache_aligned_allocator< void ></a></td><td class="indexvalue">Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1 </td></tr>
<tr><td class="indexkey"><a class="el" href="a00240.html">tbb::captured_exception</a></td><td class="indexvalue">This class is used by TBB to propagate information about unhandled exceptions into the root thread </td></tr>
<tr><td class="indexkey"><a class="el" href="a00241.html">tbb::combinable< T ></a></td><td class="indexvalue">Thread-local storage with optional reduction </td></tr>
<tr><td class="indexkey"><a class="el" href="a00242.html">tbb::concurrent_bounded_queue< T, A ></a></td><td class="indexvalue">A high-performance thread-safe blocking concurrent bounded queue </td></tr>
<tr><td class="indexkey"><a class="el" href="a00243.html">tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator ></a></td><td class="indexvalue">Unordered map from Key to T </td></tr>
<tr><td class="indexkey"><a class="el" href="a00244.html">tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::accessor</a></td><td class="indexvalue">Allows write access to elements and combines data access, locking, and garbage collection </td></tr>
<tr><td class="indexkey"><a class="el" href="a00245.html">tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::bucket_accessor</a></td><td class="indexvalue">Bucket accessor is to find, rehash, acquire a lock, and access a bucket </td></tr>
<tr><td class="indexkey"><a class="el" href="a00246.html">tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::const_accessor</a></td><td class="indexvalue">Combines data access, locking, and garbage collection </td></tr>
<tr><td class="indexkey"><a class="el" href="a00247.html">tbb::interface5::concurrent_priority_queue< T, Compare, A ></a></td><td class="indexvalue">Concurrent priority queue </td></tr>
<tr><td class="indexkey"><a class="el" href="a00248.html">tbb::strict_ppl::concurrent_queue< T, A ></a></td><td class="indexvalue">A high-performance thread-safe non-blocking concurrent queue </td></tr>
<tr><td class="indexkey"><a class="el" href="a00249.html">tbb::deprecated::concurrent_queue< T, A ></a></td><td class="indexvalue">A high-performance thread-safe blocking concurrent bounded queue </td></tr>
<tr><td class="indexkey"><a class="el" href="a00250.html">tbb::concurrent_vector< T, A ></a></td><td class="indexvalue">Concurrent vector container </td></tr>
<tr><td class="indexkey"><a class="el" href="a00251.html">tbb::flow::interface6::continue_msg</a></td><td class="indexvalue">An empty class used for messages that mean "I'm done" </td></tr>
<tr><td class="indexkey"><a class="el" href="a00252.html">tbb::flow::interface6::continue_node< Output ></a></td><td class="indexvalue">Implements an executable node that supports <a class="el" href="a00251.html">continue_msg</a> -> Output </td></tr>
<tr><td class="indexkey"><a class="el" href="a00253.html">tbb::flow::interface6::continue_receiver</a></td><td class="indexvalue">Base class for receivers of completion messages </td></tr>
<tr><td class="indexkey"><a class="el" href="a00254.html">tbb::empty_task</a></td><td class="indexvalue">Task that does nothing. Useful for synchronization </td></tr>
<tr><td class="indexkey"><a class="el" href="a00255.html">tbb::interface6::enumerable_thread_specific< T, Allocator, ETS_key_type ></a></td><td class="indexvalue">The <a class="el" href="a00255.html">enumerable_thread_specific</a> container </td></tr>
<tr><td class="indexkey"><a class="el" href="a00256.html">tbb::filter</a></td><td class="indexvalue">A stage in a pipeline </td></tr>
<tr><td class="indexkey"><a class="el" href="a00257.html">tbb::interface6::filter_t< T, U ></a></td><td class="indexvalue">Class representing a chain of type-safe pipeline filters </td></tr>
<tr><td class="indexkey"><a class="el" href="a00258.html">tbb::final_scan_tag</a></td><td class="indexvalue">Used to indicate that the final scan is being performed </td></tr>
<tr><td class="indexkey"><a class="el" href="a00259.html">tbb::interface6::flow_control</a></td><td class="indexvalue">Input_filter control to signal end-of-input for parallel_pipeline </td></tr>
<tr><td class="indexkey"><a class="el" href="a00260.html">tbb::flow::interface6::function_node< Input, Output,, Allocator ></a></td><td class="indexvalue">Implements a function node that supports Input -> Output </td></tr>
<tr><td class="indexkey"><a class="el" href="a00261.html">tbb::flow::interface6::function_node< Input, Output, queueing, Allocator ></a></td><td class="indexvalue">Implements a function node that supports Input -> Output </td></tr>
<tr><td class="indexkey"><a class="el" href="a00262.html">tbb::flow::interface6::graph</a></td><td class="indexvalue">The graph class </td></tr>
<tr><td class="indexkey"><a class="el" href="a00263.html">tbb::flow::interface6::graph_node</a></td><td class="indexvalue">The base of all graph nodes. Allows them to be stored in a collection for deletion </td></tr>
<tr><td class="indexkey"><a class="el" href="a00264.html">tbb::improper_lock</a></td><td class="indexvalue">Exception for PPL locks </td></tr>
<tr><td class="indexkey"><a class="el" href="a00265.html">tbb::invalid_multiple_scheduling</a></td><td class="indexvalue">Exception for repeated scheduling of the same task_handle </td></tr>
<tr><td class="indexkey"><a class="el" href="a00266.html">tbb::flow::interface6::limiter_node< T ></a></td><td class="indexvalue">Forwards messages only if the threshold has not been reached </td></tr>
<tr><td class="indexkey"><a class="el" href="a00267.html">tbb::internal::machine_load_store_relaxed< T, S ></a></td><td class="indexvalue"></td></tr>
<tr><td class="indexkey"><a class="el" href="a00268.html">tbb::internal::machine_load_store_seq_cst< T, 8 ></a></td><td class="indexvalue"></td></tr>
<tr><td class="indexkey"><a class="el" href="a00269.html">tbb::interface6::memory_pool< Alloc ></a></td><td class="indexvalue">Thread-safe growable pool allocator for variable-size requests </td></tr>
<tr><td class="indexkey"><a class="el" href="a00270.html">tbb::interface6::memory_pool_allocator< T, P ></a></td><td class="indexvalue">Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5 </td></tr>
<tr><td class="indexkey"><a class="el" href="a00271.html">tbb::interface6::memory_pool_allocator< void, P ></a></td><td class="indexvalue">Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1 </td></tr>
<tr><td class="indexkey"><a class="el" href="a00272.html">tbb::missing_wait</a></td><td class="indexvalue">Exception for missing wait on structured_task_group </td></tr>
<tr><td class="indexkey"><a class="el" href="a00273.html">tbb::movable_exception< ExceptionData ></a></td><td class="indexvalue">Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread </td></tr>
<tr><td class="indexkey"><a class="el" href="a00274.html">tbb::flow::interface6::multioutput_function_node< Input, Output,, Allocator ></a></td><td class="indexvalue">Implements a function node that supports Input -> (set of outputs) </td></tr>
<tr><td class="indexkey"><a class="el" href="a00275.html">tbb::mutex</a></td><td class="indexvalue">Wrapper around the platform's native reader-writer lock </td></tr>
<tr><td class="indexkey"><a class="el" href="a00276.html">tbb::mutex::scoped_lock</a></td><td class="indexvalue">The scoped locking pattern </td></tr>
<tr><td class="indexkey"><a class="el" href="a00277.html">tbb::null_mutex</a></td><td class="indexvalue">A mutex which does nothing </td></tr>
<tr><td class="indexkey"><a class="el" href="a00278.html">tbb::null_mutex::scoped_lock</a></td><td class="indexvalue">Represents acquisition of a mutex </td></tr>
<tr><td class="indexkey"><a class="el" href="a00279.html">tbb::null_rw_mutex</a></td><td class="indexvalue">A rw mutex which does nothing </td></tr>
<tr><td class="indexkey"><a class="el" href="a00280.html">tbb::null_rw_mutex::scoped_lock</a></td><td class="indexvalue">Represents acquisition of a mutex </td></tr>
<tr><td class="indexkey"><a class="el" href="a00281.html">tbb::parallel_do_feeder< Item ></a></td><td class="indexvalue">Class the user supplied algorithm body uses to add new tasks </td></tr>
<tr><td class="indexkey"><a class="el" href="a00282.html">tbb::parallel_while< Body ></a></td><td class="indexvalue">Parallel iteration over a stream, with optional addition of more work </td></tr>
<tr><td class="indexkey"><a class="el" href="a00283.html">tbb::internal::partition_type_base</a></td><td class="indexvalue">Provides backward-compatible methods for partition objects without affinity </td></tr>
<tr><td class="indexkey"><a class="el" href="a00284.html">tbb::pipeline</a></td><td class="indexvalue">A processing pipeline that applies filters to items </td></tr>
<tr><td class="indexkey"><a class="el" href="a00285.html">tbb::pre_scan_tag</a></td><td class="indexvalue">Used to indicate that the initial scan is being performed </td></tr>
<tr><td class="indexkey"><a class="el" href="a00286.html">tbb::flow::interface6::priority_queue_node< T, Compare, A ></a></td><td class="indexvalue">Forwards messages in priority order </td></tr>
<tr><td class="indexkey"><a class="el" href="a00287.html">tbb::flow::interface6::queue_node< T, A ></a></td><td class="indexvalue">Forwards messages in FIFO order </td></tr>
<tr><td class="indexkey"><a class="el" href="a00288.html">tbb::queuing_mutex</a></td><td class="indexvalue">Queuing lock with local-only spinning </td></tr>
<tr><td class="indexkey"><a class="el" href="a00289.html">tbb::queuing_mutex::scoped_lock</a></td><td class="indexvalue">The scoped locking pattern </td></tr>
<tr><td class="indexkey"><a class="el" href="a00290.html">tbb::queuing_rw_mutex</a></td><td class="indexvalue">Reader-writer lock with local-only spinning </td></tr>
<tr><td class="indexkey"><a class="el" href="a00291.html">tbb::queuing_rw_mutex::scoped_lock</a></td><td class="indexvalue">The scoped locking pattern </td></tr>
<tr><td class="indexkey"><a class="el" href="a00292.html">tbb::interface5::reader_writer_lock</a></td><td class="indexvalue">Writer-preference reader-writer lock with local-only spinning on readers </td></tr>
<tr><td class="indexkey"><a class="el" href="a00293.html">tbb::interface5::reader_writer_lock::scoped_lock</a></td><td class="indexvalue">The scoped lock pattern for write locks </td></tr>
<tr><td class="indexkey"><a class="el" href="a00294.html">tbb::interface5::reader_writer_lock::scoped_lock_read</a></td><td class="indexvalue">The scoped lock pattern for read locks </td></tr>
<tr><td class="indexkey"><a class="el" href="a00295.html">tbb::flow::interface6::receiver< T ></a></td><td class="indexvalue">Pure virtual template class that defines a receiver of messages of type T </td></tr>
<tr><td class="indexkey"><a class="el" href="a00296.html">tbb::recursive_mutex</a></td><td class="indexvalue">Mutex that allows recursive mutex acquisition </td></tr>
<tr><td class="indexkey"><a class="el" href="a00297.html">tbb::recursive_mutex::scoped_lock</a></td><td class="indexvalue">The scoped locking pattern </td></tr>
<tr><td class="indexkey"><a class="el" href="a00298.html">tbb::interface6::runtime_loader</a></td><td class="indexvalue">Load TBB at runtime </td></tr>
<tr><td class="indexkey"><a class="el" href="a00299.html">tbb::scalable_allocator< T ></a></td><td class="indexvalue">Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5 </td></tr>
<tr><td class="indexkey"><a class="el" href="a00300.html">tbb::scalable_allocator< void ></a></td><td class="indexvalue">Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1 </td></tr>
<tr><td class="indexkey"><a class="el" href="a00301.html">tbb::flow::interface6::sender< T ></a></td><td class="indexvalue">Pure virtual template class that defines a sender of messages of type T </td></tr>
<tr><td class="indexkey"><a class="el" href="a00302.html">tbb::flow::interface6::sequencer_node< T, A ></a></td><td class="indexvalue">Forwards messages in sequence order </td></tr>
<tr><td class="indexkey"><a class="el" href="a00303.html">tbb::simple_partitioner</a></td><td class="indexvalue">A simple partitioner </td></tr>
<tr><td class="indexkey"><a class="el" href="a00304.html">tbb::flow::interface6::source_node< Output ></a></td><td class="indexvalue">An executable node that acts as a source, i.e. it has no predecessors </td></tr>
<tr><td class="indexkey"><a class="el" href="a00305.html">tbb::spin_mutex</a></td><td class="indexvalue">A lock that occupies a single byte </td></tr>
<tr><td class="indexkey"><a class="el" href="a00306.html">tbb::spin_mutex::scoped_lock</a></td><td class="indexvalue">Represents acquisition of a mutex </td></tr>
<tr><td class="indexkey"><a class="el" href="a00307.html">tbb::spin_rw_mutex_v3</a></td><td class="indexvalue">Fast, unfair, spinning reader-writer lock with backoff and writer-preference </td></tr>
<tr><td class="indexkey"><a class="el" href="a00308.html">tbb::spin_rw_mutex_v3::scoped_lock</a></td><td class="indexvalue">The scoped locking pattern </td></tr>
<tr><td class="indexkey"><a class="el" href="a00309.html">tbb::split</a></td><td class="indexvalue">Dummy type that distinguishes splitting constructor from copy constructor </td></tr>
<tr><td class="indexkey"><a class="el" href="a00310.html">tbb::flow::interface6::split_node< TupleType, Allocator ></a></td><td class="indexvalue">Split_node: accepts a tuple as input, forwards each element of the tuple to its </td></tr>
<tr><td class="indexkey"><a class="el" href="a00311.html">tbb::task</a></td><td class="indexvalue">Base class for user-defined tasks </td></tr>
<tr><td class="indexkey"><a class="el" href="a00312.html">tbb::interface5::internal::task_base</a></td><td class="indexvalue">Base class for methods that became static in TBB 3.0 </td></tr>
<tr><td class="indexkey"><a class="el" href="a00313.html">tbb::task_group_context</a></td><td class="indexvalue">Used to form groups of tasks </td></tr>
<tr><td class="indexkey"><a class="el" href="a00314.html">tbb::task_group_context</a></td><td class="indexvalue"></td></tr>
<tr><td class="indexkey"><a class="el" href="a00315.html">tbb::task_list</a></td><td class="indexvalue">A list of children </td></tr>
<tr><td class="indexkey"><a class="el" href="a00316.html">tbb::task_scheduler_init</a></td><td class="indexvalue">Class delimiting the scope of task scheduler activity </td></tr>
<tr><td class="indexkey"><a class="el" href="a00317.html">tbb::tbb_allocator< T ></a></td><td class="indexvalue">Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5 </td></tr>
<tr><td class="indexkey"><a class="el" href="a00318.html">tbb::tbb_allocator< void ></a></td><td class="indexvalue">Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1 </td></tr>
<tr><td class="indexkey"><a class="el" href="a00319.html">tbb::tbb_exception</a></td><td class="indexvalue">Interface to be implemented by all exceptions TBB recognizes and propagates across the threads </td></tr>
<tr><td class="indexkey"><a class="el" href="a00320.html">tbb::internal::tbb_exception_ptr</a></td><td class="indexvalue">Exception container that preserves the exact copy of the original exception </td></tr>
<tr><td class="indexkey"><a class="el" href="a00321.html">tbb::tbb_hash_compare< Key ></a></td><td class="indexvalue">Hash_compare that is default argument for concurrent_hash_map </td></tr>
<tr><td class="indexkey"><a class="el" href="a00322.html">tbb::thread_bound_filter</a></td><td class="indexvalue">A stage in a pipeline served by a user thread </td></tr>
<tr><td class="indexkey"><a class="el" href="a00323.html">tbb::tick_count</a></td><td class="indexvalue">Absolute timestamp </td></tr>
<tr><td class="indexkey"><a class="el" href="a00324.html">tbb::tick_count::interval_t</a></td><td class="indexvalue">Relative time interval </td></tr>
<tr><td class="indexkey"><a class="el" href="a00325.html">tbb::internal::work_around_alignment_bug< Size, T ></a></td><td class="indexvalue">Work around for bug in GNU 3.2 and MSVC compilers </td></tr>
<tr><td class="indexkey"><a class="el" href="a00326.html">tbb::zero_allocator< T, Allocator ></a></td><td class="indexvalue">Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5 </td></tr>
<tr><td class="indexkey"><a class="el" href="a00327.html">tbb::zero_allocator< void, Allocator ></a></td><td class="indexvalue">Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1 </td></tr>
</table>
<hr>
<p></p>
Copyright © 2005-2011 Intel Corporation. All Rights Reserved.
<p></p>
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.
<p></p>
* Other names and brands may be claimed as the property of others.
|
