-
Notifications
You must be signed in to change notification settings - Fork 16
Expand file tree
/
Copy pathLinkedHashItems.test.js
More file actions
87 lines (69 loc) · 2.26 KB
/
LinkedHashItems.test.js
File metadata and controls
87 lines (69 loc) · 2.26 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
import LinkedHashItems from './LinkedHashItems';
var items = [
{ id: 1, name: 'A' },
{ id: 2, name: 'B' },
{ id: 3, name: 'C' },
{ id: 4, name: 'D' },
{ id: 5, name: 'E' },
{ id: 6, name: 'F' }
];
function getLinkedHashItems(items) {
var linkedHashItems = new LinkedHashItems();
for (var index = 0; index < items.length; index++) {
var item = items[index];
linkedHashItems.add(item.id, item);
};
return linkedHashItems;
}
test('LinkedHashItems - Forward iteration returned correct items', () => {
const linkedHashItems = getLinkedHashItems(items);
const result = [];
linkedHashItems.iterate(function (item) {
result.push(item);
});
expect(items).toEqual(result);
});
test('LinkedHashItems - Forward items iteration', () => {
const linkedHashItems = getLinkedHashItems(items);
const result = [];
linkedHashItems.iterate(function (item) {
result.push(item);
});
expect(items).toEqual(result);
});
test('LinkedHashItems - Backward items iteration', () => {
const linkedHashItems = getLinkedHashItems(items);
const reversedResult = [],
reversedItems = items.slice(0);
reversedItems.reverse();
linkedHashItems.iterateBack(function (item) {
reversedResult.push(item);
});
expect(reversedItems).toEqual(reversedResult);
});
test('LinkedHashItems - Removed item', () => {
const linkedHashItems = getLinkedHashItems(items);
linkedHashItems.remove(3);
const modifiedItems = items.slice(0);
modifiedItems.splice(2, 1);
expect(modifiedItems).toEqual(linkedHashItems.toArray());
});
test('LinkedHashItems - Remove first item', () => {
const linkedHashItems = getLinkedHashItems(items);
linkedHashItems.remove(1);
const modifiedItems = items.slice(0);
modifiedItems.splice(0, 1);
expect(modifiedItems).toEqual(linkedHashItems.toArray());
});
test('LinkedHashItems - Remove last item', () => {
const linkedHashItems = getLinkedHashItems(items);
linkedHashItems.remove(6);
const modifiedItems = items.slice(0);
modifiedItems.splice(5, 1);
expect(modifiedItems).toEqual(linkedHashItems.toArray());
});
test('LinkedHashItems - Remove last item', () => {
const linkedHashItems = getLinkedHashItems(items);
linkedHashItems.empty();
expect([]).toEqual(linkedHashItems.toArray());
});