@@ -41,55 +41,55 @@ L.init(C);
41
41
L . init ( D ) ;
42
42
43
43
assert . ok ( L . isEmpty ( list ) ) ;
44
- assert . strictEqual ( null , L . peek ( list ) ) ;
44
+ assert . strictEqual ( L . peek ( list ) , null ) ;
45
45
46
46
L . append ( list , A ) ;
47
47
// list -> A
48
- assert . strictEqual ( A , L . peek ( list ) ) ;
48
+ assert . strictEqual ( L . peek ( list ) , A ) ;
49
49
50
50
L . append ( list , B ) ;
51
51
// list -> A -> B
52
- assert . strictEqual ( A , L . peek ( list ) ) ;
52
+ assert . strictEqual ( L . peek ( list ) , A ) ;
53
53
54
54
L . append ( list , C ) ;
55
55
// list -> A -> B -> C
56
- assert . strictEqual ( A , L . peek ( list ) ) ;
56
+ assert . strictEqual ( L . peek ( list ) , A ) ;
57
57
58
58
L . append ( list , D ) ;
59
59
// list -> A -> B -> C -> D
60
- assert . strictEqual ( A , L . peek ( list ) ) ;
60
+ assert . strictEqual ( L . peek ( list ) , A ) ;
61
61
62
62
L . remove ( A ) ;
63
63
L . remove ( B ) ;
64
64
// B is already removed, so removing it again shouldn't hurt.
65
65
L . remove ( B ) ;
66
66
// list -> C -> D
67
- assert . strictEqual ( C , L . peek ( list ) ) ;
67
+ assert . strictEqual ( L . peek ( list ) , C ) ;
68
68
69
69
// Put B back on the list
70
70
L . append ( list , B ) ;
71
71
// list -> C -> D -> B
72
- assert . strictEqual ( C , L . peek ( list ) ) ;
72
+ assert . strictEqual ( L . peek ( list ) , C ) ;
73
73
74
74
L . remove ( C ) ;
75
75
// list -> D -> B
76
- assert . strictEqual ( D , L . peek ( list ) ) ;
76
+ assert . strictEqual ( L . peek ( list ) , D ) ;
77
77
78
78
L . remove ( B ) ;
79
79
// list -> D
80
- assert . strictEqual ( D , L . peek ( list ) ) ;
80
+ assert . strictEqual ( L . peek ( list ) , D ) ;
81
81
82
82
L . remove ( D ) ;
83
83
// list
84
- assert . strictEqual ( null , L . peek ( list ) ) ;
84
+ assert . strictEqual ( L . peek ( list ) , null ) ;
85
85
86
86
87
87
assert . ok ( L . isEmpty ( list ) ) ;
88
88
89
89
90
90
L . append ( list , D ) ;
91
91
// list -> D
92
- assert . strictEqual ( D , L . peek ( list ) ) ;
92
+ assert . strictEqual ( L . peek ( list ) , D ) ;
93
93
94
94
L . append ( list , C ) ;
95
95
L . append ( list , B ) ;
@@ -100,8 +100,8 @@ L.append(list, A);
100
100
L . append ( list , C ) ;
101
101
// list -> D -> B -> A -> C
102
102
103
- assert . strictEqual ( D , L . peek ( list ) ) ;
104
- assert . strictEqual ( B , L . peek ( D ) ) ;
105
- assert . strictEqual ( A , L . peek ( B ) ) ;
106
- assert . strictEqual ( C , L . peek ( A ) ) ;
107
- assert . strictEqual ( list , L . peek ( C ) ) ;
103
+ assert . strictEqual ( L . peek ( list ) , D ) ;
104
+ assert . strictEqual ( L . peek ( D ) , B ) ;
105
+ assert . strictEqual ( L . peek ( B ) , A ) ;
106
+ assert . strictEqual ( L . peek ( A ) , C ) ;
107
+ assert . strictEqual ( L . peek ( C ) , list ) ;
0 commit comments