| /third_party/mbedtls/include/psa/ |
| D | crypto_sizes.h | 167 #define PSA_AEAD_TAG_LENGTH(key_type, key_bits, alg) \ argument
168 (PSA_AEAD_NONCE_LENGTH(key_type, alg) != 0 ? \
266 #define PSA_MAC_LENGTH(key_type, key_bits, alg) \ argument
269 PSA_ALG_IS_BLOCK_CIPHER_MAC(alg) ? PSA_BLOCK_CIPHER_BLOCK_LENGTH(key_type) : \
270 ((void)(key_type), (void)(key_bits), 0))
298 #define PSA_AEAD_ENCRYPT_OUTPUT_SIZE(key_type, alg, plaintext_length) \ argument
299 (PSA_AEAD_NONCE_LENGTH(key_type, alg) != 0 ? \
351 #define PSA_AEAD_DECRYPT_OUTPUT_SIZE(key_type, alg, ciphertext_length) \ argument
352 (PSA_AEAD_NONCE_LENGTH(key_type, alg) != 0 && \
403 #define PSA_AEAD_NONCE_LENGTH(key_type, alg) \ argument
[all …]
|
| /third_party/boost/boost/flyweight/ |
| D | key_value.hpp | 51 typedef Key key_type; typedef
62 new(spc_ptr())key_type(BOOST_FLYWEIGHT_FORWARD(args)); \
73 if(!x.value_ptr)new(key_ptr())key_type(*x.key_ptr()); in BOOST_FLYWEIGHT_PERFECT_FWD()
81 if(!x.value_ptr)new(key_ptr())key_type(std::move(*x.key_ptr())); in rep_type()
89 if(!value_ptr) key_ptr()->~key_type(); in ~rep_type()
93 operator const key_type&()const in operator const key_type&()
115 key_type* key_ptr()const in key_ptr()
117 return static_cast<key_type*>(static_cast<void*>(&spc)); in key_ptr()
120 static const key_type& key_from_value(const value_type& x) in key_from_value()
132 key_type k(std::move(*key_ptr())); in construct_value()
[all …]
|
| /third_party/boost/boost/algorithm/searching/detail/ |
| D | bm_traits.hpp | 36 template<typename key_type, typename value_type, bool /*useArray*/> class skip_table;
39 template<typename key_type, typename value_type>
40 class skip_table<key_type, value_type, false> {
43 typedef boost::unordered_map<key_type, value_type> skip_map;
45 typedef std::unordered_map<key_type, value_type> skip_map;
54 void insert ( key_type key, value_type val ) { in insert()
58 value_type operator [] ( key_type key ) const { in operator []()
74 template<typename key_type, typename value_type>
75 class skip_table<key_type, value_type, true> {
77 typedef typename boost::make_unsigned<key_type>::type unsigned_key_type;
[all …]
|
| /third_party/boost/boost/compute/algorithm/detail/ |
| D | merge_sort_on_gpu.hpp | 93 typedef typename std::iterator_traits<KeyIterator>::value_type key_type; in bitonic_block_sort() typedef
99 size_t local_keys_arg = k.add_arg<key_type *>(memory_object::local_memory, "lkeys"); in bitonic_block_sort()
112 k.decl<key_type>("my_key") << ";\n"; in bitonic_block_sort()
125 k.var<key_type>("my_key") << " = " << in bitonic_block_sort()
169 k.decl<key_type>("sibling_key") << " = lkeys[sibling_idx];\n" << in bitonic_block_sort()
171 compare(k.var<key_type>("sibling_key"), in bitonic_block_sort()
172 k.var<key_type>("my_key")) << ";\n" << in bitonic_block_sort()
174 compare(k.var<key_type>("my_key"), in bitonic_block_sort()
175 k.var<key_type>("sibling_key")) << ");\n" << in bitonic_block_sort()
223 k.decl<key_type>("sibling_key") << " = lkeys[sibling_idx];\n" << in bitonic_block_sort()
[all …]
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/detail/ |
| D | merge_sort_on_gpu.hpp | 93 typedef typename std::iterator_traits<KeyIterator>::value_type key_type; in bitonic_block_sort() typedef
99 size_t local_keys_arg = k.add_arg<key_type *>(memory_object::local_memory, "lkeys"); in bitonic_block_sort()
112 k.decl<key_type>("my_key") << ";\n"; in bitonic_block_sort()
125 k.var<key_type>("my_key") << " = " << in bitonic_block_sort()
169 k.decl<key_type>("sibling_key") << " = lkeys[sibling_idx];\n" << in bitonic_block_sort()
171 compare(k.var<key_type>("sibling_key"), in bitonic_block_sort()
172 k.var<key_type>("my_key")) << ";\n" << in bitonic_block_sort()
174 compare(k.var<key_type>("my_key"), in bitonic_block_sort()
175 k.var<key_type>("sibling_key")) << ");\n" << in bitonic_block_sort()
223 k.decl<key_type>("sibling_key") << " = lkeys[sibling_idx];\n" << in bitonic_block_sort()
[all …]
|
| /third_party/boost/boost/property_map/ |
| D | property_map.hpp | 34 BOOST_MPL_HAS_XXX_TRAIT_DEF(key_type)
51 typedef typename PA::key_type key_type; typedef
69 typedef typename PA::key_type key_type;
102 typedef std::ptrdiff_t key_type; typedef
110 typedef std::ptrdiff_t key_type; typedef
143 typedef typename property_traits<PMap>::key_type key_type; typedef
158 typedef KeyArchetype key_type; typedef
166 const typename readable_property_map_archetype<K,V>::key_type&) in get() argument
176 typedef typename property_traits<PMap>::key_type key_type; typedef
189 typedef KeyArchetype key_type; typedef
[all …]
|
| /third_party/boost/libs/unordered/test/helpers/ |
| D | helpers.hpp | 14 typedef typename Container::key_type key_type; typedef
16 static key_type const& get_key(key_type const& x) { return x; } in get_key()
19 static key_type const& get_key(std::pair<key_type, T> const& x, char = 0) in get_key()
25 static key_type const& get_key( in get_key()
26 std::pair<key_type const, T> const& x, unsigned char = 0) in get_key()
33 inline typename Container::key_type const& get_key(T const& x) in get_key()
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/util/ |
| D | auto_index.h | 38 using key_type = typename my_tree::key_type; variable
50 Status insert(const value_type &val, key_type *key = nullptr) {
51 key_type my_inx = inx_.fetch_add(1);
58 Status insert(std::unique_ptr<value_type> &&val, key_type *key = nullptr) {
59 key_type my_inx = inx_.fetch_add(1);
73 key_type my_inx = inx_.fetch_add(num_ele); in insert()
82 key_type min_key() const { in min_key()
88 key_type max_key() const { in max_key()
95 static constexpr key_type kMinKey = 0;
96 std::atomic<key_type> inx_;
|
| D | btree.h | 85 using key_type = K; variable
91 using key_allocator = typename value_allocator::template rebind<key_type>::other;
117 Status DoInsert(const key_type &key, const value_type &value);
118 Status DoInsert(const key_type &key, std::unique_ptr<value_type> &&value);
121 std::unique_ptr<value_type> DoUpdate(const key_type &key, const value_type &new_value);
122 …std::unique_ptr<value_type> DoUpdate(const key_type &key, std::unique_ptr<value_type> &&new_value);
259 IndexRc Split(InnerNode *to, key_type *split_key);
261 IndexRc InsertIntoSlot(slot_type slot, const key_type &key, BaseNode *ptr);
268 key_type keys_[traits::kInnerSlots] = {0};
290 …IndexRc InsertIntoSlot(LockPathCB *insCB, slot_type slot, const key_type &key, std::unique_ptr<val…
[all …]
|
| /third_party/boost/boost/ptr_container/ |
| D | ptr_map_adapter.hpp | 82 typedef BOOST_DEDUCED_TYPENAME VoidPtrMap::key_type
83 key_type; typedef
87 typedef ptr_map_iterator< BOOST_DEDUCED_TYPENAME VoidPtrMap::iterator, key_type, U* const >
90 …typedef ptr_map_iterator< BOOST_DEDUCED_TYPENAME VoidPtrMap::const_iterator, key_type, const U* co…
98 key_type, U* const >
106 key_type, const U* const >
154 typedef BOOST_DEDUCED_TYPENAME base_type::key_type
155 key_type; typedef in boost::ptr_container_detail::ptr_map_adapter_base
176 const_mapped_reference lookup( const key_type& key ) const in lookup()
189 const key_type& key_;
[all …]
|
| D | ptr_set_adapter.hpp | 51 key_type; typedef
140 typedef Key key_type; typedef in boost::ptr_container_detail::ptr_set_adapter_base
229 size_type erase( const key_type& x ) // nothrow in erase()
231 key_type* key = const_cast<key_type*>(&x); in erase()
235 key = static_cast<key_type*>(*i.base()); // nothrow in erase()
242 iterator find( const key_type& x ) in find()
245 find( const_cast<key_type*>(&x) ) ); in find()
248 const_iterator find( const key_type& x ) const in find()
251 find( const_cast<key_type*>(&x) ) ); in find()
254 size_type count( const key_type& x ) const in count()
[all …]
|
| /third_party/boost/libs/unordered/doc/ |
| D | ref.php | 25 $key_type = 'Key';
38 $key_type = 'Value';
48 <default><type>boost::hash<<?php echo $key_type; ?>></type></default>
51 <default><type>std::equal_to<<?php echo $key_type; ?>></type></default>
91 …h function for a <code><?php echo $key_type; ?></code>. It takes a single argument of type <code><…
94 …ct that implements an equivalence relation on values of type <code><?php echo $key_type; ?></code>.
95 …bject that induces an equivalence relation on values of type <code><?php echo $key_type; ?></code>.
96 …It takes two arguments of type <code><?php echo $key_type; ?></code> and returns a value of type b…
108 <type><?php echo $key_type; ?></type>
|
| /third_party/protobuf/php/src/Google/Protobuf/Internal/ |
| D | MapField.php | 53 private $key_type; variable in Google\\Protobuf\\Internal\\MapField
70 * @param long $key_type Type of the stored key element.
76 public function __construct($key_type, $value_type, $klass = null) argument
79 $this->key_type = $key_type;
100 return $this->key_type;
156 $this->checkKey($this->key_type, $key);
214 $this->checkKey($this->key_type, $key);
229 $this->checkKey($this->key_type, $key);
238 return new MapFieldIter($this->container, $this->key_type);
256 private function checkKey($key_type, &$key) argument
[all …]
|
| /third_party/abseil-cpp/absl/container/internal/ |
| D | raw_hash_map.h | 48 using key_type = typename Policy::key_type;
51 using key_arg = typename KeyArgImpl::template type<K, key_type>;
53 static_assert(!std::is_reference<key_type>::value, "");
71 template <class K = key_type, class V = mapped_type, K* = nullptr,
77 template <class K = key_type, class V = mapped_type, K* = nullptr>
82 template <class K = key_type, class V = mapped_type, V* = nullptr>
87 template <class K = key_type, class V = mapped_type>
92 template <class K = key_type, class V = mapped_type, K* = nullptr,
98 template <class K = key_type, class V = mapped_type, K* = nullptr>
103 template <class K = key_type, class V = mapped_type, V* = nullptr>
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
| D | raw_hash_map.h | 48 using key_type = typename Policy::key_type;
51 using key_arg = typename KeyArgImpl::template type<K, key_type>;
53 static_assert(!std::is_reference<key_type>::value, "");
72 template <class K = key_type, class V = mapped_type, K* = nullptr,
78 template <class K = key_type, class V = mapped_type, K* = nullptr>
83 template <class K = key_type, class V = mapped_type, V* = nullptr>
88 template <class K = key_type, class V = mapped_type>
93 template <class K = key_type, class V = mapped_type, K* = nullptr,
99 template <class K = key_type, class V = mapped_type, K* = nullptr>
104 template <class K = key_type, class V = mapped_type, V* = nullptr>
[all …]
|
| /third_party/boost/boost/intrusive/detail/ |
| D | tree_value_compare.hpp | 58 typedef typename KeyOfValue::type key_type; typedef
83 BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key) const in operator ()()
94 BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key1, const key_type &key2) const in operator ()()
100 BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key1, const value_type &value2) const in operator ()()
103 BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const value_type &value1, const key_type &key2) const in operator ()()
107 BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const key_type &key1, const U &nonkey2 in operator ()()
112 BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const U &nonkey1, const key_type &key2 in operator ()()
135 typedef typename KeyOfValue::type key_type; typedef
161 BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key) const in operator ()()
169 BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key1, const key_type &key2) const in operator ()()
[all …]
|
| /third_party/boost/boost/interprocess/indexes/ |
| D | unordered_map_index.hpp | 47 typedef typename MapConfig::key_type key_type; typedef
49 typedef std::equal_to<key_type> key_equal;
50 typedef std::pair<const key_type, mapped_type> value_type;
57 typedef key_type argument_type;
60 std::size_t operator()(const key_type &val) const in operator ()()
62 typedef typename key_type::char_type char_type; in operator ()()
68 typedef unordered_map<key_type, mapped_type, hasher,
|
| /third_party/boost/libs/compute/include/boost/compute/container/ |
| D | flat_set.hpp | 29 typedef T key_type; typedef in boost::compute::flat_set
220 size_type erase(const key_type &value, command_queue &queue) in erase()
233 size_type erase(const key_type &value) in erase()
241 iterator find(const key_type &value, command_queue &queue) in find()
246 iterator find(const key_type &value) in find()
254 const_iterator find(const key_type &value, command_queue &queue) const in find()
259 const_iterator find(const key_type &value) const in find()
267 size_type count(const key_type &value, command_queue &queue) const in count()
272 size_type count(const key_type &value) const in count()
280 iterator lower_bound(const key_type &value, command_queue &queue) in lower_bound()
[all …]
|
| D | flat_map.hpp | 38 typedef Key key_type; typedef in boost::compute::flat_map
231 size_type erase(const key_type &value, command_queue &queue) in erase()
244 iterator find(const key_type &value, command_queue &queue) in find()
256 iterator find(const key_type &value) in find()
264 const_iterator find(const key_type &value, command_queue &queue) const in find()
276 const_iterator find(const key_type &value) const in find()
284 size_type count(const key_type &value, command_queue &queue) const in count()
289 size_type count(const key_type &value) const in count()
297 iterator lower_bound(const key_type &value, command_queue &queue) in lower_bound()
309 iterator lower_bound(const key_type &value) in lower_bound()
[all …]
|
| /third_party/boost/boost/compute/container/ |
| D | flat_set.hpp | 29 typedef T key_type; typedef in boost::compute::flat_set
220 size_type erase(const key_type &value, command_queue &queue) in erase()
233 size_type erase(const key_type &value) in erase()
241 iterator find(const key_type &value, command_queue &queue) in find()
246 iterator find(const key_type &value) in find()
254 const_iterator find(const key_type &value, command_queue &queue) const in find()
259 const_iterator find(const key_type &value) const in find()
267 size_type count(const key_type &value, command_queue &queue) const in count()
272 size_type count(const key_type &value) const in count()
280 iterator lower_bound(const key_type &value, command_queue &queue) in lower_bound()
[all …]
|
| D | flat_map.hpp | 38 typedef Key key_type; typedef in boost::compute::flat_map
231 size_type erase(const key_type &value, command_queue &queue) in erase()
244 iterator find(const key_type &value, command_queue &queue) in find()
256 iterator find(const key_type &value) in find()
264 const_iterator find(const key_type &value, command_queue &queue) const in find()
276 const_iterator find(const key_type &value) const in find()
284 size_type count(const key_type &value, command_queue &queue) const in count()
289 size_type count(const key_type &value) const in count()
297 iterator lower_bound(const key_type &value, command_queue &queue) in lower_bound()
309 iterator lower_bound(const key_type &value) in lower_bound()
[all …]
|
| /third_party/mindspore/mindspore/core/utils/ |
| D | counter.h | 31 using key_type = T const *; variable
38 std::size_t operator()(const key_type ptr) const noexcept { return Hash{}(*ptr); } in operator()
42 …bool operator()(const key_type lhs, const key_type rhs) const noexcept { return Equal{}(*lhs, *rhs… in operator()
44 using map_type = std::unordered_map<key_type, iterator, KeyHash, KeyEqual>;
165 using key_type = std::shared_ptr<T>; variable
166 using counter_type = Counter<key_type>;
167 using map_type = OrderedMap<key_type, int>;
173 …std::pair<iterator, bool> emplace(const key_type &key, int value) { return map_.emplace(key, value… in emplace()
175 …std::pair<iterator, bool> emplace(key_type &&key, int value) { return map_.emplace(std::move(key),… in emplace()
177 void add(const key_type &key) { in add()
[all …]
|
| /third_party/boost/boost/property_tree/ |
| D | xml_parser.hpp | 47 typename Ptree::key_type::value_type in read_xml()
79 std::basic_ifstream<typename Ptree::key_type::value_type> in read_xml()
101 typename Ptree::key_type::value_type in write_xml()
105 typename Ptree::key_type in write_xml()
107 typename Ptree::key_type>() ) in write_xml()
128 typename Ptree::key_type in write_xml()
129 > & settings = xml_writer_settings<typename Ptree::key_type>()) in write_xml()
131 std::basic_ofstream<typename Ptree::key_type::value_type> in write_xml()
|
| /third_party/boost/libs/icl/doc/ |
| D | functions_iterator_related.qbk | 20 [[`J T::lower_bound(const key_type&)`] [__Olgn__] [__Olgn__] [__Olgn__] [__Olgn__] ]
21 [[`J T::upper_bound(const key_type&)`] [__Olgn__] [__Olgn__] [__Olgn__] [__Olgn__] ]
22 [[`pair<J,J> T::equal_range(const key_type&)`] [__Olgn__] [__Olgn__] [__Olgn__] [__Olgn__] ]
35 [[`` iterator T::lower_bound(const key_type& k)
36 …_bound(const key_type& key)const``][Returns an iterator that points to the first element `first`, …
38 [[`` iterator T::upper_bound(const key_type&)
39 …per_bound(const key_type&)const``] [Returns an iterator that points to the first element `past`…
41 pair<iterator,iterator> T::equal_range(const key_type& key)
42 pair<const_iterator,const_iterator> T::equal_range(const key_type& key)const
46 that compare neither less than nor greater than `key_type key`.
|
| /third_party/boost/libs/mpl/doc/src/refmanual/ |
| D | key_type.rst | 1 .. Sequences/Intrinsic Metafunctions//key_type
3 key_type title
15 struct key_type
33 #include <boost/mpl/key_type.hpp>
62 typedef key_type<s,x>::type k;
74 If ``key_type< s,deref<pos1>::type >::type`` is identical to
75 ``key_type< s,deref<pos2>::type >::type`` then ``pos1`` is identical to ``pos2``.
90 typedef key_type< map<>,pair<int,unsigned> >::type k1;
91 typedef key_type< set<>,pair<int,unsigned> >::type k2;
|