libcxx/test/std/containers/associative/multiset/insert_iter_iter.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 // <set>
  10
  11 // class multiset
  12
  13 // template <class InputIterator>
  14 //   void insert(InputIterator first, InputIterator last);
  15
  16 #include <set>
  17 #include <cassert>
  18
  19 #include "test_macros.h"
  20 #include "test_iterators.h"
  21 #include "min_allocator.h"
  22
  23 int main(int, char**)
  24 {
  25     {
  26         typedef std::multiset<int> M;
  27         typedef int V;
  28         V ar[] =
  29         {
  30             1,
  31             1,
  32             1,
  33             2,
  34             2,
  35             2,
  36             3,
  37             3,
  38             3
  39         };
  40         M m;
  41         m.insert(cpp17_input_iterator<const V*>(ar),
  42                  cpp17_input_iterator<const V*>(ar + sizeof(ar)/sizeof(ar[0])));
  43         assert(m.size() == 9);
  44         assert(*std::next(m.begin(), 0) == 1);
  45         assert(*std::next(m.begin(), 1) == 1);
  46         assert(*std::next(m.begin(), 2) == 1);
  47         assert(*std::next(m.begin(), 3) == 2);
  48         assert(*std::next(m.begin(), 4) == 2);
  49         assert(*std::next(m.begin(), 5) == 2);
  50         assert(*std::next(m.begin(), 6) == 3);
  51         assert(*std::next(m.begin(), 7) == 3);
  52         assert(*std::next(m.begin(), 8) == 3);
  53     }
  54 #if TEST_STD_VER >= 11
  55     {
  56         typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
  57         typedef int V;
  58         V ar[] =
  59         {
  60             1,
  61             1,
  62             1,
  63             2,
  64             2,
  65             2,
  66             3,
  67             3,
  68             3
  69         };
  70         M m;
  71         m.insert(cpp17_input_iterator<const V*>(ar),
  72                  cpp17_input_iterator<const V*>(ar + sizeof(ar)/sizeof(ar[0])));
  73         assert(m.size() == 9);
  74         assert(*std::next(m.begin(), 0) == 1);
  75         assert(*std::next(m.begin(), 1) == 1);
  76         assert(*std::next(m.begin(), 2) == 1);
  77         assert(*std::next(m.begin(), 3) == 2);
  78         assert(*std::next(m.begin(), 4) == 2);
  79         assert(*std::next(m.begin(), 5) == 2);
  80         assert(*std::next(m.begin(), 6) == 3);
  81         assert(*std::next(m.begin(), 7) == 3);
  82         assert(*std::next(m.begin(), 8) == 3);
  83     }
  84 #endif
  85
  86   return 0;
  87 }