| /external/tensorflow/third_party/absl/abseil-cpp/absl/container/ |
| D | btree_map.h | 84 class btree_map
89 using Base = typename btree_map::btree_map_container;
130 btree_map() {} in btree_map() function
474 void swap(btree_map<K, V, C, A> &x, btree_map<K, V, C, A> &y) { in swap()
483 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if()
484 btree_map<K, V, C, A> &map, Pred pred) { in erase_if()
|
| D | btree_test.cc | 808 sizeof(absl::btree_map<K, K>), in MapTest()
809 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
810 using BtreeMap = absl::btree_map<K, K>; in MapTest()
812 absl::btree_map<K, K, std::less<K>, in MapTest()
952 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
960 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1145 absl::btree_map<std::string, int64_t> my_map; in TEST()
1149 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1183 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1254 return BtreeNodePeer::UsesLinearNodeSearch<absl::btree_map<K, int, C>>(); in IsLinear()
[all …]
|
| D | btree_benchmark.cc | 496 btree_map<value, intptr_t, std::less<value>, \
638 btree_map<BigType<SIZE, COPIES>, intptr_t>; \
700 double ContainerInfo(const btree_map<int, BigTypePtr<Size>>& b) { in ContainerInfo()
724 btree_map<int, BigTypePtr<SIZE>>; \
|
| /external/webrtc/third_party/abseil-cpp/absl/container/ |
| D | btree_map.h | 87 class btree_map
92 using Base = typename btree_map::btree_map_container;
133 btree_map() {} in btree_map() function
478 void swap(btree_map<K, V, C, A> &x, btree_map<K, V, C, A> &y) { in swap()
487 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if()
488 btree_map<K, V, C, A> &map, Pred pred) { in erase_if()
|
| D | btree_test.cc | 811 sizeof(absl::btree_map<K, K>), in MapTest()
812 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
813 using BtreeMap = absl::btree_map<K, K>; in MapTest()
815 absl::btree_map<K, K, std::less<K>, in MapTest()
955 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
963 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1148 absl::btree_map<std::string, int64_t> my_map; in TEST()
1152 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1186 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1257 return BtreeNodePeer::UsesLinearNodeSearch<absl::btree_map<K, int, C>>(); in IsLinear()
[all …]
|
| /external/abseil-cpp/absl/container/ |
| D | btree_map.h | 84 class btree_map
89 using Base = typename btree_map::btree_map_container;
130 btree_map() {} in btree_map() function
474 void swap(btree_map<K, V, C, A> &x, btree_map<K, V, C, A> &y) { in swap()
483 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if()
484 btree_map<K, V, C, A> &map, Pred pred) { in erase_if()
|
| D | btree_test.cc | 808 sizeof(absl::btree_map<K, K>), in MapTest()
809 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
810 using BtreeMap = absl::btree_map<K, K>; in MapTest()
812 absl::btree_map<K, K, std::less<K>, in MapTest()
952 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
960 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1145 absl::btree_map<std::string, int64_t> my_map; in TEST()
1149 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1183 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1254 return BtreeNodePeer::UsesLinearNodeSearch<absl::btree_map<K, int, C>>(); in IsLinear()
[all …]
|
| /external/openscreen/third_party/abseil/src/absl/container/ |
| D | btree_map.h | 73 class btree_map
78 using Base = typename btree_map::btree_map_container;
119 btree_map() {} in btree_map() function
440 void swap(btree_map<K, V, C, A> &x, btree_map<K, V, C, A> &y) { in swap()
448 void erase_if(btree_map<K, V, C, A> &map, Pred pred) { in erase_if()
|
| D | btree_test.cc | 804 sizeof(absl::btree_map<K, K>), in MapTest()
805 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
806 using BtreeMap = absl::btree_map<K, K>; in MapTest()
808 absl::btree_map<K, K, std::less<K>, in MapTest()
948 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
956 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1141 absl::btree_map<std::string, int64_t> my_map; in TEST()
1145 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1179 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1245 return BtreeNodePeer::UsesLinearNodeSearch<absl::btree_map<K, int, C>>(); in IsLinear()
[all …]
|
| /external/libtextclassifier/abseil-cpp/absl/container/ |
| D | btree_map.h | 73 class btree_map
78 using Base = typename btree_map::btree_map_container;
119 btree_map() {} in btree_map() function
440 void swap(btree_map<K, V, C, A> &x, btree_map<K, V, C, A> &y) { in swap()
448 void erase_if(btree_map<K, V, C, A> &map, Pred pred) { in erase_if()
|
| D | btree_test.cc | 803 sizeof(absl::btree_map<K, K>), in MapTest()
804 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
805 using BtreeMap = absl::btree_map<K, K>; in MapTest()
807 absl::btree_map<K, K, std::less<K>, in MapTest()
947 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
955 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1140 absl::btree_map<std::string, int64_t> my_map; in TEST()
1144 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1178 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1186 absl::btree_map<std::string, std::unique_ptr<std::string>> m; in TEST()
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/ |
| D | btree_map.h | 73 class btree_map
78 using Base = typename btree_map::btree_map_container;
119 btree_map() {} in btree_map() function
439 void swap(btree_map<K, V, C, A> &x, btree_map<K, V, C, A> &y) { in swap()
447 void erase_if(btree_map<K, V, C, A> &map, Pred pred) { in erase_if()
|
| D | btree_test.cc | 804 sizeof(absl::btree_map<K, K>), in MapTest()
805 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
806 using BtreeMap = absl::btree_map<K, K>; in MapTest()
808 absl::btree_map<K, K, std::less<K>, in MapTest()
948 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
956 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1141 absl::btree_map<std::string, int64_t> my_map; in TEST()
1145 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1179 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1245 return BtreeNodePeer::UsesLinearNodeSearch<absl::btree_map<K, int, C>>(); in IsLinear()
[all …]
|
| /external/angle/third_party/abseil-cpp/absl/container/ |
| D | btree_map.h | 87 class btree_map
92 using Base = typename btree_map::btree_map_container;
133 btree_map() {} in btree_map() function
493 void swap(btree_map<K, V, C, A> &x, btree_map<K, V, C, A> &y) { in swap()
502 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if()
503 btree_map<K, V, C, A> &map, Pred pred) { in erase_if()
|
| D | btree_test.cc | 823 sizeof(absl::btree_map<K, K>), in MapTest()
824 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
825 using BtreeMap = absl::btree_map<K, K>; in MapTest()
827 absl::btree_map<K, K, std::less<K>, in MapTest()
967 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
975 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1160 absl::btree_map<std::string, int64_t> my_map; in TEST()
1164 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1198 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1271 return BtreeNodePeer::UsesLinearNodeSearch<absl::btree_map<K, int, C>>(); in IsLinear()
[all …]
|
| /external/cronet/third_party/abseil-cpp/absl/container/ |
| D | btree_map.h | 87 class btree_map
92 using Base = typename btree_map::btree_map_container;
133 btree_map() {} in btree_map() function
493 void swap(btree_map<K, V, C, A> &x, btree_map<K, V, C, A> &y) { in swap()
502 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if()
503 btree_map<K, V, C, A> &map, Pred pred) { in erase_if()
|
| D | btree_test.cc | 822 sizeof(absl::btree_map<K, K>), in MapTest()
823 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
824 using BtreeMap = absl::btree_map<K, K>; in MapTest()
826 absl::btree_map<K, K, std::less<K>, in MapTest()
966 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
974 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1159 absl::btree_map<std::string, int64_t> my_map; in TEST()
1163 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1197 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1268 return BtreeNodePeer::UsesLinearNodeSearch<absl::btree_map<K, int, C>>(); in IsLinear()
[all …]
|
| /external/rust/crates/serde_json/src/ |
| D | map.rs | 21 use alloc::collections::{btree_map, BTreeMap};
213 use alloc::collections::btree_map::Entry as EntryImpl; in entry()
518 type VacantEntryImpl<'a> = btree_map::VacantEntry<'a, String, Value>;
523 type OccupiedEntryImpl<'a> = btree_map::OccupiedEntry<'a, String, Value>;
844 type IterImpl<'a> = btree_map::Iter<'a, String, Value>;
869 type IterMutImpl<'a> = btree_map::IterMut<'a, String, Value>;
894 type IntoIterImpl = btree_map::IntoIter<String, Value>;
908 type KeysImpl<'a> = btree_map::Keys<'a, String, Value>;
922 type ValuesImpl<'a> = btree_map::Values<'a, String, Value>;
936 type ValuesMutImpl<'a> = btree_map::ValuesMut<'a, String, Value>;
|
| /external/tensorflow/tensorflow/cc/saved_model/ |
| D | fingerprinting.cc | 159 absl::btree_map<std::string, SignatureDef> sorted_signature_defs; in RegularizeAndHashSignatureDefs()
180 absl::btree_map<int, std::string> uid_to_function_names; in RegularizeAndHashSavedObjectGraph()
|
| /external/rust/crates/xml-rs/src/ |
| D | namespace.rs | 4 use std::collections::btree_map::{BTreeMap, Entry};
5 use std::collections::btree_map::Iter as Entries;
|
| /external/rust/crates/rayon/src/collections/ |
| D | mod.rs | 25 pub mod btree_map; module
|
| /external/cronet/net/third_party/quiche/src/quiche/common/ |
| D | btree_scheduler.h | 120 typename absl::btree_map<ScheduleKey, FullStreamEntry*>::const_iterator;
134 absl::btree_map<ScheduleKey, FullStreamEntry*> schedule_;
|
| /external/rust/crates/rayon/src/ |
| D | delegate.rs | 65 use crate::collections::btree_map::IntoIter; in unindexed_example()
|
| /external/rust/crates/quiche/src/ |
| D | ranges.rs | 29 use std::collections::btree_map;
196 inner: btree_map::Iter<'a, u64, u64>,
222 inner: btree_map::Iter<'a, u64, u64>,
|
| /external/rust/crates/thiserror-impl/src/ |
| D | generics.rs | 3 use std::collections::btree_map::Entry;
|