1195   absl::btree_multiset<int> mset({1, 1, 4});  in TEST()  local
1196   EXPECT_EQ(mset.count(1), 2);  in TEST()
1197   EXPECT_EQ(mset.count(4), 1);  in TEST()
1219   absl::btree_multiset<int> mset;  in TEST()  local
1220   mset.insert({1, 1, 4});  in TEST()
1221   EXPECT_EQ(mset.count(1), 2);  in TEST()
1222   EXPECT_EQ(mset.count(4), 1);  in TEST()
1288   absl::btree_multiset<MovableOnlyInstance> mset;  in TEST()  local
1291   mset.insert(std::move(zero));  in TEST()
1292   mset.insert(mset.find(MovableOnlyInstance(0)), std::move(zero2));  in TEST()
1293   EXPECT_EQ(mset.count(MovableOnlyInstance(0)), 2);  in TEST()
1682   using mset = absl::btree_multiset<int>;  in TEST()  typedef
1684       mset{},  in TEST()
1685       mset{1},  in TEST()
1686       mset{1, 1},  in TEST()
1687       mset{2},  in TEST()
1688       mset{2, 2},  in TEST()
1689       mset{1, 2},  in TEST()
1690       mset{1, 1, 2},  in TEST()
1691       mset{1, 2, 2},  in TEST()
1692       mset{1, 1, 2, 2},  in TEST()
1693       mset(values.begin(), values.end()),  in TEST()
1694       mset(values.rbegin(), values.rend()),  in TEST()