-
Notifications
You must be signed in to change notification settings - Fork 0
/
SimpleArray.h
158 lines (128 loc) · 3.2 KB
/
SimpleArray.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
153
154
155
156
157
158
#ifndef SIMPLE_ARRAY_H
#define SIMPLE_ARRAY_H
#include <stdexcept> //size_t, std::out_of_range
#include <iterator> // std::iterator, std::input_iterator_tag
#include <algorithm> //std::copy
namespace ph{
template<class T>
class SimpleArray{
public:
//Iterator
class Iterator : public std::iterator<std::input_iterator_tag, T>{
public:
Iterator(T* x) :p(x) {}
Iterator(const Iterator& mit) : p(mit.p) {}
Iterator& operator++() {++p;return *this;}
Iterator operator++(int) {Iterator tmp(*this); operator++(); return tmp;}
bool operator==(const Iterator& rhs) const {return p==rhs.p;}
bool operator!=(const Iterator& rhs) const {return p!=rhs.p;}
T& operator*() {return *p;}
private:
T* p;
};
//Constructor
explicit SimpleArray(const size_t size)
: m_size(size), m_data(nullptr)
{
if(size > 0)
m_data = new T[size];
}
//Copy Constructor
SimpleArray(const SimpleArray& arr)
: m_size(arr.m_size)
{
m_data = new T[m_size];
std::copy(arr.m_data, arr.m_data + m_size, m_data);
}
//Assignment operator
SimpleArray& operator=(SimpleArray other){
swap(*this, other);
return *this;
}
//move Constructor
SimpleArray(SimpleArray&& other)
:SimpleArray()
{
swap(*this, other);
};
//Destructor
~SimpleArray(){
delete[] m_data;
}
//Element access
T& at(const size_t pos){
if(pos < m_size){
return m_data[pos];
}
throw std::out_of_range("SimpleArray out of Range");
}
const T& at(const size_t pos) const {
if(pos < m_size){
return m_data[pos];
}
throw std::out_of_range("SimpleArray out of Range");
}
T& operator[] (const size_t pos){
return m_data[pos];
}
const T& operator[] (const size_t pos) const {
return m_data[pos];
}
T& front() {
return m_data[0];
}
const T& front() const {
return m_data[0];
}
T& back() {
return m_data[m_size - 1];
}
const T& back() const {
return m_data[m_size - 1];
}
T* data() noexcept {
return m_data;
}
const T* data() const noexcept {
return m_data;
}
//Capacity
const size_t size() const noexcept {
return m_size;
}
const bool empty() const noexcept {
return m_size == 0;
}
constexpr size_t max_size() const noexcept {
return ~(0U);
}
//Iteratoren
Iterator begin() noexcept {
return Iterator(m_data);
}
const Iterator begin() const noexcept {
return Iterator(m_data);
}
Iterator end() noexcept {
return Iterator(m_data + m_size);
}
const Iterator end() const noexcept {
return Iterator(m_data + m_size);
}
//Modifieres
//from: https://stackoverflow.com/questions/3279543/what-is-the-copy-and-swap-idiom
friend void swap(SimpleArray& first, SimpleArray& second){
using std::swap;
swap(first.m_size, second.m_size);
swap(first.m_data, second.m_data);
}
void fill(const T& val){
using std::fill;
std::fill(begin(), end(), val);
}
private:
size_t m_size;
T* m_data;
};
}
#endif