| /external/libtextclassifier/abseil-cpp/absl/container/ |
| D | btree_set.h | 395 class btree_multiset
400 using Base = typename btree_multiset::btree_multiset_container;
441 btree_multiset() {} in btree_multiset() function
662 void swap(btree_multiset<K, C, A> &x, btree_multiset<K, C, A> &y) { in swap()
670 void erase_if(btree_multiset<K, C, A> &set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 828 sizeof(absl::btree_multiset<K>), in MultiSetTest()
829 2 * sizeof(void *) + sizeof(typename absl::btree_multiset<K>::size_type)); in MultiSetTest()
830 using BtreeMSet = absl::btree_multiset<K>; in MultiSetTest()
832 absl::btree_multiset<K, std::less<K>, PropagatingCountingAlloc<K>>; in MultiSetTest()
950 btree_multiset<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
979 absl::btree_multiset<std::string, NonTransparentCompare>; in TEST()
1175 absl::btree_multiset<int> tmset(ivec.begin(), ivec.end()); in TEST()
1201 absl::btree_multiset<int> mset({1, 1, 4}); in TEST()
1225 absl::btree_multiset<int> mset; in TEST()
1296 absl::btree_multiset<MovableOnlyInstance> mset; in TEST()
[all …]
|
| D | btree_benchmark.cc | 498 btree_multiset<value, std::less<value>, std::allocator<value>>; \
636 btree_multiset<BigType<SIZE, COPIES>>; \
|
| /external/openscreen/third_party/abseil/src/absl/container/ |
| D | btree_set.h | 395 class btree_multiset
400 using Base = typename btree_multiset::btree_multiset_container;
441 btree_multiset() {} in btree_multiset() function
662 void swap(btree_multiset<K, C, A> &x, btree_multiset<K, C, A> &y) { in swap()
670 void erase_if(btree_multiset<K, C, A> &set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 829 sizeof(absl::btree_multiset<K>), in MultiSetTest()
830 2 * sizeof(void *) + sizeof(typename absl::btree_multiset<K>::size_type)); in MultiSetTest()
831 using BtreeMSet = absl::btree_multiset<K>; in MultiSetTest()
833 absl::btree_multiset<K, std::less<K>, PropagatingCountingAlloc<K>>; in MultiSetTest()
951 btree_multiset<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
980 absl::btree_multiset<std::string, NonTransparentCompare>; in TEST()
1176 absl::btree_multiset<int> tmset(ivec.begin(), ivec.end()); in TEST()
1299 absl::btree_multiset<int> mset({1, 1, 4}); in TEST()
1323 absl::btree_multiset<int> mset; in TEST()
1394 absl::btree_multiset<MovableOnlyInstance> mset; in TEST()
[all …]
|
| D | btree_benchmark.cc | 498 btree_multiset<value, std::less<value>, std::allocator<value>>; \
636 btree_multiset<BigType<SIZE, COPIES>>; \
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/ |
| D | btree_set.h | 395 class btree_multiset
400 using Base = typename btree_multiset::btree_multiset_container;
441 btree_multiset() {} in btree_multiset() function
662 void swap(btree_multiset<K, C, A> &x, btree_multiset<K, C, A> &y) { in swap()
670 void erase_if(btree_multiset<K, C, A> &set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 829 sizeof(absl::btree_multiset<K>), in MultiSetTest()
830 2 * sizeof(void *) + sizeof(typename absl::btree_multiset<K>::size_type)); in MultiSetTest()
831 using BtreeMSet = absl::btree_multiset<K>; in MultiSetTest()
833 absl::btree_multiset<K, std::less<K>, PropagatingCountingAlloc<K>>; in MultiSetTest()
951 btree_multiset<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
980 absl::btree_multiset<std::string, NonTransparentCompare>; in TEST()
1176 absl::btree_multiset<int> tmset(ivec.begin(), ivec.end()); in TEST()
1299 absl::btree_multiset<int> mset({1, 1, 4}); in TEST()
1323 absl::btree_multiset<int> mset; in TEST()
1394 absl::btree_multiset<MovableOnlyInstance> mset; in TEST()
[all …]
|
| D | btree_benchmark.cc | 465 btree_multiset<value, std::less<value>, std::allocator<value>>; \
602 btree_multiset<BigType<SIZE, COPIES>>; \
|
| /external/webrtc/third_party/abseil-cpp/absl/container/ |
| D | btree_set.h | 430 class btree_multiset
435 using Base = typename btree_multiset::btree_multiset_container;
476 btree_multiset() {} in btree_multiset() function
720 void swap(btree_multiset<K, C, A> &x, btree_multiset<K, C, A> &y) { in swap()
729 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if()
730 btree_multiset<K, C, A> & set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 836 sizeof(absl::btree_multiset<K>), in MultiSetTest()
837 2 * sizeof(void *) + sizeof(typename absl::btree_multiset<K>::size_type)); in MultiSetTest()
838 using BtreeMSet = absl::btree_multiset<K>; in MultiSetTest()
840 absl::btree_multiset<K, std::less<K>, PropagatingCountingAlloc<K>>; in MultiSetTest()
958 btree_multiset<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
987 absl::btree_multiset<std::string, NonTransparentCompare>; in TEST()
1183 absl::btree_multiset<int> tmset(ivec.begin(), ivec.end()); in TEST()
1311 absl::btree_multiset<int> mset({1, 1, 4}); in TEST()
1335 absl::btree_multiset<int> mset; in TEST()
1402 absl::btree_multiset<MovableOnlyInstance> mset; in TEST()
[all …]
|
| D | btree_benchmark.cc | 501 btree_multiset<value, std::less<value>, std::allocator<value>>; \
642 btree_multiset<BigType<SIZE, COPIES>>; \
|
| /external/tensorflow/third_party/absl/abseil-cpp/absl/container/ |
| D | btree_set.h | 426 class btree_multiset
431 using Base = typename btree_multiset::btree_multiset_container;
472 btree_multiset() {} in btree_multiset() function
716 void swap(btree_multiset<K, C, A> &x, btree_multiset<K, C, A> &y) { in swap()
725 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if()
726 btree_multiset<K, C, A> & set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 833 sizeof(absl::btree_multiset<K>), in MultiSetTest()
834 2 * sizeof(void *) + sizeof(typename absl::btree_multiset<K>::size_type)); in MultiSetTest()
835 using BtreeMSet = absl::btree_multiset<K>; in MultiSetTest()
837 absl::btree_multiset<K, std::less<K>, PropagatingCountingAlloc<K>>; in MultiSetTest()
955 btree_multiset<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
984 absl::btree_multiset<std::string, NonTransparentCompare>; in TEST()
1180 absl::btree_multiset<int> tmset(ivec.begin(), ivec.end()); in TEST()
1308 absl::btree_multiset<int> mset({1, 1, 4}); in TEST()
1332 absl::btree_multiset<int> mset; in TEST()
1399 absl::btree_multiset<MovableOnlyInstance> mset; in TEST()
[all …]
|
| D | btree_benchmark.cc | 499 btree_multiset<value, std::less<value>, std::allocator<value>>; \
640 btree_multiset<BigType<SIZE, COPIES>>; \
|
| /external/cronet/third_party/abseil-cpp/absl/container/ |
| D | btree_set.h | 445 class btree_multiset
450 using Base = typename btree_multiset::btree_multiset_container;
491 btree_multiset() {} in btree_multiset() function
750 void swap(btree_multiset<K, C, A> &x, btree_multiset<K, C, A> &y) { in swap()
759 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if()
760 btree_multiset<K, C, A> & set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 847 sizeof(absl::btree_multiset<K>), in MultiSetTest()
848 2 * sizeof(void *) + sizeof(typename absl::btree_multiset<K>::size_type)); in MultiSetTest()
849 using BtreeMSet = absl::btree_multiset<K>; in MultiSetTest()
851 absl::btree_multiset<K, std::less<K>, PropagatingCountingAlloc<K>>; in MultiSetTest()
969 btree_multiset<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
998 absl::btree_multiset<std::string, NonTransparentCompare>; in TEST()
1194 absl::btree_multiset<int> tmset(ivec.begin(), ivec.end()); in TEST()
1322 absl::btree_multiset<int> mset({1, 1, 4}); in TEST()
1346 absl::btree_multiset<int> mset; in TEST()
1413 absl::btree_multiset<MovableOnlyInstance> mset; in TEST()
[all …]
|
| D | btree_benchmark.cc | 501 btree_multiset<value, std::less<value>, std::allocator<value>>; \
642 btree_multiset<BigType<SIZE, COPIES>>; \
|
| /external/abseil-cpp/absl/container/ |
| D | btree_set.h | 426 class btree_multiset
431 using Base = typename btree_multiset::btree_multiset_container;
472 btree_multiset() {} in btree_multiset() function
716 void swap(btree_multiset<K, C, A> &x, btree_multiset<K, C, A> &y) { in swap()
725 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if()
726 btree_multiset<K, C, A> & set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 833 sizeof(absl::btree_multiset<K>), in MultiSetTest()
834 2 * sizeof(void *) + sizeof(typename absl::btree_multiset<K>::size_type)); in MultiSetTest()
835 using BtreeMSet = absl::btree_multiset<K>; in MultiSetTest()
837 absl::btree_multiset<K, std::less<K>, PropagatingCountingAlloc<K>>; in MultiSetTest()
955 btree_multiset<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
984 absl::btree_multiset<std::string, NonTransparentCompare>; in TEST()
1180 absl::btree_multiset<int> tmset(ivec.begin(), ivec.end()); in TEST()
1308 absl::btree_multiset<int> mset({1, 1, 4}); in TEST()
1332 absl::btree_multiset<int> mset; in TEST()
1399 absl::btree_multiset<MovableOnlyInstance> mset; in TEST()
[all …]
|
| D | btree_benchmark.cc | 499 btree_multiset<value, std::less<value>, std::allocator<value>>; \
640 btree_multiset<BigType<SIZE, COPIES>>; \
|
| /external/angle/third_party/abseil-cpp/absl/container/ |
| D | btree_set.h | 445 class btree_multiset
450 using Base = typename btree_multiset::btree_multiset_container;
491 btree_multiset() {} in btree_multiset() function
750 void swap(btree_multiset<K, C, A> &x, btree_multiset<K, C, A> &y) { in swap()
759 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if()
760 btree_multiset<K, C, A> & set, Pred pred) { in erase_if()
|
| D | btree_test.cc | 848 sizeof(absl::btree_multiset<K>), in MultiSetTest()
849 2 * sizeof(void *) + sizeof(typename absl::btree_multiset<K>::size_type)); in MultiSetTest()
850 using BtreeMSet = absl::btree_multiset<K>; in MultiSetTest()
852 absl::btree_multiset<K, std::less<K>, PropagatingCountingAlloc<K>>; in MultiSetTest()
970 btree_multiset<std::string, CompareIntToString>{"1", "3", "5"}); in TEST()
999 absl::btree_multiset<std::string, NonTransparentCompare>; in TEST()
1195 absl::btree_multiset<int> tmset(ivec.begin(), ivec.end()); in TEST()
1325 absl::btree_multiset<int> mset({1, 1, 4}); in TEST()
1349 absl::btree_multiset<int> mset; in TEST()
1416 absl::btree_multiset<MovableOnlyInstance> mset; in TEST()
[all …]
|
| D | btree_benchmark.cc | 501 btree_multiset<value, std::less<value>, std::allocator<value>>; \
642 btree_multiset<BigType<SIZE, COPIES>>; \
|
| /external/abseil-cpp/absl/strings/ |
| D | str_split_test.cc | 412 TestConversionOperator<absl::btree_multiset<absl::string_view>>(splitter); in TEST()
413 TestConversionOperator<absl::btree_multiset<std::string>>(splitter); in TEST()
|