-
Notifications
You must be signed in to change notification settings - Fork 4
/
lists.js
104 lines (90 loc) · 1.38 KB
/
lists.js
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
list = null;
for (var i = 5; i >= 1; i--) {
node = {
data: i,
next: list
};
list = node;
}
// Case 1: Not a traversal
function case1() {
node = list;
return node.next.next.next.data;
}
// Case 2: Traversal
function case2() {
node = list
while (node.next != null) {
node = node.next;
}
return node.data;
}
function contains(node, x) {
if (node == null) {
return false;
} else if (node.data == x) {
return true;
} else {
return contains(node.next, x);
}
}
// Case 3: Traversal
function case3() {
return contains(list, 42);
}
// Case 4: Not a traversal
function case4(){
function next(node) {
return node.next;
}
return next(next(next(list))).data;
}
// Case 5: Traversal
function case5() {
function next(node) {
return node.next;
}
node = list
while (node.next != null) {
node = next(node);
}
}
// Case 6: Traversal
function case6() {
function next2(node) {
return node.next;
}
function next(node) {
return next2(node);
}
node = list
while (node != null) {
node = next(node);
}
}
// Case 7: Traversal
function case7() {
node = list
while (node != null) {
node.data += 1
node = node.next
}
}
case1();
case2();
case3();
case4();
case5();
case6();
case7();
function repeat(f, n) {
(function() {
for(var i=0; i < n; i++)
f();
}());
}
// Some redundant traversals
repeat(case6, 3);
repeat(case7, 3);
repeat(case7, 3);
repeat(case7, 3);