-
Notifications
You must be signed in to change notification settings - Fork 0
/
classes.d
397 lines (333 loc) · 7.47 KB
/
classes.d
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
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
module sard.classes;
/**
* This file is part of the "SARD"
*
* @license The MIT License (MIT) Included in this distribution
* @author Zaher Dirkey <zaherdirkey at yahoo dot com>
*/
import std.stdio;
import std.string;
import std.conv;
import std.uni;
import std.array;
import std.range;
import std.file;
import sard.utils;
//alias bool bool; //already exists
alias long integer;
alias double number;
alias string text;
/**---------------------------*/
/** Exception
/**---------------------------*/
class CodeException: Exception
{
private uint _code;
@property uint code() { return _code; }
public:
this(string msg, int code = -1) {
_code = code;
super(msg);
}
}
class ParserException: Exception
{
private int _line;
private int _column;
@property {
int line() {
return _line;
}
int column() {
return _column;
}
}
this(string msg, int line, int column ) {
_line = line;
_column = column;
super(msg);
}
}
void error(string err, int code = -1)
{
throw new CodeException(err, code);
}
/**---------------------------*/
/** Base classes
/**---------------------------*/
class BaseObject: Object
{
protected:
public:
debug(log_nodes) {
/*void printTree(){
auto a = [__traits(allMembers, typeof(this))];
foreach (member; a)
{
writeln(member);
}
writeln();
}*/
debug(log_nodes) void debugWrite(int level){
writeln(stringRepeat(" ", level * 2) ~ this.classinfo.nakename);
}
}
this(){
created();
}
~this(){
destroyed();
}
void created(){
}
void destroyed() {
}
}
class BaseNamedObject: BaseObject {
string _name;
public @property string name(){ return _name; }
public @property string name(string value){
return _name = value;
}
}
//class Objects(T): BaseObject if(is(T: SomeObject)) {
//class Objects(T: BaseObject): BaseObject
class Objects(T): BaseObject
{
private:
T[] _items;//TODO hash string list for namedobjects
bool _owned;
public:
//alias items = this;
protected:
T getItem(int index) {
return _items[index];
}
void beforeAdd(T object){
}
void afterAdd(T object){
debug(log) {
//writeln(this.classinfo.nakename ~ ".add(" ~ object.classinfo.nakename ~ ")");
}
}
public:
int add(T object)
{
beforeAdd(object);
_items = _items ~ object;
afterAdd(object);
return _items.length - 1;
}
T opIndex(size_t index) {
return getItem(index);
}
@property int count(){
return _items.length;
}
@property bool empty(){
return _items.length == 0;
}
@property T first(){
if (_items.length == 0)
return null;
else
return _items[0];
}
int opApply(int delegate(T) dg)
{
foreach(itm; _items)
{
int b = dg(itm);
if (b)
return b;
}
return 0;
}
@property T last()
{
if (_items.length == 0)
return null;
else
return _items[_items.length - 1];
}
this(bool owned = true){
_owned = owned;
super();
}
~this(){
if (_owned)
{
clear();
}
}
void clear()
{
int i = 0;
while (i < _items.length){
destroy(_items[i]);
_items[i] = null;
i++;
}
_items = null;
}
debug(log_nodes) {
override void debugWrite(int level){
super.debugWrite(level);
writeln(stringRepeat(" ", level * 2) ~ "Count: " ~ to!string(count));
foreach(itm; items) {
itm.debugWrite(level + 1);
}
}
}
}
class NamedObjects(T: BaseObject): Objects!T
{
public:
T find(const string name)
{
T result = null;
foreach(itm; this) {
if (icmp(name, itm.name) == 0) {
result = itm;
break;
}
}
return result;
}
bool isOpenBy(const char c)
{
foreach(itm; this){
if (!itm.name.empty && (itm.name[0] == toLower(c)))
return true;
}
return false;
}
T scan(string text, int index)
{
T result = null;
int max = 0;
foreach(itm; this)
{
if (scanCompare(itm.name, text, index))
{
if (max < itm.name.length)
{
max = itm.name.length;
result = itm;
}
}
}
return result;
}
}
/**---------------------------*/
/** Stack
/**---------------------------*/
class Stack(T): BaseObject
{
protected:
bool own = true; //free when remove it
static class StackItem: BaseObject {
protected {
T object;
StackItem parent;
}
public {
Stack owner;
int level;
}
}
private:
int _count;
StackItem _currentItem;
public:
@property int count() { return _count; }
@property StackItem currentItem() { return _currentItem; }
protected:
T getParent() {
if (_currentItem is null)
return null;
else if (_currentItem.parent is null)
return null;
else
return _currentItem.parent.object;
}
T getCurrent()
{
if (currentItem is null)
return null;
else
return currentItem.object;
}
public @property T current() { return getCurrent(); }
public @property T parent() { return getParent(); }
void afterPush() {
debug(log) {
writeln("push: " ~ T.classinfo.nakename);
}
};
void beforePop() {
debug(log){
writeln("pop: " ~ T.classinfo.nakename);
}
};
public:
bool isEmpty() {
return currentItem is null;
}
void push(T aObject)
{
if (aObject is null)
error("Can't push null");
StackItem aItem = new StackItem();
aItem.object = aObject;
aItem.parent = _currentItem;
aItem.owner = this;
if (_currentItem is null)
aItem.level = 0;
else
aItem.level = _currentItem.level + 1;
_currentItem = aItem;
_count++;
afterPush();
}
T peek(){
if (currentItem is null)
return null;
else
return currentItem.object;
}
T pull(){
if (currentItem is null)
error("Stack is empty");
beforePop();
T object = currentItem.object;
StackItem aItem = currentItem;
_currentItem = aItem.parent;
_count--;
destroy(aItem);
return object;
}
void pop()
{
T object = pull();
if (own)
destroy(object);
}
void clear(){
while (!(current is null))
pop();
}
this(){
super();
}
~this(){
if (own)
clear();
}
}
//functions
bool indexInStr(int index,string str) {
return index < str.length;
//return index <= str.length; in Pascal
}