//===----------------------------------------------------------------------===// // // 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 , class Pred = equal_to, // class Alloc = allocator>> // class unordered_multimap // float max_load_factor() const; // void max_load_factor(float mlf); #ifdef _LIBCPP_DEBUG #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) #endif #include #include #include #include "min_allocator.h" int main() { { typedef std::unordered_multimap C; typedef std::pair P; const C c; assert(c.max_load_factor() == 1); } { typedef std::unordered_multimap C; typedef std::pair P; C c; assert(c.max_load_factor() == 1); c.max_load_factor(2.5); assert(c.max_load_factor() == 2.5); } #if __cplusplus >= 201103L { typedef std::unordered_multimap, std::equal_to, min_allocator>> C; typedef std::pair P; const C c; assert(c.max_load_factor() == 1); } { typedef std::unordered_multimap, std::equal_to, min_allocator>> C; typedef std::pair P; C c; assert(c.max_load_factor() == 1); c.max_load_factor(2.5); assert(c.max_load_factor() == 2.5); } #endif #if _LIBCPP_DEBUG_LEVEL >= 1 { typedef std::unordered_multimap C; C c; c.max_load_factor(0); assert(false); } #endif }