brintos

brintos / llvm-project-archived public Read only

0
0
Text · 1.2 KiB · 8687904 Raw
47 lines · 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-exception6//7//===----------------------------------------------------------------------===//8 9// <unordered_set>10 11// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,12//           class Alloc = allocator<Value>>13// class unordered_set14 15// void clear() noexcept;16 17#include <unordered_set>18#include <cassert>19 20#include "test_macros.h"21#include "min_allocator.h"22 23int main(int, char**) {24  {25    typedef std::unordered_set<int> C;26    typedef int P;27    P a[] = {P(1), P(2), P(3), P(4), P(1), P(2)};28    C c(a, a + sizeof(a) / sizeof(a[0]));29    ASSERT_NOEXCEPT(c.clear());30    c.clear();31    assert(c.size() == 0);32  }33#if TEST_STD_VER >= 1134  {35    typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;36    typedef int P;37    P a[] = {P(1), P(2), P(3), P(4), P(1), P(2)};38    C c(a, a + sizeof(a) / sizeof(a[0]));39    ASSERT_NOEXCEPT(c.clear());40    c.clear();41    assert(c.size() == 0);42  }43#endif44 45  return 0;46}47