Home
last modified time | relevance | path

Searched refs:map (Results 1 – 25 of 26) sorted by relevance

12

/oneTBB/examples/parallel_for/polygon_overlay/
H A DREADME.md8 …ting list of polygons from one map and intersecting each sub-list against the entire list of polyg…
9 …map is split into submaps, with each resulting submap being intersected against the corresponding …
17 …map, then on average the number of intersections calculated is approximately 80,000 (400 * 200, wh…
23 One further optimization would be to sort one map, say map1, by maxY, and sort the other map (map2)…
25 …map is inspected and any remaining unoccupied "boxes" are made into additional polygons, as large …
27 One limitation of the program is that if the number of polygons in the source map is greater than t…
49 * `--polys npolys` - number of polygons in each map.
50 * `--size nnnxnnn` - size of each map (X x Y).
/oneTBB/examples/graph/som/
H A DREADME.md2 …s `oneapi::tbb::flow` and the use of cancellation in scheduling multiple iterations of map updates.
6 …map with several examples, splitting the map into subsections and looking for best-match for multi…
30 * `nospeculate` - don't speculate in SOM map teaching.
/oneTBB/python/tbb/
H A Dtest.py110 assert pool.map(return42, []) == []
122 assert list(pool.map(f, range(10))) == list(map(f, range(10)))
138 assert list(pool.imap(work, range(10, 3, -1), chunksize=4)) == list(map(
142 assert sorted(pool.imap_unordered(work, range(10, 3, -1))) == sorted(map(
H A Dpool.py104 def map(self, func, iterable, chunksize=None): member in Pool
/oneTBB/test/common/
H A Dallocator_stl_test_common.h118 TestMap<std::map <int, int, std::less<int>, Acii> >(a);
130 TestMap<std::map<int, int, std::less<int>, Aii> >(a);
131 TestMap<std::map<const int, int, std::less<int>, Acii> >(a);
H A Dstate_trackable.h83 using counters_type = std::map<StateTrackableBase::StateValue, std::atomic<std::size_t>>;
H A Dconcurrent_lru_cache_common.h65 using map_type = std::map<KeyType, ValueType>;
/oneTBB/test/tbb/
H A Dtest_concurrent_unordered_map.cpp232 exception_mmap_type map; variable
234 map.insert(std::pair<const int, int>(i, 42));
239 exception_mmap_type map1(map); in __anonf1fab3910102()
H A Dtest_concurrent_hash_map.cpp702 Map map; in test_chmap_access_mode() local
706 bool result = map.insert(acc, 1); in test_chmap_access_mode()
711 result = map.insert(acc, 2L); in test_chmap_access_mode()
717 result = map.insert(acc, value); in test_chmap_access_mode()
722 result = map.insert(acc, typename Map::value_type{4, 4}); in test_chmap_access_mode()
727 result = map.find(acc, 1); in test_chmap_access_mode()
732 result = map.find(acc, 2L); in test_chmap_access_mode()
776 map_type map(init_list);
780 map_type map1(map); in __anon3741356d0302()
H A Dtest_arena_priorities.cpp280 std::map<tbb::task_arena::priority, unsigned> wasted_tasks; in test()
287 std::map<tbb::task_arena::priority, unsigned> per_priority_tasks_num; in test()
328 std::map<tbb::task_arena::priority, unsigned> per_priority_tasks_num; in test()
H A Dtest_enumerable_thread_specific.cpp283 typedef typename std::map<Key, Val> my_map; in flog_segmented_iterator_map()
/oneTBB/doc/main/tbb_userguide/
H A DThe_Task_Scheduler.rst11 scheduler. However, if you have an algorithm that does not naturally map
H A DAllocator_Configuration.rst18 map memory in huge pages or define a recommended heap size. These
H A Dconcurrent_hash_map.rst8 permits concurrent accesses. The table is a map from a key to a type
H A DTask-Based_Programming.rst32 which map onto the *physical threads* of the hardware. For computations
/oneTBB/test/conformance/
H A Dconformance_concurrent_map.cpp112 TMap map(v.begin(), v.end()); in test_deduction_guides() local
113 static_assert(std::is_same_v<decltype(map), TMap<int, int> >, "WRONG\n"); in test_deduction_guides()
/oneTBB/doc/main/intro/
H A Dintro_os.rst12 library, you specify tasks, not threads, and let the library map tasks
H A DBenefits.rst28 forces you to efficiently map logical tasks onto threads. In
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h469 hash_map_iterator( const Container &map, std::size_t index, const bucket *b, node_base *n ) : in hash_map_iterator() argument
470 my_map(&map), my_index(index), my_bucket(b), my_node(static_cast<node*>(n)) in hash_map_iterator()
529 hash_map_range( const map_type &map, size_type grainsize_ = 1 ) :
530 …my_begin( Iterator( map, 0, map.my_embedded_segment, map.my_embedded_segment->node_list.load(std::…
531 … my_end( Iterator( map, map.my_mask.load(std::memory_order_relaxed) + 1, nullptr, nullptr ) ),
H A Dconcurrent_lru_cache.h67 using storage_map_type = std::map<key_type, storage_map_value_type>;
/oneTBB/doc/main/reference/
H A Dcustom_mutex_chmap.rst157 …map_type map; // This object will use SharedMutexWrapper for thread safety of insert/find/erase op…
/oneTBB/examples/concurrent_hash_map/count_strings/
H A Dcount_strings.cpp64 std::map<std::size_t, int> hashes;
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DAgglomeration.rst161 #. **M**\ apping – map tasks onto processors. The oneTBB task
/oneTBB/examples/common/utility/
H A Dutility.hpp194 typedef std::map<std::string, internal::argument> args_map_type;
/oneTBB/examples/graph/cholesky/
H A Dcholesky.cpp674 typedef std::map<std::string, algorithm *> algmap_t; in main()

12