TheRock/compiler/amd-llvm/libcxx/test/std/containers/associative/multiset/find.pass.cpp

//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

// <set>

// class multiset

//       iterator find(const key_type& k);
// const_iterator find(const key_type& k) const;

#include <set>
#include <cassert>

#include "test_macros.h"
#include "min_allocator.h"
#include "private_constructor.h"

int main(int, char**) {
  {
    typedef int V;
    typedef std::multiset<int> M;
    {
      typedef M::iterator R;
      V ar[] = {5, 6, 7, 8, 9, 10, 11, 12};
      M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
      R r = m.find(5);
      assert(r == m.begin());
      r = m.find(6);
      assert(r == std::next(m.begin()));
      r = m.find(7);
      assert(r == std::next(m.begin(), 2));
      r = m.find(8);
      assert(r == std::next(m.begin(), 3));
      r = m.find(9);
      assert(r == std::next(m.begin(), 4));
      r = m.find(10);
      assert(r == std::next(m.begin(), 5));
      r = m.find(11);
      assert(r == std::next(m.begin(), 6));
      r = m.find(12);
      assert(r == std::next(m.begin(), 7));
      r = m.find(4);
      assert(r == std::next(m.begin(), 8));
    }
    {
      typedef M::const_iterator R;
      V ar[] = {5, 6, 7, 8, 9, 10, 11, 12};
      const M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
      R r = m.find(5);
      assert(r == m.begin());
      r = m.find(6);
      assert(r == std::next(m.begin()));
      r = m.find(7);
      assert(r == std::next(m.begin(), 2));
      r = m.find(8);
      assert(r == std::next(m.begin(), 3));
      r = m.find(9);
      assert(r == std::next(m.begin(), 4));
      r = m.find(10);
      assert(r == std::next(m.begin(), 5));
      r = m.find(11);
      assert(r == std::next(m.begin(), 6));
      r = m.find(12);
      assert(r == std::next(m.begin(), 7));
      r = m.find(4);
      assert(r == std::next(m.begin(), 8));
    }
  }
  { // Check with std::greater to ensure we're actually using the correct comparator
    using Set = std::multiset<int, std::greater<int> >;
    int ar[]  = {5, 6, 7, 8, 9, 10, 11, 12};
    Set m(ar, ar + sizeof(ar) / sizeof(ar[0]));
    assert(m.find(12) == std::next(m.begin(), 0));
    assert(m.find(11) == std::next(m.begin(), 1));
    assert(m.find(10) == std::next(m.begin(), 2));
    assert(m.find(9) == std::next(m.begin(), 3));
    assert(m.find(8) == std::next(m.begin(), 4));
    assert(m.find(7) == std::next(m.begin(), 5));
    assert(m.find(6) == std::next(m.begin(), 6));
    assert(m.find(5) == std::next(m.begin(), 7));
    assert(m.find(4) == std::next(m.begin(), 8));
    assert(std::next(m.begin(), 8) == m.end());
  }
#if TEST_STD_VER >= 11
  {
    typedef int V;
    typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
    {
      typedef M::iterator R;
      V ar[] = {5, 6, 7, 8, 9, 10, 11, 12};
      M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
      R r = m.find(5);
      assert(r == m.begin());
      r = m.find(6);
      assert(r == std::next(m.begin()));
      r = m.find(7);
      assert(r == std::next(m.begin(), 2));
      r = m.find(8);
      assert(r == std::next(m.begin(), 3));
      r = m.find(9);
      assert(r == std::next(m.begin(), 4));
      r = m.find(10);
      assert(r == std::next(m.begin(), 5));
      r = m.find(11);
      assert(r == std::next(m.begin(), 6));
      r = m.find(12);
      assert(r == std::next(m.begin(), 7));
      r = m.find(4);
      assert(r == std::next(m.begin(), 8));
    }
    {
      typedef M::const_iterator R;
      V ar[] = {5, 6, 7, 8, 9, 10, 11, 12};
      const M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
      R r = m.find(5);
      assert(r == m.begin());
      r = m.find(6);
      assert(r == std::next(m.begin()));
      r = m.find(7);
      assert(r == std::next(m.begin(), 2));
      r = m.find(8);
      assert(r == std::next(m.begin(), 3));
      r = m.find(9);
      assert(r == std::next(m.begin(), 4));
      r = m.find(10);
      assert(r == std::next(m.begin(), 5));
      r = m.find(11);
      assert(r == std::next(m.begin(), 6));
      r = m.find(12);
      assert(r == std::next(m.begin(), 7));
      r = m.find(4);
      assert(r == std::next(m.begin(), 8));
    }
  }
#endif
#if TEST_STD_VER > 11
  {
    typedef int V;
    typedef std::multiset<V, std::less<>> M;
    typedef M::iterator R;

    V ar[] = {5, 6, 7, 8, 9, 10, 11, 12};
    M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
    R r = m.find(5);
    assert(r == m.begin());
    r = m.find(6);
    assert(r == std::next(m.begin()));
    r = m.find(7);
    assert(r == std::next(m.begin(), 2));
    r = m.find(8);
    assert(r == std::next(m.begin(), 3));
    r = m.find(9);
    assert(r == std::next(m.begin(), 4));
    r = m.find(10);
    assert(r == std::next(m.begin(), 5));
    r = m.find(11);
    assert(r == std::next(m.begin(), 6));
    r = m.find(12);
    assert(r == std::next(m.begin(), 7));
    r = m.find(4);
    assert(r == std::next(m.begin(), 8));
  }

  {
    typedef PrivateConstructor V;
    typedef std::multiset<V, std::less<>> M;
    typedef M::iterator R;

    M m;
    m.insert(V::make(5));
    m.insert(V::make(6));
    m.insert(V::make(7));
    m.insert(V::make(8));
    m.insert(V::make(9));
    m.insert(V::make(10));
    m.insert(V::make(11));
    m.insert(V::make(12));

    R r = m.find(5);
    assert(r == m.begin());
    r = m.find(6);
    assert(r == std::next(m.begin()));
    r = m.find(7);
    assert(r == std::next(m.begin(), 2));
    r = m.find(8);
    assert(r == std::next(m.begin(), 3));
    r = m.find(9);
    assert(r == std::next(m.begin(), 4));
    r = m.find(10);
    assert(r == std::next(m.begin(), 5));
    r = m.find(11);
    assert(r == std::next(m.begin(), 6));
    r = m.find(12);
    assert(r == std::next(m.begin(), 7));
    r = m.find(4);
    assert(r == std::next(m.begin(), 8));
  }
#endif

  return 0;
}