forked from andrewprock/ustl
-
Notifications
You must be signed in to change notification settings - Fork 0
/
uarray.h
152 lines (137 loc) · 7.53 KB
/
uarray.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
// This file is part of the uSTL library, an STL implementation.
//
// Copyright (c) 2014 by Mike Sharov <[email protected]>
// This file is free software, distributed under the MIT License.
#pragma once
#include "mistream.h"
#include "mostream.h"
namespace ustl {
/// \class array array.h stl.h
/// \ingroup Sequences
///
/// \brief A fixed-size array of \p N \p Ts.
///
template <typename T, size_t N>
class array {
public:
typedef T value_type;
typedef unsigned size_type;
typedef value_type* pointer;
typedef const value_type* const_pointer;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef pointer iterator;
typedef const_pointer const_iterator;
typedef ::ustl::reverse_iterator<iterator> reverse_iterator;
typedef ::ustl::reverse_iterator<const_iterator> const_reverse_iterator;
public:
#if HAVE_CPP11
using initlist_t = std::initializer_list<value_type>;
inline array& operator+= (initlist_t v) { for (size_type i = 0; i < N; ++i) _v[i] += v.begin()[i]; return *this; }
inline array& operator-= (initlist_t v) { for (size_type i = 0; i < N; ++i) _v[i] -= v.begin()[i]; return *this; }
inline array& operator*= (initlist_t v) { for (size_type i = 0; i < N; ++i) _v[i] *= v.begin()[i]; return *this; }
inline array& operator/= (initlist_t v) { for (size_type i = 0; i < N; ++i) _v[i] /= v.begin()[i]; return *this; }
inline array operator+ (initlist_t v) const { array result; for (size_type i = 0; i < N; ++i) result[i] = _v[i] + v.begin()[i]; return result; }
inline array operator- (initlist_t v) const { array result; for (size_type i = 0; i < N; ++i) result[i] = _v[i] - v.begin()[i]; return result; }
inline array operator* (initlist_t v) const { array result; for (size_type i = 0; i < N; ++i) result[i] = _v[i] * v.begin()[i]; return result; }
inline array operator/ (initlist_t v) const { array result; for (size_type i = 0; i < N; ++i) result[i] = _v[i] / v.begin()[i]; return result; }
#else
inline array (void) { fill_n (_v, N, T()); }
template <typename T2>
inline array (const array<T2,N>& v) { copy_n (v.begin(), N, _v); }
inline array (const array& v) { copy_n (v.begin(), N, _v); }
inline array (const_pointer v) { copy_n (v, N, _v); }
explicit inline array (const_reference v0) { fill_n (_v, N, v0); }
inline array (const_reference v0, const_reference v1) { _v[0] = v0; fill_n (_v+1,N-1,v1); }
inline array (const_reference v0, const_reference v1, const_reference v2) { _v[0] = v0; _v[1] = v1; fill_n (_v+2,N-2,v2); }
inline array (const_reference v0, const_reference v1, const_reference v2, const_reference v3) { _v[0] = v0; _v[1] = v1; _v[2] = v2; fill_n (_v+3,N-3,v3); }
template <typename T2>
inline array& operator= (const array<T2,N>& v) { copy_n (v.begin(), N, _v); return *this; }
inline array& operator= (const array& v) { copy_n (v.begin(), N, _v); return *this; }
#endif
inline iterator begin (void) { return _v; }
inline iterator end (void) { return begin() + N; }
inline reference at (size_type i) { return _v[i]; }
inline reference operator[] (size_type i) { return _v[i]; }
inline constexpr const_iterator begin (void) const { return _v; }
inline constexpr const_iterator end (void) const { return begin() + N; }
inline constexpr size_type size (void) const { return N; }
inline constexpr size_type max_size (void) const { return N; }
inline constexpr bool empty (void) const { return N == 0; }
inline constexpr const_reference at (size_type i) const { return _v[i]; }
inline constexpr const_reference operator[] (size_type i) const { return _v[i]; }
inline void read (istream& is) { nr_container_read (is, *this); }
inline void write (ostream& os) const { nr_container_write (os, *this); }
inline void text_write (ostringstream& os) const { container_text_write (os, *this); }
inline size_t stream_size (void) const { return nr_container_stream_size (*this); }
inline array& operator+= (const_reference v) { for (size_type i = 0; i < N; ++i) _v[i] += v; return *this; }
inline array& operator-= (const_reference v) { for (size_type i = 0; i < N; ++i) _v[i] -= v; return *this; }
inline array& operator*= (const_reference v) { for (size_type i = 0; i < N; ++i) _v[i] *= v; return *this; }
inline array& operator/= (const_reference v) { for (size_type i = 0; i < N; ++i) _v[i] /= v; return *this; }
inline array operator+ (const_reference v) const { array result; for (size_type i = 0; i < N; ++i) result[i] = _v[i] + v; return result; }
inline array operator- (const_reference v) const { array result; for (size_type i = 0; i < N; ++i) result[i] = _v[i] - v; return result; }
inline array operator* (const_reference v) const { array result; for (size_type i = 0; i < N; ++i) result[i] = _v[i] * v; return result; }
inline array operator/ (const_reference v) const { array result; for (size_type i = 0; i < N; ++i) result[i] = _v[i] / v; return result; }
inline void fill (const_reference v) { ::ustl::fill (begin(), end(), v); }
inline void swap (array& v) { swap_ranges (begin(), end(), v.begin()); }
public:
T _v [N];
};
//----------------------------------------------------------------------
template <typename T1, size_t N, typename T2>
inline bool operator== (const array<T1,N>& t1, const array<T2,N>& t2)
{
for (unsigned i = 0; i < N; ++ i)
if (t1[i] != t2[i])
return false;
return true;
}
template <typename T1, size_t N, typename T2>
inline bool operator< (const array<T1,N>& t1, const array<T2,N>& t2)
{
for (unsigned i = 0; i < N && t1[i] <= t2[i]; ++ i)
if (t1[i] < t2[i])
return true;
return false;
}
template <typename T1, size_t N, typename T2>
inline const array<T1,N>& operator+= (array<T1,N>& t1, const array<T2,N>& t2)
{ for (unsigned i = 0; i < N; ++ i) t1[i] = T1(t1[i] + t2[i]); return t1; }
template <typename T1, size_t N, typename T2>
inline const array<T1,N>& operator-= (array<T1,N>& t1, const array<T2,N>& t2)
{ for (unsigned i = 0; i < N; ++ i) t1[i] = T1(t1[i] - t2[i]); return t1; }
template <typename T1, size_t N, typename T2>
inline const array<T1,N>& operator*= (array<T1,N>& t1, const array<T2,N>& t2)
{ for (unsigned i = 0; i < N; ++ i) t1[i] = T1(t1[i] * t2[i]); return t1; }
template <typename T1, size_t N, typename T2>
inline const array<T1,N>& operator/= (array<T1,N>& t1, const array<T2,N>& t2)
{ for (unsigned i = 0; i < N; ++ i) t1[i] = T1(t1[i] / t2[i]); return t1; }
template <typename T1, size_t N, typename T2>
inline const array<T1,N> operator+ (const array<T1,N>& t1, const array<T2,N>& t2)
{
array<T1,N> result;
for (unsigned i = 0; i < N; ++ i) result[i] = T1(t1[i] + t2[i]);
return result;
}
template <typename T1, size_t N, typename T2>
inline const array<T1,N> operator- (const array<T1,N>& t1, const array<T2,N>& t2)
{
array<T1,N> result;
for (unsigned i = 0; i < N; ++ i) result[i] = T1(t1[i] - t2[i]);
return result;
}
template <typename T1, size_t N, typename T2>
inline const array<T1,N> operator* (const array<T1,N>& t1, const array<T2,N>& t2)
{
array<T1,N> result;
for (unsigned i = 0; i < N; ++ i) result[i] = T1(t1[i] * t2[i]);
return result;
}
template <typename T1, size_t N, typename T2>
inline const array<T1,N> operator/ (const array<T1,N>& t1, const array<T2,N>& t2)
{
array<T1,N> result;
for (unsigned i = 0; i < N; ++ i) result[i] = T1(t1[i] / t2[i]);
return result;
}
} // namespace ustl