1bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 2bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 3f5256e16dfc425c1d466f6308d4026d529ce9e0bHoward Hinnant// The LLVM Compiler Infrastructure 4bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 5b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 6b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// Source Licenses. See LICENSE.TXT for details. 7bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 8bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 9bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 10bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <deque> 11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 12bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// template <class InputIterator> deque(InputIterator f, InputIterator l); 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <deque> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include "../../../stack_allocator.h" 1883e2c4d877fe2d7793868b1c6a5d9525a7c4d431Marshall Clow#include "test_iterators.h" 19061d0cc4db18d17bf01ed14c5db0be098205bd47Marshall Clow#include "min_allocator.h" 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttemplate <class InputIterator> 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttest(InputIterator f, InputIterator l) 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef typename std::iterator_traits<InputIterator>::value_type T; 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef std::allocator<T> Allocator; 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef std::deque<T, Allocator> C; 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef typename C::const_iterator const_iterator; 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant C d(f, l); 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(d.size() == std::distance(f, l)); 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(distance(d.begin(), d.end()) == d.size()); 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (const_iterator i = d.begin(), e = d.end(); i != e; ++i, ++f) 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(*i == *f); 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttemplate <class Allocator, class InputIterator> 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttest(InputIterator f, InputIterator l) 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef typename std::iterator_traits<InputIterator>::value_type T; 41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef std::deque<T, Allocator> C; 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef typename C::const_iterator const_iterator; 43bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant C d(f, l); 44bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(d.size() == std::distance(f, l)); 45bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(distance(d.begin(), d.end()) == d.size()); 46bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (const_iterator i = d.begin(), e = d.end(); i != e; ++i, ++f) 47bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(*i == *f); 48bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 49bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 50bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 51bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; 53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int* an = ab + sizeof(ab)/sizeof(ab[0]); 54bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); 55bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); 56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); 57bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); 58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test<stack_allocator<int, 4096> >(ab, an); 59fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant#if __cplusplus >= 201103L 60fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant test<min_allocator<int> >(ab, an); 61fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant#endif 62bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 63