Home
last modified time | relevance | path

Searched refs:table (Results 1 – 25 of 30) sorted by relevance

12

/oneTBB/test/conformance/
H A Dconformance_concurrent_hash_map.cpp647 TableOperation( test_table_type& table ) : my_table(table) {} in TableOperation() argument
725 table.insert( il ); in apply()
746 for( test_table_type::iterator i = table.begin(); i!=table.end(); ++i ) { in TraverseTable()
783 b = table.find( a, MyKey::make(i) ) && table.erase( a ); in apply()
786 b = table.find( a, MyKey::make(i) ) && table.erase( a ); in apply()
809 if(table.find( res, MyKey::make(key) ) && table.erase( res ) ) in apply()
813 if(table.find( res, MyKey::make(key) ) && table.erase( res ) ) in apply()
833 YourTable& table; member
941 table.clear(); in TestInsertFindErase()
1005 RemoveFromTable( test_table_type& table, int m ) : my_table(table), my_m(m) {} in RemoveFromTable() argument
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_segment_table.h187 segment = table[seg_index].load(std::memory_order_acquire); in enable_segment()
203 size_type number_of_segments( segment_table_type table ) const { in number_of_segments() argument
210 segment_table_type table = get_table(); in capacity() local
211 size_type num_segments = number_of_segments(table); in capacity()
223 size_type num_segments = number_of_segments(table); in find_last_allocated_segment()
287 if (table) { in extend_table_if_necessary()
303 } while (table == my_embedded_table); in extend_table_if_necessary()
510 extend_table_if_necessary(table, index, index + 1); in internal_subscript()
516 enable_segment(segment, table, seg_index, index); in internal_subscript()
537 void zero_table( segment_table_type table, size_type count ) { in zero_table() argument
[all …]
H A D_concurrent_unordered_base.h733 const_range_type( const concurrent_unordered_base& table ) in const_range_type() argument
734 …: my_instance(table), my_begin_node(my_instance.first_value_node(const_cast<node_ptr>(&table.my_he… in const_range_type()
838 …segment_type nullify_segment( typename base_type::segment_table_type table, size_type segment_inde… in nullify_segment() argument
839 segment_type target_segment = table[segment_index].load(std::memory_order_relaxed); in nullify_segment()
840 table[segment_index].store(nullptr, std::memory_order_relaxed); in nullify_segment()
/oneTBB/doc/main/tbb_userguide/
H A Dconcurrent_hash_map.rst7 A ``concurrent_hash_map<Key, T, HashCompare >`` is a hash table that
46 // A concurrent hash table that maps strings to ints.
52 StringTable& table;
53 Tally( StringTable& table_ ) : table(table_) {}
57 table.insert( a, *p );
71 // Construct empty table.
72 StringTable table;
75 // Put occurrences into the table
77 Tally(table) );
81 for( StringTable::iterator i=table.begin(); i!=table.end(); ++i )
[all …]
H A DMac_OS.rst7 The following table describes the subdirectory structure for macOS\*, relative to *<install_dir>*.
11 .. list-table::
H A DLinux_OS.rst8 installation directory. The following table describes the subdirectory
13 .. list-table::
H A DParallelizing_Simple_Loops_os.rst20 library, otherwise undefined references will occur. The following table
29 .. list-table::
H A DWindows_OS_ug.rst7 installation directory. The following table describes the subdirectory
13 .. list-table::
H A DDebug_Versus_Release_Libraries.rst7 The following table details the |full_name|
15 .. list-table::
H A DPartitioner_Summary.rst9 executing the loop. The following table summarizes partitioners and
16 .. list-table::
H A DLambda_Expressions.rst50 C++11 support is off by default in the compiler. The following table
57 .. list-table::
H A DWhich_Dynamic_Libraries_to_Use.rst28 .. list-table::
H A DMutex_Flavors.rst11 summarized in the table below.
97 .. list-table::
H A DPredefined_Node_Types.rst10 flow_graph.h. Below is a table that lists all of the predefined types
18 .. list-table::
H A DMore_on_HashCompare.rst46 equal, then they must hash to the same value*, otherwise the hash table
/oneTBB/test/common/
H A Dnode_handling_support.h149 Container table; in generate_node_handle() local
150 table.insert(value); in generate_node_handle()
151 return table.unsafe_extract(table.begin()); in generate_node_handle()
155 void check_insert( const Container& table,
160 REQUIRE_MESSAGE(result == table.end(),
167 for (auto it = table.begin(); it != table.end(); ++it) {
181 void check_insert( const Container& table,
186 check_insert(table, result, node_value);
191 void check_insert( const Container& table,
239 Container table_backup(table); in test_insert()
[all …]
H A Dconcurrent_associative_common.h676 FillTable(Container& table, int items, bool asymptotic)
677 : my_table(table), my_items(items), my_asymptotic(asymptotic)
767 T& table;
769 CheckTable(T& t) : NoAssign(), table(t) {}
771 int c = (int)table.count(i);
786 Container table;
798 REQUIRE(int(table.size()) == items_inserted);
804 typename Container::range_type r = table.range();
812 const Container& const_table = table;
823 tbb::parallel_for(0, items, CheckTable<Container>(table));
[all …]
H A Dconcurrent_unordered_common.h28 inline void CheckContainerAllocator(MyTable &table, size_t expected_allocs, size_t expected_frees, … in CheckContainerAllocator() argument
29 typename MyTable::allocator_type a = table.get_allocator(); in CheckContainerAllocator()
/oneTBB/doc/_static/
H A Dtheme_overrides.css1 /* override table width restrictions */
4 .wy-table-responsive table td {
10 .wy-table-responsive {
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_vector.h574 if (table[0].load(std::memory_order_acquire) != nullptr) { in create_segment()
654 table[i].store(nullptr, std::memory_order_relaxed); in nullify_segment()
698 auto table = this->get_table(); in copy_segment()
721 auto table = this->get_table(); in move_segment()
758 if (base_type::number_of_segments(table) < seg_index) { in internal_subscript_with_exceptions()
762 if (table[seg_index] <= this->segment_allocation_failure_tag) { in internal_subscript_with_exceptions()
831 segment_table_type table = this->get_table(); in internal_grow() local
832 this->extend_table_if_necessary(table, start_idx, end_idx); in internal_grow()
846 internal_loop_construct(table, start_idx, end_idx, args...); in internal_grow()
949 segment_table_type table = this->get_table(); in internal_compact() local
[all …]
H A Dconcurrent_hash_map.h316 void internal_swap_content(hash_map_base &table) { in internal_swap_content() argument
318 swap_atomics_relaxed(my_mask, table.my_mask); in internal_swap_content()
319 swap_atomics_relaxed(my_size, table.my_size); in internal_swap_content()
864 internal_copy(table); in __TBB_requires()
874 internal_copy(table); in __TBB_requires()
881 concurrent_hash_map( concurrent_hash_map &&table ) in __TBB_requires()
884 this->internal_move(std::move(table)); in __TBB_requires()
933 if( this != &table ) { in __TBB_requires()
936 internal_copy(table); in __TBB_requires()
943 if( this != &table ) { in __TBB_requires()
[all …]
/oneTBB/examples/concurrent_hash_map/count_strings/
H A Dcount_strings.cpp83 StringTable& table; member
84 Tally(StringTable& table_) : table(table_) {} in Tally()
88 table.insert(a, *p); in operator ()()
97 StringTable table; in CountOccurrences() local
101 Tally(table)); in CountOccurrences()
105 for (StringTable::iterator i = table.begin(); i != table.end(); ++i) { in CountOccurrences()
124 "total = %d unique = %u time = %g\n", n, unsigned(table.size()), (t1 - t0).seconds()); in CountOccurrences()
240 StringTable table; in main() local
/oneTBB/doc/main/reference/
H A Dscalable_memory_pools.rst10 thread-safe, scalable operations. The following table summarizes the Memory Pool named requirement.
15 .. list-table::
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DLocal_Serializer.rst86 the three constraints in the following table are met.
92 .. list-table::
108 table. The first constraint does not exist when s is NULL. The
/oneTBB/doc/main/intro/
H A Dnotation.rst13 .. list-table::

12