Home
last modified time | relevance | path

Searched refs:K (Results 1 – 16 of 16) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_join_impl.h508 K my_key;
1264 …new type_to_key_function_body_leaf<T0, K, key_from_message_body<K,T0> >(key_from_message_body<K,T0…
1265 …new type_to_key_function_body_leaf<T1, K, key_from_message_body<K,T1> >(key_from_message_body<K,T1…
1299 …new type_to_key_function_body_leaf<T0, K, key_from_message_body<K,T0> >(key_from_message_body<K,T0…
1300 …new type_to_key_function_body_leaf<T1, K, key_from_message_body<K,T1> >(key_from_message_body<K,T1…
1301 …new type_to_key_function_body_leaf<T2, K, key_from_message_body<K,T2> >(key_from_message_body<K,T2…
1341 …new type_to_key_function_body_leaf<T3, K, key_from_message_body<K,T3> >(key_from_message_body<K,T3…
1385 …new type_to_key_function_body_leaf<T4, K, key_from_message_body<K,T4> >(key_from_message_body<K,T4…
1434 …new type_to_key_function_body_leaf<T5, K, key_from_message_body<K,T5> >(key_from_message_body<K,T5…
1488 …new type_to_key_function_body_leaf<T6, K, key_from_message_body<K,T6> >(key_from_message_body<K,T6…
[all …]
H A D_concurrent_skip_list.h469 template <typename K>
491 template <typename K>
508 template <typename K>
513 template <typename K>
526 template <typename K>
531 template <typename K>
544 template <typename K>
549 template <typename K>
558 template <typename K>
567 template <typename K>
[all …]
H A D_concurrent_unordered_base.h513 template <typename K>
537 template <typename K>
558 template <typename K>
564 template <typename K>
580 template <typename K>
586 template <typename K>
596 template <typename K>
605 template <typename K>
1163 template <typename K>
1256 template <typename K>
[all …]
H A D_hash_compare.h46 template <typename K, typename = typename std::enable_if<is_transparent_hash::value, K>::type>
47 std::size_t operator()( const K& key ) const { in operator()
H A D_flow_graph_body_impl.h56 template<typename K, typename KHash=tbb_hash_compare<typename std::decay<K>::type > >
57 __TBB_requires(tbb::detail::hash_compare<KHash, K>)
59 typedef K key_type;
60 typedef typename std::decay<K>::type base_key_type;
H A D_flow_graph_types_impl.h39 typedef Kp K; typedef
41 typedef type_to_key_function_body<T,K> TtoK;
61 typedef typename KeyTraits::key_type K;
63 typedef typename std::tuple<PT<KeyTrait<K, KHash, Args> >... > type;
H A D_flow_graph_indexer_impl.h33 template<typename IndexerNodeBaseType, typename T, size_t K>
35 typename IndexerNodeBaseType::output_type o(K, v); in do_try_put()
/oneTBB/test/tbb/
H A Dtest_join_node.h60 template<typename K>
74 template<typename K>
76 typedef K type;
79 template<typename K>
81 typedef K type;
86 K my_key;
99 K my_key;
126 K my_key;
143 K my_key;
263 K,
[all …]
/oneTBB/test/common/
H A Dconcepts_common.h440 template <typename K> using Correct = HashCompare<K, /*CopyCtor = */true, /*Dtor = */true, /*Hash =…
441 template <typename K> using NonCopyable = HashCompare<K, /*CopyCtor = */false, /*Dtor = */true, /*H…
442 template <typename K> using NonDestructible = HashCompare<K, /*CopyCtor = */true, /*Dtor = */false,…
443 template <typename K> using NoHash = HashCompare<K, /*CopyCtor = */true, /*Dtor = */true, /*Hash = …
444 template <typename K> using HashNonConst = HashCompare<K, /*CopyCtor = */true, /*Dtor = */true, /*H…
447 template <typename K> using NoEqual = HashCompare<K, /*CopyCtor = */true, /*Dtor = */true, /*Hash =…
448 template <typename K> using EqualNonConst = HashCompare<K, /*CopyCtor = */true, /*Dtor = */true, /*…
689 template <typename I, typename K> using Correct = JoinNodeFunctionObject<I, K, /*CopyCtor = */true,…
690 template <typename I, typename K> using NonCopyable = JoinNodeFunctionObject<I, K, /*CopyCtor = */f…
691 template <typename I, typename K> using NonDestructible = JoinNodeFunctionObject<I, K, /*CopyCtor =…
[all …]
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h684 template <typename K = Key> in __TBB_requires()
696 template <typename K> in __TBB_requires()
1055 template <typename K> in __TBB_requires()
1061 template <typename K> in __TBB_requires()
1101 template <typename K> in __TBB_requires()
1121 template <typename K> in __TBB_requires()
1128 template <typename K> in __TBB_requires()
1149 template <typename K> in __TBB_requires()
1157 template <typename K> in __TBB_requires()
1242 template <typename K> in __TBB_requires()
[all …]
H A Dflow_graph.h380 template <typename K, typename T>
381 K key_from_message( const T &t ) { in key_from_message()
2197 template <typename OutputTuple, typename K,
2201 … (... && join_node_function_object<Functions, std::tuple_element_t<Idx, OutputTuple>, K>);
2203 template <typename OutputTuple, typename K, typename... Functions>
2212 template<typename OutputTuple, typename K, typename KHash>
2214 key_matching_port, OutputTuple, key_matching<K,KHash> > {
2227 __TBB_requires(join_node_functions<OutputTuple, K, __TBB_B0, __TBB_B1>) in __TBB_requires() argument
2233 __TBB_requires(join_node_functions<OutputTuple, K, __TBB_B0, __TBB_B1, __TBB_B2>) in __TBB_requires() argument
2239 __TBB_requires(join_node_functions<OutputTuple, K, __TBB_B0, __TBB_B1, __TBB_B2, __TBB_B3>) in __TBB_requires() argument
[all …]
/oneTBB/doc/main/reference/
H A Dtype_specified_message_keys.rst34 ``key_matching<typename K, class KHash=tbb_hash_compare>`` policy is
50 template <typename K, typename T>
51 K key_from_message( const T &t ) {
59 used to construct the ``join_node``, and ``K`` is the key type
/oneTBB/examples/test_all/fibonacci/
H A DREADME.md21 fibonacci K [M[:N]] [R]
23 * `K` - specifies the fibonacci number which would be calculated.
/oneTBB/test/conformance/
H A Dconformance_parallel_for_each.cpp51 template<size_t K>
54 x = K; in operator ()()
H A Dconformance_join_node.cpp271 template <typename K, typename Body1, typename Body2>
273 static_assert(std::is_same_v<std::decay_t<K>, std::size_t>, "incorrect test setup"); in test_invoke_basic()
282 using join_type = join_node<tuple_type, key_matching<K>>; in test_invoke_basic()
/oneTBB/doc/main/intro/
H A Dnotation.rst30 - X{K \| W \| P} Indicates XK, XW, or XP.