File: array.bs

package info (click to toggle)
storm-lang 0.7.5-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 52,028 kB
  • sloc: ansic: 261,471; cpp: 140,432; sh: 14,891; perl: 9,846; python: 2,525; lisp: 2,504; asm: 860; makefile: 678; pascal: 70; java: 52; xml: 37; awk: 12
file content (250 lines) | stat: -rw-r--r-- 3,898 bytes parent folder | download | duplicates (2)
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
use core;
use core:debug;

Int testArray() {
	Array<Dbg> a;

	for (Int i = 0; i < 22; i++) {
		a << Dbg(i);
	}

	a[1] = Dbg(0);

	Int sum = 0;
	for (Nat i = 0; i < a.count; i++) {
		sum = sum + a[i].get;
	}

	sum;
}

Int testIntArray() {
	Int[] a;

	for (Int i = 0; i < 20; i++)
		a << i;

	for (Int i = 5; i < 15; i++)
		a[i.nat] = 0;

	Int sum;
	for (Nat i = 0; i < a.count; i++)
		sum = sum + a[i];

	sum;
}

Int testInitArray() {
	Int[] a = Int:[1, 3, 3, 7];

	Int sum;
	for (Nat i = 0; i < a.count; i++)
		sum = sum * 10 + a[i];

	sum;

	// Comments with brackets in them causes problems?
	// for foo () {
	// }
	// Hope not!
}

Int testInitAutoArray() {
	var a = [1, 2, 3, 4];

	Int sum;
	for (Nat i = 0; i < a.count; i++)
		sum = sum * 10 + a[i];

	sum;
}

Int testAutoArray() {
	Int[] a = [];
	a.count.int;
}

Int testCastArray() {
	Dbg a(10);
	Dbg b(20);
	Object[] z = [a, b];
	z.count.int;
}

Array<Int> createValArray() {
	Array<Int> a;

	for (Int i = 0; i < 20; i++)
		a << Int(i);

	a;
}

Array<DbgActor> createActorArray() {
	Array<DbgActor> dbg;
	for (Int i = 0; i < 4; i++)
		dbg << DbgActor(i + 1);

	dbg;
}

Int testIterator() {
	Int[] data = [1, 2, 3, 4, 5];
	Int sum = 0;

	for (i in data) {
		sum += i;
	}

	sum;
}

Int testIteratorIndex() {
	Int[] data = [3, 2, 1, 4];
	Int sum = 0;

	for (k, v in data) {
		sum += k.int * v;
	}

	sum;
}

Array<Int> smallIntArray() {
	Array<Int> r;
	for (Int i = 0; i < 5; i++)
		r << (5 - i);
	r;
}

Str sortArray() {
	Array<Int> arr = smallIntArray();
	arr.sort();
	arr.toS;
}

Str sortedArray() {
	Array<Int> arr = smallIntArray();
	arr.sorted.toS + arr.toS;
}

private Bool sortPred(Int a, Int b) {
	a = (a + 2) % 5;
	b = (b + 2) % 5;
	a < b;
}

Str sortArrayP() {
	Array<Int> arr = smallIntArray();
	arr.sort(&sortPred(Int, Int));
	arr.toS;
}

Str sortedArrayP() {
	Array<Int> arr = smallIntArray();
	arr.sorted(&sortPred(Int, Int)).toS + arr.toS;
}


Str noDuplicates() {
	Int[] array = [1, 2, 2, 3, 3, 3, 4];
	array.withoutDuplicates().toS();
}

value KeyValType {
	Int key;
	Int value;

	init(Int key, Int value) {
		init { key = key; value = value; }
	}

	void toS(StrBuf out) {
		out << key << "->" << value;
	}
}

Bool keyValLess(KeyValType a, KeyValType b) {
	a.key < b.key;
}
Bool keyValLess(KeyValType a, Int b) {
	a.key < b;
}
Bool keyValLess(Int a, KeyValType b) {
	a < b.key;
}

Bool keyValEq(KeyValType a, KeyValType b) {
	a.key == b.key;
}

KeyValType[] keyValArray() {
	KeyValType[] out;
	for (Int i = 0; i < 10; i++) {
		out << KeyValType(i / 2, i);
	}
	out;
}

Str noDuplicatesP1() {
	var array = keyValArray();
	var noDuplicates = array.withoutDuplicates(&keyValLess);
	// Note: Undefined which ones will be retained, so we extract the keys.
	noDuplicates.join(", ", (x) => x.key.toS()).toS;
}

Str noDuplicatesP2() {
	var array = keyValArray();
	array.removeDuplicates(&keyValLess);
	array.join(", ", (x) => x.key.toS()).toS;
}

Str noDuplicatesP3() {
	var array = keyValArray();
	var noDuplicates = array.withoutDuplicates(&keyValEq);
	// Note: Undefined which ones will be retained, so we extract the keys.
	noDuplicates.join(", ", (x) => x.key.toS()).toS;
}

Str noDuplicatesP4() {
	var array = keyValArray();
	array.removeDuplicates(&keyValEq);
	array.join(", ", (x) => x.key.toS()).toS;
}

Str arrayEq() {
	var a = [1, 2, 3, 4];
	var b = [1, 2, 3, 4];
	var c = [1, 2];

	(a == b).toS() + (a == c).toS();
}

Str arrayLess() {
	var a = [1, 2, 3];
	var b = [1, 3];

	(a < b).toS() + (a > b).toS();
}

Int addRange(Int x) {
	var a = [1, 1, 2, 2, 2, 3, 3, 3, 3];

	Nat start = a.lowerBound(x);
	Nat end = a.upperBound(x);
	Int sum = 0;
	for (Nat i = start; i < end; i++)
		sum += a[i];
	sum;
}

Int addRangeKV(Int x) {
	var data = keyValArray();

	Nat start = data.lowerBound(x, &keyValLess);
	Nat end = data.upperBound(x, &keyValLess);
	Int sum = 0;
	for (Nat i = start; i < end; i++)
		sum += data[i].value;
	sum;
}