diff options
Diffstat (limited to 'test/std/algorithms/alg.nonmodifying/alg.search')
4 files changed, 414 insertions, 0 deletions
diff --git a/test/std/algorithms/alg.nonmodifying/alg.search/search.pass.cpp b/test/std/algorithms/alg.nonmodifying/alg.search/search.pass.cpp new file mode 100644 index 000000000000..e5c2dd29d11f --- /dev/null +++ b/test/std/algorithms/alg.nonmodifying/alg.search/search.pass.cpp @@ -0,0 +1,72 @@ +//===----------------------------------------------------------------------===// +// +// The LLVM Compiler Infrastructure +// +// This file is dual licensed under the MIT and the University of Illinois Open +// Source Licenses. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +// <algorithm> + +// template<ForwardIterator Iter1, ForwardIterator Iter2> +// requires HasEqualTo<Iter1::value_type, Iter2::value_type> +// Iter1 +// search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); + +#include <algorithm> +#include <cassert> + +#include "test_iterators.h" + +template <class Iter1, class Iter2> +void +test() +{ + int ia[] = {0, 1, 2, 3, 4, 5}; + const unsigned sa = sizeof(ia)/sizeof(ia[0]); + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1)); + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); + assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia)); + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1)); + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa)) == Iter1(ia+sa-3)); + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)) == Iter1(ia)); + assert(std::search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+sa-1)); + assert(std::search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+1)); + int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; + const unsigned sb = sizeof(ib)/sizeof(ib[0]); + int ic[] = {1}; + assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1)); + int id[] = {1, 2}; + assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2)) == Iter1(ib+1)); + int ie[] = {1, 2, 3}; + assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3)) == Iter1(ib+4)); + int ig[] = {1, 2, 3, 4}; + assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8)); + int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; + const unsigned sh = sizeof(ih)/sizeof(ih[0]); + int ii[] = {1, 1, 2}; + assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3)) == Iter1(ih+3)); + int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; + const unsigned sj = sizeof(ij)/sizeof(ij[0]); + int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; + const unsigned sk = sizeof(ik)/sizeof(ik[0]); + assert(std::search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk)) == Iter1(ij+6)); +} + +int main() +{ + test<forward_iterator<const int*>, forward_iterator<const int*> >(); + test<forward_iterator<const int*>, bidirectional_iterator<const int*> >(); + test<forward_iterator<const int*>, random_access_iterator<const int*> >(); + test<bidirectional_iterator<const int*>, forward_iterator<const int*> >(); + test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >(); + test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >(); + test<random_access_iterator<const int*>, forward_iterator<const int*> >(); + test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >(); + test<random_access_iterator<const int*>, random_access_iterator<const int*> >(); +} diff --git a/test/std/algorithms/alg.nonmodifying/alg.search/search_n.pass.cpp b/test/std/algorithms/alg.nonmodifying/alg.search/search_n.pass.cpp new file mode 100644 index 000000000000..f7f8ee092796 --- /dev/null +++ b/test/std/algorithms/alg.nonmodifying/alg.search/search_n.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// The LLVM Compiler Infrastructure +// +// This file is dual licensed under the MIT and the University of Illinois Open +// Source Licenses. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +// <algorithm> + +// template<class ForwardIterator, class Size, class T> +// ForwardIterator +// search_n(ForwardIterator first, ForwardIterator last, Size count, +// const T& value); + +#include <algorithm> +#include <cassert> + +#include "test_iterators.h" +#include "user_defined_integral.hpp" + +template <class Iter> +void +test() +{ + int ia[] = {0, 1, 2, 3, 4, 5}; + const unsigned sa = sizeof(ia)/sizeof(ia[0]); + assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); + assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); + assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa)); + assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa)); + assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia)); + assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3)); + assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa)); + assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa)); + assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia)); + assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 5) == Iter(ia+5)); + assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 5) == Iter(ia+sa)); + assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 5) == Iter(ia+sa)); + + int ib[] = {0, 0, 1, 1, 2, 2}; + const unsigned sb = sizeof(ib)/sizeof(ib[0]); + assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0) == Iter(ib+sb)); + assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0) == Iter(ib+sb)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1) == Iter(ib)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1) == Iter(ib+2)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1) == Iter(ib+2)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 1) == Iter(ib+sb)); + assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 1) == Iter(ib+sb)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 2) == Iter(ib)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 2) == Iter(ib+4)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 2) == Iter(ib+4)); + assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 2) == Iter(ib+sb)); + assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 2) == Iter(ib+sb)); + + int ic[] = {0, 0, 0}; + const unsigned sc = sizeof(ic)/sizeof(ic[0]); + assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic)); + assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic)); + assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic)); + assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic)); + assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc)); + + // Check that we properly convert the size argument to an integral. + std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(0), 0); +} + +int main() +{ + test<forward_iterator<const int*> >(); + test<bidirectional_iterator<const int*> >(); + test<random_access_iterator<const int*> >(); +} diff --git a/test/std/algorithms/alg.nonmodifying/alg.search/search_n_pred.pass.cpp b/test/std/algorithms/alg.nonmodifying/alg.search/search_n_pred.pass.cpp new file mode 100644 index 000000000000..8bc6f4d26bdb --- /dev/null +++ b/test/std/algorithms/alg.nonmodifying/alg.search/search_n_pred.pass.cpp @@ -0,0 +1,154 @@ +//===----------------------------------------------------------------------===// +// +// The LLVM Compiler Infrastructure +// +// This file is dual licensed under the MIT and the University of Illinois Open +// Source Licenses. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +// <algorithm> + +// template<class ForwardIterator, class Size, class T, class BinaryPredicate> +// ForwardIterator +// search_n(ForwardIterator first, ForwardIterator last, Size count, +// const T& value, BinaryPredicate pred); + +#include <algorithm> +#include <cassert> + +#include "test_iterators.h" +#include "user_defined_integral.hpp" + +struct count_equal +{ + static unsigned count; + template <class T> + bool operator()(const T& x, const T& y) + {++count; return x == y;} +}; + +unsigned count_equal::count = 0; + + +template <class Iter> +void +test() +{ + int ia[] = {0, 1, 2, 3, 4, 5}; + const unsigned sa = sizeof(ia)/sizeof(ia[0]); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3, count_equal()) == Iter(ia+sa)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3, count_equal()) == Iter(ia+sa)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5, count_equal()) == Iter(ia)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 5, count_equal()) == Iter(ia+5)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 5, count_equal()) == Iter(ia+sa)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 5, count_equal()) == Iter(ia+sa)); + assert(count_equal::count <= sa); + count_equal::count = 0; + + int ib[] = {0, 0, 1, 1, 2, 2}; + const unsigned sb = sizeof(ib)/sizeof(ib[0]); + assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0, count_equal()) == Iter(ib+sb)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0, count_equal()) == Iter(ib+sb)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1, count_equal()) == Iter(ib)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1, count_equal()) == Iter(ib+2)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1, count_equal()) == Iter(ib+2)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 1, count_equal()) == Iter(ib+sb)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 1, count_equal()) == Iter(ib+sb)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 2, count_equal()) == Iter(ib)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 2, count_equal()) == Iter(ib+4)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 2, count_equal()) == Iter(ib+4)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 2, count_equal()) == Iter(ib+sb)); + assert(count_equal::count <= sb); + count_equal::count = 0; + assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 2, count_equal()) == Iter(ib+sb)); + assert(count_equal::count <= sb); + count_equal::count = 0; + + int ic[] = {0, 0, 0}; + const unsigned sc = sizeof(ic)/sizeof(ic[0]); + assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic)); + assert(count_equal::count <= sc); + count_equal::count = 0; + assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic)); + assert(count_equal::count <= sc); + count_equal::count = 0; + assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic)); + assert(count_equal::count <= sc); + count_equal::count = 0; + assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0, count_equal()) == Iter(ic)); + assert(count_equal::count <= sc); + count_equal::count = 0; + assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0, count_equal()) == Iter(ic+sc)); + assert(count_equal::count <= sc); + count_equal::count = 0; + + // Check that we properly convert the size argument to an integral. + std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(4), 0, count_equal()); + count_equal::count = 0; +} + +int main() +{ + test<forward_iterator<const int*> >(); + test<bidirectional_iterator<const int*> >(); + test<random_access_iterator<const int*> >(); +} diff --git a/test/std/algorithms/alg.nonmodifying/alg.search/search_pred.pass.cpp b/test/std/algorithms/alg.nonmodifying/alg.search/search_pred.pass.cpp new file mode 100644 index 000000000000..192da03d67b3 --- /dev/null +++ b/test/std/algorithms/alg.nonmodifying/alg.search/search_pred.pass.cpp @@ -0,0 +1,111 @@ +//===----------------------------------------------------------------------===// +// +// The LLVM Compiler Infrastructure +// +// This file is dual licensed under the MIT and the University of Illinois Open +// Source Licenses. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +// <algorithm> + +// template<ForwardIterator Iter1, ForwardIterator Iter2> +// requires HasEqualTo<Iter1::value_type, Iter2::value_type> +// Iter1 +// search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); + +#include <algorithm> +#include <cassert> + +#include "test_iterators.h" + +struct count_equal +{ + static unsigned count; + template <class T> + bool operator()(const T& x, const T& y) + {++count; return x == y;} +}; + +unsigned count_equal::count = 0; + +template <class Iter1, class Iter2> +void +test() +{ + int ia[] = {0, 1, 2, 3, 4, 5}; + const unsigned sa = sizeof(ia)/sizeof(ia[0]); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia)); + assert(count_equal::count <= 0); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), count_equal()) == Iter1(ia)); + assert(count_equal::count <= 0); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia)); + assert(count_equal::count <= 0); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), count_equal()) == Iter1(ia+sa-1)); + assert(count_equal::count <= sa); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), count_equal()) == Iter1(ia+sa-3)); + assert(count_equal::count <= sa*3); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), count_equal()) == Iter1(ia)); + assert(count_equal::count <= sa*sa); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), count_equal()) == Iter1(ia+sa-1)); + assert(count_equal::count <= (sa-1)*sa); + count_equal::count = 0; + assert(std::search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), count_equal()) == Iter1(ia+1)); + assert(count_equal::count <= sa); + count_equal::count = 0; + int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; + const unsigned sb = sizeof(ib)/sizeof(ib[0]); + int ic[] = {1}; + assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), count_equal()) == Iter1(ib+1)); + assert(count_equal::count <= sb); + count_equal::count = 0; + int id[] = {1, 2}; + assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), count_equal()) == Iter1(ib+1)); + assert(count_equal::count <= sb*2); + count_equal::count = 0; + int ie[] = {1, 2, 3}; + assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), count_equal()) == Iter1(ib+4)); + assert(count_equal::count <= sb*3); + count_equal::count = 0; + int ig[] = {1, 2, 3, 4}; + assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), count_equal()) == Iter1(ib+8)); + assert(count_equal::count <= sb*4); + count_equal::count = 0; + int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; + const unsigned sh = sizeof(ih)/sizeof(ih[0]); + int ii[] = {1, 1, 2}; + assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), count_equal()) == Iter1(ih+3)); + assert(count_equal::count <= sh*3); +} + +int main() +{ + test<forward_iterator<const int*>, forward_iterator<const int*> >(); + test<forward_iterator<const int*>, bidirectional_iterator<const int*> >(); + test<forward_iterator<const int*>, random_access_iterator<const int*> >(); + test<bidirectional_iterator<const int*>, forward_iterator<const int*> >(); + test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >(); + test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >(); + test<random_access_iterator<const int*>, forward_iterator<const int*> >(); + test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >(); + test<random_access_iterator<const int*>, random_access_iterator<const int*> >(); +} |