Home
last modified time | relevance | path

Searched refs:key_arg (Results 1 – 23 of 23) sorted by relevance

/external/webrtc/third_party/abseil-cpp/absl/container/internal/
Draw_hash_map.h51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
83 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, V&& v) { in insert_or_assign()
88 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
109 iterator insert_or_assign(const_iterator, const key_arg<K>& k, const V& v) { in insert_or_assign()
120 std::pair<iterator, bool> try_emplace(key_arg<K>&& k, Args&&... args) { in try_emplace()
[all …]
Dbtree_container.h44 using key_arg =
93 iterator find(const key_arg<K> &key) { in find()
97 const_iterator find(const key_arg<K> &key) const { in find()
101 bool contains(const key_arg<K> &key) const { in contains()
105 iterator lower_bound(const key_arg<K> &key) { in lower_bound()
109 const_iterator lower_bound(const key_arg<K> &key) const { in lower_bound()
113 iterator upper_bound(const key_arg<K> &key) { in upper_bound()
117 const_iterator upper_bound(const key_arg<K> &key) const { in upper_bound()
121 std::pair<iterator, iterator> equal_range(const key_arg<K> &key) { in equal_range()
126 const key_arg<K> &key) const { in equal_range()
[all …]
Draw_hash_set.h547 using key_arg = typename KeyArgImpl::template type<K, key_type>;
1129 iterator lazy_emplace(const key_arg<K>& key, F&& f) {
1149 size_type erase(const key_arg<K>& key) {
1218 node_type extract(const key_arg<K>& key) {
1272 size_t count(const key_arg<K>& key) const {
1282 void prefetch(const key_arg<K>& key) const {
1299 iterator find(const key_arg<K>& key, size_t hash) {
1314 iterator find(const key_arg<K>& key) {
1319 const_iterator find(const key_arg<K>& key, size_t hash) const {
1323 const_iterator find(const key_arg<K>& key) const {
[all …]
/external/openscreen/third_party/abseil/src/absl/container/internal/
Draw_hash_map.h51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
83 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, V&& v) { in insert_or_assign()
88 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
109 iterator insert_or_assign(const_iterator, const key_arg<K>& k, const V& v) { in insert_or_assign()
120 std::pair<iterator, bool> try_emplace(key_arg<K>&& k, Args&&... args) { in try_emplace()
[all …]
Dbtree_container.h45 using key_arg =
107 size_type count(const key_arg<K> &key) const { in count()
112 iterator find(const key_arg<K> &key) { in find()
116 const_iterator find(const key_arg<K> &key) const { in find()
120 bool contains(const key_arg<K> &key) const { in contains()
124 iterator lower_bound(const key_arg<K> &key) { in lower_bound()
128 const_iterator lower_bound(const key_arg<K> &key) const { in lower_bound()
132 iterator upper_bound(const key_arg<K> &key) { in upper_bound()
136 const_iterator upper_bound(const key_arg<K> &key) const { in upper_bound()
140 std::pair<iterator, iterator> equal_range(const key_arg<K> &key) { in equal_range()
[all …]
Draw_hash_set.h623 using key_arg = typename KeyArgImpl::template type<K, key_type>;
1201 iterator lazy_emplace(const key_arg<K>& key, F&& f) {
1221 size_type erase(const key_arg<K>& key) {
1290 node_type extract(const key_arg<K>& key) {
1345 size_t count(const key_arg<K>& key) const {
1355 void prefetch(const key_arg<K>& key) const {
1372 iterator find(const key_arg<K>& key, size_t hash) {
1388 iterator find(const key_arg<K>& key) {
1393 const_iterator find(const key_arg<K>& key, size_t hash) const {
1397 const_iterator find(const key_arg<K>& key) const {
[all …]
/external/abseil-cpp/absl/container/internal/
Draw_hash_map.h51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
83 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, V&& v) { in insert_or_assign()
88 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
109 iterator insert_or_assign(const_iterator, const key_arg<K>& k, const V& v) { in insert_or_assign()
120 std::pair<iterator, bool> try_emplace(key_arg<K>&& k, Args&&... args) { in try_emplace()
[all …]
Dbtree_container.h44 using key_arg =
93 iterator find(const key_arg<K> &key) { in find()
97 const_iterator find(const key_arg<K> &key) const { in find()
101 bool contains(const key_arg<K> &key) const { in contains()
105 iterator lower_bound(const key_arg<K> &key) { in lower_bound()
109 const_iterator lower_bound(const key_arg<K> &key) const { in lower_bound()
113 iterator upper_bound(const key_arg<K> &key) { in upper_bound()
117 const_iterator upper_bound(const key_arg<K> &key) const { in upper_bound()
121 std::pair<iterator, iterator> equal_range(const key_arg<K> &key) { in equal_range()
126 const key_arg<K> &key) const { in equal_range()
[all …]
Draw_hash_set.h547 using key_arg = typename KeyArgImpl::template type<K, key_type>;
1129 iterator lazy_emplace(const key_arg<K>& key, F&& f) {
1149 size_type erase(const key_arg<K>& key) {
1218 node_type extract(const key_arg<K>& key) {
1272 size_t count(const key_arg<K>& key) const {
1282 void prefetch(const key_arg<K>& key) const {
1299 iterator find(const key_arg<K>& key, size_t hash) {
1314 iterator find(const key_arg<K>& key) {
1319 const_iterator find(const key_arg<K>& key, size_t hash) const {
1323 const_iterator find(const key_arg<K>& key) const {
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/
Draw_hash_map.h51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
83 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, V&& v) { in insert_or_assign()
88 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
109 iterator insert_or_assign(const_iterator, const key_arg<K>& k, const V& v) { in insert_or_assign()
120 std::pair<iterator, bool> try_emplace(key_arg<K>&& k, Args&&... args) { in try_emplace()
[all …]
Dbtree_container.h44 using key_arg =
93 iterator find(const key_arg<K> &key) { in find()
97 const_iterator find(const key_arg<K> &key) const { in find()
101 bool contains(const key_arg<K> &key) const { in contains()
105 iterator lower_bound(const key_arg<K> &key) { in lower_bound()
109 const_iterator lower_bound(const key_arg<K> &key) const { in lower_bound()
113 iterator upper_bound(const key_arg<K> &key) { in upper_bound()
117 const_iterator upper_bound(const key_arg<K> &key) const { in upper_bound()
121 std::pair<iterator, iterator> equal_range(const key_arg<K> &key) { in equal_range()
126 const key_arg<K> &key) const { in equal_range()
[all …]
Draw_hash_set.h575 using key_arg = typename KeyArgImpl::template type<K, key_type>;
1152 iterator lazy_emplace(const key_arg<K>& key, F&& f) {
1172 size_type erase(const key_arg<K>& key) {
1241 node_type extract(const key_arg<K>& key) {
1291 size_t count(const key_arg<K>& key) const {
1301 void prefetch(const key_arg<K>& key) const {
1318 iterator find(const key_arg<K>& key, size_t hash) {
1334 iterator find(const key_arg<K>& key) {
1339 const_iterator find(const key_arg<K>& key, size_t hash) const {
1343 const_iterator find(const key_arg<K>& key) const {
[all …]
/external/libtextclassifier/abseil-cpp/absl/container/internal/
Draw_hash_map.h51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
83 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, V&& v) { in insert_or_assign()
88 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
109 iterator insert_or_assign(const_iterator, const key_arg<K>& k, const V& v) { in insert_or_assign()
120 std::pair<iterator, bool> try_emplace(key_arg<K>&& k, Args&&... args) { in try_emplace()
[all …]
Dbtree_container.h44 using key_arg =
93 iterator find(const key_arg<K> &key) { in find()
97 const_iterator find(const key_arg<K> &key) const { in find()
101 bool contains(const key_arg<K> &key) const { in contains()
105 iterator lower_bound(const key_arg<K> &key) { in lower_bound()
109 const_iterator lower_bound(const key_arg<K> &key) const { in lower_bound()
113 iterator upper_bound(const key_arg<K> &key) { in upper_bound()
117 const_iterator upper_bound(const key_arg<K> &key) const { in upper_bound()
121 std::pair<iterator, iterator> equal_range(const key_arg<K> &key) { in equal_range()
126 const key_arg<K> &key) const { in equal_range()
[all …]
Draw_hash_set.h575 using key_arg = typename KeyArgImpl::template type<K, key_type>;
1152 iterator lazy_emplace(const key_arg<K>& key, F&& f) {
1172 size_type erase(const key_arg<K>& key) {
1241 node_type extract(const key_arg<K>& key) {
1291 size_t count(const key_arg<K>& key) const {
1301 void prefetch(const key_arg<K>& key) const {
1318 iterator find(const key_arg<K>& key, size_t hash) {
1334 iterator find(const key_arg<K>& key) {
1339 const_iterator find(const key_arg<K>& key, size_t hash) const {
1343 const_iterator find(const key_arg<K>& key) const {
[all …]
/external/angle/third_party/abseil-cpp/absl/container/internal/
Draw_hash_map.h51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
74 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
79 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
84 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, V&& v) { in insert_or_assign()
89 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, const V& v) { in insert_or_assign()
95 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
100 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
105 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
110 iterator insert_or_assign(const_iterator, const key_arg<K>& k, const V& v) { in insert_or_assign()
121 std::pair<iterator, bool> try_emplace(key_arg<K>&& k, Args&&... args) { in try_emplace()
[all …]
Dbtree_container.h46 using key_arg =
108 size_type count(const key_arg<K> &key) const { in count()
113 iterator find(const key_arg<K> &key) { in find()
117 const_iterator find(const key_arg<K> &key) const { in find()
121 bool contains(const key_arg<K> &key) const { in contains()
125 iterator lower_bound(const key_arg<K> &key) { in lower_bound()
129 const_iterator lower_bound(const key_arg<K> &key) const { in lower_bound()
133 iterator upper_bound(const key_arg<K> &key) { in upper_bound()
137 const_iterator upper_bound(const key_arg<K> &key) const { in upper_bound()
141 std::pair<iterator, iterator> equal_range(const key_arg<K> &key) { in equal_range()
[all …]
Draw_hash_set.h640 using key_arg = typename KeyArgImpl::template type<K, key_type>;
1221 iterator lazy_emplace(const key_arg<K>& key, F&& f) {
1241 size_type erase(const key_arg<K>& key) {
1310 node_type extract(const key_arg<K>& key) {
1365 size_t count(const key_arg<K>& key) const {
1375 void prefetch(const key_arg<K>& key) const {
1392 iterator find(const key_arg<K>& key, size_t hash) {
1408 iterator find(const key_arg<K>& key) {
1413 const_iterator find(const key_arg<K>& key, size_t hash) const {
1417 const_iterator find(const key_arg<K>& key) const {
[all …]
/external/tensorflow/tensorflow/compiler/xla/tests/
Dtest_utils_test.cc141 const Literal& key_arg = args[0]; in XLA_TEST_F() local
144 for (const float& value : key_arg.data<float>()) { in XLA_TEST_F()
172 const Literal& key_arg = args[0]; in XLA_TEST_F() local
175 for (const int32& value : key_arg.data<int32>()) { in XLA_TEST_F()
203 const Literal& key_arg = args[0]; in XLA_TEST_F() local
206 for (const bfloat16& value : key_arg.data<bfloat16>()) { in XLA_TEST_F()
/external/llvm-project/lldb/source/Commands/
DCommandObjectSettings.cpp571 CommandArgumentData key_arg; in CommandObjectSettingsRemove() local
586 key_arg.arg_type = eArgTypeSettingKey; in CommandObjectSettingsRemove()
587 key_arg.arg_repetition = eArgRepeatPlain; in CommandObjectSettingsRemove()
591 arg2.push_back(key_arg); in CommandObjectSettingsRemove()
669 CommandArgumentData key_arg; in CommandObjectSettingsReplace() local
685 key_arg.arg_type = eArgTypeSettingKey; in CommandObjectSettingsReplace()
686 key_arg.arg_repetition = eArgRepeatPlain; in CommandObjectSettingsReplace()
690 arg2.push_back(key_arg); in CommandObjectSettingsReplace()
/external/tensorflow/tensorflow/core/kernels/data/experimental/
Dgroup_by_window_dataset_op.cc480 Tensor key_arg(DT_INT64, TensorShape({})); in StartFlushingGroup() local
481 key_arg.scalar<int64>()() = key; in StartFlushingGroup()
488 {std::move(key_arg), std::move(group_dataset_arg)}); in StartFlushingGroup()
/external/tensorflow/tensorflow/compiler/jit/
Dextract_outside_compilation_pass.cc1569 Node* key_arg = nullptr; in RewriteHostWhileLoopCond() local
1572 key_arg = n; in RewriteHostWhileLoopCond()
1575 if (!key_arg) { in RewriteHostWhileLoopCond()
1593 recv_pred_builder.Input(key_arg->name(), 0, DT_STRING); in RewriteHostWhileLoopCond()
1599 cond_graph->AddEdge(key_arg, 0, recv_pred_node, 0); in RewriteHostWhileLoopCond()
1646 Node* key_arg = nullptr; in RewriteHostWhileLoopBody() local
1649 key_arg = n; in RewriteHostWhileLoopBody()
1652 if (!key_arg) { in RewriteHostWhileLoopBody()
1663 ret_builder.Input(key_arg->name(), 0, DT_STRING); in RewriteHostWhileLoopBody()
1669 body_graph->AddEdge(key_arg, 0, ret_node, 0); in RewriteHostWhileLoopBody()
/external/rust/crates/grpcio-sys/grpc/tools/run_tests/xds_k8s_test_driver/framework/infrastructure/gcp/
Dapi.py147 key_arg = f'&key={api_key}' if api_key else ''