Home
last modified time | relevance | path

Searched refs:random_key (Results 1 – 7 of 7) sorted by relevance

/third_party/boost/libs/serialization/test/
Dtest_map_boost_unordered.cpp39 struct random_key { struct
49 random_key() : m_i(std::rand()){}; in random_key() function
50 bool operator<(const random_key &rhs) const { in operator <() argument
53 bool operator==(const random_key &rhs) const { in operator ==() argument
66 struct hash<random_key>{ argument
67 std::size_t operator()(const random_key& r) const { in operator ()()
80 boost::unordered_map<random_key, A> anunordered_map; in test_unordered_map()
81 anunordered_map.insert(std::make_pair(random_key(), A())); in test_unordered_map()
82 anunordered_map.insert(std::make_pair(random_key(), A())); in test_unordered_map()
88 boost::unordered_map<random_key, A> anunordered_map1; in test_unordered_map()
[all …]
Dtest_map_hashed.cpp39 struct random_key { struct
49 random_key() : m_i(std::rand()){}; in random_key() argument
50 bool operator<(const random_key &rhs) const { in operator <() argument
53 bool operator==(const random_key &rhs) const { in operator ==() argument
65 struct hash<random_key>{ argument
66 std::size_t operator()(const random_key& r) const { in operator ()()
79 BOOST_STD_EXTENSION_NAMESPACE::hash_map<random_key, A> ahash_map; in test_hash_map()
80 ahash_map.insert(std::make_pair(random_key(), A())); in test_hash_map()
81 ahash_map.insert(std::make_pair(random_key(), A())); in test_hash_map()
87 BOOST_STD_EXTENSION_NAMESPACE::hash_map<random_key, A> ahash_map1; in test_hash_map()
[all …]
Dtest_map_unordered.cpp39 struct random_key { struct
49 random_key() : m_i(std::rand()){}; in random_key() argument
50 bool operator<(const random_key &rhs) const { in operator <() argument
53 bool operator==(const random_key &rhs) const { in operator ==() argument
66 struct hash<random_key>{ argument
67 std::size_t operator()(const random_key& r) const { in operator ()()
80 std::unordered_map<random_key, A> anunordered_map; in test_unordered_map()
81 anunordered_map.insert(std::make_pair(random_key(), A())); in test_unordered_map()
82 anunordered_map.insert(std::make_pair(random_key(), A())); in test_unordered_map()
88 std::unordered_map<random_key, A> anunordered_map1; in test_unordered_map()
[all …]
Dtest_map.cpp39 struct random_key { struct
49 random_key() : m_i(std::rand()){}; in random_key() argument
50 bool operator<(const random_key &rhs) const { in operator <() argument
53 bool operator==(const random_key &rhs) const { in operator ==() argument
68 std::map<random_key, A> amap; in test_map() argument
69 amap.insert(std::make_pair(random_key(), A())); in test_map()
70 amap.insert(std::make_pair(random_key(), A())); in test_map()
76 std::map<random_key, A> amap1; in test_map()
124 std::multimap<random_key, A> amultimap; in test_multimap()
125 amultimap.insert(std::make_pair(random_key(), A())); in test_multimap()
[all …]
/third_party/gstreamer/gstplugins_bad/ext/srtp/
Dgstsrtpenc.h72 gboolean random_key; member
Dgstsrtpenc.c743 filter->random_key = g_value_get_boolean (value); in gst_srtp_enc_set_property()
794 g_value_set_boolean (value, filter->random_key); in gst_srtp_enc_get_property()
1249 if (filter->random_key && !filter->key_changed) in gst_srtp_enc_chain()
1343 if (filter->random_key && !filter->key_changed) in gst_srtp_enc_chain_list()
1400 if (filter->random_key) { in gst_srtp_enc_change_state()
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/cache_embedding/
Dcache_embedding.cc225 auto random_key = host_range[i]; in InitHashMapData() local
226 auto entry = HashFunc(random_key, hashmap_size); in InitHashMapData()
228 while (!hashmap_data[entry].IsEmpty() && !hashmap_data[entry].IsKey(random_key)) { in InitHashMapData()
234 hashmap_data[entry].key_ = random_key; in InitHashMapData()