Home
last modified time | relevance | path

Searched refs:where (Results 1 – 25 of 50) sorted by relevance

12

/oneTBB/include/oneapi/tbb/
H A Dconcurrent_unordered_map.h91 iterator where = this->find(key); variable
93 if (where == this->end()) {
96 return where->second;
100 iterator where = this->find(key); variable
102 if (where == this->end()) {
105 return where->second;
109 iterator where = this->find(key); in at() local
111 if (where == this->end()) { in at()
114 return where->second; in at()
120 if (where == this->end()) { in at()
[all …]
H A Denumerable_thread_specific.h632 …void construct(void*where) {new(where) T();} // C++ note: the () in T() ensure zero initialization.
639 void construct(void*where) {new(where) T(exemplar);}
647 void construct(void* where) {new(where) T(f());}
654 void construct(void* where) {
655 call( [where](const typename std::decay<P>::type&... args ){
656 new(where) T(args...);
673 virtual void construct(void* where) = 0;
692 void construct(void* where) override {
693 Constructor::construct(where);
699 void* where = my_allocator_type().allocate(1);
[all …]
/oneTBB/examples/graph/binpack/
H A DREADME.md4 …hen a bin is packed as well as it can be, it is passed to a `buffer_node` where it waits to be pic…
23 * `#threads` - the number of threads to use; a range of the form low\[:high\] where low and optiona…
/oneTBB/doc/main/tbb_userguide/
H A DSummary_of_Containers.rst9 scenarios where the alternative would be a serial container with a lock
H A DLock_Pathologies.rst47 alphabetical order" in a situation where the locks have names. Or
73 To avoid convoying, use atomic operations instead of locks where
H A DMac_OS.rst26 where
H A DLinux_OS.rst28 where
H A DAutomatic_Chunking.rst22 most heuristics, however, there are situations where controlling the
H A Dconcurrent_hash_map.rst13 The following example builds a ``concurrent_hash_map`` where the keys
97 situations where elements are frequently read and infrequently updated.
H A DUsing_Circular_Buffers.rst11 circular buffer of size at least ``ntoken``, where ``ntoken`` is the
H A DTask_Scheduler_Bypass.rst6 Scheduler bypass is an optimization where you directly specify the next task to run.
H A DWindows_OS_ug.rst33 where
/oneTBB/examples/task_arena/fractal/
H A DREADME.md4 The application window is divided into two areas where fractals are rendered. The example also has …
27 * `n-of-threads` - the number of threads to use; a range of the form low\[:high\], where low and op…
/oneTBB/examples/parallel_for/polygon_overlay/
H A DREADME.md9 * A parallel solution where each map is split into submaps, with each resulting submap being inters…
17 …where 200 is the average number of polygons examined before stopping.) If the maps are split into …
/oneTBB/examples/concurrent_hash_map/count_strings/
H A DREADME.md21 * `n-of-threads` - number of threads to use; a range of the form low\[:high\], where low and option…
/oneTBB/examples/graph/logic_sim/
H A DREADME.md21 * `#threads` - the number of threads to use; a range of the form low[:high] where low and optional …
/oneTBB/examples/graph/cholesky/
H A DREADME.md8 …e solely of `continue_node` objects. This an inspector-executor approach, where a loop nest that i…
33 …ed to output files: <output_prefix>_posdef.txt and <output_prefix>_X.txt; where `X` is the algorit…
/oneTBB/examples/parallel_reduce/primes/
H A DREADME.md21 * `n-of-threads` - the number of threads to use; a range of the form low\[:high\], where low and op…
/oneTBB/examples/parallel_reduce/pi/
H A DREADME.md22 …hreads to use. This number is specified in the low\[:high\] range format, where both ``low`` and, …
/oneTBB/doc/main/reference/
H A Dparallel_sort_ranges_extension.rst48 …Equivalent to ``parallel_sort( std::begin(c), std::end(c), comp )``, where `comp` uses `operator<`…
H A Dreference.rst13 This document provides additional details or restrictions where necessary.
/oneTBB/examples/parallel_pipeline/square/
H A DREADME.md22 * `n-of-threads` - the number of threads to use; a range of the form low\[:high\], where low and op…
/oneTBB/examples/graph/dining_philosophers/
H A DREADME.md23 …mber of threads to use; a range of the form low\[:high\[:(+|*|#)step\]\], where low and optional h…
/oneTBB/examples/parallel_reduce/convex_hull/
H A DREADME.md27 * `n-of-threads` - the number of threads to use; a range of the form low\[:high\], where low and op…
/oneTBB/examples/task_group/sudoku/
H A DREADME.md24 * `n-of-threads` - the number of threads to use; a range of the form low\[:high\], where low and op…

12