// class map
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// size_type count(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class map
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// size_type count(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class map
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// size_type count(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class map
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// size_type count(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
#include <map>
#include <utility>
-#include "min_allocator.h"
-#include "private_constructor.h"
-#include "test_macros.h"
-
struct Comp {
using is_transparent = void;
// class map
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// pair<iterator,iterator> equal_range(const key_type& k);
+// pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class map
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// pair<iterator,iterator> equal_range(const key_type& k);
+// pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class map
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// pair<iterator,iterator> equal_range(const key_type& k);
+// pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class map
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// pair<iterator,iterator> equal_range(const key_type& k);
+// pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
#include <map>
#include <utility>
-#include "min_allocator.h"
-#include "private_constructor.h"
-#include "test_macros.h"
-
struct Comp {
using is_transparent = void;
// class multimap
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// size_type count(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class multimap
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// size_type count(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class multimap
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// size_type count(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class multimap
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// size_type count(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
#include <map>
#include <utility>
-#include "min_allocator.h"
-#include "private_constructor.h"
-#include "test_macros.h"
-
struct Comp {
using is_transparent = void;
// class multimap
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// pair<iterator, iterator> equal_range(const key_type& k);
+// pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class multimap
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// pair<iterator, iterator> equal_range(const key_type& k);
+// pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class multimap
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// pair<iterator, iterator> equal_range(const key_type& k);
+// pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// class multimap
-// iterator find(const key_type& k);
-// const_iterator find(const key_type& k) const;
+// pair<iterator, iterator> equal_range(const key_type& k);
+// pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
#include <map>
#include <utility>
-#include "min_allocator.h"
-#include "private_constructor.h"
-#include "test_macros.h"
-
struct Comp {
using is_transparent = void;
// class multiset
// template<typename K>
-// iterator lower_bound(const K& x); // C++14
-// template<typename K>
-// const_iterator lower_bound(const K& x) const; // C++14
+// size_type count(const K& x) const; // C++14
#include <cassert>
#include <set>
#include <utility>
-#include "min_allocator.h"
-#include "private_constructor.h"
-#include "test_macros.h"
-
struct Comp {
using is_transparent = void;
#include <set>
#include <utility>
-#include "min_allocator.h"
-#include "private_constructor.h"
-#include "test_macros.h"
-
struct Comp {
using is_transparent = void;
// class set
-// template<typename K>
-// iterator lower_bound(const K& x); // C++14
-// template<typename K>
-// const_iterator lower_bound(const K& x) const; // C++14
+// template<typename K>
+// size_type count(const K& x) const; // C++14
#include <cassert>
#include <set>
#include <utility>
-#include "min_allocator.h"
-#include "private_constructor.h"
-#include "test_macros.h"
-
struct Comp {
using is_transparent = void;
#include <set>
#include <utility>
-#include "min_allocator.h"
-#include "private_constructor.h"
-#include "test_macros.h"
-
struct Comp {
using is_transparent = void;