mirror of
https://github.com/boostorg/circular_buffer.git
synced 2026-02-09 11:02:30 +00:00
Compare commits
3 Commits
20131209-m
...
20131209-d
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
3b639851fb | ||
|
|
e2528e4168 | ||
|
|
c5625fa2bc |
@@ -34,21 +34,10 @@
|
|||||||
#include <utility>
|
#include <utility>
|
||||||
#include <deque>
|
#include <deque>
|
||||||
#include <stdexcept>
|
#include <stdexcept>
|
||||||
#if BOOST_CB_ENABLE_DEBUG
|
|
||||||
#include <cstring>
|
|
||||||
#endif
|
|
||||||
#if BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3205))
|
#if BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3205))
|
||||||
#include <stddef.h>
|
#include <stddef.h>
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#if defined(BOOST_NO_STDC_NAMESPACE)
|
|
||||||
namespace std {
|
|
||||||
using ::memset;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
namespace boost {
|
namespace boost {
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@@ -690,7 +679,7 @@ public:
|
|||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
if (is_uninitialized(dest)) {
|
if (is_uninitialized(dest)) {
|
||||||
::new (dest) value_type(this_type::move_if_noexcept(*src));
|
cb_details::do_construct<value_type>(dest, this_type::move_if_noexcept(*src), m_alloc);
|
||||||
++constructed;
|
++constructed;
|
||||||
} else {
|
} else {
|
||||||
value_type tmp = this_type::move_if_noexcept(*src);
|
value_type tmp = this_type::move_if_noexcept(*src);
|
||||||
@@ -902,7 +891,7 @@ public:
|
|||||||
iterator b = begin();
|
iterator b = begin();
|
||||||
BOOST_TRY {
|
BOOST_TRY {
|
||||||
reset(buff,
|
reset(buff,
|
||||||
cb_details::uninitialized_move_if_noexcept<value_type>(b, b + (std::min)(new_capacity, size()), buff),
|
cb_details::uninitialized_move_if_noexcept(b, b + (std::min)(new_capacity, size()), buff, m_alloc),
|
||||||
new_capacity);
|
new_capacity);
|
||||||
} BOOST_CATCH(...) {
|
} BOOST_CATCH(...) {
|
||||||
deallocate(buff, new_capacity);
|
deallocate(buff, new_capacity);
|
||||||
@@ -977,8 +966,8 @@ public:
|
|||||||
pointer buff = allocate(new_capacity);
|
pointer buff = allocate(new_capacity);
|
||||||
iterator e = end();
|
iterator e = end();
|
||||||
BOOST_TRY {
|
BOOST_TRY {
|
||||||
reset(buff, cb_details::uninitialized_move_if_noexcept<value_type>(e - (std::min)(new_capacity, size()),
|
reset(buff, cb_details::uninitialized_move_if_noexcept(e - (std::min)(new_capacity, size()),
|
||||||
e, buff), new_capacity);
|
e, buff, m_alloc), new_capacity);
|
||||||
} BOOST_CATCH(...) {
|
} BOOST_CATCH(...) {
|
||||||
deallocate(buff, new_capacity);
|
deallocate(buff, new_capacity);
|
||||||
BOOST_RETHROW
|
BOOST_RETHROW
|
||||||
@@ -1125,7 +1114,7 @@ public:
|
|||||||
initialize_buffer(cb.capacity());
|
initialize_buffer(cb.capacity());
|
||||||
m_first = m_buff;
|
m_first = m_buff;
|
||||||
BOOST_TRY {
|
BOOST_TRY {
|
||||||
m_last = cb_details::uninitialized_copy<value_type>(cb.begin(), cb.end(), m_buff);
|
m_last = cb_details::uninitialized_copy(cb.begin(), cb.end(), m_buff, m_alloc);
|
||||||
} BOOST_CATCH(...) {
|
} BOOST_CATCH(...) {
|
||||||
deallocate(m_buff, cb.capacity());
|
deallocate(m_buff, cb.capacity());
|
||||||
BOOST_RETHROW
|
BOOST_RETHROW
|
||||||
@@ -1249,7 +1238,7 @@ public:
|
|||||||
return *this;
|
return *this;
|
||||||
pointer buff = allocate(cb.capacity());
|
pointer buff = allocate(cb.capacity());
|
||||||
BOOST_TRY {
|
BOOST_TRY {
|
||||||
reset(buff, cb_details::uninitialized_copy<value_type>(cb.begin(), cb.end(), buff), cb.capacity());
|
reset(buff, cb_details::uninitialized_copy(cb.begin(), cb.end(), buff, m_alloc), cb.capacity());
|
||||||
} BOOST_CATCH(...) {
|
} BOOST_CATCH(...) {
|
||||||
deallocate(buff, cb.capacity());
|
deallocate(buff, cb.capacity());
|
||||||
BOOST_RETHROW
|
BOOST_RETHROW
|
||||||
@@ -1446,7 +1435,7 @@ private:
|
|||||||
increment(m_last);
|
increment(m_last);
|
||||||
m_first = m_last;
|
m_first = m_last;
|
||||||
} else {
|
} else {
|
||||||
::new (m_last) value_type(static_cast<ValT>(item));
|
cb_details::do_construct<value_type>(m_last, static_cast<ValT>(item), m_alloc);
|
||||||
increment(m_last);
|
increment(m_last);
|
||||||
++m_size;
|
++m_size;
|
||||||
}
|
}
|
||||||
@@ -1463,7 +1452,7 @@ private:
|
|||||||
m_last = m_first;
|
m_last = m_first;
|
||||||
} else {
|
} else {
|
||||||
decrement(m_first);
|
decrement(m_first);
|
||||||
::new (m_first) value_type(static_cast<ValT>(item));
|
cb_details::do_construct<value_type>(m_first, static_cast<ValT>(item), m_alloc);
|
||||||
++m_size;
|
++m_size;
|
||||||
}
|
}
|
||||||
} BOOST_CATCH(...) {
|
} BOOST_CATCH(...) {
|
||||||
@@ -2397,7 +2386,7 @@ private:
|
|||||||
throw_exception(std::length_error("circular_buffer"));
|
throw_exception(std::length_error("circular_buffer"));
|
||||||
#if BOOST_CB_ENABLE_DEBUG
|
#if BOOST_CB_ENABLE_DEBUG
|
||||||
pointer p = (n == 0) ? 0 : m_alloc.allocate(n, 0);
|
pointer p = (n == 0) ? 0 : m_alloc.allocate(n, 0);
|
||||||
std::memset(p, cb_details::UNINITIALIZED, sizeof(value_type) * n);
|
cb_details::do_fill_uninitialized_memory(p, sizeof(value_type) * n);
|
||||||
return p;
|
return p;
|
||||||
#else
|
#else
|
||||||
return (n == 0) ? 0 : m_alloc.allocate(n, 0);
|
return (n == 0) ? 0 : m_alloc.allocate(n, 0);
|
||||||
@@ -2438,7 +2427,7 @@ private:
|
|||||||
*/
|
*/
|
||||||
void construct_or_replace(bool construct, pointer pos, param_value_type item) {
|
void construct_or_replace(bool construct, pointer pos, param_value_type item) {
|
||||||
if (construct)
|
if (construct)
|
||||||
::new (pos) value_type(item);
|
cb_details::do_construct<value_type>(pos, item, m_alloc);
|
||||||
else
|
else
|
||||||
replace(pos, item);
|
replace(pos, item);
|
||||||
}
|
}
|
||||||
@@ -2450,7 +2439,7 @@ private:
|
|||||||
*/
|
*/
|
||||||
void construct_or_replace(bool construct, pointer pos, rvalue_type item) {
|
void construct_or_replace(bool construct, pointer pos, rvalue_type item) {
|
||||||
if (construct)
|
if (construct)
|
||||||
::new (pos) value_type(boost::move(item));
|
cb_details::do_construct<value_type>(pos, boost::move(item), m_alloc);
|
||||||
else
|
else
|
||||||
replace(pos, boost::move(item));
|
replace(pos, boost::move(item));
|
||||||
}
|
}
|
||||||
@@ -2460,7 +2449,7 @@ private:
|
|||||||
m_alloc.destroy(p);
|
m_alloc.destroy(p);
|
||||||
#if BOOST_CB_ENABLE_DEBUG
|
#if BOOST_CB_ENABLE_DEBUG
|
||||||
invalidate_iterators(iterator(this, p));
|
invalidate_iterators(iterator(this, p));
|
||||||
std::memset(p, cb_details::UNINITIALIZED, sizeof(value_type));
|
cb_details::do_fill_uninitialized_memory(p, sizeof(value_type));
|
||||||
#endif
|
#endif
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -2590,7 +2579,7 @@ private:
|
|||||||
if (buffer_capacity == 0)
|
if (buffer_capacity == 0)
|
||||||
return;
|
return;
|
||||||
while (first != last && !full()) {
|
while (first != last && !full()) {
|
||||||
::new (m_last) value_type(*first++);
|
cb_details::do_construct<value_type>(m_last, *first++, m_alloc);
|
||||||
increment(m_last);
|
increment(m_last);
|
||||||
++m_size;
|
++m_size;
|
||||||
}
|
}
|
||||||
@@ -2626,7 +2615,7 @@ private:
|
|||||||
m_size = distance;
|
m_size = distance;
|
||||||
}
|
}
|
||||||
BOOST_TRY {
|
BOOST_TRY {
|
||||||
m_last = cb_details::uninitialized_copy<value_type>(first, last, m_buff);
|
m_last = cb_details::uninitialized_copy(first, last, m_buff, m_alloc);
|
||||||
} BOOST_CATCH(...) {
|
} BOOST_CATCH(...) {
|
||||||
deallocate(m_buff, buffer_capacity);
|
deallocate(m_buff, buffer_capacity);
|
||||||
BOOST_RETHROW
|
BOOST_RETHROW
|
||||||
@@ -2680,8 +2669,8 @@ private:
|
|||||||
std::deque<value_type, allocator_type> tmp(first, last, m_alloc);
|
std::deque<value_type, allocator_type> tmp(first, last, m_alloc);
|
||||||
size_type distance = tmp.size();
|
size_type distance = tmp.size();
|
||||||
assign_n(distance, distance,
|
assign_n(distance, distance,
|
||||||
cb_details::make_assign_range<value_type>
|
cb_details::make_assign_range
|
||||||
(boost::make_move_iterator(tmp.begin()), boost::make_move_iterator(tmp.end())));
|
(boost::make_move_iterator(tmp.begin()), boost::make_move_iterator(tmp.end()), m_alloc));
|
||||||
}
|
}
|
||||||
|
|
||||||
//! Specialized assign method.
|
//! Specialized assign method.
|
||||||
@@ -2689,7 +2678,7 @@ private:
|
|||||||
void assign(ForwardIterator first, ForwardIterator last, const std::forward_iterator_tag&) {
|
void assign(ForwardIterator first, ForwardIterator last, const std::forward_iterator_tag&) {
|
||||||
BOOST_CB_ASSERT(std::distance(first, last) >= 0); // check for wrong range
|
BOOST_CB_ASSERT(std::distance(first, last) >= 0); // check for wrong range
|
||||||
size_type distance = std::distance(first, last);
|
size_type distance = std::distance(first, last);
|
||||||
assign_n(distance, distance, cb_details::make_assign_range<value_type>(first, last));
|
assign_n(distance, distance, cb_details::make_assign_range(first, last, m_alloc));
|
||||||
}
|
}
|
||||||
|
|
||||||
//! Specialized assign method.
|
//! Specialized assign method.
|
||||||
@@ -2732,7 +2721,7 @@ private:
|
|||||||
distance = new_capacity;
|
distance = new_capacity;
|
||||||
}
|
}
|
||||||
assign_n(new_capacity, distance,
|
assign_n(new_capacity, distance,
|
||||||
cb_details::make_assign_range<value_type>(first, last));
|
cb_details::make_assign_range(first, last, m_alloc));
|
||||||
}
|
}
|
||||||
|
|
||||||
//! Helper assign method.
|
//! Helper assign method.
|
||||||
@@ -2855,7 +2844,7 @@ private:
|
|||||||
pointer p = m_last;
|
pointer p = m_last;
|
||||||
BOOST_TRY {
|
BOOST_TRY {
|
||||||
for (; ii < construct; ++ii, increment(p))
|
for (; ii < construct; ++ii, increment(p))
|
||||||
::new (p) value_type(*wrapper());
|
cb_details::do_construct<value_type>(p, *wrapper(), m_alloc);
|
||||||
for (;ii < n; ++ii, increment(p))
|
for (;ii < n; ++ii, increment(p))
|
||||||
replace(p, *wrapper());
|
replace(p, *wrapper());
|
||||||
} BOOST_CATCH(...) {
|
} BOOST_CATCH(...) {
|
||||||
@@ -2949,7 +2938,7 @@ private:
|
|||||||
for (;ii > construct; --ii, increment(p))
|
for (;ii > construct; --ii, increment(p))
|
||||||
replace(p, *wrapper());
|
replace(p, *wrapper());
|
||||||
for (; ii > 0; --ii, increment(p))
|
for (; ii > 0; --ii, increment(p))
|
||||||
::new (p) value_type(*wrapper());
|
cb_details::do_construct<value_type>(p, *wrapper(), m_alloc);
|
||||||
} BOOST_CATCH(...) {
|
} BOOST_CATCH(...) {
|
||||||
size_type constructed = ii < construct ? construct - ii : 0;
|
size_type constructed = ii < construct ? construct - ii : 0;
|
||||||
m_last = add(m_last, constructed);
|
m_last = add(m_last, constructed);
|
||||||
|
|||||||
@@ -13,6 +13,16 @@
|
|||||||
#pragma once
|
#pragma once
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
#if BOOST_CB_ENABLE_DEBUG
|
||||||
|
#include <cstring>
|
||||||
|
|
||||||
|
#if defined(BOOST_NO_STDC_NAMESPACE)
|
||||||
|
namespace std {
|
||||||
|
using ::memset;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#endif // BOOST_CB_ENABLE_DEBUG
|
||||||
namespace boost {
|
namespace boost {
|
||||||
|
|
||||||
namespace cb_details {
|
namespace cb_details {
|
||||||
@@ -22,6 +32,17 @@ namespace cb_details {
|
|||||||
// The value the uninitialized memory is filled with.
|
// The value the uninitialized memory is filled with.
|
||||||
const int UNINITIALIZED = 0xcc;
|
const int UNINITIALIZED = 0xcc;
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
inline void do_fill_uninitialized_memory(T* data, std::size_t size_in_bytes) BOOST_NOEXCEPT {
|
||||||
|
std::memset(static_cast<void*>(data), UNINITIALIZED, size_in_bytes);
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
inline void do_fill_uninitialized_memory(T& /*data*/, std::size_t /*size_in_bytes*/) BOOST_NOEXCEPT {
|
||||||
|
// Do nothing
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
class debug_iterator_registry;
|
class debug_iterator_registry;
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
|
|||||||
@@ -38,11 +38,42 @@ template<class ForwardIterator, class Diff, class T, class Alloc>
|
|||||||
void uninitialized_fill_n_with_alloc(
|
void uninitialized_fill_n_with_alloc(
|
||||||
ForwardIterator first, Diff n, const T& item, Alloc& alloc);
|
ForwardIterator first, Diff n, const T& item, Alloc& alloc);
|
||||||
|
|
||||||
template<class ValueType, class InputIterator, class ForwardIterator>
|
template<class InputIterator, class ForwardIterator, class Alloc>
|
||||||
ForwardIterator uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator dest);
|
ForwardIterator uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator dest, Alloc& a);
|
||||||
|
|
||||||
template<class ValueType, class InputIterator, class ForwardIterator>
|
template<class InputIterator, class ForwardIterator, class Alloc>
|
||||||
ForwardIterator uninitialized_move_if_noexcept(InputIterator first, InputIterator last, ForwardIterator dest);
|
ForwardIterator uninitialized_move_if_noexcept(InputIterator first, InputIterator last, ForwardIterator dest, Alloc& a);
|
||||||
|
|
||||||
|
|
||||||
|
//! Those `do_construct` methods are required because in C++03 default allocators
|
||||||
|
//! have `construct` method that accepts second parameter in as a const reference;
|
||||||
|
//! while move-only types emulated by Boost.Move require constructor that accepts
|
||||||
|
//! a non-const reference.
|
||||||
|
//!
|
||||||
|
//! So when we need to call `construct` and pointer to value_type is provided, we
|
||||||
|
//! assume that it is safe to call placement new instead of Alloc::construct.
|
||||||
|
//! Otherwise we are asume that user has made his own allocator or uses allocator
|
||||||
|
//! from other libraries. In that case it's users ability to provide Alloc::construct
|
||||||
|
//! with non-const reference parameter or just do not use move-only types.
|
||||||
|
template <class ValueType, class Alloc>
|
||||||
|
inline void do_construct(ValueType* p, BOOST_RV_REF(ValueType) item, Alloc&) {
|
||||||
|
::new (p) ValueType(boost::move(item));
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class ValueType, class Alloc>
|
||||||
|
inline void do_construct(ValueType* p, const ValueType& item, Alloc&) {
|
||||||
|
::new (p) ValueType(item);
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class ValueType, class Alloc, class PointerT>
|
||||||
|
inline void do_construct(PointerT& p, BOOST_RV_REF(ValueType) item, Alloc& a) {
|
||||||
|
a.construct(p, boost::move(item));
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class ValueType, class Alloc, class PointerT>
|
||||||
|
inline void do_construct(PointerT& p, const ValueType& item, Alloc& a) {
|
||||||
|
a.construct(p, item);
|
||||||
|
}
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
\struct const_traits
|
\struct const_traits
|
||||||
@@ -127,23 +158,24 @@ private:
|
|||||||
\struct assign_range
|
\struct assign_range
|
||||||
\brief Helper functor for assigning range of items.
|
\brief Helper functor for assigning range of items.
|
||||||
*/
|
*/
|
||||||
template <class ValueType, class Iterator>
|
template <class Iterator, class Alloc>
|
||||||
struct assign_range {
|
struct assign_range {
|
||||||
Iterator m_first;
|
Iterator m_first;
|
||||||
Iterator m_last;
|
Iterator m_last;
|
||||||
|
Alloc& m_alloc;
|
||||||
|
|
||||||
assign_range(const Iterator& first, const Iterator& last) BOOST_NOEXCEPT
|
assign_range(const Iterator& first, const Iterator& last, Alloc& alloc)
|
||||||
: m_first(first), m_last(last) {}
|
: m_first(first), m_last(last), m_alloc(alloc) {}
|
||||||
|
|
||||||
template <class Pointer>
|
template <class Pointer>
|
||||||
void operator () (Pointer p) const {
|
void operator () (Pointer p) const {
|
||||||
boost::cb_details::uninitialized_copy<ValueType>(m_first, m_last, p);
|
boost::cb_details::uninitialized_copy(m_first, m_last, p, m_alloc);
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
template <class ValueType, class Iterator>
|
template <class Iterator, class Alloc>
|
||||||
inline assign_range<ValueType, Iterator> make_assign_range(const Iterator& first, const Iterator& last) {
|
inline assign_range<Iterator, Alloc> make_assign_range(const Iterator& first, const Iterator& last, Alloc& a) {
|
||||||
return assign_range<ValueType, Iterator>(first, last);
|
return assign_range<Iterator, Alloc>(first, last, a);
|
||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@@ -427,48 +459,43 @@ operator + (typename Traits::difference_type n, const iterator<Buff, Traits>& it
|
|||||||
\fn ForwardIterator uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator dest)
|
\fn ForwardIterator uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator dest)
|
||||||
\brief Equivalent of <code>std::uninitialized_copy</code> but with explicit specification of value type.
|
\brief Equivalent of <code>std::uninitialized_copy</code> but with explicit specification of value type.
|
||||||
*/
|
*/
|
||||||
template<class ValueType, class InputIterator, class ForwardIterator>
|
template<class InputIterator, class ForwardIterator, class Alloc>
|
||||||
inline ForwardIterator uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator dest) {
|
inline ForwardIterator uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator dest, Alloc& a) {
|
||||||
typedef ValueType value_type;
|
|
||||||
|
|
||||||
// We do not use allocator.construct and allocator.destroy
|
|
||||||
// because C++03 requires to take parameter by const reference but
|
|
||||||
// Boost.move requires nonconst reference
|
|
||||||
ForwardIterator next = dest;
|
ForwardIterator next = dest;
|
||||||
BOOST_TRY {
|
BOOST_TRY {
|
||||||
for (; first != last; ++first, ++dest)
|
for (; first != last; ++first, ++dest)
|
||||||
::new (dest) value_type(*first);
|
do_construct<typename Alloc::value_type>(dest, *first, a);
|
||||||
} BOOST_CATCH(...) {
|
} BOOST_CATCH(...) {
|
||||||
for (; next != dest; ++next)
|
for (; next != dest; ++next)
|
||||||
next->~value_type();
|
a.destroy(next);
|
||||||
BOOST_RETHROW
|
BOOST_RETHROW
|
||||||
}
|
}
|
||||||
BOOST_CATCH_END
|
BOOST_CATCH_END
|
||||||
return dest;
|
return dest;
|
||||||
}
|
}
|
||||||
|
|
||||||
template<class ValueType, class InputIterator, class ForwardIterator>
|
template<class InputIterator, class ForwardIterator, class Alloc>
|
||||||
ForwardIterator uninitialized_move_if_noexcept_impl(InputIterator first, InputIterator last, ForwardIterator dest,
|
ForwardIterator uninitialized_move_if_noexcept_impl(InputIterator first, InputIterator last, ForwardIterator dest, Alloc& a,
|
||||||
true_type) {
|
true_type) {
|
||||||
for (; first != last; ++first, ++dest)
|
for (; first != last; ++first, ++dest)
|
||||||
::new (dest) ValueType(boost::move(*first));
|
do_construct<typename Alloc::value_type>(dest, boost::move(*first), a);
|
||||||
return dest;
|
return dest;
|
||||||
}
|
}
|
||||||
|
|
||||||
template<class ValueType, class InputIterator, class ForwardIterator>
|
template<class InputIterator, class ForwardIterator, class Alloc>
|
||||||
ForwardIterator uninitialized_move_if_noexcept_impl(InputIterator first, InputIterator last, ForwardIterator dest,
|
ForwardIterator uninitialized_move_if_noexcept_impl(InputIterator first, InputIterator last, ForwardIterator dest, Alloc& a,
|
||||||
false_type) {
|
false_type) {
|
||||||
return uninitialized_copy<ValueType>(first, last, dest);
|
return uninitialized_copy(first, last, dest, a);
|
||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
\fn ForwardIterator uninitialized_move_if_noexcept(InputIterator first, InputIterator last, ForwardIterator dest)
|
\fn ForwardIterator uninitialized_move_if_noexcept(InputIterator first, InputIterator last, ForwardIterator dest)
|
||||||
\brief Equivalent of <code>std::uninitialized_copy</code> but with explicit specification of value type and moves elements if they have noexcept move constructors.
|
\brief Equivalent of <code>std::uninitialized_copy</code> but with explicit specification of value type and moves elements if they have noexcept move constructors.
|
||||||
*/
|
*/
|
||||||
template<class ValueType, class InputIterator, class ForwardIterator>
|
template<class InputIterator, class ForwardIterator, class Alloc>
|
||||||
ForwardIterator uninitialized_move_if_noexcept(InputIterator first, InputIterator last, ForwardIterator dest) {
|
ForwardIterator uninitialized_move_if_noexcept(InputIterator first, InputIterator last, ForwardIterator dest, Alloc& a) {
|
||||||
typedef typename boost::is_nothrow_move_constructible<ValueType>::type tag_t;
|
typedef typename boost::is_nothrow_move_constructible<typename Alloc::value_type>::type tag_t;
|
||||||
return uninitialized_move_if_noexcept_impl<ValueType>(first, last, dest, tag_t());
|
return uninitialized_move_if_noexcept_impl(first, last, dest, a, tag_t());
|
||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@@ -480,7 +507,7 @@ inline void uninitialized_fill_n_with_alloc(ForwardIterator first, Diff n, const
|
|||||||
ForwardIterator next = first;
|
ForwardIterator next = first;
|
||||||
BOOST_TRY {
|
BOOST_TRY {
|
||||||
for (; n > 0; ++first, --n)
|
for (; n > 0; ++first, --n)
|
||||||
alloc.construct(first, item);
|
do_construct<typename Alloc::value_type>(first, item, alloc);
|
||||||
} BOOST_CATCH(...) {
|
} BOOST_CATCH(...) {
|
||||||
for (; next != first; ++next)
|
for (; next != first; ++next)
|
||||||
alloc.destroy(next);
|
alloc.destroy(next);
|
||||||
|
|||||||
@@ -11,7 +11,8 @@
|
|||||||
#include <boost/type_traits/is_nothrow_move_assignable.hpp>
|
#include <boost/type_traits/is_nothrow_move_assignable.hpp>
|
||||||
#include <boost/type_traits/has_nothrow_constructor.hpp>
|
#include <boost/type_traits/has_nothrow_constructor.hpp>
|
||||||
|
|
||||||
void generic_test(CB_CONTAINER<MyInteger>& cb) {
|
template <class Alloc>
|
||||||
|
void generic_test(CB_CONTAINER<MyInteger, Alloc>& cb) {
|
||||||
|
|
||||||
vector<int> v;
|
vector<int> v;
|
||||||
v.push_back(11);
|
v.push_back(11);
|
||||||
@@ -149,6 +150,88 @@ void size_test() {
|
|||||||
generic_test(cb2);
|
generic_test(cb2);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template<class T>
|
||||||
|
class my_allocator {
|
||||||
|
typedef std::allocator<T> base_t;
|
||||||
|
base_t base_;
|
||||||
|
public:
|
||||||
|
typedef T value_type;
|
||||||
|
|
||||||
|
|
||||||
|
typedef value_type& reference;
|
||||||
|
typedef const value_type& const_reference;
|
||||||
|
typedef typename base_t::size_type size_type;
|
||||||
|
typedef typename base_t::difference_type difference_type;
|
||||||
|
|
||||||
|
struct const_pointer;
|
||||||
|
struct pointer {
|
||||||
|
pointer(){}
|
||||||
|
pointer(void* p) : hidden_ptr_((T*)p) {}
|
||||||
|
difference_type operator-(const const_pointer& rhs) const { return hidden_ptr_ - rhs.hidden_ptr_; }
|
||||||
|
difference_type operator-(pointer rhs) const { return hidden_ptr_ - rhs.hidden_ptr_; }
|
||||||
|
pointer operator-(size_type rhs) const { return hidden_ptr_ - rhs; }
|
||||||
|
bool operator == (pointer rhs) const { return hidden_ptr_ == rhs.hidden_ptr_; }
|
||||||
|
bool operator != (pointer rhs) const { return hidden_ptr_ != rhs.hidden_ptr_; }
|
||||||
|
bool operator < (pointer rhs) const { return hidden_ptr_ < rhs.hidden_ptr_; }
|
||||||
|
bool operator >= (pointer rhs) const { return hidden_ptr_ >= rhs.hidden_ptr_; }
|
||||||
|
pointer& operator++() { ++hidden_ptr_; return *this; }
|
||||||
|
pointer& operator--() { --hidden_ptr_; return *this; }
|
||||||
|
pointer& operator+=(size_type s) { hidden_ptr_ += s; return *this; }
|
||||||
|
pointer operator+(size_type s) const { return hidden_ptr_ + s; }
|
||||||
|
pointer operator++(int) { pointer p = *this; ++hidden_ptr_; return p; }
|
||||||
|
pointer operator--(int) { pointer p = *this; --hidden_ptr_; return p; }
|
||||||
|
T& operator*() const { return *hidden_ptr_; }
|
||||||
|
|
||||||
|
T* hidden_ptr_;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct const_pointer {
|
||||||
|
const_pointer(){}
|
||||||
|
const_pointer(pointer p) : hidden_ptr_(p.hidden_ptr_) {}
|
||||||
|
const_pointer(const void* p) : hidden_ptr_((const T*)p) {}
|
||||||
|
difference_type operator-(pointer rhs) const { return hidden_ptr_ - rhs.hidden_ptr_; }
|
||||||
|
difference_type operator-(const_pointer rhs) const { return hidden_ptr_ - rhs.hidden_ptr_; }
|
||||||
|
const_pointer operator-(size_type rhs) const { return hidden_ptr_ - rhs; }
|
||||||
|
bool operator == (const_pointer rhs) const { return hidden_ptr_ == rhs.hidden_ptr_; }
|
||||||
|
bool operator != (const_pointer rhs) const { return hidden_ptr_ != rhs.hidden_ptr_; }
|
||||||
|
bool operator < (const_pointer rhs) const { return hidden_ptr_ < rhs.hidden_ptr_; }
|
||||||
|
bool operator >= (const_pointer rhs) const { return hidden_ptr_ >= rhs.hidden_ptr_; }
|
||||||
|
const_pointer& operator++() { ++hidden_ptr_; return *this; }
|
||||||
|
const_pointer& operator--() { --hidden_ptr_; return *this; }
|
||||||
|
const_pointer& operator+=(size_type s) { hidden_ptr_ += s; return hidden_ptr_; }
|
||||||
|
const_pointer operator+(size_type s) const { return hidden_ptr_ + s; }
|
||||||
|
const_pointer operator++(int) { const_pointer p = *this; ++hidden_ptr_; return p; }
|
||||||
|
const_pointer operator--(int) { const_pointer p = *this; --hidden_ptr_; return p; }
|
||||||
|
const T& operator*() const { return *hidden_ptr_; }
|
||||||
|
|
||||||
|
const T* hidden_ptr_;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<class T2>
|
||||||
|
struct rebind
|
||||||
|
{
|
||||||
|
typedef my_allocator<T2> other;
|
||||||
|
};
|
||||||
|
|
||||||
|
size_type max_size() const
|
||||||
|
{ return base_.max_size(); }
|
||||||
|
|
||||||
|
pointer allocate(size_type count, const void* hint = 0) {
|
||||||
|
return pointer(base_.allocate(count, hint));
|
||||||
|
}
|
||||||
|
|
||||||
|
void deallocate(const pointer &ptr, size_type s)
|
||||||
|
{ base_.deallocate(ptr.hidden_ptr_, s); }
|
||||||
|
|
||||||
|
template<class P>
|
||||||
|
void construct(const pointer &ptr, BOOST_FWD_REF(P) p)
|
||||||
|
{ ::new(ptr.hidden_ptr_) value_type(::boost::forward<P>(p)); }
|
||||||
|
|
||||||
|
void destroy(const pointer &ptr)
|
||||||
|
{ (*ptr.hidden_ptr_).~value_type(); }
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
void allocator_test() {
|
void allocator_test() {
|
||||||
|
|
||||||
CB_CONTAINER<MyInteger> cb1(10, 0);
|
CB_CONTAINER<MyInteger> cb1(10, 0);
|
||||||
@@ -159,6 +242,10 @@ void allocator_test() {
|
|||||||
alloc.max_size();
|
alloc.max_size();
|
||||||
|
|
||||||
generic_test(cb1);
|
generic_test(cb1);
|
||||||
|
|
||||||
|
|
||||||
|
CB_CONTAINER<MyInteger, my_allocator<MyInteger> > cb_a(10, 0);
|
||||||
|
generic_test(cb_a);
|
||||||
}
|
}
|
||||||
|
|
||||||
void begin_and_end_test() {
|
void begin_and_end_test() {
|
||||||
|
|||||||
Reference in New Issue
Block a user