forked from boostorg/unordered
Unordered: Import functions into boost namespace.
[SVN r72905]
This commit is contained in:
@@ -25,15 +25,6 @@ namespace unordered
|
|||||||
class P = std::equal_to<K>,
|
class P = std::equal_to<K>,
|
||||||
class A = std::allocator<std::pair<const K, T> > >
|
class A = std::allocator<std::pair<const K, T> > >
|
||||||
class unordered_map;
|
class unordered_map;
|
||||||
template <class K, class T, class H, class P, class A>
|
|
||||||
inline bool operator==(unordered_map<K, T, H, P, A> const&,
|
|
||||||
unordered_map<K, T, H, P, A> const&);
|
|
||||||
template <class K, class T, class H, class P, class A>
|
|
||||||
inline bool operator!=(unordered_map<K, T, H, P, A> const&,
|
|
||||||
unordered_map<K, T, H, P, A> const&);
|
|
||||||
template <class K, class T, class H, class P, class A>
|
|
||||||
inline void swap(unordered_map<K, T, H, P, A>&,
|
|
||||||
unordered_map<K, T, H, P, A>&);
|
|
||||||
|
|
||||||
template <class K,
|
template <class K,
|
||||||
class T,
|
class T,
|
||||||
@@ -41,46 +32,18 @@ namespace unordered
|
|||||||
class P = std::equal_to<K>,
|
class P = std::equal_to<K>,
|
||||||
class A = std::allocator<std::pair<const K, T> > >
|
class A = std::allocator<std::pair<const K, T> > >
|
||||||
class unordered_multimap;
|
class unordered_multimap;
|
||||||
template <class K, class T, class H, class P, class A>
|
|
||||||
inline bool operator==(unordered_multimap<K, T, H, P, A> const&,
|
|
||||||
unordered_multimap<K, T, H, P, A> const&);
|
|
||||||
template <class K, class T, class H, class P, class A>
|
|
||||||
inline bool operator!=(unordered_multimap<K, T, H, P, A> const&,
|
|
||||||
unordered_multimap<K, T, H, P, A> const&);
|
|
||||||
template <class K, class T, class H, class P, class A>
|
|
||||||
inline void swap(unordered_multimap<K, T, H, P, A>&,
|
|
||||||
unordered_multimap<K, T, H, P, A>&);
|
|
||||||
|
|
||||||
template <class T,
|
template <class T,
|
||||||
class H = hash<T>,
|
class H = hash<T>,
|
||||||
class P = std::equal_to<T>,
|
class P = std::equal_to<T>,
|
||||||
class A = std::allocator<T> >
|
class A = std::allocator<T> >
|
||||||
class unordered_set;
|
class unordered_set;
|
||||||
template <class T, class H, class P, class A>
|
|
||||||
inline bool operator==(unordered_set<T, H, P, A> const&,
|
|
||||||
unordered_set<T, H, P, A> const&);
|
|
||||||
template <class T, class H, class P, class A>
|
|
||||||
inline bool operator!=(unordered_set<T, H, P, A> const&,
|
|
||||||
unordered_set<T, H, P, A> const&);
|
|
||||||
template <class T, class H, class P, class A>
|
|
||||||
inline void swap(unordered_set<T, H, P, A> &m1,
|
|
||||||
unordered_set<T, H, P, A> &m2);
|
|
||||||
|
|
||||||
template <class T,
|
template <class T,
|
||||||
class H = hash<T>,
|
class H = hash<T>,
|
||||||
class P = std::equal_to<T>,
|
class P = std::equal_to<T>,
|
||||||
class A = std::allocator<T> >
|
class A = std::allocator<T> >
|
||||||
class unordered_multiset;
|
class unordered_multiset;
|
||||||
template <class T, class H, class P, class A>
|
|
||||||
inline bool operator==(unordered_multiset<T, H, P, A> const&,
|
|
||||||
unordered_multiset<T, H, P, A> const&);
|
|
||||||
template <class T, class H, class P, class A>
|
|
||||||
inline bool operator!=(unordered_multiset<T, H, P, A> const&,
|
|
||||||
unordered_multiset<T, H, P, A> const&);
|
|
||||||
template <class T, class H, class P, class A>
|
|
||||||
inline void swap(unordered_multiset<T, H, P, A> &m1,
|
|
||||||
unordered_multiset<T, H, P, A> &m2);
|
|
||||||
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -14,8 +14,34 @@
|
|||||||
|
|
||||||
namespace boost
|
namespace boost
|
||||||
{
|
{
|
||||||
|
namespace unordered
|
||||||
|
{
|
||||||
|
template <class K, class T, class H, class P, class A>
|
||||||
|
inline bool operator==(unordered_map<K, T, H, P, A> const&,
|
||||||
|
unordered_map<K, T, H, P, A> const&);
|
||||||
|
template <class K, class T, class H, class P, class A>
|
||||||
|
inline bool operator!=(unordered_map<K, T, H, P, A> const&,
|
||||||
|
unordered_map<K, T, H, P, A> const&);
|
||||||
|
template <class K, class T, class H, class P, class A>
|
||||||
|
inline void swap(unordered_map<K, T, H, P, A>&,
|
||||||
|
unordered_map<K, T, H, P, A>&);
|
||||||
|
|
||||||
|
template <class K, class T, class H, class P, class A>
|
||||||
|
inline bool operator==(unordered_multimap<K, T, H, P, A> const&,
|
||||||
|
unordered_multimap<K, T, H, P, A> const&);
|
||||||
|
template <class K, class T, class H, class P, class A>
|
||||||
|
inline bool operator!=(unordered_multimap<K, T, H, P, A> const&,
|
||||||
|
unordered_multimap<K, T, H, P, A> const&);
|
||||||
|
template <class K, class T, class H, class P, class A>
|
||||||
|
inline void swap(unordered_multimap<K, T, H, P, A>&,
|
||||||
|
unordered_multimap<K, T, H, P, A>&);
|
||||||
|
}
|
||||||
|
|
||||||
using ::boost::unordered::unordered_map;
|
using ::boost::unordered::unordered_map;
|
||||||
using ::boost::unordered::unordered_multimap;
|
using ::boost::unordered::unordered_multimap;
|
||||||
|
using ::boost::unordered::swap;
|
||||||
|
using ::boost::unordered::operator==;
|
||||||
|
using ::boost::unordered::operator!=;
|
||||||
}
|
}
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
@@ -14,8 +14,34 @@
|
|||||||
|
|
||||||
namespace boost
|
namespace boost
|
||||||
{
|
{
|
||||||
|
namespace unordered
|
||||||
|
{
|
||||||
|
template <class T, class H, class P, class A>
|
||||||
|
inline bool operator==(unordered_set<T, H, P, A> const&,
|
||||||
|
unordered_set<T, H, P, A> const&);
|
||||||
|
template <class T, class H, class P, class A>
|
||||||
|
inline bool operator!=(unordered_set<T, H, P, A> const&,
|
||||||
|
unordered_set<T, H, P, A> const&);
|
||||||
|
template <class T, class H, class P, class A>
|
||||||
|
inline void swap(unordered_set<T, H, P, A> &m1,
|
||||||
|
unordered_set<T, H, P, A> &m2);
|
||||||
|
|
||||||
|
template <class T, class H, class P, class A>
|
||||||
|
inline bool operator==(unordered_multiset<T, H, P, A> const&,
|
||||||
|
unordered_multiset<T, H, P, A> const&);
|
||||||
|
template <class T, class H, class P, class A>
|
||||||
|
inline bool operator!=(unordered_multiset<T, H, P, A> const&,
|
||||||
|
unordered_multiset<T, H, P, A> const&);
|
||||||
|
template <class T, class H, class P, class A>
|
||||||
|
inline void swap(unordered_multiset<T, H, P, A> &m1,
|
||||||
|
unordered_multiset<T, H, P, A> &m2);
|
||||||
|
}
|
||||||
|
|
||||||
using ::boost::unordered::unordered_set;
|
using ::boost::unordered::unordered_set;
|
||||||
using ::boost::unordered::unordered_multiset;
|
using ::boost::unordered::unordered_multiset;
|
||||||
|
using ::boost::unordered::swap;
|
||||||
|
using ::boost::unordered::operator==;
|
||||||
|
using ::boost::unordered::operator!=;
|
||||||
}
|
}
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
@@ -129,6 +129,7 @@ void container_test(X& r, T const&)
|
|||||||
test::check_return_type<const_iterator>::equals(a_const.cend());
|
test::check_return_type<const_iterator>::equals(a_const.cend());
|
||||||
|
|
||||||
a.swap(b);
|
a.swap(b);
|
||||||
|
boost::swap(a, b);
|
||||||
test::check_return_type<X>::equals_ref(r = a);
|
test::check_return_type<X>::equals_ref(r = a);
|
||||||
test::check_return_type<size_type>::equals(a.size());
|
test::check_return_type<size_type>::equals(a.size());
|
||||||
test::check_return_type<size_type>::equals(a.max_size());
|
test::check_return_type<size_type>::equals(a.max_size());
|
||||||
@@ -180,6 +181,8 @@ void equality_test(X& r)
|
|||||||
|
|
||||||
test::check_return_type<bool>::equals(a == b);
|
test::check_return_type<bool>::equals(a == b);
|
||||||
test::check_return_type<bool>::equals(a != b);
|
test::check_return_type<bool>::equals(a != b);
|
||||||
|
test::check_return_type<bool>::equals(boost::operator==(a, b));
|
||||||
|
test::check_return_type<bool>::equals(boost::operator!=(a, b));
|
||||||
}
|
}
|
||||||
|
|
||||||
template <class X, class T>
|
template <class X, class T>
|
||||||
|
Reference in New Issue
Block a user