167 using MoveOnlyTree = flat_tree<MoveOnlyInt,
170                                std::vector<MoveOnlyInt>>;
331   EXPECT_EQ(1U, moved.count(MoveOnlyInt(1)));  in TEST()
332   EXPECT_EQ(1U, moved.count(MoveOnlyInt(2)));  in TEST()
333   EXPECT_EQ(1U, moved.count(MoveOnlyInt(3)));  in TEST()
334   EXPECT_EQ(1U, moved.count(MoveOnlyInt(4)));  in TEST()
375   using Pair = std::pair<int, MoveOnlyInt>;  in TEST()
381   storage.push_back(Pair(2, MoveOnlyInt(0)));  in TEST()
382   storage.push_back(Pair(1, MoveOnlyInt(0)));  in TEST()
383   storage.push_back(Pair(2, MoveOnlyInt(1)));  in TEST()
462   using Pair = std::pair<int, MoveOnlyInt>;  in TEST()
465   storage.push_back(Pair(1, MoveOnlyInt(0)));  in TEST()
466   storage.push_back(Pair(2, MoveOnlyInt(0)));  in TEST()
530   EXPECT_EQ(1U, moved.count(MoveOnlyInt(1)));  in TEST()
531   EXPECT_EQ(1U, moved.count(MoveOnlyInt(2)));  in TEST()
532   EXPECT_EQ(1U, moved.count(MoveOnlyInt(3)));  in TEST()
533   EXPECT_EQ(1U, moved.count(MoveOnlyInt(4)));  in TEST()
714   std::pair<MoveOnlyTree::iterator, bool> result = cont.insert(MoveOnlyInt(2));  in TEST()
720   result = cont.insert(MoveOnlyInt(1));  in TEST()
726   result = cont.insert(MoveOnlyInt(3));  in TEST()
732   result = cont.insert(MoveOnlyInt(3));  in TEST()
770   auto result = cont.insert(cont.cend(), MoveOnlyInt(2));  in TEST()
775   result = cont.insert(cont.cend(), MoveOnlyInt(1));  in TEST()
780   result = cont.insert(cont.cend(), MoveOnlyInt(3));  in TEST()
785   result = cont.insert(cont.cend(), MoveOnlyInt(3));  in TEST()