mirror of
https://github.com/boostorg/unordered.git
synced 2025-10-30 23:31:41 +01:00
6f45d36d97
Remove deprecated headers, move hash_fwd.hpp into hash subdirectory. And several minor internal changes. Mostly minor internal details. Merged revisions 51262-51263,51407-51409,51504-51505,51644-51646,51667 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r51262 | danieljames | 2009-02-15 19:32:04 +0000 (Sun, 15 Feb 2009) | 1 line Use the new 'boost:' links for the hash, unordered and quickbook documentation. ........ r51263 | danieljames | 2009-02-15 19:32:19 +0000 (Sun, 15 Feb 2009) | 2 lines Don't copy images for the standalone hash and unordered documentation, was only really required before the libraries were integrated into boost. ........ r51407 | danieljames | 2009-02-22 23:49:51 +0000 (Sun, 22 Feb 2009) | 1 line Fix the hash dirname. ........ r51408 | danieljames | 2009-02-22 23:50:04 +0000 (Sun, 22 Feb 2009) | 1 line Make copy_buckets and move_buckets member functions - so that calling them is a bit simpler. ........ r51409 | danieljames | 2009-02-22 23:50:20 +0000 (Sun, 22 Feb 2009) | 1 line Move some of the data structure classes out of hash table data. ........ r51504 | danieljames | 2009-03-01 14:15:09 +0000 (Sun, 01 Mar 2009) | 1 line Add missing return for operator=. ........ r51505 | danieljames | 2009-03-01 14:15:39 +0000 (Sun, 01 Mar 2009) | 3 lines Make the sort stable. Doesn't really matter, but it might as well be. ........ r51644 | danieljames | 2009-03-08 09:44:51 +0000 (Sun, 08 Mar 2009) | 1 line Detab. ........ r51645 | danieljames | 2009-03-08 09:45:11 +0000 (Sun, 08 Mar 2009) | 4 lines Move hash_fwd into the hash subdirectory. I should have done this in the last release. But now all of the hash implementation is in the hash subdirectory. ........ r51646 | danieljames | 2009-03-08 09:45:30 +0000 (Sun, 08 Mar 2009) | 3 lines Remove deprecated headers. Fixes #2412. ........ r51667 | danieljames | 2009-03-09 20:56:23 +0000 (Mon, 09 Mar 2009) | 1 line Update copyright dates in hash and unordered. ........ [SVN r51729]
82 lines
2.7 KiB
C++
82 lines
2.7 KiB
C++
|
|
// Copyright 2005-2009 Daniel James.
|
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#if !defined(BOOST_UNORDERED_TEST_HELPERS_METAFUNCTIONS_HEADER)
|
|
#define BOOST_UNORDERED_TEST_HELPERS_METAFUNCTIONS_HEADER
|
|
|
|
#include <boost/config.hpp>
|
|
#include <boost/type_traits/is_same.hpp>
|
|
#include <boost/mpl/not.hpp>
|
|
#include <boost/unordered_set.hpp>
|
|
#include <boost/unordered_map.hpp>
|
|
|
|
namespace test
|
|
{
|
|
/*
|
|
struct unordered_set_type { char x[100]; };
|
|
struct unordered_multiset_type { char x[200]; };
|
|
struct unordered_map_type { char x[300]; };
|
|
struct unordered_multimap_type { char x[400]; };
|
|
|
|
template <class V, class H, class P, class A>
|
|
unordered_set_type container_type(
|
|
boost::unordered_set<V, H, P, A> const*);
|
|
template <class V, class H, class P, class A>
|
|
unordered_multiset_type container_type(
|
|
boost::unordered_multiset<V, H, P, A> const*);
|
|
template <class K, class M, class H, class P, class A>
|
|
unordered_map_type container_type(
|
|
boost::unordered_map<K, M, H, P, A> const*);
|
|
template <class K, class M, class H, class P, class A>
|
|
unordered_multimap_type container_type(
|
|
boost::unordered_multimap<K, M, H, P, A> const*);
|
|
*/
|
|
|
|
template <class Container>
|
|
struct is_set
|
|
: public boost::is_same<
|
|
BOOST_DEDUCED_TYPENAME Container::key_type,
|
|
BOOST_DEDUCED_TYPENAME Container::value_type> {};
|
|
|
|
template <class Container>
|
|
struct is_map
|
|
: public boost::mpl::not_<is_set<Container> > {};
|
|
|
|
struct yes_type { char x[100]; };
|
|
struct no_type { char x[200]; };
|
|
|
|
template <class V, class H, class P, class A>
|
|
yes_type has_unique_key_impl(
|
|
boost::unordered_set<V, H, P, A> const*);
|
|
template <class V, class H, class P, class A>
|
|
no_type has_unique_key_impl(
|
|
boost::unordered_multiset<V, H, P, A> const*);
|
|
template <class K, class M, class H, class P, class A>
|
|
yes_type has_unique_key_impl(
|
|
boost::unordered_map<K, M, H, P, A> const*);
|
|
template <class K, class M, class H, class P, class A>
|
|
no_type has_unique_key_impl(
|
|
boost::unordered_multimap<K, M, H, P, A> const*);
|
|
|
|
template <class Container>
|
|
struct has_unique_keys
|
|
{
|
|
BOOST_STATIC_CONSTANT(bool, value =
|
|
sizeof(has_unique_key_impl((Container const*)0))
|
|
== sizeof(yes_type));
|
|
};
|
|
|
|
template <class Container>
|
|
struct has_equivalent_keys
|
|
{
|
|
BOOST_STATIC_CONSTANT(bool, value =
|
|
sizeof(has_unique_key_impl((Container const*)0))
|
|
== sizeof(no_type));
|
|
};
|
|
}
|
|
|
|
#endif
|
|
|