libcxx/test/std/containers/sequences/deque/deque.special/copy.pass.cpp

   1 //===----------------------------------------------------------------------===//
   2 //
   3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
   4 // See https://llvm.org/LICENSE.txt for license information.
   5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
   6 //
   7 //===----------------------------------------------------------------------===//
   8
   9 // <deque>
  10
  11 // Optimization for deque::iterators
  12
  13 // template <class InputIterator, class OutputIterator>
  14 //   OutputIterator
  15 //   copy(InputIterator first, InputIterator last, OutputIterator result);
  16
  17 #include "asan_testing.h"
  18 #include <deque>
  19 #include <cassert>
  20
  21 #include "test_macros.h"
  22 #include "test_iterators.h"
  23 #include "min_allocator.h"
  24
  25 template <class C>
  26 C
  27 make(int size, int start = 0 )
  28 {
  29     const int b = 4096 / sizeof(int);
  30     int init = 0;
  31     if (start > 0)
  32     {
  33         init = (start+1) / b + ((start+1) % b != 0);
  34         init *= b;
  35         --init;
  36     }
  37     C c(init, 0);
  38     for (int i = 0; i < init-start; ++i)
  39         c.pop_back();
  40     for (int i = 0; i < size; ++i)
  41         c.push_back(i);
  42     for (int i = 0; i < start; ++i)
  43         c.pop_front();
  44     return c;
  45 }
  46
  47 template <class C>
  48 void testN(int start, int N)
  49 {
  50     typedef typename C::iterator I;
  51     typedef typename C::const_iterator CI;
  52     typedef random_access_iterator<I> RAI;
  53     typedef random_access_iterator<CI> RACI;
  54     typedef cpp17_input_iterator<CI> ICI;
  55     C c1 = make<C>(N, start);
  56     C c2 = make<C>(N);
  57     assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
  58     assert(c1 == c2);
  59     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));
  60     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
  61     assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
  62     assert(c1 == c2);
  63     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));
  64     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
  65     assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
  66     assert(c1 == c2);
  67     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));
  68     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
  69     assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
  70     assert(c1 == c2);
  71     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));
  72     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
  73     assert(std::copy(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end());
  74     assert(c1 == c2);
  75     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));
  76     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
  77     assert(std::copy(ICI(c2.cbegin()), ICI(c2.cend()), c1.begin()) == c1.end());
  78     assert(c1 == c2);
  79     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));
  80     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
  81 }
  82
  83 int main(int, char**)
  84 {
  85     {
  86     int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
  87     const int N = sizeof(rng)/sizeof(rng[0]);
  88     for (int i = 0; i < N; ++i)
  89         for (int j = 0; j < N; ++j)
  90             testN<std::deque<int> >(rng[i], rng[j]);
  91     }
  92 #if TEST_STD_VER >= 11
  93     {
  94     int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
  95     const int N = sizeof(rng)/sizeof(rng[0]);
  96     for (int i = 0; i < N; ++i)
  97         for (int j = 0; j < N; ++j)
  98             testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
  99     }
 100 #endif
 101
 102   return 0;
 103 }