Lines Matching refs:btree_set
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()
1103 using SubstringSet = absl::btree_set<std::string, SubstringLess>; in TEST()
1118 absl::btree_set<int64_t> my_set; in TEST()
1122 absl::btree_set<int64_t> my_set_copy(my_set); in TEST()
1177 absl::btree_set<int> tset(ivec.begin(), ivec.end()); in TEST()
1197 absl::btree_set<std::string> set({"a", "b"}); in TEST()
1220 absl::btree_set<std::string> set; in TEST()
1286 absl::btree_set<MovableOnlyInstance> set; in TEST()
1406 EXPECT_EQ(BtreeNodePeer::GetNumValuesPerNode<absl::btree_set<int32_t>>(), in TEST()
1461 EXPECT_EQ(BtreeNodePeer::GetNumValuesPerNode<absl::btree_set<int32_t>>(), in TEST()
1619 absl::btree_set<int> set; in TEST()
1635 const absl::btree_set<std::string> split_set = absl::StrSplit("a,b,c", ','); in TEST()
1636 const absl::btree_set<std::string> expected_set = {"a", "b", "c"}; in TEST()
1647 absl::btree_set<int> s; in TEST()
1667 absl::btree_set<int> s; in TEST()
1685 using set = absl::btree_set<int>; in TEST()
1739 absl::btree_set<int> s1 = {1, 2}; in TEST()
1740 absl::btree_set<int> s2 = {2, 3}; in TEST()
1750 absl::btree_set<int> s1 = {1, 2}; in TEST()
1751 absl::btree_set<int> s2 = {1, 2, 3}; in TEST()
1797 absl::btree_set<int, std::greater<int>> s1 = {1, 2}; in TEST()
1798 absl::btree_set<int, std::greater<int>> s2 = {2, 3}; in TEST()
1808 absl::btree_set<int> set = {1, 2, 3, 4, 5}; in TEST()
1816 absl::btree_set<int> src1 = {1, 2, 3, 4, 5}; in TEST()
1819 absl::btree_set<int> other; in TEST()
1820 absl::btree_set<int>::insert_return_type res = other.insert(std::move(nh)); in TEST()
1826 absl::btree_set<int> src2 = {3, 4}; in TEST()
1905 TestExtractWithTrackingForSet<absl::btree_set<MovableOnlyInstance>>(); in TEST()
1999 absl::btree_set<int> src = {1, 2, 3, 4, 5}; in TEST()
2002 absl::btree_set<int> other = {0, 100}; in TEST()
2046 absl::btree_set<int, IntCompareToCmp> src1 = {1, 2, 3}; in TEST()
2048 absl::btree_set<int> dst; in TEST()
2059 absl::btree_set<int, IntCompareToCmp> src1 = {1, 2, 3}; in TEST()
2061 absl::btree_set<int, IntCompareToCmp> dst; in TEST()
2072 absl::btree_set<int, IntCompareToCmp> src1 = {1, 2, 3}; in TEST()
2085 absl::btree_set<int, IntCompareToCmp> src1 = {1, 2, 3}; in TEST()
2131 absl::btree_set<int, KeyCompareToWeakOrdering> weak_set = {1, 2, 3}; in TEST()
2135 absl::btree_set<int, KeyCompareToStrongOrdering> strong_set = {1, 2, 3}; in TEST()
2272 absl::btree_set<MovableOnlyInstance, std::less<MovableOnlyInstance>, in TEST()
2284 absl::btree_set<MovableOnlyInstance, std::less<MovableOnlyInstance>, in TEST()
2296 absl::btree_set<MovableOnlyInstance, std::less<MovableOnlyInstance>, in TEST()
2309 absl::btree_set<int> s; in TEST()
2320 absl::btree_set<int> s = {1, 3, 5, 6, 100}; in TEST()
2343 absl::btree_set<int> s; in TEST()
2350 absl::btree_set<int> s = {1, 3, 5, 6, 100}; in TEST()
2418 absl::btree_set<std::string> name_set1{std::begin(names), std::end(names)}; in TEST()
2421 absl::btree_set<std::string> name_set2; in TEST()
2451 absl::btree_set<ConstructorCounted, ConstructorCountedCompare> set{ in TEST()
2465 absl::btree_set<std::vector<void *>> s1{std::begin(i), std::end(i)}; in TEST()
2468 absl::btree_set<std::vector<void *>> s2; in TEST()
2601 absl::btree_set<MultiKey, MultiKeyComp> set; in TEST()