2006-03-19 22:24:06 +00:00
|
|
|
|
2009-03-09 20:56:23 +00:00
|
|
|
// Copyright 2006-2009 Daniel James.
|
2006-07-01 22:31:26 +00:00
|
|
|
// 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)
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2008-01-08 13:59:01 +00:00
|
|
|
// Define some minimal classes which provide the bare minimum concepts to
|
|
|
|
// test that the containers don't rely on something that they shouldn't.
|
|
|
|
// They are not intended to be good examples of how to implement the concepts.
|
|
|
|
|
2006-03-19 22:24:06 +00:00
|
|
|
#if !defined(BOOST_UNORDERED_OBJECTS_MINIMAL_HEADER)
|
|
|
|
#define BOOST_UNORDERED_OBJECTS_MINIMAL_HEADER
|
|
|
|
|
2011-08-16 22:17:11 +00:00
|
|
|
#include <boost/move/move.hpp>
|
2017-02-19 13:05:17 +00:00
|
|
|
#include <cstddef>
|
2011-08-16 22:17:11 +00:00
|
|
|
#include <utility>
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2007-08-14 09:55:30 +00:00
|
|
|
#if defined(BOOST_MSVC)
|
|
|
|
#pragma warning(push)
|
2017-02-19 13:05:17 +00:00
|
|
|
#pragma warning(disable : 4100) // unreferenced formal parameter
|
2007-08-14 09:55:30 +00:00
|
|
|
#endif
|
|
|
|
|
2014-11-16 10:01:17 +00:00
|
|
|
#if !BOOST_WORKAROUND(BOOST_MSVC, == 1500)
|
2014-12-03 18:28:40 +00:00
|
|
|
#define BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED 1
|
2014-11-16 10:01:17 +00:00
|
|
|
#else
|
2014-12-03 18:28:40 +00:00
|
|
|
#define BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED 0
|
2014-11-16 10:01:17 +00:00
|
|
|
#endif
|
|
|
|
|
2017-02-19 13:05:17 +00:00
|
|
|
namespace test {
|
2017-06-11 20:55:59 +01:00
|
|
|
namespace minimal {
|
|
|
|
class destructible;
|
|
|
|
class copy_constructible;
|
|
|
|
class copy_constructible_equality_comparable;
|
|
|
|
class default_assignable;
|
|
|
|
class assignable;
|
|
|
|
|
|
|
|
struct ampersand_operator_used
|
2006-03-19 22:24:06 +00:00
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
ampersand_operator_used() { BOOST_TEST(false); }
|
|
|
|
};
|
|
|
|
|
|
|
|
template <class T> class hash;
|
|
|
|
template <class T> class equal_to;
|
|
|
|
template <class T> class ptr;
|
|
|
|
template <class T> class const_ptr;
|
|
|
|
template <class T> class allocator;
|
|
|
|
template <class T> class cxx11_allocator;
|
|
|
|
|
|
|
|
struct constructor_param
|
|
|
|
{
|
|
|
|
operator int() const { return 0; }
|
|
|
|
};
|
|
|
|
|
|
|
|
class destructible
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
destructible(constructor_param const&) {}
|
|
|
|
~destructible() {}
|
|
|
|
void dummy_member() const {}
|
2017-10-05 10:54:22 +01:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
private:
|
|
|
|
destructible(destructible const&);
|
|
|
|
destructible& operator=(destructible const&);
|
|
|
|
};
|
|
|
|
|
|
|
|
class copy_constructible
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
copy_constructible(constructor_param const&) {}
|
|
|
|
copy_constructible(copy_constructible const&) {}
|
|
|
|
~copy_constructible() {}
|
|
|
|
void dummy_member() const {}
|
2017-10-05 10:54:22 +01:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
private:
|
|
|
|
copy_constructible& operator=(copy_constructible const&);
|
|
|
|
copy_constructible() {}
|
|
|
|
};
|
|
|
|
|
|
|
|
class copy_constructible_equality_comparable
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
copy_constructible_equality_comparable(constructor_param const&) {}
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
copy_constructible_equality_comparable(
|
|
|
|
copy_constructible_equality_comparable const&)
|
|
|
|
{
|
|
|
|
}
|
Merge in support for equality operators for the unordered containers and
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]
2008-04-30 07:57:04 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
~copy_constructible_equality_comparable() {}
|
|
|
|
|
|
|
|
void dummy_member() const {}
|
2017-10-05 10:54:22 +01:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
private:
|
|
|
|
copy_constructible_equality_comparable& operator=(
|
2017-02-19 13:05:17 +00:00
|
|
|
copy_constructible_equality_comparable const&);
|
2017-06-11 20:55:59 +01:00
|
|
|
copy_constructible_equality_comparable() {}
|
2017-02-19 13:05:17 +00:00
|
|
|
#if BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED
|
2017-06-11 20:55:59 +01:00
|
|
|
ampersand_operator_used operator&() const
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return ampersand_operator_used();
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2017-02-19 13:05:17 +00:00
|
|
|
#endif
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
Merge in support for equality operators for the unordered containers and
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]
2008-04-30 07:57:04 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
bool operator==(copy_constructible_equality_comparable,
|
|
|
|
copy_constructible_equality_comparable)
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
Merge in support for equality operators for the unordered containers and
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]
2008-04-30 07:57:04 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
bool operator!=(copy_constructible_equality_comparable,
|
|
|
|
copy_constructible_equality_comparable)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
class default_assignable
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
default_assignable(constructor_param const&) {}
|
2010-01-04 22:49:39 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
default_assignable() {}
|
2010-01-04 22:49:39 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
default_assignable(default_assignable const&) {}
|
2010-01-04 22:49:39 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
default_assignable& operator=(default_assignable const&) { return *this; }
|
2012-08-25 21:56:16 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
~default_assignable() {}
|
2010-11-13 12:31:54 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void dummy_member() const {}
|
2014-11-16 10:01:17 +00:00
|
|
|
|
2014-12-03 18:28:40 +00:00
|
|
|
#if BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED
|
2017-06-11 20:55:59 +01:00
|
|
|
ampersand_operator_used operator&() const
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return ampersand_operator_used();
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2014-12-03 18:28:40 +00:00
|
|
|
#endif
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
class assignable
|
2017-02-19 13:05:17 +00:00
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
public:
|
|
|
|
assignable(constructor_param const&) {}
|
|
|
|
assignable(assignable const&) {}
|
|
|
|
assignable& operator=(assignable const&) { return *this; }
|
|
|
|
~assignable() {}
|
|
|
|
void dummy_member() const {}
|
2017-10-05 10:54:22 +01:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
private:
|
|
|
|
assignable() {}
|
|
|
|
#if BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED
|
|
|
|
ampersand_operator_used operator&() const
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return ampersand_operator_used();
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2014-12-03 18:28:40 +00:00
|
|
|
#endif
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
struct movable_init
|
|
|
|
{
|
|
|
|
};
|
|
|
|
|
|
|
|
class movable1
|
|
|
|
{
|
|
|
|
BOOST_MOVABLE_BUT_NOT_COPYABLE(movable1)
|
|
|
|
|
|
|
|
public:
|
|
|
|
movable1(constructor_param const&) {}
|
|
|
|
movable1() {}
|
|
|
|
explicit movable1(movable_init) {}
|
|
|
|
movable1(BOOST_RV_REF(movable1)) {}
|
|
|
|
movable1& operator=(BOOST_RV_REF(movable1)) { return *this; }
|
|
|
|
~movable1() {}
|
|
|
|
void dummy_member() const {}
|
|
|
|
};
|
2011-08-16 22:17:11 +00:00
|
|
|
|
2012-11-26 17:47:12 +00:00
|
|
|
#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
|
2017-06-11 20:55:59 +01:00
|
|
|
class movable2
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
movable2(constructor_param const&) {}
|
|
|
|
explicit movable2(movable_init) {}
|
|
|
|
movable2(movable2&&) {}
|
|
|
|
~movable2() {}
|
|
|
|
movable2& operator=(movable2&&) { return *this; }
|
|
|
|
void dummy_member() const {}
|
2017-10-05 10:54:22 +01:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
private:
|
|
|
|
movable2() {}
|
|
|
|
movable2(movable2 const&);
|
|
|
|
movable2& operator=(movable2 const&);
|
|
|
|
};
|
2011-08-16 22:17:11 +00:00
|
|
|
#else
|
2017-06-11 20:55:59 +01:00
|
|
|
typedef movable1 movable2;
|
2011-08-16 22:17:11 +00:00
|
|
|
#endif
|
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T> class hash
|
2017-02-19 13:05:17 +00:00
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
public:
|
|
|
|
hash(constructor_param const&) {}
|
|
|
|
hash() {}
|
|
|
|
hash(hash const&) {}
|
|
|
|
hash& operator=(hash const&) { return *this; }
|
|
|
|
~hash() {}
|
|
|
|
|
|
|
|
std::size_t operator()(T const&) const { return 0; }
|
|
|
|
#if BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED
|
|
|
|
ampersand_operator_used operator&() const
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return ampersand_operator_used();
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2014-12-03 18:28:40 +00:00
|
|
|
#endif
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
template <class T> class equal_to
|
2017-02-19 13:05:17 +00:00
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
public:
|
|
|
|
equal_to(constructor_param const&) {}
|
|
|
|
equal_to() {}
|
|
|
|
equal_to(equal_to const&) {}
|
|
|
|
equal_to& operator=(equal_to const&) { return *this; }
|
|
|
|
~equal_to() {}
|
|
|
|
|
|
|
|
bool operator()(T const&, T const&) const { return true; }
|
|
|
|
#if BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED
|
|
|
|
ampersand_operator_used operator&() const
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return ampersand_operator_used();
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2014-12-03 18:28:40 +00:00
|
|
|
#endif
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T> class ptr;
|
|
|
|
template <class T> class const_ptr;
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
struct void_ptr
|
|
|
|
{
|
2011-10-05 19:45:14 +00:00
|
|
|
#if !defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS)
|
2017-06-11 20:55:59 +01:00
|
|
|
template <typename T> friend class ptr;
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
private:
|
2011-10-05 19:45:14 +00:00
|
|
|
#endif
|
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void* ptr_;
|
2011-10-05 19:45:14 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
public:
|
|
|
|
void_ptr() : ptr_(0) {}
|
2011-10-05 19:45:14 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <typename T> explicit void_ptr(ptr<T> const& x) : ptr_(x.ptr_) {}
|
2011-10-05 19:45:14 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
// I'm not using the safe bool idiom because the containers should be
|
|
|
|
// able to cope with bool conversions.
|
|
|
|
operator bool() const { return !!ptr_; }
|
2011-10-05 19:45:14 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
bool operator==(void_ptr const& x) const { return ptr_ == x.ptr_; }
|
|
|
|
bool operator!=(void_ptr const& x) const { return ptr_ != x.ptr_; }
|
|
|
|
};
|
2011-10-05 19:45:14 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
class void_const_ptr
|
|
|
|
{
|
2011-10-05 19:45:14 +00:00
|
|
|
#if !defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS)
|
2017-06-11 20:55:59 +01:00
|
|
|
template <typename T> friend class const_ptr;
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
private:
|
2011-10-05 19:45:14 +00:00
|
|
|
#endif
|
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void* ptr_;
|
2011-10-05 19:45:14 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
public:
|
|
|
|
void_const_ptr() : ptr_(0) {}
|
2011-10-05 19:45:14 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <typename T>
|
|
|
|
explicit void_const_ptr(const_ptr<T> const& x) : ptr_(x.ptr_)
|
|
|
|
{
|
|
|
|
}
|
2011-10-05 19:45:14 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
// I'm not using the safe bool idiom because the containers should be
|
|
|
|
// able to cope with bool conversions.
|
|
|
|
operator bool() const { return !!ptr_; }
|
2011-10-05 19:45:14 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
bool operator==(void_const_ptr const& x) const { return ptr_ == x.ptr_; }
|
|
|
|
bool operator!=(void_const_ptr const& x) const { return ptr_ != x.ptr_; }
|
|
|
|
};
|
2011-10-05 19:45:14 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T> class ptr
|
|
|
|
{
|
|
|
|
friend class allocator<T>;
|
|
|
|
friend class const_ptr<T>;
|
|
|
|
friend struct void_ptr;
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
T* ptr_;
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
ptr(T* x) : ptr_(x) {}
|
2017-10-05 10:54:22 +01:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
public:
|
|
|
|
ptr() : ptr_(0) {}
|
|
|
|
explicit ptr(void_ptr const& x) : ptr_((T*)x.ptr_) {}
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
T& operator*() const { return *ptr_; }
|
|
|
|
T* operator->() const { return ptr_; }
|
|
|
|
ptr& operator++()
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
++ptr_;
|
|
|
|
return *this;
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
|
|
|
ptr operator++(int)
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
ptr tmp(*this);
|
|
|
|
++ptr_;
|
|
|
|
return tmp;
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
|
|
|
ptr operator+(std::ptrdiff_t s) const { return ptr<T>(ptr_ + s); }
|
|
|
|
friend ptr operator+(std::ptrdiff_t s, ptr p)
|
|
|
|
{
|
|
|
|
return ptr<T>(s + p.ptr_);
|
|
|
|
}
|
|
|
|
T& operator[](std::ptrdiff_t s) const { return ptr_[s]; }
|
|
|
|
bool operator!() const { return !ptr_; }
|
|
|
|
|
|
|
|
// I'm not using the safe bool idiom because the containers should be
|
|
|
|
// able to cope with bool conversions.
|
|
|
|
operator bool() const { return !!ptr_; }
|
|
|
|
|
|
|
|
bool operator==(ptr const& x) const { return ptr_ == x.ptr_; }
|
|
|
|
bool operator!=(ptr const& x) const { return ptr_ != x.ptr_; }
|
|
|
|
bool operator<(ptr const& x) const { return ptr_ < x.ptr_; }
|
|
|
|
bool operator>(ptr const& x) const { return ptr_ > x.ptr_; }
|
|
|
|
bool operator<=(ptr const& x) const { return ptr_ <= x.ptr_; }
|
|
|
|
bool operator>=(ptr const& x) const { return ptr_ >= x.ptr_; }
|
2014-12-03 18:28:40 +00:00
|
|
|
#if BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED
|
2017-06-11 20:55:59 +01:00
|
|
|
ampersand_operator_used operator&() const
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return ampersand_operator_used();
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
Merge support for emplace for compilers with rvalue references and variadic templates arguments, and better use of C++0x allocators.
Merged revisions 44058-44075,44078-44084,44086-44108,44110-44365,44367,44369-44414,44416-44419,44421-44457,44467-44469,44471-44511,44513-44535,44537-44737 via svnmerge from
https://svn.boost.org/svn/boost/branches/unordered/trunk
................
r44467 | danieljames | 2008-04-16 18:35:56 +0100 (Wed, 16 Apr 2008) | 2 lines
Add C++-0x support to the test allocators.
................
r44468 | danieljames | 2008-04-16 18:36:06 +0100 (Wed, 16 Apr 2008) | 2 lines
Add a C++-0x node_constructor.
................
r44469 | danieljames | 2008-04-16 18:36:16 +0100 (Wed, 16 Apr 2008) | 2 lines
C++-0x constructor for node.
................
r44516 | danieljames | 2008-04-17 21:41:48 +0100 (Thu, 17 Apr 2008) | 16 lines
Merge in my work so far on implementing emplace for compilers with variadic
template & rvalue references.
Merged revisions 44059-44062 via svnmerge from
https://svn.boost.org/svn/boost/branches/unordered/dev
........
r44059 | danieljames | 2008-04-05 17:41:25 +0100 (Sat, 05 Apr 2008) | 1 line
First stab at implementing emplace - only for compilers with variadic template & rvalue references.
........
r44062 | danieljames | 2008-04-05 19:12:09 +0100 (Sat, 05 Apr 2008) | 1 line
Better variable template arguments, need to add proper support to BoostBook.
........
................
r44616 | danieljames | 2008-04-20 13:30:19 +0100 (Sun, 20 Apr 2008) | 1 line
Merge with trunk, fixes tabs.
................
r44618 | danieljames | 2008-04-20 13:42:38 +0100 (Sun, 20 Apr 2008) | 2 lines
Some extra compile tests.
................
r44619 | danieljames | 2008-04-20 13:42:50 +0100 (Sun, 20 Apr 2008) | 2 lines
Fix an error message.
................
r44703 | danieljames | 2008-04-21 20:19:50 +0100 (Mon, 21 Apr 2008) | 15 lines
Merge latest changes from trunk.
Merged revisions 44616-44702 via svnmerge from
https://svn.boost.org/svn/boost/trunk
........
r44650 | danieljames | 2008-04-20 22:08:57 +0100 (Sun, 20 Apr 2008) | 1 line
Update an include.
........
r44697 | danieljames | 2008-04-21 16:55:40 +0100 (Mon, 21 Apr 2008) | 1 line
Factor out the code for choosing the bucket count, and which bucket that hash values map to make it easier to experiment with alternative policies.
........
................
r44733 | danieljames | 2008-04-23 07:55:43 +0100 (Wed, 23 Apr 2008) | 2 lines
Remove 'reserve_extra'.
................
r44734 | danieljames | 2008-04-23 07:55:55 +0100 (Wed, 23 Apr 2008) | 2 lines
More unnecessary copy tests - showing some weakness in the emplace implementation.
................
r44735 | danieljames | 2008-04-23 07:56:06 +0100 (Wed, 23 Apr 2008) | 2 lines
More tests.
................
r44736 | danieljames | 2008-04-23 07:56:19 +0100 (Wed, 23 Apr 2008) | 2 lines
Comment out a test which requires a C++0x std::pair.
................
r44737 | danieljames | 2008-04-23 07:56:35 +0100 (Wed, 23 Apr 2008) | 2 lines
Avoid creating unnecessary copies in unordered_set::emplace and unordered_map::emplace.
................
[SVN r44738]
2008-04-23 07:09:58 +00:00
|
|
|
#endif
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
Merge support for emplace for compilers with rvalue references and variadic templates arguments, and better use of C++0x allocators.
Merged revisions 44058-44075,44078-44084,44086-44108,44110-44365,44367,44369-44414,44416-44419,44421-44457,44467-44469,44471-44511,44513-44535,44537-44737 via svnmerge from
https://svn.boost.org/svn/boost/branches/unordered/trunk
................
r44467 | danieljames | 2008-04-16 18:35:56 +0100 (Wed, 16 Apr 2008) | 2 lines
Add C++-0x support to the test allocators.
................
r44468 | danieljames | 2008-04-16 18:36:06 +0100 (Wed, 16 Apr 2008) | 2 lines
Add a C++-0x node_constructor.
................
r44469 | danieljames | 2008-04-16 18:36:16 +0100 (Wed, 16 Apr 2008) | 2 lines
C++-0x constructor for node.
................
r44516 | danieljames | 2008-04-17 21:41:48 +0100 (Thu, 17 Apr 2008) | 16 lines
Merge in my work so far on implementing emplace for compilers with variadic
template & rvalue references.
Merged revisions 44059-44062 via svnmerge from
https://svn.boost.org/svn/boost/branches/unordered/dev
........
r44059 | danieljames | 2008-04-05 17:41:25 +0100 (Sat, 05 Apr 2008) | 1 line
First stab at implementing emplace - only for compilers with variadic template & rvalue references.
........
r44062 | danieljames | 2008-04-05 19:12:09 +0100 (Sat, 05 Apr 2008) | 1 line
Better variable template arguments, need to add proper support to BoostBook.
........
................
r44616 | danieljames | 2008-04-20 13:30:19 +0100 (Sun, 20 Apr 2008) | 1 line
Merge with trunk, fixes tabs.
................
r44618 | danieljames | 2008-04-20 13:42:38 +0100 (Sun, 20 Apr 2008) | 2 lines
Some extra compile tests.
................
r44619 | danieljames | 2008-04-20 13:42:50 +0100 (Sun, 20 Apr 2008) | 2 lines
Fix an error message.
................
r44703 | danieljames | 2008-04-21 20:19:50 +0100 (Mon, 21 Apr 2008) | 15 lines
Merge latest changes from trunk.
Merged revisions 44616-44702 via svnmerge from
https://svn.boost.org/svn/boost/trunk
........
r44650 | danieljames | 2008-04-20 22:08:57 +0100 (Sun, 20 Apr 2008) | 1 line
Update an include.
........
r44697 | danieljames | 2008-04-21 16:55:40 +0100 (Mon, 21 Apr 2008) | 1 line
Factor out the code for choosing the bucket count, and which bucket that hash values map to make it easier to experiment with alternative policies.
........
................
r44733 | danieljames | 2008-04-23 07:55:43 +0100 (Wed, 23 Apr 2008) | 2 lines
Remove 'reserve_extra'.
................
r44734 | danieljames | 2008-04-23 07:55:55 +0100 (Wed, 23 Apr 2008) | 2 lines
More unnecessary copy tests - showing some weakness in the emplace implementation.
................
r44735 | danieljames | 2008-04-23 07:56:06 +0100 (Wed, 23 Apr 2008) | 2 lines
More tests.
................
r44736 | danieljames | 2008-04-23 07:56:19 +0100 (Wed, 23 Apr 2008) | 2 lines
Comment out a test which requires a C++0x std::pair.
................
r44737 | danieljames | 2008-04-23 07:56:35 +0100 (Wed, 23 Apr 2008) | 2 lines
Avoid creating unnecessary copies in unordered_set::emplace and unordered_map::emplace.
................
[SVN r44738]
2008-04-23 07:09:58 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T> class const_ptr
|
|
|
|
{
|
|
|
|
friend class allocator<T>;
|
|
|
|
friend struct const_void_ptr;
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
T const* ptr_;
|
2006-03-20 20:01:45 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
const_ptr(T const* ptr) : ptr_(ptr) {}
|
2017-10-05 10:54:22 +01:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
public:
|
|
|
|
const_ptr() : ptr_(0) {}
|
|
|
|
const_ptr(ptr<T> const& x) : ptr_(x.ptr_) {}
|
|
|
|
explicit const_ptr(void_const_ptr const& x) : ptr_((T const*)x.ptr_) {}
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
T const& operator*() const { return *ptr_; }
|
|
|
|
T const* operator->() const { return ptr_; }
|
|
|
|
const_ptr& operator++()
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
++ptr_;
|
|
|
|
return *this;
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
|
|
|
const_ptr operator++(int)
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
const_ptr tmp(*this);
|
|
|
|
++ptr_;
|
|
|
|
return tmp;
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
|
|
|
const_ptr operator+(std::ptrdiff_t s) const
|
|
|
|
{
|
|
|
|
return const_ptr(ptr_ + s);
|
|
|
|
}
|
|
|
|
friend const_ptr operator+(std::ptrdiff_t s, const_ptr p)
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return ptr<T>(s + p.ptr_);
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
|
|
|
T const& operator[](int s) const { return ptr_[s]; }
|
|
|
|
bool operator!() const { return !ptr_; }
|
|
|
|
operator bool() const { return !!ptr_; }
|
|
|
|
|
|
|
|
bool operator==(const_ptr const& x) const { return ptr_ == x.ptr_; }
|
|
|
|
bool operator!=(const_ptr const& x) const { return ptr_ != x.ptr_; }
|
|
|
|
bool operator<(const_ptr const& x) const { return ptr_ < x.ptr_; }
|
|
|
|
bool operator>(const_ptr const& x) const { return ptr_ > x.ptr_; }
|
|
|
|
bool operator<=(const_ptr const& x) const { return ptr_ <= x.ptr_; }
|
|
|
|
bool operator>=(const_ptr const& x) const { return ptr_ >= x.ptr_; }
|
2014-12-03 18:28:40 +00:00
|
|
|
#if BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED
|
2017-06-11 20:55:59 +01:00
|
|
|
ampersand_operator_used operator&() const
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return ampersand_operator_used();
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2014-12-03 18:28:40 +00:00
|
|
|
#endif
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
template <class T> class allocator
|
2006-03-19 22:24:06 +00:00
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
public:
|
|
|
|
typedef std::size_t size_type;
|
|
|
|
typedef std::ptrdiff_t difference_type;
|
|
|
|
typedef void_ptr void_pointer;
|
|
|
|
typedef void_const_ptr const_void_pointer;
|
|
|
|
typedef ptr<T> pointer;
|
|
|
|
typedef const_ptr<T> const_pointer;
|
|
|
|
typedef T& reference;
|
|
|
|
typedef T const& const_reference;
|
|
|
|
typedef T value_type;
|
|
|
|
|
|
|
|
template <class U> struct rebind
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
typedef allocator<U> other;
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
allocator() {}
|
|
|
|
template <class Y> allocator(allocator<Y> const&) {}
|
|
|
|
allocator(allocator const&) {}
|
|
|
|
~allocator() {}
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
pointer address(reference r) { return pointer(&r); }
|
|
|
|
const_pointer address(const_reference r) { return const_pointer(&r); }
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
pointer allocate(size_type n)
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return pointer(static_cast<T*>(::operator new(n * sizeof(T))));
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2006-03-19 22:24:06 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class Y> pointer allocate(size_type n, const_ptr<Y>)
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return pointer(static_cast<T*>(::operator new(n * sizeof(T))));
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void deallocate(pointer p, size_type)
|
|
|
|
{
|
|
|
|
::operator delete((void*)p.ptr_);
|
|
|
|
}
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void construct(T* p, T const& t) { new ((void*)p) T(t); }
|
2017-02-19 13:05:17 +00:00
|
|
|
|
|
|
|
#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class... Args> void construct(T* p, BOOST_FWD_REF(Args)... args)
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
new ((void*)p) T(boost::forward<Args>(args)...);
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2017-02-19 13:05:17 +00:00
|
|
|
#endif
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void destroy(T* p) { p->~T(); }
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
size_type max_size() const { return 1000; }
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-02-19 13:05:17 +00:00
|
|
|
#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) || \
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
|
|
|
|
public:
|
|
|
|
allocator& operator=(allocator const&) { return *this; }
|
2017-02-19 13:05:17 +00:00
|
|
|
#else
|
2017-06-11 20:55:59 +01:00
|
|
|
private:
|
|
|
|
allocator& operator=(allocator const&);
|
2017-02-19 13:05:17 +00:00
|
|
|
#endif
|
|
|
|
#if BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED
|
2017-06-11 20:55:59 +01:00
|
|
|
ampersand_operator_used operator&() const
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return ampersand_operator_used();
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2017-02-19 13:05:17 +00:00
|
|
|
#endif
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
template <class T> class allocator<T const>
|
2017-02-23 20:14:27 +00:00
|
|
|
{
|
2017-06-11 20:55:59 +01:00
|
|
|
public:
|
|
|
|
typedef std::size_t size_type;
|
|
|
|
typedef std::ptrdiff_t difference_type;
|
|
|
|
typedef void_ptr void_pointer;
|
|
|
|
typedef void_const_ptr const_void_pointer;
|
|
|
|
// Maybe these two should be const_ptr<T>
|
|
|
|
typedef ptr<T const> pointer;
|
|
|
|
typedef const_ptr<T const> const_pointer;
|
|
|
|
typedef T const& reference;
|
|
|
|
typedef T const& const_reference;
|
|
|
|
typedef T const value_type;
|
|
|
|
|
|
|
|
template <class U> struct rebind
|
|
|
|
{
|
2017-02-23 20:14:27 +00:00
|
|
|
typedef allocator<U> other;
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
2017-02-23 20:14:27 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
allocator() {}
|
|
|
|
template <class Y> allocator(allocator<Y> const&) {}
|
|
|
|
allocator(allocator const&) {}
|
|
|
|
~allocator() {}
|
2017-02-23 20:14:27 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
const_pointer address(const_reference r) { return const_pointer(&r); }
|
2017-02-23 20:14:27 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
pointer allocate(size_type n)
|
|
|
|
{
|
2017-02-23 20:14:27 +00:00
|
|
|
return pointer(static_cast<T const*>(::operator new(n * sizeof(T))));
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2017-02-23 20:14:27 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class Y> pointer allocate(size_type n, const_ptr<Y>)
|
|
|
|
{
|
2017-02-23 20:14:27 +00:00
|
|
|
return pointer(static_cast<T const*>(::operator new(n * sizeof(T))));
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2017-02-23 20:14:27 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void deallocate(pointer p, size_type)
|
|
|
|
{
|
|
|
|
::operator delete((void*)p.ptr_);
|
|
|
|
}
|
2017-02-23 20:14:27 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void construct(T const* p, T const& t) { new ((void*)p) T(t); }
|
2017-02-23 20:14:27 +00:00
|
|
|
|
|
|
|
#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class... Args>
|
|
|
|
void construct(T const* p, BOOST_FWD_REF(Args)... args)
|
|
|
|
{
|
2017-02-23 20:14:27 +00:00
|
|
|
new ((void*)p) T(boost::forward<Args>(args)...);
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2017-02-23 20:14:27 +00:00
|
|
|
#endif
|
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void destroy(T const* p) { p->~T(); }
|
2017-02-23 20:14:27 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
size_type max_size() const { return 1000; }
|
2017-02-23 20:14:27 +00:00
|
|
|
|
|
|
|
#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) || \
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
|
|
|
|
public:
|
|
|
|
allocator& operator=(allocator const&) { return *this; }
|
2017-02-23 20:14:27 +00:00
|
|
|
#else
|
2017-06-11 20:55:59 +01:00
|
|
|
private:
|
|
|
|
allocator& operator=(allocator const&);
|
2017-02-23 20:14:27 +00:00
|
|
|
#endif
|
|
|
|
#if BOOST_UNORDERED_CHECK_ADDR_OPERATOR_NOT_USED
|
2017-06-11 20:55:59 +01:00
|
|
|
ampersand_operator_used operator&() const
|
|
|
|
{
|
2017-02-23 20:14:27 +00:00
|
|
|
return ampersand_operator_used();
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2017-02-23 20:14:27 +00:00
|
|
|
#endif
|
2017-06-11 20:55:59 +01:00
|
|
|
};
|
2017-02-23 20:14:27 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T>
|
|
|
|
inline bool operator==(allocator<T> const&, allocator<T> const&)
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T>
|
|
|
|
inline bool operator!=(allocator<T> const&, allocator<T> const&)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T> void swap(allocator<T>&, allocator<T>&) {}
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
// C++11 allocator
|
|
|
|
//
|
|
|
|
// Not a fully minimal C++11 allocator, just what I support. Hopefully will
|
|
|
|
// cut down further in the future.
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T> class cxx11_allocator
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
typedef T value_type;
|
|
|
|
// template <class U> struct rebind { typedef cxx11_allocator<U> other; };
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
cxx11_allocator() {}
|
|
|
|
template <class Y> cxx11_allocator(cxx11_allocator<Y> const&) {}
|
|
|
|
cxx11_allocator(cxx11_allocator const&) {}
|
|
|
|
~cxx11_allocator() {}
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
T* address(T& r) { return &r; }
|
|
|
|
T const* address(T const& r) { return &r; }
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
T* allocate(std::size_t n)
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return static_cast<T*>(::operator new(n * sizeof(T)));
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class Y> T* allocate(std::size_t n, const_ptr<Y>)
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return static_cast<T*>(::operator new(n * sizeof(T)));
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2011-08-11 21:17:57 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void deallocate(T* p, std::size_t) { ::operator delete((void*)p); }
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void construct(T* p, T const& t) { new ((void*)p) T(t); }
|
2017-02-19 13:05:17 +00:00
|
|
|
|
|
|
|
#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class... Args> void construct(T* p, BOOST_FWD_REF(Args)... args)
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
new ((void*)p) T(boost::forward<Args>(args)...);
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2017-02-19 13:05:17 +00:00
|
|
|
#endif
|
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
void destroy(T* p) { p->~T(); }
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
std::size_t max_size() const { return 1000u; }
|
|
|
|
};
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T>
|
|
|
|
inline bool operator==(cxx11_allocator<T> const&, cxx11_allocator<T> const&)
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T>
|
|
|
|
inline bool operator!=(cxx11_allocator<T> const&, cxx11_allocator<T> const&)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
2017-02-19 13:05:17 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class T> void swap(cxx11_allocator<T>&, cxx11_allocator<T>&) {}
|
|
|
|
}
|
2006-03-19 22:24:06 +00:00
|
|
|
}
|
|
|
|
|
Merge in support for equality operators for the unordered containers and
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]
2008-04-30 07:57:04 +00:00
|
|
|
#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
|
|
|
|
namespace boost {
|
|
|
|
#else
|
|
|
|
namespace test {
|
2017-06-11 20:55:59 +01:00
|
|
|
namespace minimal {
|
Merge in support for equality operators for the unordered containers and
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]
2008-04-30 07:57:04 +00:00
|
|
|
#endif
|
2017-06-11 20:55:59 +01:00
|
|
|
std::size_t hash_value(test::minimal::copy_constructible_equality_comparable)
|
|
|
|
{
|
2017-02-19 13:05:17 +00:00
|
|
|
return 1;
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
Merge in support for equality operators for the unordered containers and
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]
2008-04-30 07:57:04 +00:00
|
|
|
#if !defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
|
2017-02-19 13:05:17 +00:00
|
|
|
}
|
|
|
|
}
|
Merge in support for equality operators for the unordered containers and
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]
2008-04-30 07:57:04 +00:00
|
|
|
#else
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
Merge in support for equality operators for the unordered containers and
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]
2008-04-30 07:57:04 +00:00
|
|
|
#endif
|
|
|
|
|
2007-08-14 09:55:30 +00:00
|
|
|
#if defined(BOOST_MSVC)
|
|
|
|
#pragma warning(pop)
|
|
|
|
#endif
|
|
|
|
|
2006-03-19 22:24:06 +00:00
|
|
|
#endif
|