Home
last modified time | relevance | path

Searched refs:list (Results 1 – 25 of 67) sorted by relevance

123

/oneTBB/examples/parallel_for/tachyon/src/
H A Dintersect.cpp112 intstruct->list[0].t = FHUGE; in reset_intersection()
113 intstruct->list[0].obj = nullptr; in reset_intersection()
114 intstruct->list[1].t = FHUGE; in reset_intersection()
115 intstruct->list[1].obj = nullptr; in reset_intersection()
133 intstruct->list[intstruct->num].obj = obj; in add_intersection()
134 intstruct->list[intstruct->num].t = t; in add_intersection()
143 if (intstruct->list[i].t < *t) { in closest_intersection()
144 *t = intstruct->list[i].t; in closest_intersection()
145 *obj = intstruct->list[i].obj; in closest_intersection()
157 if ((intstruct->list[i].t < maxdist) && in shadow_intersection()
[all …]
H A Dgrid.cpp279 if (*list == nullptr) in engrid_scene()
295 g->nextobj = *list; in engrid_scene()
314 if (*list == nullptr) in engrid_objlist()
317 prev = list; in engrid_objlist()
318 cur = *list; in engrid_objlist()
337 objectlist **list; in engrid_cell() local
342 if (*list == nullptr) in engrid_cell()
372 *list = newobj; in engrid_cell()
385 if (*list == nullptr) in engrid_objectlist()
388 prev = list; in engrid_objectlist()
[all …]
H A Dgrid.hpp53 int engrid_scene(object **list);
103 void engrid_objlist(grid *g, object **list);
106 static int engrid_objectlist(grid *g, objectlist **list);
/oneTBB/doc/main/tbb_userguide/
H A DCook_Until_Done_parallel_do.rst12 A linked list is an example of an iteration space that is not known in
14 arrays instead of linked lists, because accessing items in a linked list
27 void SerialApplyFooToList( const std::list<Item>& list ) {
28 for( std::list<Item>::const_iterator i=list.begin() i!=list.end(); ++i )
58 void ParallelApplyFooToList( const std::list<Item>& list ) {
59 parallel_for_each( list.begin(), list.end(), ApplyFoo() );
H A DMac_OS.rst11 .. list-table::
H A DLinux_OS.rst13 .. list-table::
H A DLambda_Expressions.rst41 capture the values by reference. After the [=] is the parameter list and
57 .. list-table::
H A DParallelizing_Simple_Loops_os.rst29 .. list-table::
H A DWhich_Dynamic_Libraries_to_Use.rst28 .. list-table::
/oneTBB/python/tbb/
H A Dtest.py113 assert list(pool.imap(return42, iter([]))) == []
114 assert list(pool.imap_unordered(return42, iter([]))) == []
116 assert list(pool.imap_async(return42, iter([])).get()) == []
117 assert list(pool.imap_unordered_async(return42, iter([])).get()) == []
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(
/oneTBB/examples/common/cmake/modules/
H A DFindTBB.cmake32 list(APPEND ADDITIONAL_LIB_DIRS ENV PATH ENV LIB)
33 list(APPEND ADDITIONAL_INCLUDE_DIRS ENV INCLUDE ENV CPATH)
35 list(APPEND ADDITIONAL_LIB_DIRS ENV LIBRARY_PATH ENV LD_LIBRARY_PATH ENV DYLD_LIBRARY_PATH)
36 …list(APPEND ADDITIONAL_INCLUDE_DIRS ENV CPATH ENV C_INCLUDE_PATH ENV CPLUS_INCLUDE_PATH ENV INCLUD…
70 list(APPEND TBB_IMPORTED_TARGETS TBB::${_tbb_component})
85 list(REMOVE_DUPLICATES TBB_IMPORTED_TARGETS)
/oneTBB/src/tbb/
H A Dsmall_object_pool.cpp119 std::int64_t small_object_pool_impl::cleanup_list(small_object* list) in cleanup_list() argument
123 while (list) { in cleanup_list()
124 small_object* current = list; in cleanup_list()
125 list = list->next; in cleanup_list()
H A Dobserver_proxy.cpp300 observer_list &list = *proxy->my_list; in observe() local
303 observer_list::scoped_lock lock(list.mutex(), /*is_writer=*/true); in observe()
307 list.remove(proxy); in observe()
H A Dsmall_object_pool_impl.h46 static std::int64_t cleanup_list(small_object* list);
/oneTBB/cmake/templates/
H A DTBBConfig.cmake.in39 list(FIND TBB_FIND_COMPONENTS tbbmalloc_proxy _tbbmalloc_proxy_ix)
41 list(APPEND TBB_FIND_COMPONENTS tbbmalloc)
42 list(REMOVE_DUPLICATES TBB_FIND_COMPONENTS)
109 list(APPEND TBB_IMPORTED_TARGETS TBB::${_tbb_component})
121 list(REMOVE_DUPLICATES TBB_IMPORTED_TARGETS)
/oneTBB/test/tbb/
H A Dtest_concurrent_hash_map.cpp99 const std::list<value_type> &my_lst;
229 typename std::list<value_type>::const_iterator begin5 = lst.begin(); in Examine()
256 void TypeTester( const std::list<Value> &lst ) { in TypeTester()
268 typename std::list<Value>::const_iterator it = lst.begin(); in TypeTester()
329 std::list<int_int_t> arrIntInt; in TestSpecificTypes()
334 std::list<ref_int_t> arrRefInt; in TestSpecificTypes()
340 std::list<int_ref_t> arrIntRef; in TestSpecificTypes()
346 std::list<shr_shr_t> arrShrShr; in TestSpecificTypes()
354 std::list< wk_wk_t > arrWkWk; in TestSpecificTypes()
361 std::list<pair_int_t> arr_pair_int; in TestSpecificTypes()
[all …]
H A Dtest_limiter_node.cpp346 int list[4] = {19, 33, 72, 98}; //list to be put to the input queue in test_reserve_release_messages() local
348 input_queue.try_put(list[0]); // succeeds in test_reserve_release_messages()
349 input_queue.try_put(list[1]); // succeeds in test_reserve_release_messages()
350 input_queue.try_put(list[2]); // fails, stored in upstream buffer in test_reserve_release_messages()
363 input_queue.try_put(list[3]); //success in test_reserve_release_messages()
370 CHECK_MESSAGE( (var==list[i]), "some data dropped, input does not match output"); in test_reserve_release_messages()
/oneTBB/test/common/
H A Dallocator_stl_test_common.h107 TestSequence<std::list <int,Ai> >(a);
112 TestSequence<std::list <MoveOperationTracker, Amot> >(a);
126 TestSequence<std::list <const int,Aci> >(a);
H A Dconcurrent_associative_common.h872 std::list<int> arr_int;
879 std::list<std::reference_wrapper<int>> arr_ref;
886 std::list<std::shared_ptr<int>> arr_shr;
893 std::list<std::weak_ptr<int>> arr_weak;
898 std::list<std::pair<int, int>> arr_pairs;
919 std::list<std::pair<const int, int>> arr_int_int_pairs;
933 std::list<std::pair<const int, std::reference_wrapper<int>>> arr_int_ref_pairs;
954 std::list<std::pair<const pair_key_type, int>> arr_pair_int_pairs;
962 std::list<std::pair<const tbb_string_key_type, int>> arr_tbb_string_pairs;
1106 const std::list<Value>& my_lst;
[all …]
H A Dconcurrent_unordered_common.h153 void CustomExamine( Table c, const std::list<typename Table::value_type>& lst ) { in CustomExamine()
194 void Examine( Table c, const std::list<typename Table::value_type>& lst ) { in Examine()
206 void TypeTester( const std::list<typename Table::value_type>& lst ) { in TypeTester()
/oneTBB/test/
H A DCMakeLists.txt192 list(APPEND LIBRARIES_PATH ${HWLOC_LOCATION_PATH})
220 list(GET _hwloc_test_HWLOC_REQUIRED_VERSION_LIST 0 TEST_HWLOC_VERSION)
298 list(APPEND HWLOC_TEST_CASES
310 list(APPEND HWLOC_TEST_CASE_0_VARS tbbbind_2_5 "hwloc_2_5")
311 list(APPEND HWLOC_TEST_CASE_1_VARS tbbbind_2 "hwloc_2")
312 list(APPEND HWLOC_TEST_CASE_2_VARS tbbbind "hwloc_1_11")
313 list(APPEND HWLOC_TEST_CASE_3_VARS tbbbind_2_5 "hwloc_2_5,hwloc_2")
314 list(APPEND HWLOC_TEST_CASE_4_VARS tbbbind_2_5 "hwloc_2_5,hwloc_1_11")
315 list(APPEND HWLOC_TEST_CASE_5_VARS tbbbind_2 "hwloc_2,hwloc_1_11")
318 list(APPEND HWLOC_TEST_CASE_8_VARS tbbbind_2 "hwloc_1_11,hwloc_2")
[all …]
/oneTBB/cmake/python/
H A Dtest_launcher.cmake18 list(LENGTH MODULES_LIST MODULES_COUNT)
26 list(GET MODULES_LIST 0 PYTHON_MODULE)
/oneTBB/examples/parallel_for/polygon_overlay/
H A DREADME.md8 …e parallel solution, by splitting list of polygons from one map and intersecting each sub-list aga…
/oneTBB/doc/main/reference/
H A Dscalable_memory_pools.rst15 .. list-table::
/oneTBB/doc/
H A Dtest_classification.dox2 /// The list of test classes attributed to test cases.

123