Skip to content

Commit d55cb37

Browse files
author
Kohei Asai
authored
Prefer assertStrictEq() (axross#130)
1 parent 9c954d6 commit d55cb37

File tree

65 files changed

+546
-468
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

65 files changed

+546
-468
lines changed

‎solutions/add_binary_test.ts‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
import { test } from "https://deno.land/std/testing/mod.ts";
2-
import { assert } from "https://deno.land/std/testing/asserts.ts";
2+
import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
33
import addBinary from "./add_binary.ts";
44

55
test("67. Add Binary", () => {
6-
assert(addBinary("11", "1") === "100");
7-
assert(addBinary("1010", "1011") === "10101");
6+
assertStrictEq(addBinary("11", "1"), "100");
7+
assertStrictEq(addBinary("1010", "1011"), "10101");
88
});

‎solutions/backspace_string_compare_test.ts‎

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
11
import { test } from "https://deno.land/std/testing/mod.ts";
2-
import { assert } from "https://deno.land/std/testing/asserts.ts";
2+
import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
33
import backspaceCompare from "./backspace_string_compare.ts";
44

55
test("844. Backspace String Compare", () => {
6-
assert(backspaceCompare("ab#c", "ad#c") === true);
7-
assert(backspaceCompare("ab##", "c#d#") === true);
8-
assert(backspaceCompare("a##c", "#a#c") === true);
9-
assert(backspaceCompare("a#c", "b") === false);
6+
assertStrictEq(backspaceCompare("ab#c", "ad#c"), true);
7+
assertStrictEq(backspaceCompare("ab##", "c#d#"), true);
8+
assertStrictEq(backspaceCompare("a##c", "#a#c"), true);
9+
assertStrictEq(backspaceCompare("a#c", "b"), false);
1010
});

‎solutions/best_time_to_buy_and_sell_stock_test.ts‎

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
11
import { test } from "https://deno.land/std/testing/mod.ts";
2-
import { assert } from "https://deno.land/std/testing/asserts.ts";
2+
import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
33
import maxProfit from "./best_time_to_buy_and_sell_stock.ts";
44

55
test("121. Best Time to Buy and Sell Stock", () => {
6-
assert(maxProfit([7, 1, 5, 3, 6, 4]) === 5);
7-
assert(maxProfit([7, 6, 4, 3, 1]) === 0);
8-
assert(maxProfit([7, 6, 5, 2, 3, 4, 1]) === 2);
9-
assert(maxProfit([7, 3, 8, 1, 2, 5, 4]) === 5);
6+
assertStrictEq(maxProfit([7, 1, 5, 3, 6, 4]), 5);
7+
assertStrictEq(maxProfit([7, 6, 4, 3, 1]), 0);
8+
assertStrictEq(maxProfit([7, 6, 5, 2, 3, 4, 1]), 2);
9+
assertStrictEq(maxProfit([7, 3, 8, 1, 2, 5, 4]), 5);
1010
});

‎solutions/binary_search_test.ts‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
import { test } from "https://deno.land/std/testing/mod.ts";
2-
import { assert } from "https://deno.land/std/testing/asserts.ts";
2+
import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
33
import search from "./binary_search.ts";
44

55
test("704. Binary Search", () => {
6-
assert(search([-1, 0, 3, 5, 9, 12], 9) === 4);
7-
assert(search([-1, 0, 3, 5, 9, 12], 13) === -1);
6+
assertStrictEq(search([-1, 0, 3, 5, 9, 12], 9), 4);
7+
assertStrictEq(search([-1, 0, 3, 5, 9, 12], 13), -1);
88
});

‎solutions/bulls_and_cows_test.ts‎

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,13 @@
11
import { test } from "https://deno.land/std/testing/mod.ts";
2-
import { assert } from "https://deno.land/std/testing/asserts.ts";
2+
import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
33
import getHint from "./bulls_and_cows.ts";
44

55
test("299. Bulls and Cows", () => {
6-
assert(getHint("1807", "7810") === "1A3B");
7-
assert(getHint("1123", "0111") === "1A1B");
8-
assert(getHint("1234", "5678") === "0A0B");
9-
assert(getHint("1234", "1234") === "4A0B");
10-
assert(getHint("1234", "4123") === "0A4B");
11-
assert(getHint("1122", "0001") === "0A1B");
12-
assert(getHint("11", "10") === "1A0B");
6+
assertStrictEq(getHint("1807", "7810"), "1A3B");
7+
assertStrictEq(getHint("1123", "0111"), "1A1B");
8+
assertStrictEq(getHint("1234", "5678"), "0A0B");
9+
assertStrictEq(getHint("1234", "1234"), "4A0B");
10+
assertStrictEq(getHint("1234", "4123"), "0A4B");
11+
assertStrictEq(getHint("1122", "0001"), "0A1B");
12+
assertStrictEq(getHint("11", "10"), "1A0B");
1313
});

‎solutions/climbing_stairs_test.ts‎

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,11 @@
11
import { test } from "https://deno.land/std/testing/mod.ts";
2-
import { assert } from "https://deno.land/std/testing/asserts.ts";
2+
import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
33
import climbStairs from "./climbing_stairs.ts";
44

55
test("70. Climbing Stairs", () => {
6-
assert(climbStairs(1) === 1);
7-
assert(climbStairs(2) === 2);
8-
assert(climbStairs(3) === 3);
9-
assert(climbStairs(4) === 5);
10-
assert(climbStairs(32) === 3524578);
6+
assertStrictEq(climbStairs(1), 1);
7+
assertStrictEq(climbStairs(2), 2);
8+
assertStrictEq(climbStairs(3), 3);
9+
assertStrictEq(climbStairs(4), 5);
10+
assertStrictEq(climbStairs(32), 3524578);
1111
});

‎solutions/count_and_say_test.ts‎

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,16 @@
11
import { test } from "https://deno.land/std/testing/mod.ts";
2-
import { assert } from "https://deno.land/std/testing/asserts.ts";
2+
import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
33
import countAndSay from "./count_and_say.ts";
44

55
test("38. Count and Say", () => {
6-
assert(countAndSay(1) === "1");
7-
assert(countAndSay(2) === "11");
8-
assert(countAndSay(3) === "21");
9-
assert(countAndSay(4) === "1211");
10-
assert(countAndSay(5) === "111221");
11-
assert(countAndSay(10) === "13211311123113112211");
12-
assert(
13-
countAndSay(30) ===
14-
"3113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112212211131221121321131211132221123113112221131112311332211211133112111311222112111312211311123113322112111312211312111322212321121113121112133221121321132132211331121321132213211231132132211211131221232112111312212221121123222112311311222113111231133211121321321122111312211312111322211213211321322123211211131211121332211231131122211311123113321112131221123113111231121123222112111331121113112221121113122113111231133221121113122113121113221112131221123113111231121123222112111312211312111322212321121113121112131112132112311321322112111312212321121113122122211211232221121321132132211331121321231231121113112221121321132132211322132113213221123113112221133112132123222112111312211312112213211231132132211211131221131211322113321132211221121332211231131122211311123113321112131221123113111231121113311211131221121321131211132221123113112211121312211231131122211211133112111311222112111312211312111322211213211321223112111311222112132113213221133122211311221122111312211312111322212321121113121112131112132112311321322112111312212321121113122122211211232221121321132132211331121321231231121113112221121321132132211322132113213221123113112221133112132123222112111312211312112213211231132132211211131221131211322113321132211221121332211213211321322113311213212312311211131122211213211331121321123123211231131122211211131221131112311332211213211321223112111311222112132113213221123123211231132132211231131122211311123113322112111312211312111322111213122112311311123112112322211213211321322113312211223113112221121113122113111231133221121321132132211331222113321112131122211332113221122112133221123113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112311332111213122112311311123112112322211322311311222113111231133211121312211231131112311211232221121113122113121113222123211211131221132211131221121321131211132221123113112211121312211231131122113221122112133221121321132132211331121321231231121113121113122122311311222113111231133221121113122113121113221112131221123113111231121123222112132113213221133112132123123112111312211322311211133112111312211213211311123113223112111321322123122113222122211211232221121113122113121113222123211211131211121311121321123113213221121113122123211211131221121311121312211213211321322112311311222113311213212322211211131221131211221321123113213221121113122113121113222112131112131221121321131211132221121321132132211331121321232221123113112221131112311322311211131122211213211331121321122112133221121113122113121113222123112221221321132132211231131122211331121321232221121113122113121113222123211211131211121332211213111213122112132113121113222112132113213221232112111312111213322112132113213221133112132123123112111311222112132113311213211221121332211231131122211311123113321112131221123113112221132231131122211211131221131112311332211213211321223112111311222112132113212221132221222112112322211211131221131211132221232112111312111213111213211231131112311311221122132113213221133112132123222112311311222113111231132231121113112221121321133112132112211213322112111312211312111322212321121113121112131112132112311321322112111312212321121113122122211211232221121311121312211213211312111322211213211321322123211211131211121332211213211321322113311213211322132112311321322112111312212321121113122122211211232221121321132132211331121321231231121113112221121321133112132112312321123113112221121113122113111231133221121321132122311211131122211213211321222113222122211211232221123113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112311332111213213211221113122113121113222112132113213221232112111312111213322112132113213221133112132123123112111312211322311211133112111312212221121123222112132113213221133112132123222113223113112221131112311332111213122112311311123112112322211211131221131211132221232112111312111213111213211231132132211211131221131211221321123113213221123113112221131112211322212322211231131122211322111312211312111322211213211321322113311213211331121113122122211211132213211231131122212322211331222113112211"
6+
assertStrictEq(countAndSay(1), "1");
7+
assertStrictEq(countAndSay(2), "11");
8+
assertStrictEq(countAndSay(3), "21");
9+
assertStrictEq(countAndSay(4), "1211");
10+
assertStrictEq(countAndSay(5), "111221");
11+
assertStrictEq(countAndSay(10), "13211311123113112211");
12+
assertStrictEq(
13+
countAndSay(30),
14+
"3113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112212211131221121321131211132221123113112221131112311332211211133112111311222112111312211311123113322112111312211312111322212321121113121112133221121321132132211331121321132213211231132132211211131221232112111312212221121123222112311311222113111231133211121321321122111312211312111322211213211321322123211211131211121332211231131122211311123113321112131221123113111231121123222112111331121113112221121113122113111231133221121113122113121113221112131221123113111231121123222112111312211312111322212321121113121112131112132112311321322112111312212321121113122122211211232221121321132132211331121321231231121113112221121321132132211322132113213221123113112221133112132123222112111312211312112213211231132132211211131221131211322113321132211221121332211231131122211311123113321112131221123113111231121113311211131221121321131211132221123113112211121312211231131122211211133112111311222112111312211312111322211213211321223112111311222112132113213221133122211311221122111312211312111322212321121113121112131112132112311321322112111312212321121113122122211211232221121321132132211331121321231231121113112221121321132132211322132113213221123113112221133112132123222112111312211312112213211231132132211211131221131211322113321132211221121332211213211321322113311213212312311211131122211213211331121321123123211231131122211211131221131112311332211213211321223112111311222112132113213221123123211231132132211231131122211311123113322112111312211312111322111213122112311311123112112322211213211321322113312211223113112221121113122113111231133221121321132132211331222113321112131122211332113221122112133221123113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112311332111213122112311311123112112322211322311311222113111231133211121312211231131112311211232221121113122113121113222123211211131221132211131221121321131211132221123113112211121312211231131122113221122112133221121321132132211331121321231231121113121113122122311311222113111231133221121113122113121113221112131221123113111231121123222112132113213221133112132123123112111312211322311211133112111312211213211311123113223112111321322123122113222122211211232221121113122113121113222123211211131211121311121321123113213221121113122123211211131221121311121312211213211321322112311311222113311213212322211211131221131211221321123113213221121113122113121113222112131112131221121321131211132221121321132132211331121321232221123113112221131112311322311211131122211213211331121321122112133221121113122113121113222123112221221321132132211231131122211331121321232221121113122113121113222123211211131211121332211213111213122112132113121113222112132113213221232112111312111213322112132113213221133112132123123112111311222112132113311213211221121332211231131122211311123113321112131221123113112221132231131122211211131221131112311332211213211321223112111311222112132113212221132221222112112322211211131221131211132221232112111312111213111213211231131112311311221122132113213221133112132123222112311311222113111231132231121113112221121321133112132112211213322112111312211312111322212321121113121112131112132112311321322112111312212321121113122122211211232221121311121312211213211312111322211213211321322123211211131211121332211213211321322113311213211322132112311321322112111312212321121113122122211211232221121321132132211331121321231231121113112221121321133112132112312321123113112221121113122113111231133221121321132122311211131122211213211321222113222122211211232221123113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112311332111213213211221113122113121113222112132113213221232112111312111213322112132113213221133112132123123112111312211322311211133112111312212221121123222112132113213221133112132123222113223113112221131112311332111213122112311311123112112322211211131221131211132221232112111312111213111213211231132132211211131221131211221321123113213221123113112221131112211322212322211231131122211322111312211312111322211213211321322113311213211331121113122122211211132213211231131122212322211331222113112211"
1515
);
1616
});

‎solutions/count_complete_tree_nodes_test.ts‎

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,11 @@
11
import { test } from "https://deno.land/std/testing/mod.ts";
2-
import { assert } from "https://deno.land/std/testing/asserts.ts";
2+
import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
33
import { createBinaryTreeNode } from "../test_utilities/binary_tree.ts";
44
import countNodes from "./count_complete_tree_nodes.ts";
55

66
test("222. Count Complete Tree Nodes", () => {
7-
assert(countNodes(createBinaryTreeNode([1, 2, 3, 4, 5, 6])) === 6);
8-
assert(countNodes(createBinaryTreeNode([])) === 0);
9-
assert(countNodes(createBinaryTreeNode([1, 2, 3, 4, 5, 6, 7, 8])) === 8);
10-
assert(countNodes(createBinaryTreeNode([1, 2, 3, 4, 5, 6, 7])) === 7);
7+
assertStrictEq(countNodes(createBinaryTreeNode([1, 2, 3, 4, 5, 6])), 6);
8+
assertStrictEq(countNodes(createBinaryTreeNode([])), 0);
9+
assertStrictEq(countNodes(createBinaryTreeNode([1, 2, 3, 4, 5, 6, 7, 8])), 8);
10+
assertStrictEq(countNodes(createBinaryTreeNode([1, 2, 3, 4, 5, 6, 7])), 7);
1111
});

‎solutions/count_univalue_subtrees_test.ts‎

Lines changed: 8 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,16 @@
11
import { test } from "https://deno.land/std/testing/mod.ts";
2-
import { assert } from "https://deno.land/std/testing/asserts.ts";
2+
import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
33
import { createBinaryTreeNode } from "../test_utilities/binary_tree.ts";
44
import countUnivalSubtrees from "./count_univalue_subtrees.ts";
55

66
test("250. Count Univalue Subtrees", () => {
7-
assert(
8-
countUnivalSubtrees(createBinaryTreeNode([5, 1, 5, 5, 5, null, 5])) === 4
7+
assertStrictEq(
8+
countUnivalSubtrees(createBinaryTreeNode([5, 1, 5, 5, 5, null, 5])),
9+
4
910
);
10-
assert(
11-
countUnivalSubtrees(createBinaryTreeNode([1, 4, 3, 4, 4, 5, 6])) === 5
11+
assertStrictEq(
12+
countUnivalSubtrees(createBinaryTreeNode([1, 4, 3, 4, 4, 5, 6])),
13+
5
1214
);
13-
assert(countUnivalSubtrees(createBinaryTreeNode([])) === 0);
15+
assertStrictEq(countUnivalSubtrees(createBinaryTreeNode([])), 0);
1416
});

‎solutions/diameter_of_binary_tree_test.ts‎

Lines changed: 10 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,16 @@
11
import { test } from "https://deno.land/std/testing/mod.ts";
2-
import { assert } from "https://deno.land/std/testing/asserts.ts";
2+
import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
33
import { createBinaryTreeNode } from "../test_utilities/binary_tree.ts";
44
import diameterOfBinaryTree from "./diameter_of_binary_tree.ts";
55

66
test("543. Diameter of Binary Tree", () => {
7-
assert(diameterOfBinaryTree(createBinaryTreeNode([1, 2, 3, 4, 5])) === 3);
8-
assert(diameterOfBinaryTree(createBinaryTreeNode([1])) === 0);
9-
assert(diameterOfBinaryTree(createBinaryTreeNode([])) === 0);
10-
assert(
7+
assertStrictEq(
8+
diameterOfBinaryTree(createBinaryTreeNode([1, 2, 3, 4, 5])),
9+
3
10+
);
11+
assertStrictEq(diameterOfBinaryTree(createBinaryTreeNode([1])), 0);
12+
assertStrictEq(diameterOfBinaryTree(createBinaryTreeNode([])), 0);
13+
assertStrictEq(
1114
diameterOfBinaryTree(
1215
createBinaryTreeNode([
1316
4,
@@ -41,6 +44,7 @@ test("543. Diameter of Binary Tree", () => {
4144
null,
4245
-2
4346
])
44-
) === 8
47+
),
48+
8
4549
);
4650
});

0 commit comments

Comments
 (0)