//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // vector // template vector(InputIter first, InputIter last, // const allocator_type& a); #include #include #include "test_iterators.h" #include "../../min_allocator.h" template void test(Iterator first, Iterator last, const typename C::allocator_type& a) { C c(first, last, a); assert(c.__invariants()); assert(c.size() == std::distance(first, last)); for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) assert(*i == *first); } int main() { bool a[] = {0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0}; bool* an = a + sizeof(a)/sizeof(a[0]); { std::allocator alloc; test >(input_iterator(a), input_iterator(an), alloc); test >(forward_iterator(a), forward_iterator(an), alloc); test >(bidirectional_iterator(a), bidirectional_iterator(an), alloc); test >(random_access_iterator(a), random_access_iterator(an), alloc); test >(a, an, alloc); } #if __cplusplus >= 201103L { min_allocator alloc; test> >(input_iterator(a), input_iterator(an), alloc); test> >(forward_iterator(a), forward_iterator(an), alloc); test> >(bidirectional_iterator(a), bidirectional_iterator(an), alloc); test> >(random_access_iterator(a), random_access_iterator(an), alloc); test> >(a, an, alloc); } #endif }