//===----------------------------------------------------------------------===// // // 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 // //===----------------------------------------------------------------------===// // // template , class Pred = equal_to, // class Alloc = allocator>> // class unordered_multiset // template // size_type count(const K& k) const; // UNSUPPORTED: c++03, c++11, c++14, c++17 #include #include "test_transparent_unordered.h" int main(int, char**) { using key_type = StoredType; { // Make sure conversions don't happen for transparent non-final hasher and key_equal using set_type = const unord_set_type >; test_transparent_count(key_type{1}, key_type{1}, key_type{2}); } { // Make sure conversions don't happen for transparent final hasher and key_equal using set_type = const unord_set_type; test_transparent_count(key_type{1}, key_type{1}, key_type{2}); } { // Make sure conversions do happen for non-transparent hasher using set_type = const unord_set_type >; test_non_transparent_count(key_type{1}, key_type{1}, key_type{2}); } { // Make sure conversions do happen for non-transparent key_equal using set_type = const unord_set_type >; test_non_transparent_count(key_type{1}, key_type{1}, key_type{2}); } { // Make sure conversions do happen for both non-transparent hasher and key_equal using set_type = const unord_set_type >; test_non_transparent_count(key_type{1}, key_type{1}, key_type{2}); } return 0; }