-
Notifications
You must be signed in to change notification settings - Fork 16
Expand file tree
/
Copy pathTreeLevels.test.js
More file actions
403 lines (329 loc) · 10.8 KB
/
TreeLevels.test.js
File metadata and controls
403 lines (329 loc) · 10.8 KB
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
398
399
400
401
402
403
import TreeLevels from './TreeLevels';
function getTreeLevels(levels) {
var treeLevels = TreeLevels();
for (var levelIndex = 0, levelLen = levels.length; levelIndex < levelLen; levelIndex += 1) {
var level = levels[levelIndex];
for (var index = 0, len = level.length; index < len; index += 1) {
treeLevels.addItem(levelIndex, level[index], { id: level[index] });
}
}
return treeLevels;
};
var items = [
[1],
[2, 3],
[4, 5, 6],
[],
[7, 8, 9, 10]
];
test('isEmpty function returns true for empty structure', () => {
var treeLevels = TreeLevels();
expect(treeLevels.isEmpty()).toBe(true);
});
test('isEmpty function returns false for none empty structure', () => {
var treeLevels = TreeLevels();
treeLevels.addlevel(1, "Level 1");
expect(treeLevels.isEmpty()).toBe(false);
});
test('hasLevel function', () => {
var treeLevels = TreeLevels();
treeLevels.addlevel(1, "Level 1");
expect(treeLevels.hasLevel(1)).toBe(true);
});
test('hasLevel function test for 2 levels contexts', () => {
var treeLevels = TreeLevels();
treeLevels.addlevel(1, "Level 1");
treeLevels.addlevel(2, "Level 2");
expect(treeLevels.hasLevel(1) && treeLevels.hasLevel(2)).toBe(true);
});
test('hasItem function checkes item presence in structure', () => {
var treeLevels = TreeLevels();
treeLevels.addItem(1, 100, { name: "Item 1 Name", descriptions: "Item 1 Description" });
expect(treeLevels.hasItem(100)).toBe(true);
});
test('loopLevels function indexes levels', () => {
var treeLevels = getTreeLevels(items);
var result = [];
treeLevels.loopLevels(this, function (index, level) {
result.push(index);
})
expect(result).toEqual([0, 1, 2, 4]);
});
test('loopLevelsReversed function indexes levels in reversed order', () => {
var treeLevels = getTreeLevels(items);
var result = [];
treeLevels.loopLevelsReversed(this, function (index, level) {
result.push(index);
})
expect(result).toEqual([4, 2, 1, 0]);
});
test('loopLevelItems function loops items of the level', () => {
var treeLevels = getTreeLevels(items);
var result = [];
treeLevels.loopLevelItems(this, 2, function (itemid, context, position) {
result.push([itemid, context.id, position]);
})
expect(result).toEqual( [
[4, 4, 0],
[5, 5, 1],
[6, 6, 2]
]);
});
test('getLevelIndex function returns index of items level', () => {
var treeLevels = getTreeLevels(items);
expect(treeLevels.getLevelIndex(6)).toBe(2);
});
test('getItemPosition function returns item position at level', () => {
var treeLevels = getTreeLevels(items);
expect(treeLevels.getItemPosition(8)).toBe(1);
});
test('getItemAtPosition function returns item at given level position', () => {
var treeLevels = getTreeLevels(items);
expect(treeLevels.getItemAtPosition(2, 1)).toBe(5);
});
test('getPrevItem function returns previous item at the level', () => {
var treeLevels = getTreeLevels(items);
expect(treeLevels.getPrevItem(5)).toBe(4);
});
test('getPrevItem function returns null for the first item of the level', () => {
var treeLevels = getTreeLevels(items);
expect(treeLevels.getPrevItem(7)).toBe(undefined);
});
test('getNextItem function returns next item at the level', () => {
var treeLevels = getTreeLevels(items);
expect(treeLevels.getNextItem(5)).toBe(6);
});
test('getNextItem function returns null for the last item of the level', () => {
var treeLevels = getTreeLevels(items);
expect(treeLevels.getNextItem(10)).toBe(undefined);
});
test('getLevelLength function returns 0 for omitted level', () => {
var treeLevels = getTreeLevels(items);
expect(treeLevels.getLevelLength(3)).toBe(0);
});
test('getLevelLength function returns number of items at the level', () => {
var treeLevels = getTreeLevels(items);
expect(treeLevels.getLevelLength(4)).toBe(4);
});
var items2 = [
[1],
[2, 3, 5],
[4, 5, 6],
[5],
[7, 8, 9, 5, 10]
];
test('getLevelIndex function returns index of items start level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getLevelIndex(5)).toBe(1);
});
test('getEndLevelIndex function returns index of items end level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getEndLevelIndex(5)).toBe(4);
});
test('getItemPosition function returns item position at start level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getItemPosition(5)).toBe(2);
});
test('getItemPosition function returns item position at middle level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getItemPosition(5, 2)).toBe(1);
});
test('getItemPosition function returns item position at end level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getItemPosition(5, 4)).toBe(3);
});
test('getItemAtPosition function returns item at given level position', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getItemAtPosition(2, 1)).toBe(5);
});
test('getPrevItem function returns previous item at the items start level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getPrevItem(5)).toBe(3);
});
test('getPrevItem function returns previous item at the items middle level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getPrevItem(5, 2)).toBe(4);
});
test('getPrevItem function returns previous item at the items end level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getPrevItem(5, 4)).toBe(9);
});
test('getNextItem function returns next item at the items start level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getNextItem(5)).toBe(undefined);
});
test('getNextItem function returns next item at the items middle level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getNextItem(5, 2)).toBe(6);
});
test('getNextItem function returns next item at the items end level', () => {
var treeLevels = getTreeLevels(items2);
expect(treeLevels.getNextItem(5, 4)).toBe(10);
});
test('loopItems function loops items in structure', () => {
var treeLevels = getTreeLevels([
[1],
[2, 3],
[4, 5, 6],
[],
[7, 8, 9, 10]
]);
var result = [];
treeLevels.loopItems(this, function (itemid, item, position, levelIndex, level) {
result.push([itemid, position, levelIndex]);
})
var expectedResult = [
[1, 0, 0],
[2, 0, 1], [3, 1, 1],
[4, 0, 2], [5, 1, 2], [6, 2, 2],
[7, 0, 4], [8, 1, 4], [9, 2, 4], [10, 3, 4]
];
expect(result).toEqual(expectedResult);
});
test('binarySearch function returns nearest item at the level', () => {
var treeLevels = getTreeLevels([[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]]);
var result = treeLevels.binarySearch(this, 0, function (itemid) {
return 4.2 - itemid;
})
expect(result).toBe(4);
});
test('binarySearch function returns first item of collection for item beyond the left margin', () => {
var treeLevels = getTreeLevels([[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]]);
var result = treeLevels.binarySearch(this, 0, function (itemid) {
return 0 - itemid;
})
expect(result).toBe(1);
});
test('binarySearch function returns the last item of collection for item beyond the last item', () => {
var treeLevels = getTreeLevels([[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]]);
var result = treeLevels.binarySearch(this, 0, function (itemid) {
return 15 - itemid;
})
expect(result).toBe(10);
});
test('loopFromItem function returns items up to the end of level starting from item', () => {
var treeLevels = getTreeLevels([
[7, 8, 9, 10, 11, 12, 13, 14, 15, 16],
[1, 2, 12, 4, 5, 6]
]);
var result = [];
treeLevels.loopFromItem(this, 12, false, function (itemid, item) {
result.push([itemid, item.id]);
});
var expectedResult = [
[13, 13],
[14, 14],
[15, 15],
[16, 16]
];
expect(result).toEqual(expectedResult);
});
test('loopFromItem function returns items up to the end of level starting from item', () => {
var treeLevels = getTreeLevels([
[7, 8, 9, 10, 11, 12, 13, 14, 15, 16],
[1, 2, 12, 4, 5, 6]
]);
var result = [];
treeLevels.loopFromItem(this, 12, false, function (itemid, item) {
result.push(itemid);
}, 1);
expect(result).toEqual([4, 5, 6]);
});
test('loopFromItem function returns items up to the start of the level starting from item', () => {
var treeLevels = getTreeLevels([
[7, 8, 9, 10, 11, 12, 13, 14, 15, 16],
[1, 2, 12, 3, 4, 5, 6]
]);
var result = [];
treeLevels.loopFromItem(this, 12, true, function (itemid, item) {
result.push([itemid, item.id]);
});
var expectedResult = [
[11, 11],
[10, 10],
[9, 9],
[8, 8],
[7, 7]
];
expect(result).toEqual(expectedResult);
});
test('loopFromItem function returns items up to the start of the level starting from item', () => {
var treeLevels = getTreeLevels([
[7, 8, 9, 10, 11, 12, 13, 14, 15, 16],
[1, 2, 12, 3, 4, 5, 6]
]);
var result = [];
treeLevels.loopFromItem(this, 12, true, function (itemid, item) {
result.push(itemid);
}, 1);
expect(result).toEqual([2, 1]);
});
test('loopLevelsFromItem function returns level indexes above the item starting for the immidiate level above', () => {
var treeLevels = getTreeLevels([
[1],
[2, 3],
[4, 5, 6],
[5],
[7, 8, 9, 10],
[11, 12, 13],
[14]
]);
var result = [];
treeLevels.loopLevelsFromItem(this, 5, false, function (levelIndex, level) {
result.push(levelIndex);
});
var expectedResult = [1, 0];
expect(result).toEqual(expectedResult);
});
test('loopLevelsFromItem function returns level indexes below the item starting for the immidiate level below', () => {
var treeLevels = getTreeLevels([
[1],
[2, 3],
[4, 5, 6],
[5],
[7, 8, 9, 10],
[11, 12, 13],
[14]
]);
var result = [];
treeLevels.loopLevelsFromItem(this, 5, true, function (levelIndex, level) {
result.push(levelIndex);
});
var expectedResult = [4, 5, 6];
expect(result).toEqual(expectedResult);
});
test('loopMerged function returns merged levels into one collection by weight', () => {
var treeLevels = getTreeLevels([
[1, 6, 9],
[2, 3, 5, 8],
[4, 5],
[],
[7, 10]
]);
var result = [];
treeLevels.loopMerged(this, function (itemid) {
return itemid;
}, function (itemid, item) {
result.push(itemid);
});
var expectedResult = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
expect(result).toEqual(expectedResult);
});
test('clone function returns copy of existing structure', () => {
var expectedResult = [
[1, 6, 9],
[2, 3, 8],
[4, 5],
[7, 10]
];
var treeLevels = getTreeLevels(expectedResult).clone();
var result = [];
treeLevels.loopLevels(this, function (index, level) {
var levelItems = [];
treeLevels.loopLevelItems(this, index, function (itemid, context, position) {
levelItems.push(itemid);
})
result.push(levelItems);
})
expect(result).toEqual(expectedResult);
});