-
Notifications
You must be signed in to change notification settings - Fork 0
/
myarray.h
268 lines (234 loc) · 5.47 KB
/
myarray.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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
#pragma once
namespace mylib{
template<typename T>
class array_val
{
public:
inline array_val(){ data = nullptr; len = 0; }
inline array_val(int length){ data = new T[length]; len = length; }
inline ~array_val(){ if (data)delete[] data; }
array_val(const array_val& obj)
{
len = obj.len;
data = new T[len];
for (int i = 0; i < len; i++)
data[i] = obj.data[i];
}
array_val(array_val&& obj)
{
len = obj.len;
data = obj.data;
obj.data = nullptr;
}
array_val& operator=(const array_val& obj)
{
if (this == &obj)
return *this;
if (data)
delete[]data;
len = obj.len;
data = new T[len];
for (int i = 0; i < len; i++)
data[i] = obj.data[i];
}
array_val& operator=(array_val&& obj)
{
if (this == &obj)
return *this;
if (data)
delete[]data;
len = obj.len;
data = obj.data;
obj.data = nullptr;
}
inline T& operator[](int index){ return data[index]; }
inline const T& operator[](int index) const{ return data[index]; }
inline T* Data(){ return data; }
inline const T* Data() const{ return data };
inline void ReNew(int length){ if (data)delete data; data = new T[length]; len = length; }
inline operator T*(){ return data; }
inline operator const T*() const{ return data; }
inline int size() const{ return len; }
int search_in_order(T val)
{
int a = 0, b = len - 1, c;
while (b > a)
{
c = (a + b) / 2;
if (val == data[c])
return c;
if (val < data[c])
b = c - 1;
else
a = c + 1;
}
return -1;
}
private:
T* data;
int len;
};
class array_val_writter
{
public:
inline array_val_writter() { data = nullptr; len = 0; cur = 0; }
inline array_val_writter(int length){ data = new char[length]; memset(data, 0, length); len = length; cur = 0; }
inline ~array_val_writter(){ if (data)delete[] data; }
inline array_val_writter(const array_val_writter& obj)
{
len = obj.len;
data = new char[len];
cur = obj.cur;
for (int i = 0; i < len; i++)
data[i] = obj.data[i];
}
inline array_val_writter(array_val_writter&& obj)
{
len = obj.len;
data = obj.data;
cur = obj.cur;
obj.data = nullptr;
}
inline array_val_writter& operator=(const array_val_writter& obj)
{
if (this == &obj)
return *this;
if (data)
delete[]data;
cur = obj.cur;
len = obj.len;
data = new char[len];
for (int i = 0; i < len; i++)
data[i] = obj.data[i];
}
inline array_val_writter& operator=(array_val_writter&& obj)
{
if (this == &obj)
return *this;
if (data)
delete[]data;
cur = obj.cur;
len = obj.len;
data = obj.data;
obj.data = nullptr;
}
inline char& operator[](int index){ return data[index]; }
inline const char& operator[](int index) const{ return data[index]; }
inline char* Data(){ return data; }
inline const char* Data() const{ return data; }
inline void ReNew(int length){ if (data)delete data; data = new char[length]; len = length; }
inline operator char*(){ return data; }
inline operator const char*() const{ return data; }
inline int size() const{ return len; }
inline int current() const{ return cur; }
inline int setcur(int c){ return (cur = c); }
inline int seek(int c){ return (cur += c); }
inline void write(const void* src, int len){
if (cur + len > this->len)
throw std::logic_error("no much memory");
memcpy(data + cur, src, len); cur += len;
}
inline void read(void* dst, int len)
{
if (cur + len > this->len)
throw std::logic_error("no much memory");
memcpy(dst, data + cur, len); cur += len;
}
inline mylib::string readstring()
{
int i;
for (i = cur; i < len; i++)
{
if (data[i] == '\0')
{
int curold = cur;
cur = i + 1;
return mylib::string(data+curold);
}
}
throw std::logic_error("no string end.");
}
private:
int cur;
char* data;
int len;
};
template<class T>
class myptr
{
public:
myptr(T * ptr){ this->ptr = ptr; }
~myptr(){ delete ptr; }
myptr(const myptr<T>&) = delete;
myptr<T> & operator=(const myptr<T>&) = delete;
T* operator*(){ return ptr; }
const T* operator*() const{ return ptr; }
T* operator->(){ return ptr; }
const T* operator->() const{ return ptr; }
operator T* (){ return ptr; }
operator const T* ()const{ return ptr; }
private:
T * ptr;
};
template<class T>
class myptr_shared
{
public:
myptr_shared(T* p)
{
ptr = p;
ref = new int(1);
}
myptr_shared()
{
ptr = nullptr;
ref = nullptr;
}
~myptr_shared()
{
if (ref)
{
(*ref)--;
if (!(*ref))
{
delete ptr;
delete ref;
ref = nullptr;
}
}
}
myptr_shared(const myptr_shared& obj)
{
ptr = obj.ptr;
ref = obj.ref;
if (ref)
(*ref)++;
}
myptr_shared& operator=(const myptr_shared&)
{
if (ref)
{
(*ref)--;
if (!(*ref))
{
delete ptr;
delete ref;
ref = nullptr;
}
}
ptr = obj.ptr;
ref = obj.ref;
if (ref)
(*ref)++;
}
T& operator*(){ return *ptr; }
const T& operator*() const{ return *ptr; }
T* operator->(){ return ptr; }
const T* operator->() const{ return ptr; }
operator T* (){ return ptr; }
operator const T* ()const{ return ptr; }
private:
T * ptr;
int * ref;
};
}