//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // template // bool // operator==(const unordered_map& x, // const unordered_map& y); // // template // bool // operator!=(const unordered_map& x, // const unordered_map& y); #include #include #include int main() { { typedef std::unordered_map C; typedef std::pair P; P a[] = { P(10, "ten"), P(20, "twenty"), P(30, "thirty"), P(40, "fourty"), P(50, "fifty"), P(60, "sixty"), P(70, "seventy"), P(80, "eighty"), }; const C c1(std::begin(a), std::end(a)); const C c2; assert(!(c1 == c2)); assert( (c1 != c2)); } { typedef std::unordered_map C; typedef std::pair P; P a[] = { P(10, "ten"), P(20, "twenty"), P(30, "thirty"), P(40, "fourty"), P(50, "fifty"), P(60, "sixty"), P(70, "seventy"), P(80, "eighty"), }; const C c1(std::begin(a), std::end(a)); const C c2 = c1; assert( (c1 == c2)); assert(!(c1 != c2)); } { typedef std::unordered_map C; typedef std::pair P; P a[] = { P(10, "ten"), P(20, "twenty"), P(30, "thirty"), P(40, "fourty"), P(50, "fifty"), P(60, "sixty"), P(70, "seventy"), P(80, "eighty"), }; C c1(std::begin(a), std::end(a)); C c2 = c1; c2.rehash(30); assert( (c1 == c2)); assert(!(c1 != c2)); c2.insert(P(90, "ninety")); assert(!(c1 == c2)); assert( (c1 != c2)); c1.insert(P(90, "ninety")); assert( (c1 == c2)); assert(!(c1 != c2)); } }