Home
last modified time | relevance | path

Searched refs:container (Results 1 – 25 of 57) sorted by relevance

123

/oneTBB/doc/main/tbb_userguide/
H A DContainers.rst8 container classes. These containers can be used with raw Windows\* OS or
12 A concurrent container allows multiple threads to concurrently access
13 and update items in the container. Typical C++ STL containers do not
15 result in corrupting the container. STL containers can be wrapped in a
17 thread operate on the container at a time, but that approach eliminates
25 - **Fine-grained locking:** Multiple threads operate on the container
45 container object must not be invoked concurrently with another
H A DFlow_Graph_Reservation.rst99 .. container:: fignone
103 .. container:: imagecenter
132 .. container:: fignone
136 .. container:: imagecenter
154 .. container:: fignone
158 .. container:: imagecenter
176 .. container:: fignone
180 .. container:: imagecenter
196 .. container:: fignone
220 .. container:: fignone
[all …]
H A DLock_Pathologies.rst11 .. container:: section
44 "outer container" and "inner container" mutexes, and need to
55 .. container:: section
H A DDependence_Graph.rst15 .. container:: fignone
22 .. container:: imagecenter
47 .. container:: fignone
54 .. container:: imagecenter
114 .. container:: fignone
120 .. container:: imagecenter
H A DFlow_Graph_Message_Passing_Protocol.rst31 .. container:: fignone
38 .. container:: imagecenter
H A DParallelizing_Flow_Graph.rst33 .. container:: fignone
40 .. container:: imagecenter
60 .. container:: fignone
67 .. container:: imagecenter
H A DSummary_of_Containers.rst9 scenarios where the alternative would be a serial container with a lock
H A DNon-Linear_Pipelines.rst12 .. container:: fignone
35 .. container:: fignone
H A Destimate_flow_graph_performance.rst12 .. container:: section
36 .. container:: section
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DOdd-Even_Communication.rst7 .. container:: section
18 .. container:: section
35 .. container:: section
44 .. container:: section
53 .. container:: section
H A DAgglomeration.rst7 .. container:: section
17 .. container:: section
31 .. container:: section
46 .. container:: section
81 .. container:: section
107 .. container:: fignone
123 .. container:: fignone
136 .. container:: section
H A DWavefront.rst7 .. container:: section
17 .. container:: section
26 .. container:: section
40 .. container:: section
66 .. container:: section
102 .. container:: fignone
115 .. container:: fignone
183 .. container:: section
H A DElementwise.rst7 .. container:: section
17 .. container:: section
28 .. container:: section
37 .. container:: section
59 .. container:: section
H A DReference_Counting.rst7 .. container:: section
16 .. container:: section
27 .. container:: section
40 .. container:: section
102 .. container:: section
123 .. container:: section
H A DFenced_Data_Transfer.rst7 .. container:: section
17 .. container:: section
72 .. container:: section
81 .. container:: section
121 .. container:: section
135 .. container:: section
H A DLazy_Initialization.rst7 .. container:: section
17 .. container:: section
29 .. container:: section
44 .. container:: section
H A DNon-Preemptive_Priorities.rst7 .. container:: section
16 .. container:: section
29 .. container:: section
45 .. container:: section
56 .. container:: section
H A DDivide_and_Conquer.rst7 .. container:: section
16 .. container:: section
26 .. container:: section
40 .. container:: section
58 .. container:: section
H A DGUI_Thread.rst6 .. container:: section
16 .. container:: section
31 .. container:: section
48 .. container:: section
58 .. container:: section
75 .. container:: section
H A DLocal_Serializer.rst7 .. container:: section
25 .. container:: section
40 .. container:: section
59 .. container:: section
89 .. container:: tablenoborder
/oneTBB/doc/main/reference/
H A Dconcurrent_lru_cache_cls.rst18 A ``concurrent_lru_cache`` container maps keys to values with the ability
20 stored in the container.
22 The container permits multiple threads to concurrently retrieve items from it.
24 The container tracks which items are in use by returning a proxy
28 The container stores all the items that are currently in use plus a limited
32 When no item is found for a given key, the container calls the user-specified
107 **Effects**: Searches the container for an item that corresponds to the given key.
109 construct a value that is inserted into the container.
H A Dscalable_memory_pools.rst13 .. container:: tablenoborder
31 .. container:: section
/oneTBB/examples/concurrent_hash_map/
H A DREADME.md2 This directory contains examples of the `concurrent_hash_map` container.
6 | count_strings | Concurrently inserts strings into a `concurrent_hash_map` container.
/oneTBB/examples/concurrent_priority_queue/
H A DREADME.md2 This directory contains examples of the `concurrent_priority_queue` container.
6 …th | Solves the single source shortest path problem using a `concurrent_priority_queue` container.
/oneTBB/test/common/
H A Dconcurrent_unordered_common.h377 Container container; in test_reserve_regression() local
379 float lf = container.max_load_factor(); in test_reserve_regression()
380 std::size_t buckets = container.unsafe_bucket_count(); in test_reserve_regression()
384 container.reserve(elements); in test_reserve_regression()
385 REQUIRE_MESSAGE(container.unsafe_bucket_count() == buckets, in test_reserve_regression()
389 container.reserve(capacity * 2); in test_reserve_regression()
390 …REQUIRE_MESSAGE(container.unsafe_bucket_count() > buckets, "reserve() should increase bucket count… in test_reserve_regression()

123