feedc0de/boost_container
1
0
Fork 0
forked from boostorg/container
Code Pull Requests Activity

Removed tabs.

Browse Source
This commit is contained in:
Ion Gaztañaga
2014-07-30 16:32:55 +02:00
parent 85821789f7
commit d849f80ea5
53 changed files with 6190 additions and 6192 deletions
Download Patch File Download Diff File Expand all files Collapse all files
include/boost/container/deque.hpp
+1 -1
View File
@@ -102,7 +102,7 @@ template<class Pointer, bool IsConst>
class deque_iterator
{
public:
typedef std::random_access_iterator_tag iterator_category;
typedef std::random_access_iterator_tag iterator_category;
typedef typename boost::intrusive::pointer_traits<Pointer>::element_type value_type;
typedef typename boost::intrusive::pointer_traits<Pointer>::difference_type difference_type;
typedef typename if_c
include/boost/container/detail/flat_tree.hpp
+2 -2
View File
@@ -447,7 +447,7 @@ class flat_tree
#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
, typename container_detail::enable_if_c
< !container_detail::is_input_iterator<FwdIt>::value &&
container_detail::is_forward_iterator<FwdIt>::value
container_detail::is_forward_iterator<FwdIt>::value
>::type * = 0
#endif
)
@@ -559,7 +559,7 @@ class flat_tree
const typename std::iterator_traits<BidirIt>::value_type & val = *first;
pos = const_cast<const flat_tree&>(*this).priv_lower_bound(pos, ce, KeyOfValue()(val));
//Check if already present
if (pos != ce){
if (pos != ce){
++first;
--len;
if(!val_cmp(val, *pos)){
include/boost/container/detail/mpl.hpp
+4 -4
View File
@@ -128,8 +128,8 @@ struct if_
template <class Pair>
struct select1st
{
typedef Pair argument_type;
typedef typename Pair::first_type result_type;
typedef Pair argument_type;
typedef typename Pair::first_type result_type;
template<class OtherPair>
const typename Pair::first_type& operator()(const OtherPair& x) const
@@ -143,8 +143,8 @@ struct select1st
template <class T>
struct identity
{
typedef T argument_type;
typedef T result_type;
typedef T argument_type;
typedef T result_type;
typedef T type;
const T& operator()(const T& x) const
include/boost/container/detail/mutex.hpp
+2 -4
View File
@@ -25,10 +25,6 @@
#include <boost/container/detail/config_begin.hpp>
#include <boost/container/detail/workaround.hpp>
#ifdef _AIX
#include <sched.h>
#endif
// Extremely Light-Weight wrapper classes for OS thread synchronization
#define BOOST_MUTEX_HELPER_NONE 0
@@ -138,8 +134,10 @@
#define SLEEP_EX_DURATION 50 /* delay for yield/sleep */
#define SPIN_LOCK_YIELD SleepEx(SLEEP_EX_DURATION, FALSE)
#elif defined (__SVR4) && defined (__sun) /* solaris */
#include <thread.h>
#define SPIN_LOCK_YIELD thr_yield();
#elif !defined(LACKS_SCHED_H)
#include <sched.h>
#define SPIN_LOCK_YIELD sched_yield();
#else
#define SPIN_LOCK_YIELD
include/boost/container/detail/node_pool_impl.hpp
+2 -2
View File
@@ -251,8 +251,8 @@ class private_node_pool_impl
struct is_between
{
typedef typename free_nodes_t::value_type argument_type;
typedef bool result_type;
typedef typename free_nodes_t::value_type argument_type;
typedef bool result_type;
is_between(const void *addr, std::size_t size)
: beg_(static_cast<const char *>(addr)), end_(beg_+size)
include/boost/container/detail/utilities.hpp
+22 -22
View File
@@ -103,8 +103,8 @@ template <typename T>
inline T* addressof(T& obj)
{
return static_cast<T*>(
static_cast<void*>(
const_cast<char*>(
static_cast<void*>(
const_cast<char*>(
&reinterpret_cast<const char&>(obj)
)));
}
@@ -451,10 +451,10 @@ inline typename container_detail::disable_if_memtransfer_copy_constructible<I, F
}
}
BOOST_CATCH(...){
for (; back != r; ++back){
for (; back != r; ++back){
allocator_traits<A>::destroy(a, container_detail::iterator_to_raw_pointer(back));
}
BOOST_RETHROW;
BOOST_RETHROW;
}
BOOST_CATCH_END
return r;
@@ -496,10 +496,10 @@ inline typename container_detail::disable_if_memtransfer_copy_constructible<I, F
}
}
BOOST_CATCH(...){
for (; back != r; ++back){
for (; back != r; ++back){
allocator_traits<A>::destroy(a, container_detail::iterator_to_raw_pointer(back));
}
BOOST_RETHROW;
BOOST_RETHROW;
}
BOOST_CATCH_END
return r;
@@ -541,10 +541,10 @@ inline typename container_detail::disable_if_memtransfer_copy_constructible<I, F
}
}
BOOST_CATCH(...){
for (; back != r; ++back){
for (; back != r; ++back){
allocator_traits<A>::destroy(a, container_detail::iterator_to_raw_pointer(back));
}
BOOST_RETHROW;
BOOST_RETHROW;
}
BOOST_CATCH_END
return f;
@@ -586,10 +586,10 @@ inline typename container_detail::disable_if_memtransfer_copy_constructible<I, F
}
}
BOOST_CATCH(...){
for (; back != r; ++back){
for (; back != r; ++back){
allocator_traits<A>::destroy(a, container_detail::iterator_to_raw_pointer(back));
}
BOOST_RETHROW;
BOOST_RETHROW;
}
BOOST_CATCH_END
return r;
@@ -631,10 +631,10 @@ inline typename container_detail::disable_if_memtransfer_copy_constructible<I, F
}
}
BOOST_CATCH(...){
for (; back != r; ++back){
for (; back != r; ++back){
allocator_traits<A>::destroy(a, container_detail::iterator_to_raw_pointer(back));
}
BOOST_RETHROW;
BOOST_RETHROW;
}
BOOST_CATCH_END
return r;
@@ -676,10 +676,10 @@ inline typename container_detail::disable_if_memtransfer_copy_constructible<I, F
}
}
BOOST_CATCH(...){
for (; back != r; ++back){
for (; back != r; ++back){
allocator_traits<A>::destroy(a, container_detail::iterator_to_raw_pointer(back));
}
BOOST_RETHROW;
BOOST_RETHROW;
}
BOOST_CATCH_END
return f;
@@ -720,10 +720,10 @@ inline typename container_detail::disable_if_memzero_initializable<F, F>::type
}
}
BOOST_CATCH(...){
for (; back != r; ++back){
for (; back != r; ++back){
allocator_traits<A>::destroy(a, container_detail::iterator_to_raw_pointer(back));
}
BOOST_RETHROW;
BOOST_RETHROW;
}
BOOST_CATCH_END
return r;
@@ -767,10 +767,10 @@ inline F uninitialized_default_init_alloc_n(A &a, typename allocator_traits<A>::
}
}
BOOST_CATCH(...){
for (; back != r; ++back){
for (; back != r; ++back){
allocator_traits<A>::destroy(a, container_detail::iterator_to_raw_pointer(back));
}
BOOST_RETHROW;
BOOST_RETHROW;
}
BOOST_CATCH_END
return r;
@@ -803,10 +803,10 @@ inline void uninitialized_fill_alloc(A &a, F f, F l, const T &t)
}
}
BOOST_CATCH(...){
for (; back != l; ++back){
for (; back != l; ++back){
allocator_traits<A>::destroy(a, container_detail::iterator_to_raw_pointer(back));
}
BOOST_RETHROW;
BOOST_RETHROW;
}
BOOST_CATCH_END
}
@@ -839,10 +839,10 @@ inline F uninitialized_fill_alloc_n(A &a, const T &v, typename allocator_traits<
}
}
BOOST_CATCH(...){
for (; back != r; ++back){
for (; back != r; ++back){
allocator_traits<A>::destroy(a, container_detail::iterator_to_raw_pointer(back));
}
BOOST_RETHROW;
BOOST_RETHROW;
}
BOOST_CATCH_END
return r;
include/boost/container/stable_vector.hpp
+1 -1
View File
@@ -226,7 +226,7 @@ class stable_vector_iterator
{
typedef boost::intrusive::pointer_traits<Pointer> non_const_ptr_traits;
public:
typedef std::random_access_iterator_tag iterator_category;
typedef std::random_access_iterator_tag iterator_category;
typedef typename non_const_ptr_traits::element_type value_type;
typedef typename non_const_ptr_traits::difference_type difference_type;
typedef typename ::boost::container::container_detail::if_c
include/boost/container/string.hpp
+17 -17
View File
@@ -494,9 +494,9 @@ class basic_string
struct Eq_traits
{
//Compatibility with std::binary_function
typedef typename Tr::char_type first_argument_type;
typedef typename Tr::char_type second_argument_type;
typedef bool result_type;
typedef typename Tr::char_type first_argument_type;
typedef typename Tr::char_type second_argument_type;
typedef bool result_type;
bool operator()(const first_argument_type& x, const second_argument_type& y) const
{ return Tr::eq(x, y); }
@@ -505,8 +505,8 @@ class basic_string
template <class Tr>
struct Not_within_traits
{
typedef typename Tr::char_type argument_type;
typedef bool result_type;
typedef typename Tr::char_type argument_type;
typedef bool result_type;
typedef const typename Tr::char_type* Pointer;
const Pointer m_first;
@@ -1256,18 +1256,18 @@ class basic_string
{ return this->assign(cvalue_iterator(c, n), cvalue_iterator()); }
//! <b>Effects</b>: Equivalent to assign(basic_string(first, last)).
//!
//! <b>Returns</b>: *this
basic_string& assign(const CharT* first, const CharT* last)
{
size_type n = static_cast<size_type>(last - first);
this->reserve(n);
CharT* ptr = container_detail::to_raw_pointer(this->priv_addr());
Traits::copy(ptr, first, n);
this->priv_construct_null(ptr + n);
this->priv_size(n);
return *this;
}
//!
//! <b>Returns</b>: *this
basic_string& assign(const CharT* first, const CharT* last)
{
size_type n = static_cast<size_type>(last - first);
this->reserve(n);
CharT* ptr = container_detail::to_raw_pointer(this->priv_addr());
Traits::copy(ptr, first, n);
this->priv_construct_null(ptr + n);
this->priv_size(n);
return *this;
}
//! <b>Effects</b>: Equivalent to assign(basic_string(first, last)).
//!