| /external/cronet/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 810 sizeof(absl::btree_set<K>), in SetTest()
811 2 * sizeof(void *) + sizeof(typename absl::btree_set<K>::size_type)); in SetTest()
812 using BtreeSet = absl::btree_set<K>; in SetTest()
814 absl::btree_set<K, std::less<K>, PropagatingCountingAlloc<K>>; in SetTest()
965 TestHeterogeneous(btree_set<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
986 using StringSet = absl::btree_set<std::string, NonTransparentCompare>; in TEST()
1015 btree_set<int> s = {1}; in TEST()
1023 btree_set<std::string> s = {"A"}; in TEST()
1051 using StringSet = absl::btree_set<StringLike>; in TEST()
1098 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
[all …]
|
| D | btree_set.h | 89 class btree_set
94 using Base = typename btree_set::btree_set_container;
135 btree_set() {} in btree_set() function
413 void swap(btree_set<K, C, A> &x, btree_set<K, C, A> &y) { in swap()
422 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if()
|
| D | btree_benchmark.cc | 496 btree_set<value, std::less<value>, std::allocator<value>>; \
638 btree_set<BigType<SIZE, COPIES>>; \
694 double ContainerInfo(const btree_set<BigTypePtr<Size>>& b) { in ContainerInfo()
724 btree_set<BigTypePtr<SIZE>>; \
746 absl::btree_set<int> set; in BM_BtreeSet_IteratorSubtraction()
|
| /external/angle/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 811 sizeof(absl::btree_set<K>), in SetTest()
812 2 * sizeof(void *) + sizeof(typename absl::btree_set<K>::size_type)); in SetTest()
813 using BtreeSet = absl::btree_set<K>; in SetTest()
815 absl::btree_set<K, std::less<K>, PropagatingCountingAlloc<K>>; in SetTest()
966 TestHeterogeneous(btree_set<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
987 using StringSet = absl::btree_set<std::string, NonTransparentCompare>; in TEST()
1016 btree_set<int> s = {1}; in TEST()
1024 btree_set<std::string> s = {"A"}; in TEST()
1052 using StringSet = absl::btree_set<StringLike>; in TEST()
1099 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
[all …]
|
| D | btree_set.h | 89 class btree_set
94 using Base = typename btree_set::btree_set_container;
135 btree_set() {} in btree_set() function
413 void swap(btree_set<K, C, A> &x, btree_set<K, C, A> &y) { in swap()
422 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if()
|
| D | btree_benchmark.cc | 496 btree_set<value, std::less<value>, std::allocator<value>>; \
638 btree_set<BigType<SIZE, COPIES>>; \
694 double ContainerInfo(const btree_set<BigTypePtr<Size>>& b) { in ContainerInfo()
724 btree_set<BigTypePtr<SIZE>>; \
746 absl::btree_set<int> set; in BM_BtreeSet_IteratorSubtraction()
|
| /external/webrtc/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 799 sizeof(absl::btree_set<K>), in SetTest()
800 2 * sizeof(void *) + sizeof(typename absl::btree_set<K>::size_type)); in SetTest()
801 using BtreeSet = absl::btree_set<K>; in SetTest()
803 absl::btree_set<K, std::less<K>, PropagatingCountingAlloc<K>>; in SetTest()
954 TestHeterogeneous(btree_set<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
975 using StringSet = absl::btree_set<std::string, NonTransparentCompare>; in TEST()
1004 btree_set<int> s = {1}; in TEST()
1012 btree_set<std::string> s = {"A"}; in TEST()
1040 using StringSet = absl::btree_set<StringLike>; in TEST()
1087 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
[all …]
|
| D | btree_set.h | 89 class btree_set
94 using Base = typename btree_set::btree_set_container;
135 btree_set() {} in btree_set() function
398 void swap(btree_set<K, C, A> &x, btree_set<K, C, A> &y) { in swap()
407 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if()
|
| D | btree_benchmark.cc | 496 btree_set<value, std::less<value>, std::allocator<value>>; \
638 btree_set<BigType<SIZE, COPIES>>; \
694 double ContainerInfo(const btree_set<BigTypePtr<Size>>& b) { in ContainerInfo()
724 btree_set<BigTypePtr<SIZE>>; \
746 absl::btree_set<int> set; in BM_BtreeSet_IteratorSubtraction()
|
| /external/tensorflow/third_party/absl/abseil-cpp/absl/container/ |
| D | btree_test.cc | 796 sizeof(absl::btree_set<K>), in SetTest()
797 2 * sizeof(void *) + sizeof(typename absl::btree_set<K>::size_type)); in SetTest()
798 using BtreeSet = absl::btree_set<K>; in SetTest()
800 absl::btree_set<K, std::less<K>, PropagatingCountingAlloc<K>>; in SetTest()
951 TestHeterogeneous(btree_set<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
972 using StringSet = absl::btree_set<std::string, NonTransparentCompare>; in TEST()
1001 btree_set<int> s = {1}; in TEST()
1009 btree_set<std::string> s = {"A"}; in TEST()
1037 using StringSet = absl::btree_set<StringLike>; in TEST()
1084 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
[all …]
|
| D | btree_set.h | 86 class btree_set
91 using Base = typename btree_set::btree_set_container;
132 btree_set() {} in btree_set() function
394 void swap(btree_set<K, C, A> &x, btree_set<K, C, A> &y) { in swap()
403 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if()
|
| D | btree_benchmark.cc | 494 btree_set<value, std::less<value>, std::allocator<value>>; \
636 btree_set<BigType<SIZE, COPIES>>; \
692 double ContainerInfo(const btree_set<BigTypePtr<Size>>& b) { in ContainerInfo()
722 btree_set<BigTypePtr<SIZE>>; \
|
| /external/abseil-cpp/absl/container/ |
| D | btree_test.cc | 796 sizeof(absl::btree_set<K>), in SetTest()
797 2 * sizeof(void *) + sizeof(typename absl::btree_set<K>::size_type)); in SetTest()
798 using BtreeSet = absl::btree_set<K>; in SetTest()
800 absl::btree_set<K, std::less<K>, PropagatingCountingAlloc<K>>; in SetTest()
951 TestHeterogeneous(btree_set<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
972 using StringSet = absl::btree_set<std::string, NonTransparentCompare>; in TEST()
1001 btree_set<int> s = {1}; in TEST()
1009 btree_set<std::string> s = {"A"}; in TEST()
1037 using StringSet = absl::btree_set<StringLike>; in TEST()
1084 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
[all …]
|
| D | btree_set.h | 86 class btree_set
91 using Base = typename btree_set::btree_set_container;
132 btree_set() {} in btree_set() function
394 void swap(btree_set<K, C, A> &x, btree_set<K, C, A> &y) { in swap()
403 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if()
|
| /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 …]
|
| /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 …]
|
| /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 | 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 …]
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | set_kernels.cc | 155 const std::vector<std::pair<std::vector<int64_t>, absl::btree_set<T>>>& in OutputSparseTensor()
358 absl::btree_set<T>* result) const;
370 absl::btree_set<T>* result) { in SetDifference()
379 absl::btree_set<T>* result) { in SetIntersection()
393 const absl::flat_hash_set<T>& set2, absl::btree_set<T>* result) { in SetUnion()
401 absl::btree_set<T>* result) const { in ApplySetOperation()
481 std::vector<std::pair<std::vector<int64_t>, absl::btree_set<T>>> group_sets; in ComputeDenseToDense()
499 absl::btree_set<T> group_set; in ComputeDenseToDense()
536 std::vector<std::pair<std::vector<int64_t>, absl::btree_set<T>>> group_sets; in ComputeDenseToSparse()
580 absl::btree_set<T> group_set; in ComputeDenseToSparse()
[all …]
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | graph_node_util.cc | 44 absl::btree_set<string> GetMergedNames(const std::vector<string>& from_names, in GetMergedNames()
46 absl::btree_set<string> merged_names; in GetMergedNames()
|
| /external/tensorflow/tensorflow/cc/gradients/ |
| D | linalg_grad.cc | 136 const Scope& scope, const absl::btree_set<char>& reduced_label_set, in EinsumGetReducedSubscripts()
188 const absl::btree_set<char>& reduced_label_set) { in EinsumGradReducedHelper()
323 absl::btree_set<char> reduced_label_set(input_subs.begin(), input_subs.end()); in EinsumGradWrt()
386 absl::btree_set<char> reduced_label_set(input_subs.begin(), in EinsumGrad()
|
| /external/cronet/net/third_party/quiche/src/quiche/common/platform/default/quiche_platform_impl/ |
| D | quiche_containers_impl.h | 13 using QuicheSmallOrderedSetImpl = absl::btree_set<Key, Compare>;
|
| /external/rust/crates/rayon/src/collections/ |
| D | mod.rs | 26 pub mod btree_set; module
|