Home | History | Annotate | Download | only in unit

Lines Matching defs:it

114      * STL implementation it is only a compile check.
247 deque<vector<int> >::iterator it = vect_deque.end() - 5;
249 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {}
267 deque<vector<int> >::iterator it = vect_deque.end() - 5;
269 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {}
287 deque<vector<int> >::iterator it = vect_deque.end() - 5;
289 for (; it != vect_deque.end() && nb_incr < 6; ++nb_incr, ++it) {}
307 deque<vector<int> >::iterator it = vect_deque.end() - 5;
309 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {}
467 vector<vector<int> >::iterator it = vect_vector.end() - 5;
469 for (; it != vect_vector.end() && nb_incr <= 6; ++nb_incr, ++it) {}
487 vector<vector<int> >::iterator it = vect_vector.end() - 5;
489 for (; it != vect_vector.end() && nb_incr <= 6; ++nb_incr, ++it) {}
507 vector<vector<int> >::iterator it = vect_vector.end() - 5;
509 for (; it != vect_vector.end() && nb_incr < 6; ++nb_incr, ++it) {}
527 vector<vector<int> >::iterator it = vect_vector.end() - 5;
529 for (; it != vect_vector.end() && nb_incr <= 6; ++nb_incr, ++it) {}
628 vector<vector<string> >::iterator it(vect.begin());
629 advance(it, index % vect.size());
630 strs.push_back(it->front());
631 it->erase(it->begin());
632 if (it->empty()) {
633 vect.erase(it);
640 vector<string>::iterator it(strs.begin()), itEnd(strs.end());
641 for (; it != itEnd; ++it) {
642 CPPUNIT_ASSERT( *it == long_str );
657 vector<deque<string> >::iterator it(vect.begin());
658 advance(it, index % vect.size());
659 strs.push_back(it->front());
660 it->pop_front();
661 if (it->empty()) {
662 vect.erase(it);
669 vector<string>::iterator it(strs.begin()), itEnd(strs.end());
670 for (; it != itEnd; ++it) {
671 CPPUNIT_ASSERT( *it == long_str );
681 vector<list<string> >::iterator it(vect.begin());
682 advance(it, index % vect.size());
683 strs.push_back(it->front());
684 it->pop_front();
685 if (it->empty()) {
686 vect.erase(it);
693 vector<string>::iterator it(strs.begin()), itEnd(strs.end());
694 for (; it != itEnd; ++it) {
695 CPPUNIT_ASSERT( *it == long_str );
706 vector<slist<string> >::iterator it(vect.begin());
707 advance(it, index % vect.size());
708 strs.push_back(it->front());
709 it->pop_front();
710 if (it->empty()) {
711 vect.erase(it);
718 vector<string>::iterator it(strs.begin()), itEnd(strs.end());
719 for (; it != itEnd; ++it) {
720 CPPUNIT_ASSERT( *it == long_str );
735 vector<multiset<string> >::iterator it(vect.begin());
736 advance(it, index % vect.size());
737 strs.push_back(*it->begin());
738 it->erase(it->begin());
739 if (it->empty()) {
740 vect.erase(it);
747 vector<string>::iterator it(strs.begin()), itEnd(strs.end());
748 for (; it != itEnd; ++it) {
749 CPPUNIT_ASSERT( *it == long_str );
765 vector<unordered_multiset<string> >::iterator it(vect.begin());
766 advance(it, index % vect.size());
767 strs.push_back(*it->begin());
768 it->erase(it->begin());
769 if (it->empty()) {
770 vect.erase(it);
777 vector<string>::iterator it(strs.begin()), itEnd(strs.end());
778 for (; it != itEnd; ++it) {
779 CPPUNIT_ASSERT( *it == long_str );