Home
last modified time | relevance | path

Searched refs:value (Results 1 – 25 of 189) sorted by relevance

12345678

/oneTBB/test/conformance/
H A Dconformance_concurrent_unordered_map.cpp72 static_assert(std::is_same<typename container_type::key_type, int>::value, in test_member_types()
154 std::less<int>, custom_allocator_type>>::value); in test_deduction_guides()
159 std::equal_to<int>, custom_allocator_type>>::value); in test_deduction_guides()
164 std::equal_to<int>, custom_allocator_type>>::value); in test_deduction_guides()
185 std::less<int>, custom_allocator_type>>::value); in test_deduction_guides()
190 std::equal_to<int>, custom_allocator_type>>::value); in test_deduction_guides()
195 std::equal_to<int>, custom_allocator_type>>::value); in test_deduction_guides()
199 static_assert(std::is_same<decltype(m14), decltype(m1)>::value); in test_deduction_guides()
204 static_assert(std::is_same<decltype(m15), decltype(m5)>::value); in test_deduction_guides()
208 static_assert(std::is_same<decltype(m16), decltype(m1)>::value); in test_deduction_guides()
[all …]
H A Dconformance_concurrent_unordered_set.cpp149 std::less<ComplexType>>>::value); in test_deduction_guides()
155 std::less<ComplexType>, custom_allocator_type>>::value); in test_deduction_guides()
160 std::equal_to<ComplexType>, custom_allocator_type>>::value); in test_deduction_guides()
165 std::equal_to<ComplexType>, custom_allocator_type>>::value); in test_deduction_guides()
178 std::less<ComplexType>>>::value); in test_deduction_guides()
183 std::less<ComplexType>, custom_allocator_type>>::value); in test_deduction_guides()
188 std::equal_to<ComplexType>, custom_allocator_type>>::value); in test_deduction_guides()
193 std::equal_to<ComplexType>, custom_allocator_type>>::value); in test_deduction_guides()
197 static_assert(std::is_same<decltype(s13), decltype(s1)>::value); in test_deduction_guides()
202 static_assert(std::is_same<decltype(s14), decltype(s5)>::value); in test_deduction_guides()
[all …]
H A Dconformance_concurrent_set.cpp42 static_assert(std::is_same<typename default_container_type::key_compare, std::less<int>>::value, in test_member_types()
52 static_assert(std::is_same<typename container_type::key_type, int>::value, in test_member_types()
54 static_assert(std::is_same<typename container_type::value_type, int>::value, in test_member_types()
57 static_assert(std::is_unsigned<typename container_type::size_type>::value, in test_member_types()
59 static_assert(std::is_signed<typename container_type::difference_type>::value, in test_member_types()
68 static_assert(std::is_same<typename container_type::reference, value_type&>::value, in test_member_types()
70 static_assert(std::is_same<typename container_type::const_reference, const value_type&>::value, in test_member_types()
78 static_assert(utils::is_forward_iterator<typename container_type::iterator>::value, in test_member_types()
80 static_assert(!std::is_const<typename container_type::iterator::value_type>::value, in test_member_types()
82 static_assert(utils::is_forward_iterator<typename container_type::const_iterator>::value, in test_member_types()
[all …]
H A Dconformance_concurrent_map.cpp60 static_assert(std::is_same<typename default_container_type::key_compare, std::less<int>>::value, in test_member_types()
70 static_assert(std::is_same<typename container_type::key_type, int>::value, in test_member_types()
72 static_assert(std::is_same<typename container_type::mapped_type, int>::value, in test_member_types()
77 static_assert(std::is_unsigned<typename container_type::size_type>::value, in test_member_types()
79 static_assert(std::is_signed<typename container_type::difference_type>::value, in test_member_types()
88 static_assert(std::is_same<typename container_type::reference, value_type&>::value, in test_member_types()
90 static_assert(std::is_same<typename container_type::const_reference, const value_type&>::value, in test_member_types()
98 static_assert(utils::is_forward_iterator<typename container_type::iterator>::value, in test_member_types()
100 static_assert(!std::is_const<typename container_type::iterator::value_type>::value, in test_member_types()
102 static_assert(utils::is_forward_iterator<typename container_type::const_iterator>::value, in test_member_types()
[all …]
H A Dconformance_concurrent_priority_queue.cpp86 std::size_t value; member
90 ~MoveOperationTrackerBase() { value = 0; } in ~MoveOperationTrackerBase()
92 MoveOperationTrackerBase( const MoveOperationTrackerBase& other ) : value(other.value) { in MoveOperationTrackerBase()
97 MoveOperationTrackerBase( MoveOperationTrackerBase&& other ) noexcept : value(other.value) { in MoveOperationTrackerBase()
99 other.value = 0; in MoveOperationTrackerBase()
105 value = other.value; in operator =()
112 value = other.value; in operator =()
113 other.value = 0; in operator =()
121 return value < other.value; in operator <()
571 std::allocator<ComplexType>>>::value); in TestDeductionGuides()
[all …]
H A Dconformance_mutex.h33 counter.value = 0;
40 counter.value = counter.value + 1;
46 counter.value = counter.value + 1;
125 long value[N]; member
127 ArrayCounter() : value{0} {} in ArrayCounter()
131 ++value[k]; in increment()
137 if (value[k] != expected_value) { in value_is()
149 long counter_value = counter.value[0]; in TestReaderWriterLock_Impl()
166 counter_value = counter.value[0]; in TestReaderWriterLock_Impl()
324 counter.value = counter.value + 1; in recurse_till()
[all …]
/oneTBB/test/tbb/
H A Dtest_join_node_key_matching.cpp104 …expr bool value = multiple_arguments_initialization_helper<ArgCount - 1, IncorrectArgIndex - 1, Co… member
111 …expr bool value = multiple_arguments_initialization_helper<ArgCount - 1, MAX_TUPLE_TEST_SIZE, Corr… member
118 static constexpr bool value = can_initialize_join_node<Args...>; member
125 …tatic constexpr bool value = multiple_arguments_initialization_helper<ArgCount, CurrentIncorrectIn… member
133 …tatic constexpr bool value = multiple_arguments_initialization_helper<ArgCount, CurrentIncorrectIn… member
140 …c constexpr bool value = incorrect_arg_index_iteration_helper<CurrentArgCount, /*StartIncorrectInd… member
147 …constexpr bool value = incorrect_arg_index_iteration_helper<MAX_TUPLE_TEST_SIZE, /*StartIncorrectI… member
155 …static constexpr bool value = join_node_correct_initialization_helper<CurrentArgCount - 1, Correct… member
160 static constexpr bool value = can_initialize_join_node<Args...>; member
165 …static constexpr bool value = join_node_correct_initialization_helper<CurrentArgCount, CorrectT>::… member
[all …]
H A Dtest_mutex.h34 long value; member
41 value += 1; in flog_once()
47 value += 1; in flog_once()
57 long value[N]; member
61 value[k] = 0; in Invariant()
67 ++value[k]; in update()
83 return value_is(value[0]); in is_okay()
96 long my_value = value[0]; in flog_once()
123 long my_value = value[0]; in flog_once()
173 counter.value = 0; in test_basic()
[all …]
H A Dtest_tagged_msg.cpp61 INFO("Value of wic is " << wic.value() << "\n"); in TestWrapper()
66 CHECK_MESSAGE( (*(wip.value()) == 23), "Error in wip value"); in TestWrapper()
82 CHECK_MESSAGE( (dvec.value()[0] == 2.0), "incorrect value in vector"); in TestWrapper()
91 CHECK_MESSAGE( ((ia.value()[1])[0] == 2), "integer vector array element[1] misbehaved"); in TestWrapper()
92 CHECK_MESSAGE( ((ia.value()[0])[0] == 3), "integer vector array element[0] misbehaved"); in TestWrapper()
94 CHECK_MESSAGE( ((iac.value()[1])[0] == 2), "integer vector array element[1] misbehaved"); in TestWrapper()
102 CHECK_MESSAGE( (1 + j == cat.value()[j]), "Error in cat array"); in TestWrapper()
104 int i = wi.value(); in TestWrapper()
106 CHECK_MESSAGE( (wi.value() == 42), "Assignment to wi failed"); in TestWrapper()
107 double d = wi.value(); in TestWrapper()
[all …]
H A Dtest_intrusive_list.cpp37 DataItemWithInheritedNodeBase( int value ) : m_Data(value) {} in DataItemWithInheritedNodeBase()
45 DataItemWithInheritedNode( int value ) : DataItemWithInheritedNodeBase(value) {} in DataItemWithInheritedNode()
54 DataItemWithMemberNodeBase( int value ) : m_Data(value) {} in DataItemWithMemberNodeBase()
62 DataItemWithMemberNodes( int value ) : DataItemWithMemberNodeBase(value) {} in DataItemWithMemberNodes()
H A Dtest_concurrent_hash_map.cpp78 test_insert_by_key( Table &c, const value_type &value ) : my_c(c), my_value(value) {} in test_insert_by_key() argument
131 CHECK(my_c.count( value.first ) == 1); in operator ()()
135 CHECK(my_c.find( ca, value.first )); in operator ()()
143 CHECK(my_c.insert( ca, value )); in operator ()()
149 CHECK(my_c.find( a, value.first )); in operator ()()
157 CHECK(my_c.insert( a, value )); in operator ()()
162 CHECK(my_c.erase( value.first )); in operator ()()
163 CHECK(my_c.count( value.first ) == 0); in operator ()()
385 return my_hash_compare.equal(key1.value(), key2.value()); in equal()
716 typename Map::value_type value{3, 3}; in test_chmap_access_mode() local
[all …]
/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp54 typedef long long value; typedef
59 value v[2][2];
61 Matrix2x2(value v00, value v01, value v10, value v11) { in Matrix2x2()
74 void Matrix2x2Multiply(const value a[2][2], const value b[2][2], value c[2][2]);
79 value SerialFib(int n) { in SerialFib()
105 value result; in SerialRecursiveFib()
365 value *const output;
400 value *output = new value[n]; in parallel_scanFib()
439 value result; in Measure()
459 value result, sum; in main()
[all …]
/oneTBB/examples/parallel_for_each/parallel_preorder/
H A DGraph.cpp23 Cell::Cell(const Cell& other) : op(other.op), value(other.value), successor(other.successor) { in Cell()
40 c.value = Cell::value_type((float)k); in create_random_dag()
82 case OP_NEGATE: value = -(input[0]->value); break; in update()
83 case OP_ADD: value = input[0]->value + input[1]->value; break; in update()
84 case OP_SUB: value = input[0]->value - input[1]->value; break; in update()
85 case OP_MUL: value = input[0]->value * input[1]->value; break; in update()
H A DREADME.md4 …value. The value is a matrix. Some of the cells have operators that compute the cell's value, usin…
20 * The smaller value type causes each `Cell` to be significantly smaller than a cache line, which le…
38 parallel_preorder [n-of-threads=value] [n-of-nodes=value] [n-of-traversals=value] [silent] [-h] [n-…
42 * `n-of-nodes` - the number of nodes in the graph. Default value is 1000.
43 * `n-of-traversals` - the number of times to evaluate the graph. Default value is 500.
/oneTBB/test/common/
H A Dnode_handling_support.h33 return node.key() == value.first && node.mapped() == value.second; in compare_handle_getters()
38 return node.value() == value; in compare_handle_getters()
43 node.key() = value.first; in set_node_handle_value()
44 node.mapped() = value.second; in set_node_handle_value()
49 node.value() = value; in set_node_handle_value()
150 table.insert(value); in generate_node_handle()
215 nh = generate_node_handle<Container>(value); in test_insert_overloads()
222 nh = generate_node_handle<Container>(value); in test_insert_overloads()
227 if (AllowMultimapping<Container>::value) { in test_insert_overloads()
289 if (AllowMultimapping<Container>::value) { in test_node_handling_support()
[all …]
H A Dspin_barrier.h66 void SpinWaitWhileEq(const std::atomic<T>& location, const U value) { in SpinWaitWhileEq() argument
67 SpinWaitWhileCondition(location, [&value](T t) { return t == value; }); in SpinWaitWhileEq()
73 void SpinWaitUntilEq(const std::atomic<T>& location, const U value) { in SpinWaitUntilEq() argument
74 SpinWaitWhileCondition(location, [&value](T t) { return t != value; }); in SpinWaitUntilEq()
83 void operator()( const std::atomic<T>& location, U value ) const { in operator()
84 SpinWaitWhileEq(location, value); in operator()
/oneTBB/python/rml/
H A Dipc_utils.cpp111 char* value = getenv( env_var ); in get_num_threads() local
112 if( value==nullptr ) { in get_num_threads()
116 int num_threads = (int)strtol( value, nullptr, 10 ); in get_num_threads()
125 char* value = getenv( env_var ); in get_enable_flag() local
126 if( value==nullptr ) { in get_enable_flag()
130 if( strcmp( value, "0" ) == 0 || in get_enable_flag()
131 strcmp( value, "false" ) == 0 || in get_enable_flag()
132 strcmp( value, "False" ) == 0 || in get_enable_flag()
133 strcmp( value, "FALSE" ) == 0 ) { in get_enable_flag()
/oneTBB/include/oneapi/tbb/detail/
H A D_pipeline_filters.h143 template<typename T> struct tbb_trivially_copyable { enum { value = false }; }; enumerator
144 template<typename T> struct tbb_trivially_copyable < T* > { enum { value = true }; };
145 template<> struct tbb_trivially_copyable < bool > { enum { value = true }; };
146 template<> struct tbb_trivially_copyable < char > { enum { value = true }; };
147 template<> struct tbb_trivially_copyable < signed char > { enum { value = true }; };
148 template<> struct tbb_trivially_copyable <unsigned char > { enum { value = true }; };
164 static constexpr bool value = sizeof(T) > sizeof(void *) || !tbb_trivially_copyable<T>::value;
229 using input_helper = token_helper<InputType, use_allocator<InputType >::value>;
231 using output_helper = token_helper<OutputType, use_allocator<OutputType>::value>;
254 using output_helper = token_helper<OutputType, use_allocator<OutputType>::value>;
[all …]
H A D_flow_graph_types_impl.h101 static const size_t t1_align = alignment_of<T1>::value;
102 static const size_t t2_align = alignment_of<T2>::value;
135 const value_type &value() const { return value_space; }
190 const ArrayType &value() const {
241 typedef typename pick_one< (Selector<T1>::value > Selector<T2>::value), T1, T2 >::type type;
260 static const bool value = std::is_same<Q,T_i>::value || is_element_of<Q,N-1,Tuple>::value;
266 static const bool value = std::is_same<Q,T_i>::value;
322 static const size_t N = std::tuple_size<Tuple>::value;
361 return h->value();
381 tagged_msg(T const &index, R const &value) : my_tag(index), my_msg(value) {}
[all …]
H A D_containers_helpers.h42 …static_assert(comp_is_transparent<type>::value, "Hash::transparent_key_equal::is_transparent is no…
43 static_assert((std::is_same<KeyEqual, std::equal_to<Key>>::value ||
44 …std::is_same<typename Hasher::transparent_key_equal, KeyEqual>::value), "KeyEqual is a different t…
52 …ame std::enable_if<std::is_base_of<std::input_iterator_tag, iter_traits_category<T>>::value>::type;
60 inline constexpr bool is_input_iterator_v = is_input_iterator<T>::value;
/oneTBB/doc/main/tbb_userguide/
H A DWhen_Not_to_Use_Queues.rst17 - A thread that is popping a value may have to wait idly until the
18 value is pushed.
21 - A queue is a passive data structure. If a thread pushes a value, it
22 could take time until it pops the value, and in the meantime the
23 value (and whatever it references) becomes "cold" in cache. Or worse
24 yet, another thread pops the value, and the value (and whatever it
30 do other work until a value shows up. It also tries to keep items hot in
H A DAdvanced_Example.rst18 float value = Foo(a[i]);
19 if( value<value_of_min ) {
20 value_of_min = value;
28 The loop works by keeping track of the minimum value found so far, and
29 the index of this value. This is the only information carried between
51 float value = Foo(a[i]);
52 if( value<value_of_min ) {
53 value_of_min = value;
/oneTBB/doc/main/reference/
H A Dconcurrent_lru_cache_cls.rst25 ``concurrent_lru_cache::handle`` object that refers to an item instead of its value.
33 ``value_function_type`` object to construct a value for the key, and stores that value.
75 value_type& value();
109 construct a value that is inserted into the container.
111 **Returns**: a ``handle`` object holding reference to the matching value.
123 **Effects**: Constructs a ``handle`` object that does not refer to any value.
131 ``other`` no longer refers to any value.
147 completion ``other`` no longer refers to any value.
155 **Returns**: ``true`` if ``*this`` holds reference to a value, ``false`` otherwise.
159 .. cpp:function:: value_type& value();
[all …]
/oneTBB/src/tbb/
H A Dtls.h44 void set( T value ) { pthread_setspecific(my_key, (void*)value); } in set() argument
58 void set( T value ) { TlsSetValue(my_key, (LPVOID)value); }
69 void set( T value ) { FlsSetValue(my_key, (LPVOID)value); }
/oneTBB/doc/
H A DDoxyfile.in11 # TAG = value [value, ...]
13 # TAG += value [value, ...]
227 # Minimum value: 1, maximum value: 16, default value: 4.
310 # Minimum value: 0, maximum value: 99, default value: 0.
422 # Minimum value: 0, maximum value: 9, default value: 0.
660 # Minimum value: 0, maximum value: 10000, default value: 30.
1106 # Minimum value: 1, maximum value: 20, default value: 5.
1489 # Minimum value: 0, maximum value: 20, default value: 4.
1512 # Minimum value: 8, maximum value: 50, default value: 10.
2225 # Minimum value: 0, maximum value: 32, default value: 0.
[all …]

12345678