-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathjslst.h
130 lines (115 loc) · 2.43 KB
/
jslst.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
typedef lst<var> vars;
void *newLst() {
return new vars;
}
void var::deleteLst() {
delete (vars*)ref->data, delete ref;
}
var var::splice(var start, var deleteCount, var item = argIgnore) {
var R = Array;
vars &L = *(vars*) ref->data;
int
x = start.toDouble(),
d = deleteCount.toDouble(),
size = length().toDouble();
if (d < 0) d = 0;
if (x >= size) return R;
if (x + d > size) d = size - x;
for (int i = x; i < x + d; i++) R.push(L[i]);
int N = 1;
if (item.type == varIgnore) N = 0;
L.delIns(x, d, &item, N);
return R;
}
var var::join(var separator) {
var R;
vars L;
int cnt = length().toDouble();
if (cnt == 0) {
return (var)"";
}
int all = 0;
for (int i = 0; i < cnt; i++) {
var t = self[i].toString();
all += t.length().toDouble();
L.push(t);
}
int seplen = (int)separator.length().toDouble();
int Rsize = all + (cnt-1) * seplen;
R.makeStringToSet();
R._chr().set(0, Rsize);
int x = 0;
for (int i = 0; i < cnt; i++) {
int subcnt = (int)L[i].length().toDouble();
L[i]._chr()._cpto(0, R._chr(), x, subcnt);
x += subcnt;
if (i == cnt - 1) break;
separator._chr()._cpto(0, R._chr(), x, seplen);
x += seplen;
}
return R;
}
var var::slice(var start, var end = undefined) {
// needs more testing
int
size = length().toDouble(),
a = start.toDouble(),
b = end.toDouble();
if (end == undefined) b = size;
else if (b < 0) b += size;
else if (b > size) b = size;
if (a < 0) a += size;
if (b < a) b = a+1;
if (type == varStr) {
var R;
R.makeStringToSet();
R._chr().set(&_chr().s[a], b-a);
return R;
}
if (type != varArr) return undefined;
var R = Array;
if (b <= a) { return R; }
vars &L = * (vars*) R.ref->data;
L.resize(b - a);
for (int i = 0; i < L.length(); i++) L[i] = self[a + i];
return R;
}
var var::push(var a) {
if (type != varArr) {
log("FATAL ERROR: push() into non-Array\n");
exit(1);
//return undefined;
}
vars *L = (vars*) ref->data;
L->push(a);
return a;
}
var var::pop() {
vars *L = (vars*) ref->data;
return L->pop();
}
var var::Push(var a) {
vars *L = (vars*) ref->data;
L->delIns(0, 0, &a, 1);
return a;
}
var var::Pop() {
vars *L = (vars*) ref->data;
var R = (*L)[0];
L->delIns(0, 1, 0, 0);
return R;
}
var var::length() {
if (type == varArr) {
vars *L = (vars*) ref->data;
return L->length();
}
if (type == varStr) {
return _chr().size;
}
return undefined;
}
var& var::getArrElement(int n) {
vars *L = (vars*) ref->data;
return (*L)[n];
}