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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
#pragma once
/**
@file
@brief tiny vector class
@author MITSUNARI Shigeo(@herumi)
@license modified new BSD license
http://opensource.org/licenses/BSD-3-Clause
*/
#include <stdlib.h>
#include <stddef.h>
#ifndef CYBOZU_DONT_USE_EXCEPTION
#include <new>
#endif
namespace mcl {
template<class T>
class Array {
T *p_;
size_t n_;
template<class U>
void swap_(U& x, U& y) const
{
U t;
t = x;
x = y;
y = t;
}
public:
Array() : p_(0), n_(0) {}
~Array()
{
free(p_);
}
#ifndef CYBOZU_DONT_USE_EXCEPTION
Array(const Array& rhs)
: p_(0)
, n_(0)
{
if (rhs.n_ == 0) return;
p_ = (T*)malloc(sizeof(T) * rhs.n_);
if (p_ == 0) throw std::bad_alloc();
n_ = rhs.n_;
for (size_t i = 0; i < n_; i++) {
p_[i] = rhs.p_[i];
}
}
Array& operator=(const Array& rhs)
{
Array tmp(rhs);
tmp.swap(*this);
return *this;
}
#endif
bool resize(size_t n)
{
if (n <= n_) {
n_ = n;
if (n == 0) {
free(p_);
p_ = 0;
}
return true;
}
T *q = (T*)malloc(sizeof(T) * n);
if (q == 0) return false;
for (size_t i = 0; i < n_; i++) {
q[i] = p_[i];
}
free(p_);
p_ = q;
n_ = n;
return true;
}
bool copy(const Array<T>& rhs)
{
if (this == &rhs) return true;
if (n_ < rhs.n_) {
clear();
if (!resize(rhs.n_)) return false;
}
for (size_t i = 0; i < rhs.n_; i++) {
p_[i] = rhs.p_[i];
}
n_ = rhs.n_;
return true;
}
void clear()
{
free(p_);
p_ = 0;
n_ = 0;
}
size_t size() const { return n_; }
void swap(Array<T>& rhs)
{
swap_(p_, rhs.p_);
swap_(n_, rhs.n_);
}
T& operator[](size_t n) { return p_[n]; }
const T& operator[](size_t n) const { return p_[n]; }
T* data() { return p_; }
const T* data() const { return p_; }
};
template<class T, size_t maxSize>
class FixedArray {
T p_[maxSize];
size_t n_;
FixedArray(const FixedArray&);
void operator=(const FixedArray&);
template<class U>
void swap_(U& x, U& y) const
{
U t;
t = x;
x = y;
y = t;
}
public:
FixedArray() : n_(0) {}
bool resize(size_t n)
{
if (n > maxSize) return false;
n_ = n;
return true;
}
void push(bool *pb, const T& x)
{
if (n_ == maxSize) {
*pb = false;
return;
}
p_[n_++] = x;
*pb = true;
}
bool copy(const FixedArray<T, maxSize>& rhs)
{
if (this == &rhs) return true;
for (size_t i = 0; i < rhs.n_; i++) {
p_[i] = rhs.p_[i];
}
n_ = rhs.n_;
return true;
}
void clear()
{
n_ = 0;
}
size_t size() const { return n_; }
void swap(FixedArray<T, maxSize>& rhs)
{
T *minP = p_;
size_t minN = n_;
T *maxP = rhs.p_;
size_t maxN = rhs.n_;
if (minP > maxP) {
swap_(minP, maxP);
swap_(minN, maxN);
}
for (size_t i = 0; i < minN; i++) {
swap_(minP[i], maxP[i]);
}
for (size_t i = minN; i < maxN; i++) {
minP[i] = maxP[i];
}
swap_(n_, rhs.n_);
}
T& operator[](size_t n) { return p_[n]; }
const T& operator[](size_t n) const { return p_[n]; }
T* data() { return p_; }
const T* data() const { return p_; }
};
} // mcl
|
