150 using IntTree =  typedef
322   static_assert((std::is_same<int, IntTree::key_type>::value), "");  in TEST()
323   static_assert((std::is_same<int, IntTree::value_type>::value), "");  in TEST()
324   static_assert((std::is_same<std::less<int>, IntTree::key_compare>::value),  in TEST()
326   static_assert((std::is_same<int&, IntTree::reference>::value), "");  in TEST()
327   static_assert((std::is_same<const int&, IntTree::const_reference>::value),  in TEST()
329   static_assert((std::is_same<int*, IntTree::pointer>::value), "");  in TEST()
330   static_assert((std::is_same<const int*, IntTree::const_pointer>::value), "");  in TEST()
341     IntTree cont;  in TEST()
387   IntTree original({1, 2, 3, 4});  in TEST()
388   IntTree copied(original);  in TEST()
450     IntTree cont({1, 2, 3, 4, 5, 6, 10, 8});  in TEST()
454     IntTree cont({1, 2, 3, 4, 5, 6, 10, 8});  in TEST()
478   IntTree original({1, 2, 3, 4});  in TEST()
479   IntTree copied;  in TEST()
505   IntTree cont({0});  in TEST()
518   IntTree cont({1, 2, 3});  in TEST()
527   IntTree cont({1, 2, 3});  in TEST()
537   IntTree cont({1, 2, 3});  in TEST()
539   IntTree::size_type capacity_before = cont.capacity();  in TEST()
550   IntTree cont({1, 2, 3, 4, 5, 6, 7, 8});  in TEST()
558   IntTree cont;  in TEST()
578   IntTree cont;  in TEST()
606   IntTree cont({1, 2, 3, 4, 5, 6, 7, 8});  in TEST()
608   auto size = static_cast<IntTree::difference_type>(cont.size());  in TEST()
616     IntTree::iterator it = cont.begin();  in TEST()
617     IntTree::const_iterator c_it = cont.cbegin();  in TEST()
625     IntTree::reverse_iterator rit = cont.rbegin();  in TEST()
626     IntTree::const_reverse_iterator c_rit = cont.crbegin();  in TEST()
642   IntTree cont;  in TEST()
645   std::pair<IntTree::iterator, bool> result = cont.insert(value);  in TEST()
706   IntTree cont;  in TEST()
708   IntTree::iterator result = cont.insert(cont.cend(), 2);  in TEST()
879     IntTree cont;  in TEST()
881     std::pair<IntTree::iterator, bool> result = cont.emplace(2);  in TEST()
912     IntTree cont;  in TEST()
914     IntTree::iterator result = cont.emplace_hint(cont.cend(), 2);  in TEST()
928     IntTree cont({1, 2, 3, 4, 5, 6, 7, 8});  in TEST()
930     IntTree::iterator it = cont.erase(std::next(cont.cbegin(), 3));  in TEST()
980   IntTree cont({1, 2, 3, 4, 5, 6, 7, 8});  in TEST()
982   IntTree::iterator it =  in TEST()
1007   IntTree cont({1, 2, 3, 4, 5, 6, 7, 8});  in TEST()
1070   const IntTree cont({5, 6, 7, 8, 9, 10, 11, 12});  in TEST()
1088     IntTree cont({5, 6, 7, 8, 9, 10, 11, 12});  in TEST()
1101     const IntTree cont({5, 6, 7, 8, 9, 10, 11, 12});  in TEST()
1120     IntTree cont({5, 7, 9, 11, 13, 15, 17, 19});  in TEST()
1122     std::pair<IntTree::iterator, IntTree::iterator> result =  in TEST()
1176     const IntTree cont({5, 7, 9, 11, 13, 15, 17, 19});  in TEST()
1178     std::pair<IntTree::const_iterator, IntTree::const_iterator> result =  in TEST()
1238     IntTree cont({5, 7, 9, 11, 13, 15, 17, 19});  in TEST()
1259     const IntTree cont({5, 7, 9, 11, 13, 15, 17, 19});  in TEST()
1286     IntTree cont({5, 7, 9, 11, 13, 15, 17, 19});  in TEST()
1307     const IntTree cont({5, 7, 9, 11, 13, 15, 17, 19});  in TEST()
1336   IntTree x({1, 2, 3});  in TEST()
1337   IntTree y({4});  in TEST()
1371   IntTree x;  in TEST()