int main() { { typedef std::unordered_multimap<int, std::string> C; typedef std::pair<int, std::string> P; const C c; assert(c.max_load_factor() == 1); } { typedef std::unordered_multimap<int, std::string> C; typedef std::pair<int, std::string> 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<int, std::string, std::hash<int>, std::equal_to<int>, min_allocator<std::pair<const int, std::string>>> C; typedef std::pair<int, std::string> P; const C c; assert(c.max_load_factor() == 1); } { typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>, min_allocator<std::pair<const int, std::string>>> C; typedef std::pair<int, std::string> P; C c; assert(c.max_load_factor() == 1); c.max_load_factor(2.5); assert(c.max_load_factor() == 2.5); } #endif }
void main() { { typedef unordered_set<int> C; typedef int P; const C c; #ifdef LIBCPP_HAS_BAD_NEWS_FOR_MOMO assert(c.max_load_factor() == 1); #endif } { typedef unordered_set<int> C; typedef int P; C c; #ifdef LIBCPP_HAS_BAD_NEWS_FOR_MOMO assert(c.max_load_factor() == 1); c.max_load_factor(2.5); assert(c.max_load_factor() == 2.5); #else c.max_load_factor(0.5); assert(c.max_load_factor() == 0.5); #endif } //#if __cplusplus >= 201103L #ifdef LIBCPP_TEST_MIN_ALLOCATOR { typedef unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; typedef int P; const C c; assert(c.max_load_factor() == 1); } { typedef unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; typedef int 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 unordered_set<int> C; C c; LIBCPP_CATCH(c.max_load_factor(-0.5f)); //assert(false); } #endif }
int main() { { typedef std::unordered_set<int> C; typedef int P; const C c; assert(c.max_load_factor() == 1); } { typedef std::unordered_set<int> C; typedef int 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_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; typedef int P; const C c; assert(c.max_load_factor() == 1); } { typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; typedef int 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_set<int> C; C c; c.max_load_factor(-0.5f); assert(false); } #endif }
int main(int, char**) { { typedef std::unordered_multimap<int, std::string> C; const C c; assert(c.max_load_factor() == 1); } { typedef std::unordered_multimap<int, std::string> C; C c; assert(c.max_load_factor() == 1); c.max_load_factor(2.5); assert(c.max_load_factor() == 2.5); } #if TEST_STD_VER >= 11 { typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>, min_allocator<std::pair<const int, std::string>>> C; const C c; assert(c.max_load_factor() == 1); } { typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>, min_allocator<std::pair<const int, std::string>>> C; 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<int, std::string> C; C c; c.max_load_factor(0); assert(false); } #endif return 0; }