65 lines
1.7 KiB
C++
65 lines
1.7 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
|
|
|
|
// <flat_set>
|
|
|
|
// iterator find(const key_type& k);
|
|
// const_iterator find(const key_type& k) const;
|
|
|
|
#include <cassert>
|
|
#include <deque>
|
|
#include <flat_set>
|
|
#include <functional>
|
|
#include <string>
|
|
#include <utility>
|
|
|
|
#include "MinSequenceContainer.h"
|
|
#include "test_macros.h"
|
|
#include "min_allocator.h"
|
|
|
|
template <class KeyContainer>
|
|
void test_one() {
|
|
using Key = typename KeyContainer::value_type;
|
|
using M = std::flat_multiset<Key, std::less<>, KeyContainer>;
|
|
{
|
|
M m = {1, 1, 2, 4, 4, 4, 4, 5, 5, 8};
|
|
ASSERT_SAME_TYPE(decltype(m.find(0)), typename M::iterator);
|
|
ASSERT_SAME_TYPE(decltype(std::as_const(m).find(0)), typename M::const_iterator);
|
|
assert(m.find(0) == m.end());
|
|
assert(m.find(1) == m.begin());
|
|
assert(m.find(2) == m.begin() + 2);
|
|
assert(m.find(3) == m.end());
|
|
assert(m.find(4) == m.begin() + 3);
|
|
assert(m.find(5) == m.begin() + 7);
|
|
assert(m.find(6) == m.end());
|
|
assert(m.find(7) == m.end());
|
|
assert(std::as_const(m).find(8) == m.begin() + 9);
|
|
assert(std::as_const(m).find(9) == m.end());
|
|
}
|
|
{
|
|
// empty
|
|
M m;
|
|
assert(m.find(0) == m.end());
|
|
}
|
|
}
|
|
|
|
void test() {
|
|
test_one<std::vector<int>>();
|
|
test_one<std::deque<int>>();
|
|
test_one<MinSequenceContainer<int>>();
|
|
test_one<std::vector<int, min_allocator<int>>>();
|
|
}
|
|
|
|
int main(int, char**) {
|
|
test();
|
|
|
|
return 0;
|
|
}
|