brintos

brintos / llvm-project-archived public Read only

0
0
Text · 1.4 KiB · 87fa25c Raw
48 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_map>10 11// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,12//           class Alloc = allocator<pair<const Key, T>>>13// class unordered_multimap14 15// hasher key_eq() const;16 17#include <unordered_map>18#include <string>19#include <cassert>20 21#include "test_macros.h"22 23int main(int, char**) {24  typedef std::unordered_multimap<int, std::string> map_type;25 26  map_type m;27  map_type::iterator i1 = m.insert(map_type::value_type(1, "abc"));28  map_type::iterator i2 = m.insert(map_type::value_type(1, "bcd"));29  map_type::iterator i3 = m.insert(map_type::value_type(2, "abc"));30 31  const map_type& cm = m;32 33  assert(cm.key_eq()(i1->first, i1->first));34  assert(cm.key_eq()(i2->first, i2->first));35  assert(cm.key_eq()(i3->first, i3->first));36 37  assert(cm.key_eq()(i1->first, i2->first));38  assert(cm.key_eq()(i2->first, i1->first));39 40  assert(!cm.key_eq()(i1->first, i3->first));41  assert(!cm.key_eq()(i3->first, i1->first));42 43  assert(!cm.key_eq()(i2->first, i3->first));44  assert(!cm.key_eq()(i3->first, i2->first));45 46  return 0;47}48