mirror of
				https://github.com/boostorg/unordered.git
				synced 2025-11-04 09:41:40 +01:00 
			
		
		
		
	hopefully better cross-platform support. Merged revisions 44778-44835,44837-44918 via svnmerge from https://svn.boost.org/svn/boost/branches/unordered/trunk ........ r44778 | danieljames | 2008-04-26 17:15:44 +0100 (Sat, 26 Apr 2008) | 2 lines Remove a trailing comma. ........ r44779 | danieljames | 2008-04-26 17:23:51 +0100 (Sat, 26 Apr 2008) | 1 line Merge in support for equality operators. ........ r44780 | danieljames | 2008-04-26 17:28:44 +0100 (Sat, 26 Apr 2008) | 1 line Use my own list container to avoid working around STL container bugs. ........ r44833 | danieljames | 2008-04-28 08:03:43 +0100 (Mon, 28 Apr 2008) | 1 line Better equality tests. ........ r44834 | danieljames | 2008-04-28 08:04:03 +0100 (Mon, 28 Apr 2008) | 1 line Remove a superfluous check. ........ r44835 | danieljames | 2008-04-28 08:04:21 +0100 (Mon, 28 Apr 2008) | 1 line Add equality reference documentation. ........ r44916 | danieljames | 2008-04-30 08:16:52 +0100 (Wed, 30 Apr 2008) | 1 line New version of list.hpp ........ r44917 | danieljames | 2008-04-30 08:18:31 +0100 (Wed, 30 Apr 2008) | 1 line Support compilers without ADL in the compile tests. ........ r44918 | danieljames | 2008-04-30 08:25:20 +0100 (Wed, 30 Apr 2008) | 7 lines Change the typedef of buffered functions as it was confusing MSVC 6.5 get_allocator wasn't compiling when the allocator workaround is used because it couldn't cast from the wrapped allocator to an allocator of another type. So use value_alloc_ when it's available (it's only unavailable on compilers with C++0x support, which don't require the workaround). ........ [SVN r44919]
		
			
				
	
	
		
			82 lines
		
	
	
		
			2.7 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			82 lines
		
	
	
		
			2.7 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
 | 
						|
// Copyright 2005-2008 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
 | 
						|
 |