Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Commit ef2777d

Browse filesBrowse files
Saleh Abdel MotaalMylesBorins
authored andcommitted
test: fix strictEqual order for timers test
PR-URL: #23568 Reviewed-By: Joyee Cheung <joyeec9h3@gmail.com> Reviewed-By: James M Snell <jasnell@gmail.com> Reviewed-By: Jeremiah Senkpiel <fishrock123@rocketmail.com> Reviewed-By: Ruben Bridgewater <ruben@bridgewater.de> Reviewed-By: Colin Ihrig <cjihrig@gmail.com> Reviewed-By: Gireesh Punathil <gpunathi@in.ibm.com> Reviewed-By: Trivikram Kamat <trivikr.dev@gmail.com> Reviewed-By: Sakthipriyan Vairamani <thechargingvolcano@gmail.com>
1 parent 2cb4789 commit ef2777d
Copy full SHA for ef2777d

File tree

Expand file treeCollapse file tree

1 file changed

+16
-16
lines changed
Open diff view settings
Filter options
Expand file treeCollapse file tree

1 file changed

+16
-16
lines changed
Open diff view settings
Collapse file

‎test/parallel/test-timers-linked-list.js‎

Copy file name to clipboardExpand all lines: test/parallel/test-timers-linked-list.js
+16-16Lines changed: 16 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -41,55 +41,55 @@ L.init(C);
4141
L.init(D);
4242

4343
assert.ok(L.isEmpty(list));
44-
assert.strictEqual(null, L.peek(list));
44+
assert.strictEqual(L.peek(list), null);
4545

4646
L.append(list, A);
4747
// list -> A
48-
assert.strictEqual(A, L.peek(list));
48+
assert.strictEqual(L.peek(list), A);
4949

5050
L.append(list, B);
5151
// list -> A -> B
52-
assert.strictEqual(A, L.peek(list));
52+
assert.strictEqual(L.peek(list), A);
5353

5454
L.append(list, C);
5555
// list -> A -> B -> C
56-
assert.strictEqual(A, L.peek(list));
56+
assert.strictEqual(L.peek(list), A);
5757

5858
L.append(list, D);
5959
// list -> A -> B -> C -> D
60-
assert.strictEqual(A, L.peek(list));
60+
assert.strictEqual(L.peek(list), A);
6161

6262
L.remove(A);
6363
L.remove(B);
6464
// B is already removed, so removing it again shouldn't hurt.
6565
L.remove(B);
6666
// list -> C -> D
67-
assert.strictEqual(C, L.peek(list));
67+
assert.strictEqual(L.peek(list), C);
6868

6969
// Put B back on the list
7070
L.append(list, B);
7171
// list -> C -> D -> B
72-
assert.strictEqual(C, L.peek(list));
72+
assert.strictEqual(L.peek(list), C);
7373

7474
L.remove(C);
7575
// list -> D -> B
76-
assert.strictEqual(D, L.peek(list));
76+
assert.strictEqual(L.peek(list), D);
7777

7878
L.remove(B);
7979
// list -> D
80-
assert.strictEqual(D, L.peek(list));
80+
assert.strictEqual(L.peek(list), D);
8181

8282
L.remove(D);
8383
// list
84-
assert.strictEqual(null, L.peek(list));
84+
assert.strictEqual(L.peek(list), null);
8585

8686

8787
assert.ok(L.isEmpty(list));
8888

8989

9090
L.append(list, D);
9191
// list -> D
92-
assert.strictEqual(D, L.peek(list));
92+
assert.strictEqual(L.peek(list), D);
9393

9494
L.append(list, C);
9595
L.append(list, B);
@@ -100,8 +100,8 @@ L.append(list, A);
100100
L.append(list, C);
101101
// list -> D -> B -> A -> C
102102

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

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.