58   set<int, less<int> > s;  in set1()
70   typedef set<int, less<int> > int_set;  in set2()
96   set<int, less<int> > s;  in erase()
107   set<int> s;  in insert()
108   set<int>::iterator i = s.insert( s.end(), 0 );  in insert()
114   set<int> s;  in find()
118   set<int> const& crs = s;  in find()
126   set<int> s(array1, array1 + sizeof(array1) / sizeof(array1[0]));  in bounds()
127   set<int> const& crs = s;  in bounds()
129   set<int>::iterator sit;  in bounds()
130   set<int>::const_iterator scit;  in bounds()
131   pair<set<int>::iterator, set<int>::iterator> pit;  in bounds()
132   pair<set<int>::const_iterator, set<int>::const_iterator> pcit;  in bounds()
225   set<SetTestClass> s;  in specialized_less()
231   set<SetTestClass>::iterator sit(s.begin()), sitEnd(s.end());  in specialized_less()
240   set<int> tree;  in implementation_check()
242   set<int>::iterator 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()
261     set<int>::reverse_iterator rit(tree.rbegin());  in reverse_iterator_test()
268     set<int> const& ctree = tree;  in reverse_iterator_test()
269     set<int>::const_reverse_iterator rit(ctree.rbegin());  in reverse_iterator_test()
285   typedef set<int, less<int>, StackAllocator<int> > SetInt;  in allocator_with_state()
396     typedef set<Key, KeyCmp> KeySet;  in template_methods()
420     typedef set<Key*, KeyCmpPtr> KeySet;  in template_methods()
501   set<IncompleteClass> instances;
502   typedef set<IncompleteClass>::iterator it;