Home
last modified time | relevance | path

Searched refs:btree_map (Results 1 – 25 of 55) sorted by relevance

123

/external/abseil-cpp/absl/container/
Dbtree_map.h73 class btree_map
78 using Base = typename btree_map::btree_map_container;
119 btree_map() {} in btree_map() function
435 void swap(btree_map<K, V, C, A> &x, btree_map<K, V, C, A> &y) { in swap()
443 void erase_if(btree_map<K, V, C, A> &map, Pred pred) { in erase_if()
Dbtree_test.cc801 sizeof(absl::btree_map<K, K>), in MapTest()
802 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
803 using BtreeMap = absl::btree_map<K, K>; in MapTest()
805 absl::btree_map<K, K, std::less<K>, in MapTest()
941 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
949 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1134 absl::btree_map<std::string, int64_t> my_map; in TEST()
1138 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1172 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1180 absl::btree_map<std::string, std::unique_ptr<std::string>> m; in TEST()
[all …]
Dbtree_benchmark.cc470 btree_map<value, intptr_t, std::less<value>, \
606 btree_map<BigType<SIZE, COPIES>, intptr_t>; \
668 double ContainerInfo(const btree_map<int, BigTypePtr<Size>>& b) { in ContainerInfo()
692 btree_map<int, BigTypePtr<SIZE>>; \
/external/openscreen/third_party/abseil/src/absl/container/
Dbtree_map.h73 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()
Dbtree_test.cc804 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 …]
Dbtree_benchmark.cc495 btree_map<value, intptr_t, std::less<value>, \
634 btree_map<BigType<SIZE, COPIES>, intptr_t>; \
696 double ContainerInfo(const btree_map<int, BigTypePtr<Size>>& b) { in ContainerInfo()
720 btree_map<int, BigTypePtr<SIZE>>; \
/external/angle/third_party/abseil-cpp/absl/container/
Dbtree_map.h73 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()
Dbtree_test.cc804 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 …]
Dbtree_benchmark.cc462 btree_map<value, intptr_t, std::less<value>, \
600 btree_map<BigType<SIZE, COPIES>, intptr_t>; \
662 double ContainerInfo(const btree_map<int, BigTypePtr<Size>>& b) { in ContainerInfo()
686 btree_map<int, BigTypePtr<SIZE>>; \
/external/libtextclassifier/abseil-cpp/absl/container/
Dbtree_map.h73 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()
Dbtree_test.cc803 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 …]
Dbtree_benchmark.cc495 btree_map<value, intptr_t, std::less<value>, \
634 btree_map<BigType<SIZE, COPIES>, intptr_t>; \
696 double ContainerInfo(const btree_map<int, BigTypePtr<Size>>& b) { in ContainerInfo()
720 btree_map<int, BigTypePtr<SIZE>>; \
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/
Dbtree_map.h73 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()
Dbtree_test.cc803 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 …]
Dbtree_benchmark.cc495 btree_map<value, intptr_t, std::less<value>, \
634 btree_map<BigType<SIZE, COPIES>, intptr_t>; \
696 double ContainerInfo(const btree_map<int, BigTypePtr<Size>>& b) { in ContainerInfo()
720 btree_map<int, BigTypePtr<SIZE>>; \
/external/webrtc/third_party/abseil-cpp/absl/container/
Dbtree_map.h73 class btree_map
78 using Base = typename btree_map::btree_map_container;
119 btree_map() {} in btree_map() function
435 void swap(btree_map<K, V, C, A> &x, btree_map<K, V, C, A> &y) { in swap()
443 void erase_if(btree_map<K, V, C, A> &map, Pred pred) { in erase_if()
Dbtree_test.cc801 sizeof(absl::btree_map<K, K>), in MapTest()
802 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
803 using BtreeMap = absl::btree_map<K, K>; in MapTest()
805 absl::btree_map<K, K, std::less<K>, in MapTest()
941 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
949 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1134 absl::btree_map<std::string, int64_t> my_map; in TEST()
1138 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1172 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1180 absl::btree_map<std::string, std::unique_ptr<std::string>> m; in TEST()
[all …]
Dbtree_benchmark.cc470 btree_map<value, intptr_t, std::less<value>, \
606 btree_map<BigType<SIZE, COPIES>, intptr_t>; \
668 double ContainerInfo(const btree_map<int, BigTypePtr<Size>>& b) { in ContainerInfo()
692 btree_map<int, BigTypePtr<SIZE>>; \
/external/rust/crates/clap/src/
Dmap.rs9 use std::collections::btree_map;
60 pub type Values<'a, V> = btree_map::Values<'a, usize, V>;
62 pub type Entry<'a, V> = btree_map::Entry<'a, usize, V>;
66 inner: btree_map::Iter<'a, usize, V>,
/external/rust/crates/serde_json/src/
Dmap.rs191 use crate::lib::btree_map::Entry as EntryImpl; in entry()
477 type VacantEntryImpl<'a> = btree_map::VacantEntry<'a, String, Value>;
482 type OccupiedEntryImpl<'a> = btree_map::OccupiedEntry<'a, String, Value>;
769 type IterImpl<'a> = btree_map::Iter<'a, String, Value>;
794 type IterMutImpl<'a> = btree_map::IterMut<'a, String, Value>;
819 type IntoIterImpl = btree_map::IntoIter<String, Value>;
833 type KeysImpl<'a> = btree_map::Keys<'a, String, Value>;
847 type ValuesImpl<'a> = btree_map::Values<'a, String, Value>;
861 type ValuesMutImpl<'a> = btree_map::ValuesMut<'a, String, Value>;
Dlib.rs410 pub use alloc::collections::{btree_map, BTreeMap};
412 pub use std::collections::{btree_map, BTreeMap};
/external/rust/crates/rayon/src/collections/
Dmod.rs25 pub mod btree_map; module
/external/rust/crates/quiche/src/
Dranges.rs29 use std::collections::btree_map;
199 inner: btree_map::Iter<'a, u64, u64>,
225 inner: btree_map::Iter<'a, u64, u64>,
/external/vm_tools/p9/src/server/
Dmod.rs6 use std::collections::{btree_map, BTreeMap};
461 btree_map::Entry::Vacant(entry) => { in attach()
487 btree_map::Entry::Occupied(_) => Err(io::Error::from_raw_os_error(libc::EBADF)), in attach()
606 btree_map::Entry::Vacant(_) => Err(io::Error::from_raw_os_error(libc::EBADF)), in clunk()
607 btree_map::Entry::Occupied(entry) => { in clunk()
/external/crosvm/devices/src/virtio/video/decoder/
Dcapability.rs8 use std::collections::btree_map::Entry;

123