54 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_multiset14 15// iterator begin() {return __table_.begin();}16// iterator end() {return __table_.end();}17// const_iterator begin() const {return __table_.begin();}18// const_iterator end() const {return __table_.end();}19// const_iterator cbegin() const {return __table_.begin();}20// const_iterator cend() const {return __table_.end();}21 22#include <unordered_set>23#include <cassert>24 25#include "test_macros.h"26 27int main(int, char**) {28 {29 typedef std::unordered_multiset<int> C;30 typedef int P;31 P a[] = {P(1), P(2), P(3), P(4), P(1), P(2)};32 C c(a, a + sizeof(a) / sizeof(a[0]));33 LIBCPP_ASSERT(c.bucket_count() == 7);34 assert(c.size() == 6);35 assert(std::distance(c.begin(), c.end()) == c.size());36 assert(std::distance(c.cbegin(), c.cend()) == c.size());37 C::iterator i = c.begin();38 assert(*i == 1);39 *i = 2;40 }41 {42 typedef std::unordered_multiset<int> C;43 typedef int P;44 P a[] = {P(1), P(2), P(3), P(4), P(1), P(2)};45 const C c(a, a + sizeof(a) / sizeof(a[0]));46 LIBCPP_ASSERT(c.bucket_count() == 7);47 assert(c.size() == 6);48 assert(std::distance(c.begin(), c.end()) == c.size());49 assert(std::distance(c.cbegin(), c.cend()) == c.size());50 }51 52 return 0;53}54