240   set<int> tree;  in implementation_check()  local
241   tree.insert(1);  in implementation_check()
242   set<int>::iterator it = tree.begin();  in implementation_check()
246   CPPUNIT_ASSERT( it == tree.end() );  in implementation_check()
247   CPPUNIT_ASSERT( it != tree.begin() );  in implementation_check()
249   set<int>::const_iterator cit = tree.begin();  in implementation_check()
256   set<int> tree;  in reverse_iterator_test()  local
257   tree.insert(1);  in reverse_iterator_test()
258   tree.insert(2);  in reverse_iterator_test()
261     set<int>::reverse_iterator rit(tree.rbegin());  in reverse_iterator_test()
264     CPPUNIT_ASSERT( rit == tree.rend() );  in reverse_iterator_test()
268     set<int> const& ctree = tree;  in reverse_iterator_test()