1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Sprout/sprout/array.hpp

306 lines
8.9 KiB
C++
Raw Normal View History

2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ARRAY_HPP
#define SPROUT_ARRAY_HPP
#include <cstddef>
#include <algorithm>
#include <utility>
#include <stdexcept>
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/index_tuple.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
2011-09-30 15:04:03 +00:00
#include <sprout/iterator.hpp>
#include <sprout/utility/forward.hpp>
2012-04-01 13:15:09 +00:00
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT
2011-10-08 06:10:23 +00:00
#if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION
2011-10-08 02:30:39 +00:00
# include <sprout/iterator/index_iterator.hpp>
#endif
2011-09-01 02:48:32 +00:00
namespace sprout {
//
// array
//
template<typename T, std::size_t N>
class array {
public:
typedef T value_type;
2011-10-08 06:10:23 +00:00
#if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION
2011-10-08 02:30:39 +00:00
typedef sprout::index_iterator<array&> iterator;
typedef sprout::index_iterator<array const&> const_iterator;
#else
2011-09-01 02:48:32 +00:00
typedef T* iterator;
typedef T const* const_iterator;
2011-10-08 02:30:39 +00:00
#endif
2011-09-01 02:48:32 +00:00
typedef T& reference;
typedef T const& const_reference;
typedef std::size_t size_type;
typedef std::ptrdiff_t difference_type;
typedef T* pointer;
typedef T const* const_pointer;
2011-09-30 15:04:03 +00:00
typedef sprout::reverse_iterator<iterator> reverse_iterator;
typedef sprout::reverse_iterator<const_iterator> const_reverse_iterator;
2011-09-01 02:48:32 +00:00
public:
2011-09-03 13:26:26 +00:00
SPROUT_STATIC_CONSTEXPR size_type static_size = N;
2011-09-01 02:48:32 +00:00
public:
value_type elems[static_size ? static_size : 1];
2011-09-01 02:48:32 +00:00
public:
void fill(const_reference value) {
std::fill_n(begin(), size(), value);
2011-09-01 02:48:32 +00:00
}
void swap(array<T, N>& other) SPROUT_NOEXCEPT_EXPR(SPROUT_NOEXCEPT_EXPR(std::swap(std::declval<T&>(), std::declval<T&>()))) {
std::swap_ranges(other.begin(), other.end(), begin());
2011-09-01 02:48:32 +00:00
}
// iterators:
2011-10-08 06:10:23 +00:00
#if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION
2011-10-08 02:30:39 +00:00
iterator begin() SPROUT_NOEXCEPT {
return iterator(*this, 0);
}
SPROUT_CONSTEXPR const_iterator begin() const SPROUT_NOEXCEPT {
return const_iterator(*this, 0);
}
iterator end() SPROUT_NOEXCEPT {
return iterator(*this, size());
}
SPROUT_CONSTEXPR const_iterator end() const SPROUT_NOEXCEPT {
return const_iterator(*this, size());
}
#else
2011-09-01 02:48:32 +00:00
iterator begin() SPROUT_NOEXCEPT {
2011-09-05 02:51:05 +00:00
return &elems[0];
2011-09-01 02:48:32 +00:00
}
SPROUT_CONSTEXPR const_iterator begin() const SPROUT_NOEXCEPT {
2011-09-05 02:51:05 +00:00
return &elems[0];
2011-09-01 02:48:32 +00:00
}
iterator end() SPROUT_NOEXCEPT {
2011-09-05 02:51:05 +00:00
return &elems[0] + size();
2011-09-01 02:48:32 +00:00
}
SPROUT_CONSTEXPR const_iterator end() const SPROUT_NOEXCEPT {
2011-09-05 02:51:05 +00:00
return &elems[0] + size();
2011-09-01 02:48:32 +00:00
}
2011-10-08 02:30:39 +00:00
#endif
2011-09-01 02:48:32 +00:00
reverse_iterator rbegin() SPROUT_NOEXCEPT {
return reverse_iterator(end());
2011-09-01 02:48:32 +00:00
}
SPROUT_CONSTEXPR const_reverse_iterator rbegin() const SPROUT_NOEXCEPT {
return const_reverse_iterator(end());
2011-09-01 02:48:32 +00:00
}
reverse_iterator rend() SPROUT_NOEXCEPT {
return reverse_iterator(begin());
2011-09-01 02:48:32 +00:00
}
SPROUT_CONSTEXPR const_reverse_iterator rend() const SPROUT_NOEXCEPT {
return const_reverse_iterator(begin());
2011-09-01 02:48:32 +00:00
}
#if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION
SPROUT_CONSTEXPR const_iterator cbegin() const SPROUT_NOEXCEPT {
return const_iterator(*this, 0);
}
SPROUT_CONSTEXPR const_iterator cend() const SPROUT_NOEXCEPT {
return const_iterator(*this, size());
}
#else
SPROUT_CONSTEXPR const_iterator cbegin() const SPROUT_NOEXCEPT {
return &elems[0];
}
SPROUT_CONSTEXPR const_iterator cend() const SPROUT_NOEXCEPT {
return &elems[0] + size();
}
#endif
SPROUT_CONSTEXPR const_reverse_iterator crbegin() const SPROUT_NOEXCEPT {
return const_reverse_iterator(end());
}
2011-09-01 02:48:32 +00:00
SPROUT_CONSTEXPR const_reverse_iterator crend() const SPROUT_NOEXCEPT {
return const_reverse_iterator(begin());
2011-09-01 02:48:32 +00:00
}
// capacity:
SPROUT_CONSTEXPR size_type size() const SPROUT_NOEXCEPT {
return static_size;
}
SPROUT_CONSTEXPR size_type max_size() const SPROUT_NOEXCEPT {
return size();
}
SPROUT_CONSTEXPR bool empty() const SPROUT_NOEXCEPT {
return size() == 0;
}
// element access:
2011-09-01 02:48:32 +00:00
reference operator[](size_type i) {
return elems[i];
}
SPROUT_CONSTEXPR const_reference operator[](size_type i) const {
return elems[i];
}
reference at(size_type i) {
return i < size()
? elems[i]
: (throw std::out_of_range("array<>: index out of range"), elems[i])
;
}
SPROUT_CONSTEXPR const_reference at(size_type i) const {
return i < size()
? elems[i]
: (throw std::out_of_range("array<>: index out of range"), elems[i])
;
2011-09-01 02:48:32 +00:00
}
reference front() {
return elems[0];
}
SPROUT_CONSTEXPR const_reference front() const {
2011-09-03 13:26:26 +00:00
return elems[0];
2011-09-01 02:48:32 +00:00
}
reference back() {
return elems[size() - 1];
}
SPROUT_CONSTEXPR const_reference back() const {
2011-09-03 13:26:26 +00:00
return elems[size() - 1];
2011-09-01 02:48:32 +00:00
}
2011-09-01 02:48:32 +00:00
pointer data() SPROUT_NOEXCEPT {
2011-09-05 02:51:05 +00:00
return &elems[0];
2011-09-01 02:48:32 +00:00
}
SPROUT_CONSTEXPR const_pointer data() const SPROUT_NOEXCEPT {
2011-09-05 02:51:05 +00:00
return &elems[0];
2011-09-01 02:48:32 +00:00
}
// others:
2011-10-06 12:45:01 +00:00
template<typename T2>
2011-09-01 02:48:32 +00:00
array<T, N>& operator=(array<T2, N> const& rhs) {
std::copy(rhs.begin(), rhs.end(), begin());
return *this;
}
2011-10-06 12:45:01 +00:00
template<typename T2>
2011-09-01 02:48:32 +00:00
array<T, N>& operator=(array<T2, N>&& rhs) {
std::move(rhs.begin(), rhs.end(), begin());
return *this;
}
pointer c_array() SPROUT_NOEXCEPT {
return &elems[0];
}
void assign(const_reference value) {
fill(value);
}
void rangecheck(size_type i) const {
if (i >= size()) {
throw std::out_of_range("array<>: index out of range");
}
}
2011-09-01 02:48:32 +00:00
};
2011-10-10 12:06:34 +00:00
template<typename T, std::size_t N>
SPROUT_CONSTEXPR typename sprout::array<T, N>::size_type sprout::array<T, N>::static_size;
//
// operator==
// operator!=
// operator<
// operator>
// operator<=
// operator>=
//
2011-09-01 02:48:32 +00:00
template<typename T, std::size_t N>
inline SPROUT_CONSTEXPR bool operator==(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
2012-04-01 13:15:09 +00:00
return NS_SSCRISK_CEL_OR_SPROUT::equal(lhs.begin(), lhs.end(), rhs.begin());
2011-09-01 02:48:32 +00:00
}
template<typename T, std::size_t N>
inline SPROUT_CONSTEXPR bool operator!=(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
2011-09-01 02:48:32 +00:00
return !(lhs == rhs);
}
template<typename T, std::size_t N>
inline SPROUT_CONSTEXPR bool operator<(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
2012-04-01 13:15:09 +00:00
return NS_SSCRISK_CEL_OR_SPROUT::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
2011-09-01 02:48:32 +00:00
}
template<typename T, std::size_t N>
inline SPROUT_CONSTEXPR bool operator>(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
2011-09-01 02:48:32 +00:00
return rhs < lhs;
}
template<typename T, std::size_t N>
inline SPROUT_CONSTEXPR bool operator<=(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
2011-09-01 02:48:32 +00:00
return !(rhs < lhs);
}
template<typename T, std::size_t N>
inline SPROUT_CONSTEXPR bool operator>=(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
2011-09-01 02:48:32 +00:00
return !(lhs < rhs);
}
//
// swap
//
template<typename T, std::size_t N>
2011-09-25 16:56:47 +00:00
inline void swap(sprout::array<T, N>& lhs, sprout::array<T, N>& rhs) SPROUT_NOEXCEPT_EXPR(SPROUT_NOEXCEPT_EXPR(lhs.swap(rhs))) {
2011-09-01 02:48:32 +00:00
lhs.swap(rhs);
}
//
// make_array
//
template<typename T, typename... Types>
inline SPROUT_CONSTEXPR sprout::array<T, sizeof...(Types)> make_array(Types&&... args) {
return sprout::array<T, sizeof...(Types)>{{sprout::forward<Types>(args)...}};
2011-09-01 02:48:32 +00:00
}
//
// make_common_array
//
template<typename... Types>
inline SPROUT_CONSTEXPR sprout::array<typename std::common_type<typename std::decay<Types>::type...>::type, sizeof...(Types)> make_common_array(Types&&... args) {
return sprout::array<typename std::common_type<typename std::decay<Types>::type...>::type, sizeof...(Types)>{{sprout::forward<Types>(args)...}};
2011-09-01 02:48:32 +00:00
}
namespace detail {
2012-02-28 01:46:39 +00:00
template<typename T, std::size_t N, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR sprout::array<T, N> to_array_impl(
2011-09-01 02:48:32 +00:00
T const (& arr)[N],
sprout::index_tuple<Indexes...>
)
{
2011-09-05 02:51:05 +00:00
return sprout::array<T, N>{{arr[Indexes]...}};
2011-09-01 02:48:32 +00:00
}
} // namespace detail
//
// to_array
//
template<typename T, std::size_t N>
inline SPROUT_CONSTEXPR sprout::array<T, N> to_array(T const (& arr)[N]) {
2011-09-01 02:48:32 +00:00
return sprout::detail::to_array_impl(arr, typename sprout::index_range<0, N>::type());
}
//
// is_array
//
template<typename T>
struct is_array
2012-04-13 12:23:49 +00:00
: public std::false_type
{};
template<typename T>
struct is_array<T const>
: public sprout::is_array<T>
{};
template<typename T>
struct is_array<T const volatile>
: public sprout::is_array<T>
{};
template<typename T, std::size_t N>
struct is_array<sprout::array<T, N> >
: public std::true_type
{};
2011-09-01 02:48:32 +00:00
} // namespace sprout
namespace std {
//
// tuple_size
//
template<typename T, std::size_t N>
struct tuple_size<sprout::array<T, N> >
: public std::integral_constant<std::size_t, N>
{};
2011-09-01 02:48:32 +00:00
//
// tuple_element
//
template<std::size_t I, typename T, std::size_t N>
struct tuple_element<I, sprout::array<T, N> > {
public:
static_assert(I < N, "tuple_element<>: index out of range");
typedef T type;
};
} // namespace std
#endif // #ifndef SPROUT_ARRAY_HPP