Lines Matching refs:end

113 …REQUIRE_MESSAGE((it != cont.end( ) && Value<Map>::get( *(it) ) == 2), "Element with key 1 not prop…
117     REQUIRE_MESSAGE( it == cont.end( ), "Element with key 1 not properly erased" );
184 …REQUIRE_MESSAGE( ((cont.equal_range( 1 )).second == cont.end( )), "Improper iterator from equal_ra…
201 …REQUIRE_MESSAGE( (cont.equal_range( 1 )).second == cont.end( ), "Improper iterator from equal_rang…
325     for (Iterator i = range.begin(); i != range.end(); ++i) {
434     REQUIRE_MESSAGE(r.begin() == r.end(), "Incorrect iterators on empty range");
455 …REQUIRE_MESSAGE(cont.begin() == cont.end(), "Concurrent container iterators are invalid after cons…
456 …REQUIRE_MESSAGE(ccont.begin() == ccont.end(), "Concurrent container iterators are invalid after co…
507 …REQUIRE_MESSAGE((it != cont.end() && Value<T>::get(*it) == 1), "Element 1 has not been found prope…
532 …REQUIRE_MESSAGE((it != cont.end() && Value<T>::get(*it) == 1), "Element 1 has not been found prope…
539 …REQUIRE_MESSAGE((it != cont.end() && Value<T>::get(*(it)) == 1), "Element 1 has not been found pro…
568 …REQUIRE_MESSAGE((it4 == cont.end() && cont.size() == 0), "Erase has not removed the last element p…
573 …REQUIRE_MESSAGE((it5 == cont.end() && cont.size() == 0), "Erase has not removed the last element p…
577     cont.insert(newcont.begin(), newcont.end());
589 …REQUIRE_MESSAGE((newcont.begin() == newcont.end() && newcont.size() == 0), "Clear has not cleared …
601         REQUIRE_MESSAGE((it != newcont.end()), "iterator" );
610 …REQUIRE_MESSAGE((it != newcont.end() && Value<T>::get(*it) == 2), "Element 2 has not been found pr…
623 …REQUIRE_MESSAGE((it != newcont.end() && Value<T>::get(*it) == 1), "Element 1 has not been found pr…
627 …REQUIRE_MESSAGE((it != newcont.end() && Value<T>::get(*it) == 2), "Element 2 has not been found pr…
734                     if (it != my_table.end()) { // found
755         for (auto i = range.begin(); i != range.end(); ++i) {
880     for (auto it = arr_int.begin(); it != arr_int.end(); ++it) {
894     std::copy(arr_shr.begin(), arr_shr.end(), std::back_inserter(arr_weak));
949     std::copy(arr_shared_pairs.begin(), arr_shared_pairs.end(), std::back_inserter(arr_wick_pairs));
1112         std::fill(my_marks.begin(), my_marks.end(), false);
1117         do_test_range(r.begin(), r.end());
1124             auto it2 = std::search(my_lst.begin(), my_lst.end(), prev_it, it, utils::IsEqual());
1125             REQUIRE(it2 != my_lst.end());
1147     std::for_each(lst.begin(), lst.end(), CheckValue<DefCtorPresent, Table>(c));
1151     TestRange<value_type>(lst, marks).do_test_range(c.begin(), c.end());
1152     REQUIRE(std::find(marks.begin(), marks.end(), false) == marks.end());
1157     TestRange<value_type>(lst, marks).do_test_range(c.begin(), c.end());
1158     REQUIRE(std::find(marks.begin(), marks.end(), false) == marks.end());
1161     REQUIRE(std::find(marks.begin(), marks.end(), false) == marks.end());
1164     REQUIRE(std::find(marks.begin(), marks.end(), false) == marks.end());
1176     std::for_each(lst.begin(), lst.end(), CheckValue<DefCtorPresent, Table>(c2));
1272     return std::lexicographical_compare(ck.my_item, ck.my_item + ck.size(), c.begin(), c.end());
1276     return std::lexicographical_compare(c.begin(), c.end(), ck.my_item, ck.my_item + ck.size());
1305         for (auto it = key.begin(); it != key.end(); ++it) {
1351             REQUIRE_MESSAGE(extract_c.find(int_k) == extract_c.end(), "Key exists after extract");
1374             REQUIRE_MESSAGE(extract_m.find(int_k) != extract_m.end(), "All nodes for key deleted");
1398     for (auto it = keys.begin(); it != keys.end(); ++it) {
1407     for (auto it = keys.begin(); it != keys.end(); ++it) {
1415     for (auto it = keys.begin(); it != keys.end(); ++it) {
1440             REQUIRE_MESSAGE(extract_m.find(char_k) != extract_m.end(), "All nodes for key deleted");
1445     for (auto it = keys.begin(); it != keys.end(); ++it) {