Trim trailing spaces.

This commit is contained in:
Andrey Semashev
2023-09-03 00:06:37 +03:00
parent c774c93b3b
commit b19ce675ad

View File

@ -33,11 +33,11 @@
#include <boost/detail/workaround.hpp> #include <boost/detail/workaround.hpp>
#if BOOST_WORKAROUND(BOOST_MSVC, >= 1400) #if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)
# pragma warning(push) # pragma warning(push)
# pragma warning(disable:4996) // 'std::equal': Function call with parameters that may be unsafe # pragma warning(disable:4996) // 'std::equal': Function call with parameters that may be unsafe
# pragma warning(disable:4510) // boost::array<T,N>' : default constructor could not be generated # pragma warning(disable:4510) // boost::array<T,N>' : default constructor could not be generated
# pragma warning(disable:4610) // warning C4610: class 'boost::array<T,N>' can never be instantiated - user defined constructor required # pragma warning(disable:4610) // warning C4610: class 'boost::array<T,N>' can never be instantiated - user defined constructor required
#endif #endif
#include <cstddef> #include <cstddef>
@ -75,7 +75,7 @@ namespace boost {
iterator begin() { return elems; } iterator begin() { return elems; }
const_iterator begin() const { return elems; } const_iterator begin() const { return elems; }
const_iterator cbegin() const { return elems; } const_iterator cbegin() const { return elems; }
iterator end() { return elems+N; } iterator end() { return elems+N; }
const_iterator end() const { return elems+N; } const_iterator end() const { return elems+N; }
const_iterator cend() const { return elems+N; } const_iterator cend() const { return elems+N; }
@ -84,9 +84,9 @@ namespace boost {
#if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS) #if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
typedef std::reverse_iterator<iterator> reverse_iterator; typedef std::reverse_iterator<iterator> reverse_iterator;
typedef std::reverse_iterator<const_iterator> const_reverse_iterator; typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
#elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) #elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC)
typedef std::reverse_iterator<iterator, std::random_access_iterator_tag, typedef std::reverse_iterator<iterator, std::random_access_iterator_tag,
value_type, reference, iterator, difference_type> reverse_iterator; value_type, reference, iterator, difference_type> reverse_iterator;
typedef std::reverse_iterator<const_iterator, std::random_access_iterator_tag, typedef std::reverse_iterator<const_iterator, std::random_access_iterator_tag,
value_type, const_reference, const_iterator, difference_type> const_reverse_iterator; value_type, const_reference, const_iterator, difference_type> const_reverse_iterator;
#else #else
@ -112,39 +112,39 @@ namespace boost {
} }
// operator[] // operator[]
reference operator[](size_type i) reference operator[](size_type i)
{ {
return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i]; return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i];
} }
/*BOOST_CONSTEXPR*/ const_reference operator[](size_type i) const /*BOOST_CONSTEXPR*/ const_reference operator[](size_type i) const
{ {
return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i]; return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i];
} }
// at() with range check // at() with range check
reference at(size_type i) { return rangecheck(i), elems[i]; } reference at(size_type i) { return rangecheck(i), elems[i]; }
/*BOOST_CONSTEXPR*/ const_reference at(size_type i) const { return rangecheck(i), elems[i]; } /*BOOST_CONSTEXPR*/ const_reference at(size_type i) const { return rangecheck(i), elems[i]; }
// front() and back() // front() and back()
reference front() reference front()
{
return elems[0];
}
BOOST_CONSTEXPR const_reference front() const
{ {
return elems[0]; return elems[0];
} }
reference back() BOOST_CONSTEXPR const_reference front() const
{ {
return elems[N-1]; return elems[0];
} }
BOOST_CONSTEXPR const_reference back() const reference back()
{ {
return elems[N-1]; return elems[N-1];
}
BOOST_CONSTEXPR const_reference back() const
{
return elems[N-1];
} }
// size is constant // size is constant
@ -213,9 +213,9 @@ namespace boost {
#if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS) #if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
typedef std::reverse_iterator<iterator> reverse_iterator; typedef std::reverse_iterator<iterator> reverse_iterator;
typedef std::reverse_iterator<const_iterator> const_reverse_iterator; typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
#elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) #elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC)
typedef std::reverse_iterator<iterator, std::random_access_iterator_tag, typedef std::reverse_iterator<iterator, std::random_access_iterator_tag,
value_type, reference, iterator, difference_type> reverse_iterator; value_type, reference, iterator, difference_type> reverse_iterator;
typedef std::reverse_iterator<const_iterator, std::random_access_iterator_tag, typedef std::reverse_iterator<const_iterator, std::random_access_iterator_tag,
value_type, const_reference, const_iterator, difference_type> const_reverse_iterator; value_type, const_reference, const_iterator, difference_type> const_reverse_iterator;
#else #else
@ -301,7 +301,7 @@ namespace boost {
// assign one value to all elements // assign one value to all elements
void assign (const T& value) { fill ( value ); } void assign (const T& value) { fill ( value ); }
void fill (const T& ) {} void fill (const T& ) {}
// check range (may be private because it is static) // check range (may be private because it is static)
static reference failed_rangecheck () { static reference failed_rangecheck () {
std::out_of_range e("attempt to access element of an empty array"); std::out_of_range e("attempt to access element of an empty array");
@ -353,16 +353,16 @@ namespace boost {
#if defined(__SUNPRO_CC) #if defined(__SUNPRO_CC)
// Trac ticket #4757; the Sun Solaris compiler can't handle // Trac ticket #4757; the Sun Solaris compiler can't handle
// syntax like 'T(&get_c_array(boost::array<T,N>& arg))[N]' // syntax like 'T(&get_c_array(boost::array<T,N>& arg))[N]'
// //
// We can't just use this for all compilers, because the // We can't just use this for all compilers, because the
// borland compilers can't handle this form. // borland compilers can't handle this form.
namespace detail { namespace detail {
template <typename T, std::size_t N> struct c_array template <typename T, std::size_t N> struct c_array
{ {
typedef T type[N]; typedef T type[N];
}; };
} }
// Specific for boost::array: simply returns its elems data member. // Specific for boost::array: simply returns its elems data member.
template <typename T, std::size_t N> template <typename T, std::size_t N>
typename detail::c_array<T,N>::type& get_c_array(boost::array<T,N>& arg) typename detail::c_array<T,N>::type& get_c_array(boost::array<T,N>& arg)
@ -383,7 +383,7 @@ namespace boost {
{ {
return arg.elems; return arg.elems;
} }
// Const version. // Const version.
template <typename T, std::size_t N> template <typename T, std::size_t N>
const T(&get_c_array(const boost::array<T,N>& arg))[N] const T(&get_c_array(const boost::array<T,N>& arg))[N]
@ -391,7 +391,7 @@ namespace boost {
return arg.elems; return arg.elems;
} }
#endif #endif
#if 0 #if 0
// Overload for std::array, assuming that std::array will have // Overload for std::array, assuming that std::array will have
// explicit conversion functions as discussed at the WG21 meeting // explicit conversion functions as discussed at the WG21 meeting
@ -401,7 +401,7 @@ namespace boost {
{ {
return static_cast<T(&)[N]>(arg); return static_cast<T(&)[N]>(arg);
} }
// Const version. // Const version.
template <typename T, std::size_t N> template <typename T, std::size_t N>
const T(&get_c_array(const std::array<T,N>& arg))[N] const T(&get_c_array(const std::array<T,N>& arg))[N]
@ -423,7 +423,7 @@ namespace boost {
BOOST_STATIC_ASSERT_MSG ( Idx < N, "boost::get<>(boost::array &) index out of range" ); BOOST_STATIC_ASSERT_MSG ( Idx < N, "boost::get<>(boost::array &) index out of range" );
return arr[Idx]; return arr[Idx];
} }
template <size_t Idx, typename T, size_t N> template <size_t Idx, typename T, size_t N>
const T &get(const boost::array<T,N> &arr) BOOST_NOEXCEPT { const T &get(const boost::array<T,N> &arr) BOOST_NOEXCEPT {
BOOST_STATIC_ASSERT_MSG ( Idx < N, "boost::get<>(const boost::array &) index out of range" ); BOOST_STATIC_ASSERT_MSG ( Idx < N, "boost::get<>(const boost::array &) index out of range" );
@ -440,7 +440,7 @@ namespace std {
BOOST_STATIC_ASSERT_MSG ( Idx < N, "std::get<>(boost::array &) index out of range" ); BOOST_STATIC_ASSERT_MSG ( Idx < N, "std::get<>(boost::array &) index out of range" );
return arr[Idx]; return arr[Idx];
} }
template <size_t Idx, typename T, size_t N> template <size_t Idx, typename T, size_t N>
const T &get(const boost::array<T,N> &arr) BOOST_NOEXCEPT { const T &get(const boost::array<T,N> &arr) BOOST_NOEXCEPT {
BOOST_STATIC_ASSERT_MSG ( Idx < N, "std::get<>(const boost::array &) index out of range" ); BOOST_STATIC_ASSERT_MSG ( Idx < N, "std::get<>(const boost::array &) index out of range" );
@ -449,8 +449,8 @@ namespace std {
} }
#endif #endif
#if BOOST_WORKAROUND(BOOST_MSVC, >= 1400) #if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)
# pragma warning(pop) # pragma warning(pop)
#endif #endif
#endif /*BOOST_ARRAY_HPP*/ #endif /*BOOST_ARRAY_HPP*/