| /external/openscreen/third_party/abseil/src/absl/container/ |
| D | btree_set.h | 73 class btree_set
78 using Base = typename btree_set::btree_set_container;
119 btree_set() {} in btree_set() function
359 void swap(btree_set<K, C, A> &x, btree_set<K, C, A> &y) { in swap()
367 void erase_if(btree_set<K, C, A> &set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 792 sizeof(absl::btree_set<K>), in SetTest()
793 2 * sizeof(void *) + sizeof(typename absl::btree_set<K>::size_type)); in SetTest()
794 using BtreeSet = absl::btree_set<K>; in SetTest()
796 absl::btree_set<K, std::less<K>, PropagatingCountingAlloc<K>>; in SetTest()
947 TestHeterogeneous(btree_set<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
968 using StringSet = absl::btree_set<std::string, NonTransparentCompare>; in TEST()
997 btree_set<int> s = {1}; in TEST()
1005 btree_set<std::string> s = {"A"}; in TEST()
1033 using StringSet = absl::btree_set<StringLike>; in TEST()
1080 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
[all …]
|
| D | btree_benchmark.cc | 493 btree_set<value, std::less<value>, std::allocator<value>>; \
632 btree_set<BigType<SIZE, COPIES>>; \
688 double ContainerInfo(const btree_set<BigTypePtr<Size>>& b) { in ContainerInfo()
718 btree_set<BigTypePtr<SIZE>>; \
|
| D | CMakeLists.txt | 31 "btree_set.h"
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/ |
| D | btree_set.h | 73 class btree_set
78 using Base = typename btree_set::btree_set_container;
119 btree_set() {} in btree_set() function
359 void swap(btree_set<K, C, A> &x, btree_set<K, C, A> &y) { in swap()
367 void erase_if(btree_set<K, C, A> &set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 791 sizeof(absl::btree_set<K>), in SetTest()
792 2 * sizeof(void *) + sizeof(typename absl::btree_set<K>::size_type)); in SetTest()
793 using BtreeSet = absl::btree_set<K>; in SetTest()
795 absl::btree_set<K, std::less<K>, PropagatingCountingAlloc<K>>; in SetTest()
946 TestHeterogeneous(btree_set<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
967 using StringSet = absl::btree_set<std::string, NonTransparentCompare>; in TEST()
996 btree_set<int> s = {1}; in TEST()
1004 btree_set<std::string> s = {"A"}; in TEST()
1032 using StringSet = absl::btree_set<StringLike>; in TEST()
1079 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
[all …]
|
| D | btree_benchmark.cc | 493 btree_set<value, std::less<value>, std::allocator<value>>; \
632 btree_set<BigType<SIZE, COPIES>>; \
688 double ContainerInfo(const btree_set<BigTypePtr<Size>>& b) { in ContainerInfo()
718 btree_set<BigTypePtr<SIZE>>; \
|
| D | CMakeLists.txt | 31 "btree_set.h"
|
| /external/webrtc/third_party/abseil-cpp/absl/container/ |
| D | btree_set.h | 73 class btree_set
78 using Base = typename btree_set::btree_set_container;
119 btree_set() {} in btree_set() function
359 void swap(btree_set<K, C, A> &x, btree_set<K, C, A> &y) { in swap()
367 void erase_if(btree_set<K, C, A> &set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 789 sizeof(absl::btree_set<K>), in SetTest()
790 2 * sizeof(void *) + sizeof(typename absl::btree_set<K>::size_type)); in SetTest()
791 using BtreeSet = absl::btree_set<K>; in SetTest()
793 absl::btree_set<K, std::less<K>, PropagatingCountingAlloc<K>>; in SetTest()
940 TestHeterogeneous(btree_set<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
961 using StringSet = absl::btree_set<std::string, NonTransparentCompare>; in TEST()
990 btree_set<int> s = {1}; in TEST()
998 btree_set<std::string> s = {"A"}; in TEST()
1026 using StringSet = absl::btree_set<StringLike>; in TEST()
1073 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
[all …]
|
| D | btree_benchmark.cc | 468 btree_set<value, std::less<value>, std::allocator<value>>; \
604 btree_set<BigType<SIZE, COPIES>>; \
660 double ContainerInfo(const btree_set<BigTypePtr<Size>>& b) { in ContainerInfo()
690 btree_set<BigTypePtr<SIZE>>; \
|
| D | CMakeLists.txt | 31 "btree_set.h"
|
| D | BUILD.bazel | 816 "btree_set.h",
|
| /external/libtextclassifier/abseil-cpp/absl/container/ |
| D | btree_set.h | 73 class btree_set
78 using Base = typename btree_set::btree_set_container;
119 btree_set() {} in btree_set() function
359 void swap(btree_set<K, C, A> &x, btree_set<K, C, A> &y) { in swap()
367 void erase_if(btree_set<K, C, A> &set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 791 sizeof(absl::btree_set<K>), in SetTest()
792 2 * sizeof(void *) + sizeof(typename absl::btree_set<K>::size_type)); in SetTest()
793 using BtreeSet = absl::btree_set<K>; in SetTest()
795 absl::btree_set<K, std::less<K>, PropagatingCountingAlloc<K>>; in SetTest()
946 TestHeterogeneous(btree_set<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
967 using StringSet = absl::btree_set<std::string, NonTransparentCompare>; in TEST()
996 btree_set<int> s = {1}; in TEST()
1004 btree_set<std::string> s = {"A"}; in TEST()
1032 using StringSet = absl::btree_set<StringLike>; in TEST()
1079 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
[all …]
|
| D | btree_benchmark.cc | 493 btree_set<value, std::less<value>, std::allocator<value>>; \
632 btree_set<BigType<SIZE, COPIES>>; \
688 double ContainerInfo(const btree_set<BigTypePtr<Size>>& b) { in ContainerInfo()
718 btree_set<BigTypePtr<SIZE>>; \
|
| D | CMakeLists.txt | 31 "btree_set.h"
|
| /external/abseil-cpp/absl/container/ |
| D | btree_set.h | 73 class btree_set
78 using Base = typename btree_set::btree_set_container;
119 btree_set() {} in btree_set() function
359 void swap(btree_set<K, C, A> &x, btree_set<K, C, A> &y) { in swap()
367 void erase_if(btree_set<K, C, A> &set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 789 sizeof(absl::btree_set<K>), in SetTest()
790 2 * sizeof(void *) + sizeof(typename absl::btree_set<K>::size_type)); in SetTest()
791 using BtreeSet = absl::btree_set<K>; in SetTest()
793 absl::btree_set<K, std::less<K>, PropagatingCountingAlloc<K>>; in SetTest()
940 TestHeterogeneous(btree_set<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
961 using StringSet = absl::btree_set<std::string, NonTransparentCompare>; in TEST()
990 btree_set<int> s = {1}; in TEST()
998 btree_set<std::string> s = {"A"}; in TEST()
1026 using StringSet = absl::btree_set<StringLike>; in TEST()
1073 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
[all …]
|
| D | btree_benchmark.cc | 468 btree_set<value, std::less<value>, std::allocator<value>>; \
604 btree_set<BigType<SIZE, COPIES>>; \
660 double ContainerInfo(const btree_set<BigTypePtr<Size>>& b) { in ContainerInfo()
690 btree_set<BigTypePtr<SIZE>>; \
|
| D | CMakeLists.txt | 31 "btree_set.h"
|
| /external/rust/crates/rayon/src/collections/ |
| D | mod.rs | 26 pub mod btree_set; module
|
| /external/rust/crates/quote/src/ |
| D | runtime.rs | 48 use std::collections::btree_set::{self, BTreeSet};
119 type Iter = btree_set::Iter<'q, T>;
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/CMake/ |
| D | AbseilDll.cmake | 65 "container/btree_set.h"
|
| /external/webrtc/third_party/abseil-cpp/CMake/ |
| D | AbseilDll.cmake | 62 "container/btree_set.h"
|