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()
1097   using SubstringSet = absl::btree_set<std::string, SubstringLess>;  in TEST()
1112   absl::btree_set<int64_t> my_set;  in TEST()
1116   absl::btree_set<int64_t> my_set_copy(my_set);  in TEST()
1171   absl::btree_set<int> tset(ivec.begin(), ivec.end());  in TEST()
1191   absl::btree_set<std::string> set({"a", "b"});  in TEST()
1214   absl::btree_set<std::string> set;  in TEST()
1278   absl::btree_set<MovableOnlyInstance> set;  in TEST()
1392     EXPECT_EQ(BtreeNodePeer::GetNumValuesPerNode<absl::btree_set<int32_t>>(),  in TEST()
1447     EXPECT_EQ(BtreeNodePeer::GetNumValuesPerNode<absl::btree_set<int32_t>>(),  in TEST()
1605   absl::btree_set<int> set;  in TEST()
1621   const absl::btree_set<std::string> split_set = absl::StrSplit("a,b,c", ',');  in TEST()
1622   const absl::btree_set<std::string> expected_set = {"a", "b", "c"};  in TEST()
1633   absl::btree_set<int> s;  in TEST()
1653   absl::btree_set<int> s;  in TEST()
1671   using set = absl::btree_set<int>;  in TEST()
1725   absl::btree_set<int> s1 = {1, 2};  in TEST()
1726   absl::btree_set<int> s2 = {2, 3};  in TEST()
1736   absl::btree_set<int> s1 = {1, 2};  in TEST()
1737   absl::btree_set<int> s2 = {1, 2, 3};  in TEST()
1783   absl::btree_set<int, std::greater<int>> s1 = {1, 2};  in TEST()
1784   absl::btree_set<int, std::greater<int>> s2 = {2, 3};  in TEST()
1794   absl::btree_set<int> set = {1, 2, 3, 4, 5};  in TEST()
1802   absl::btree_set<int> src1 = {1, 2, 3, 4, 5};  in TEST()
1805   absl::btree_set<int> other;  in TEST()
1806   absl::btree_set<int>::insert_return_type res = other.insert(std::move(nh));  in TEST()
1812   absl::btree_set<int> src2 = {3, 4};  in TEST()
1891   TestExtractWithTrackingForSet<absl::btree_set<MovableOnlyInstance>>();  in TEST()
1985     absl::btree_set<int> src = {1, 2, 3, 4, 5};  in TEST()
1988     absl::btree_set<int> other = {0, 100};  in TEST()
2032   absl::btree_set<int, IntCompareToCmp> src1 = {1, 2, 3};  in TEST()
2034   absl::btree_set<int> dst;  in TEST()
2045   absl::btree_set<int, IntCompareToCmp> src1 = {1, 2, 3};  in TEST()
2047   absl::btree_set<int, IntCompareToCmp> dst;  in TEST()
2058   absl::btree_set<int, IntCompareToCmp> src1 = {1, 2, 3};  in TEST()
2071   absl::btree_set<int, IntCompareToCmp> src1 = {1, 2, 3};  in TEST()
2117   absl::btree_set<int, KeyCompareToWeakOrdering> weak_set = {1, 2, 3};  in TEST()
2121   absl::btree_set<int, KeyCompareToStrongOrdering> strong_set = {1, 2, 3};  in TEST()
2258     absl::btree_set<MovableOnlyInstance, std::less<MovableOnlyInstance>,  in TEST()
2270     absl::btree_set<MovableOnlyInstance, std::less<MovableOnlyInstance>,  in TEST()
2282     absl::btree_set<MovableOnlyInstance, std::less<MovableOnlyInstance>,  in TEST()
2295   absl::btree_set<int> s;  in TEST()
2306     absl::btree_set<int> s = {1, 3, 5, 6, 100};  in TEST()
2329     absl::btree_set<int> s;  in TEST()
2336     absl::btree_set<int> s = {1, 3, 5, 6, 100};  in TEST()