mirror of
https://github.com/boostorg/multi_index.git
synced 2025-05-09 23:14:04 +00:00
passim: supressed non-ASCII chars in C++ code bidir_node_iterator.hpp: deleted unused template parameter bucket_array.hpp: avoided allocator<void> instantiations hash_index_iterator.hpp: avoided allocator<void> instantiations hash_index_node.hpp: avoided allocator<void> instantiations, renamed var ord_index_node.hpp: avoided allocator<void> instantiations rnd_index_loader.hpp: avoided allocator<void> instantiations rnd_index_node.hpp: avoided allocator<void> instantiations rnd_index_ptr_array.hpp: avoided allocator<void> instantiations rnd_node_iterator.hpp: deleted unused template parameter seq_index_node.hpp: avoided allocator<void> instantiations hashed_index.hpp: rewritten modify_ so that elements with unmodified key do not change position multi_index_container.hpp: added allocator ctor acknowledgements.html: added acknowledgements for Boost 1.36 compiler_specifics.html: typo hash_indices.html: documented updating functions behavior wrt unmodified keys, formatting typos key_extraction.html: formatting typos multi_index_container.html: added allocator ctor, formatting typos ord_indices.html: documented updating functions behavior wrt unmodified keys, formatting typos rnd_indices.html: formatting typos seq_indices.html: formatting typos release_notes.html: added release notes for Boost 1.36 hashed.cpp: blocked Boost inspect tool check for ASCII only chars non_std_allocator.hpp: removed void specialization to verify that no allocator<void> instantiations are generated test_copy_assignment.cpp: added test for multi_index_container allocator ctor test_update.cpp: added test for stability of update functions wrt to unmodified keys [SVN r46770]
127 lines
3.7 KiB
C++
127 lines
3.7 KiB
C++
/* Used in Boost.MultiIndex tests.
|
|
*
|
|
* Copyright 2003-2008 Joaquin M Lopez Munoz.
|
|
* 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)
|
|
*
|
|
* See http://www.boost.org/libs/multi_index for library home page.
|
|
*/
|
|
|
|
#ifndef BOOST_MULTI_INDEX_TEST_NON_STD_ALLOCATOR_HPP
|
|
#define BOOST_MULTI_INDEX_TEST_NON_STD_ALLOCATOR_HPP
|
|
|
|
#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
|
|
#include <iterator>
|
|
#include <cstddef>
|
|
|
|
template<typename T>
|
|
class non_raw_pointer
|
|
{
|
|
public:
|
|
typedef std::ptrdiff_t difference_type;
|
|
typedef T value_type;
|
|
typedef T* pointer;
|
|
typedef T& reference;
|
|
typedef std::random_access_iterator_tag iterator_category;
|
|
|
|
non_raw_pointer(){}
|
|
explicit non_raw_pointer(T* p_):p(p_){}
|
|
|
|
T& operator*()const{return *p;}
|
|
T* operator->()const{return p;}
|
|
non_raw_pointer& operator++(){++p;return *this;}
|
|
non_raw_pointer operator++(int){non_raw_pointer t(*this);++p;return t;}
|
|
non_raw_pointer& operator--(){--p;return *this;}
|
|
non_raw_pointer operator--(int){non_raw_pointer t(*this);--p;return t;}
|
|
non_raw_pointer& operator+=(std::ptrdiff_t n){p+=n;return *this;}
|
|
non_raw_pointer& operator-=(std::ptrdiff_t n){p-=n;return *this;}
|
|
T& operator[](std::ptrdiff_t n)const{return p[n];}
|
|
|
|
private:
|
|
T* p;
|
|
};
|
|
|
|
template<typename T>
|
|
non_raw_pointer<T> operator+(const non_raw_pointer<T>& x,std::ptrdiff_t n)
|
|
{return non_raw_pointer<T>((&*x)+n);}
|
|
|
|
template<typename T>
|
|
non_raw_pointer<T> operator+(std::ptrdiff_t n,const non_raw_pointer<T>& x)
|
|
{return non_raw_pointer<T>(n+(&*x));}
|
|
|
|
template<typename T>
|
|
non_raw_pointer<T> operator-(const non_raw_pointer<T>& x,std::ptrdiff_t n)
|
|
{return non_raw_pointer<T>((&*x)-n);}
|
|
|
|
template<typename T>
|
|
std::ptrdiff_t operator-(
|
|
const non_raw_pointer<T>& x,const non_raw_pointer<T>& y)
|
|
{return (&*x)-(&*y);}
|
|
|
|
template<typename T>
|
|
bool operator==(const non_raw_pointer<T>& x,const non_raw_pointer<T>& y)
|
|
{return (&*x)==(&*y);}
|
|
|
|
template<typename T>
|
|
bool operator!=(const non_raw_pointer<T>& x,const non_raw_pointer<T>& y)
|
|
{return (&*x)!=(&*y);}
|
|
|
|
template<typename T>
|
|
bool operator<(const non_raw_pointer<T>& x,const non_raw_pointer<T>& y)
|
|
{return (&*x)<(&*y);}
|
|
|
|
template<typename T>
|
|
bool operator>(const non_raw_pointer<T>& x,const non_raw_pointer<T>& y)
|
|
{return (&*x)>(&*y);}
|
|
|
|
template<typename T>
|
|
bool operator>=(const non_raw_pointer<T>& x,const non_raw_pointer<T>& y)
|
|
{return (&*x)>=(&*y);}
|
|
|
|
template<typename T>
|
|
bool operator<=(const non_raw_pointer<T>& x,const non_raw_pointer<T>& y)
|
|
{return (&*x)<=(&*y);}
|
|
|
|
template<typename T>
|
|
class non_std_allocator
|
|
{
|
|
public:
|
|
typedef std::size_t size_type;
|
|
typedef std::ptrdiff_t difference_type;
|
|
typedef non_raw_pointer<T> pointer;
|
|
typedef non_raw_pointer<const T> const_pointer;
|
|
typedef T& reference;
|
|
typedef const T& const_reference;
|
|
typedef T value_type;
|
|
template<class U>struct rebind{typedef non_std_allocator<U> other;};
|
|
|
|
non_std_allocator(){}
|
|
non_std_allocator(const non_std_allocator<T>&){}
|
|
template<class U>non_std_allocator(const non_std_allocator<U>&,int=0){}
|
|
|
|
pointer allocate(size_type n)
|
|
{
|
|
return pointer((T*)(new char[n*sizeof(T)]));
|
|
}
|
|
|
|
void deallocate(pointer p,size_type)
|
|
{
|
|
delete[](char *)&*p;
|
|
}
|
|
|
|
size_type max_size() const{return (size_type )(-1);}
|
|
|
|
friend bool operator==(const non_std_allocator&,const non_std_allocator&)
|
|
{
|
|
return true;
|
|
}
|
|
|
|
friend bool operator!=(const non_std_allocator&,const non_std_allocator&)
|
|
{
|
|
return false;
|
|
}
|
|
};
|
|
|
|
#endif
|