forked from boostorg/unordered
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]
414 lines
12 KiB
C++
414 lines
12 KiB
C++
|
|
// Copyright 2006-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_EXCEPTION_TEST_OBJECTS_HEADER)
|
|
#define BOOST_UNORDERED_EXCEPTION_TEST_OBJECTS_HEADER
|
|
|
|
#include "../helpers/exception_test.hpp"
|
|
|
|
#include <cstddef>
|
|
#include <iostream>
|
|
#include <boost/limits.hpp>
|
|
#include <new>
|
|
#include "../helpers/fwd.hpp"
|
|
#include "../helpers/allocator.hpp"
|
|
#include "../helpers/memory.hpp"
|
|
|
|
namespace test
|
|
{
|
|
namespace exception
|
|
{
|
|
namespace detail
|
|
{
|
|
namespace
|
|
{
|
|
test::detail::memory_tracker<test::malloc_allocator<int> > tracker;
|
|
}
|
|
}
|
|
|
|
class object;
|
|
class hash;
|
|
class equal_to;
|
|
template <class T> class allocator;
|
|
object generate(object const*);
|
|
|
|
class object
|
|
{
|
|
public:
|
|
int tag1_, tag2_;
|
|
|
|
explicit object() : tag1_(0), tag2_(0)
|
|
{
|
|
UNORDERED_SCOPE(object::object()) {
|
|
UNORDERED_EPOINT("Mock object default constructor.");
|
|
}
|
|
}
|
|
|
|
explicit object(int t1, int t2 = 0) : tag1_(t1), tag2_(t2)
|
|
{
|
|
UNORDERED_SCOPE(object::object(int)) {
|
|
UNORDERED_EPOINT("Mock object constructor by value.");
|
|
}
|
|
}
|
|
|
|
object(object const& x)
|
|
: tag1_(x.tag1_), tag2_(x.tag2_)
|
|
{
|
|
UNORDERED_SCOPE(object::object(object)) {
|
|
UNORDERED_EPOINT("Mock object copy constructor.");
|
|
}
|
|
}
|
|
|
|
~object() {
|
|
tag1_ = -1;
|
|
tag2_ = -1;
|
|
}
|
|
|
|
object& operator=(object const& x)
|
|
{
|
|
UNORDERED_SCOPE(object::operator=(object)) {
|
|
tag1_ = x.tag1_;
|
|
UNORDERED_EPOINT("Mock object assign operator 1.");
|
|
tag2_ = x.tag2_;
|
|
//UNORDERED_EPOINT("Mock object assign operator 2.");
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
friend bool operator==(object const& x1, object const& x2) {
|
|
UNORDERED_SCOPE(operator==(object, object)) {
|
|
UNORDERED_EPOINT("Mock object equality operator.");
|
|
}
|
|
|
|
return x1.tag1_ == x2.tag1_ && x1.tag2_ == x2.tag2_;
|
|
}
|
|
|
|
friend bool operator!=(object const& x1, object const& x2) {
|
|
UNORDERED_SCOPE(operator!=(object, object)) {
|
|
UNORDERED_EPOINT("Mock object inequality operator.");
|
|
}
|
|
|
|
return !(x1.tag1_ == x2.tag1_ && x1.tag2_ == x2.tag2_);
|
|
}
|
|
|
|
// None of the last few functions are used by the unordered associative
|
|
// containers - so there aren't any exception points.
|
|
friend bool operator<(object const& x1, object const& x2) {
|
|
return x1.tag1_ < x2.tag1_ ||
|
|
(x1.tag1_ == x2.tag1_ && x1.tag2_ < x2.tag2_);
|
|
}
|
|
|
|
friend object generate(object const*) {
|
|
int* x = 0;
|
|
return object(::test::generate(x), ::test::generate(x));
|
|
}
|
|
|
|
friend std::ostream& operator<<(std::ostream& out, object const& o)
|
|
{
|
|
return out<<"("<<o.tag1_<<","<<o.tag2_<<")";
|
|
}
|
|
};
|
|
|
|
class hash
|
|
{
|
|
int tag_;
|
|
public:
|
|
hash(int t = 0) : tag_(t)
|
|
{
|
|
UNORDERED_SCOPE(hash::object()) {
|
|
UNORDERED_EPOINT("Mock hash default constructor.");
|
|
}
|
|
}
|
|
|
|
hash(hash const& x)
|
|
: tag_(x.tag_)
|
|
{
|
|
UNORDERED_SCOPE(hash::hash(hash)) {
|
|
UNORDERED_EPOINT("Mock hash copy constructor.");
|
|
}
|
|
}
|
|
|
|
hash& operator=(hash const& x)
|
|
{
|
|
UNORDERED_SCOPE(hash::operator=(hash)) {
|
|
UNORDERED_EPOINT("Mock hash assign operator 1.");
|
|
tag_ = x.tag_;
|
|
UNORDERED_EPOINT("Mock hash assign operator 2.");
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
std::size_t operator()(object const& x) const {
|
|
UNORDERED_SCOPE(hash::operator()(object)) {
|
|
UNORDERED_EPOINT("Mock hash function.");
|
|
}
|
|
|
|
switch(tag_) {
|
|
case 1:
|
|
return x.tag1_;
|
|
case 2:
|
|
return x.tag2_;
|
|
default:
|
|
return x.tag1_ + x.tag2_;
|
|
}
|
|
}
|
|
|
|
friend bool operator==(hash const& x1, hash const& x2) {
|
|
UNORDERED_SCOPE(operator==(hash, hash)) {
|
|
UNORDERED_EPOINT("Mock hash equality function.");
|
|
}
|
|
return x1.tag_ == x2.tag_;
|
|
}
|
|
|
|
friend bool operator!=(hash const& x1, hash const& x2) {
|
|
UNORDERED_SCOPE(hash::operator!=(hash, hash)) {
|
|
UNORDERED_EPOINT("Mock hash inequality function.");
|
|
}
|
|
return x1.tag_ != x2.tag_;
|
|
}
|
|
};
|
|
|
|
class equal_to
|
|
{
|
|
int tag_;
|
|
public:
|
|
equal_to(int t = 0) : tag_(t)
|
|
{
|
|
UNORDERED_SCOPE(equal_to::equal_to()) {
|
|
UNORDERED_EPOINT("Mock equal_to default constructor.");
|
|
}
|
|
}
|
|
|
|
equal_to(equal_to const& x)
|
|
: tag_(x.tag_)
|
|
{
|
|
UNORDERED_SCOPE(equal_to::equal_to(equal_to)) {
|
|
UNORDERED_EPOINT("Mock equal_to copy constructor.");
|
|
}
|
|
}
|
|
|
|
equal_to& operator=(equal_to const& x)
|
|
{
|
|
UNORDERED_SCOPE(equal_to::operator=(equal_to)) {
|
|
UNORDERED_EPOINT("Mock equal_to assign operator 1.");
|
|
tag_ = x.tag_;
|
|
UNORDERED_EPOINT("Mock equal_to assign operator 2.");
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
bool operator()(object const& x1, object const& x2) const {
|
|
UNORDERED_SCOPE(equal_to::operator()(object, object)) {
|
|
UNORDERED_EPOINT("Mock equal_to function.");
|
|
}
|
|
|
|
switch(tag_) {
|
|
case 1:
|
|
return x1.tag1_ == x2.tag1_;
|
|
case 2:
|
|
return x1.tag2_ == x2.tag2_;
|
|
default:
|
|
return x1 == x2;
|
|
}
|
|
}
|
|
|
|
friend bool operator==(equal_to const& x1, equal_to const& x2) {
|
|
UNORDERED_SCOPE(operator==(equal_to, equal_to)) {
|
|
UNORDERED_EPOINT("Mock equal_to equality function.");
|
|
}
|
|
return x1.tag_ == x2.tag_;
|
|
}
|
|
|
|
friend bool operator!=(equal_to const& x1, equal_to const& x2) {
|
|
UNORDERED_SCOPE(operator!=(equal_to, equal_to)) {
|
|
UNORDERED_EPOINT("Mock equal_to inequality function.");
|
|
}
|
|
return x1.tag_ != x2.tag_;
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
class allocator
|
|
{
|
|
public:
|
|
int tag_;
|
|
typedef std::size_t size_type;
|
|
typedef std::ptrdiff_t difference_type;
|
|
typedef T* pointer;
|
|
typedef T const* const_pointer;
|
|
typedef T& reference;
|
|
typedef T const& const_reference;
|
|
typedef T value_type;
|
|
|
|
template <class U> struct rebind { typedef allocator<U> other; };
|
|
|
|
explicit allocator(int t = 0) : tag_(t)
|
|
{
|
|
UNORDERED_SCOPE(allocator::allocator()) {
|
|
UNORDERED_EPOINT("Mock allocator default constructor.");
|
|
}
|
|
detail::tracker.allocator_ref();
|
|
}
|
|
|
|
template <class Y> allocator(allocator<Y> const& x) : tag_(x.tag_)
|
|
{
|
|
UNORDERED_SCOPE(allocator::allocator()) {
|
|
UNORDERED_EPOINT("Mock allocator template copy constructor.");
|
|
}
|
|
detail::tracker.allocator_ref();
|
|
}
|
|
|
|
allocator(allocator const& x) : tag_(x.tag_)
|
|
{
|
|
UNORDERED_SCOPE(allocator::allocator()) {
|
|
UNORDERED_EPOINT("Mock allocator copy constructor.");
|
|
}
|
|
detail::tracker.allocator_ref();
|
|
}
|
|
|
|
~allocator() {
|
|
detail::tracker.allocator_unref();
|
|
}
|
|
|
|
allocator& operator=(allocator const& x) {
|
|
UNORDERED_SCOPE(allocator::allocator()) {
|
|
UNORDERED_EPOINT("Mock allocator assignment operator.");
|
|
tag_ = x.tag_;
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
// If address throws, then it can't be used in erase or the
|
|
// destructor, which is very limiting. I need to check up on
|
|
// this.
|
|
|
|
pointer address(reference r) {
|
|
//UNORDERED_SCOPE(allocator::address(reference)) {
|
|
// UNORDERED_EPOINT("Mock allocator address function.");
|
|
//}
|
|
return pointer(&r);
|
|
}
|
|
|
|
const_pointer address(const_reference r) {
|
|
//UNORDERED_SCOPE(allocator::address(const_reference)) {
|
|
// UNORDERED_EPOINT("Mock allocator const address function.");
|
|
//}
|
|
return const_pointer(&r);
|
|
}
|
|
|
|
pointer allocate(size_type n) {
|
|
T* ptr = 0;
|
|
UNORDERED_SCOPE(allocator::allocate(size_type)) {
|
|
UNORDERED_EPOINT("Mock allocator allocate function.");
|
|
|
|
using namespace std;
|
|
ptr = (T*) malloc(n * sizeof(T));
|
|
if(!ptr) throw std::bad_alloc();
|
|
}
|
|
detail::tracker.track_allocate((void*) ptr, n, sizeof(T), tag_);
|
|
return pointer(ptr);
|
|
|
|
//return pointer(static_cast<T*>(::operator new(n * sizeof(T))));
|
|
}
|
|
|
|
pointer allocate(size_type n, void const* u)
|
|
{
|
|
T* ptr = 0;
|
|
UNORDERED_SCOPE(allocator::allocate(size_type, const_pointer)) {
|
|
UNORDERED_EPOINT("Mock allocator allocate function.");
|
|
|
|
using namespace std;
|
|
ptr = (T*) malloc(n * sizeof(T));
|
|
if(!ptr) throw std::bad_alloc();
|
|
}
|
|
detail::tracker.track_allocate((void*) ptr, n, sizeof(T), tag_);
|
|
return pointer(ptr);
|
|
|
|
//return pointer(static_cast<T*>(::operator new(n * sizeof(T))));
|
|
}
|
|
|
|
void deallocate(pointer p, size_type n)
|
|
{
|
|
//::operator delete((void*) p);
|
|
if(p) {
|
|
detail::tracker.track_deallocate((void*) p, n, sizeof(T), tag_);
|
|
using namespace std;
|
|
free(p);
|
|
}
|
|
}
|
|
|
|
void construct(pointer p, T const& t) {
|
|
UNORDERED_SCOPE(allocator::construct(pointer, T)) {
|
|
UNORDERED_EPOINT("Mock allocator construct function.");
|
|
new(p) T(t);
|
|
}
|
|
detail::tracker.track_construct((void*) p, sizeof(T), tag_);
|
|
}
|
|
|
|
#if defined(BOOST_HAS_RVALUE_REFS) && defined(BOOST_HAS_VARIADIC_TMPL)
|
|
template<class... Args> void construct(pointer p, Args&&... args) {
|
|
UNORDERED_SCOPE(allocator::construct(pointer, Args&&...)) {
|
|
UNORDERED_EPOINT("Mock allocator construct function.");
|
|
new(p) T(std::forward<Args>(args)...);
|
|
}
|
|
detail::tracker.track_construct((void*) p, sizeof(T), tag_);
|
|
}
|
|
#endif
|
|
|
|
void destroy(pointer p) {
|
|
detail::tracker.track_destroy((void*) p, sizeof(T), tag_);
|
|
p->~T();
|
|
}
|
|
|
|
size_type max_size() const {
|
|
UNORDERED_SCOPE(allocator::construct(pointer, T)) {
|
|
UNORDERED_EPOINT("Mock allocator max_size function.");
|
|
}
|
|
return (std::numeric_limits<std::size_t>::max)();
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
void swap(allocator<T>& x, allocator<T>& y)
|
|
{
|
|
std::swap(x.tag_, y.tag_);
|
|
}
|
|
|
|
// It's pretty much impossible to write a compliant swap when these
|
|
// two can throw. So they don't.
|
|
|
|
template <class T>
|
|
inline bool operator==(allocator<T> const& x, allocator<T> const& y)
|
|
{
|
|
//UNORDERED_SCOPE(operator==(allocator, allocator)) {
|
|
// UNORDERED_EPOINT("Mock allocator equality operator.");
|
|
//}
|
|
return x.tag_ == y.tag_;
|
|
}
|
|
|
|
template <class T>
|
|
inline bool operator!=(allocator<T> const& x, allocator<T> const& y)
|
|
{
|
|
//UNORDERED_SCOPE(operator!=(allocator, allocator)) {
|
|
// UNORDERED_EPOINT("Mock allocator inequality operator.");
|
|
//}
|
|
return x.tag_ != y.tag_;
|
|
}
|
|
}
|
|
}
|
|
|
|
// Workaround for ADL deficient compilers
|
|
#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
|
|
namespace test
|
|
{
|
|
test::exception::object generate(test::exception::object const* x) {
|
|
return test::exception::generate(x);
|
|
}
|
|
}
|
|
#endif
|
|
|
|
#endif
|
|
|