Skip to content

Commit c2ed06d

Browse files
authored
Merge pull request #498 from sir-gon/renovate/eslint-plugin-jest-28.x
Update dependency eslint-plugin-jest to v28.8.0
2 parents 49ea1b7 + bd6dd2c commit c2ed06d

File tree

10 files changed

+25
-8
lines changed

10 files changed

+25
-8
lines changed

package-lock.json

+7-7
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

package.json

+1-1
Original file line numberDiff line numberDiff line change
@@ -31,7 +31,7 @@
3131
"eslint-config-airbnb-base": "15.0.0",
3232
"eslint-config-prettier": "9.1.0",
3333
"eslint-plugin-import": "2.29.1",
34-
"eslint-plugin-jest": "28.7.0",
34+
"eslint-plugin-jest": "28.8.0",
3535
"eslint-plugin-prettier": "5.2.1",
3636
"eslint-watch": "8.0.0",
3737
"jest": "29.7.0",

src/hackerrank/implementation/betweenTwoSets.test.js

+5
Original file line numberDiff line numberDiff line change
@@ -11,22 +11,27 @@ describe('between Two Sets', () => {
1111

1212
const calculatedA = getTotalX([], input);
1313
console.log(`Between Two Sets getTotalX([], ${input}): ${calculatedA}`);
14+
1415
expect(calculatedA).toBe(solutionFound);
1516

1617
const calculatedB = getTotalX(input, []);
1718
console.log(`Between Two Sets getTotalX(${input}, []): ${calculatedB}`);
19+
1820
expect(calculatedB).toBe(solutionFound);
1921

2022
const calculatedC = getTotalX([], []);
2123
console.log(`Between Two Sets getTotalX([], []): ${calculatedC}`);
24+
2225
expect(calculatedC).toBe(solutionFound);
2326

2427
const calculatedD = isFactor(1, []);
2528
console.log(`Between Two Sets isFactor(1, []): ${calculatedD}`);
29+
2630
expect(calculatedD).toBe(false);
2731

2832
const calculatedE = factorOf(1, []);
2933
console.log(`Between Two Sets factorOf(1, []): ${calculatedE}`);
34+
3035
expect(calculatedE).toBe(false);
3136
});
3237

src/hackerrank/implementation/kangaroo.test.js

+4
Original file line numberDiff line numberDiff line change
@@ -17,6 +17,7 @@ describe('number Line Jumps', () => {
1717
console.log(
1818
`number Line Jumps(${x1}, ${v1}, ${x2}, ${v2}) Border case: ${calculated}`
1919
);
20+
2021
expect(calculated).toBe(solutionFound);
2122
});
2223

@@ -34,6 +35,7 @@ describe('number Line Jumps', () => {
3435
console.log(
3536
`number Line Jumps(${x1}, ${v1}, ${x2}, ${v2}) Border case: ${calculated}`
3637
);
38+
3739
expect(calculated).toBe(solutionFound);
3840
});
3941

@@ -51,6 +53,7 @@ describe('number Line Jumps', () => {
5153
console.log(
5254
`number Line Jumps(${x1}, ${v1}, ${x2}, ${v2}) Test case 0: ${calculated}`
5355
);
56+
5457
expect(calculated).toBe(solutionFound);
5558
});
5659

@@ -68,6 +71,7 @@ describe('number Line Jumps', () => {
6871
console.log(
6972
`number Line Jumps(${x1}, ${v1}, ${x2}, ${v2}) Test case 1: ${calculated}`
7073
);
74+
7175
expect(calculated).toBe(solutionFound);
7276
});
7377
});

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci-ransom-note.test.js

+1
Original file line numberDiff line numberDiff line change
@@ -23,6 +23,7 @@ const TEST_CASES = [
2323
expected: 'Yes'
2424
}
2525
];
26+
2627
describe('ctci_ransom_note', () => {
2728
it('checkMagazine test cases', () => {
2829
expect.assertions(3);

src/hackerrank/warmup/birthdayCakeCandles.test.js

+1
Original file line numberDiff line numberDiff line change
@@ -24,6 +24,7 @@ describe('birthdayCakeCandles', () => {
2424
console.log(
2525
`birthdayCakeCandles(${test.input}) Test case 0: ${calculated}`
2626
);
27+
2728
expect(calculated).toBe(test.answer);
2829
}
2930
});

src/hackerrank/warmup/timeConversion.test.js

+1
Original file line numberDiff line numberDiff line change
@@ -14,6 +14,7 @@ describe('timeConversion', () => {
1414
for (const test of tests) {
1515
const calculated = timeConversion(test.input);
1616
console.log(`timeConversion(${test.input}) Test case 0: ${calculated}`);
17+
1718
expect(calculated).toBe(test.answer);
1819
}
1920
});

src/projecteuler/lib/BNodeBuilder.test.js

+1
Original file line numberDiff line numberDiff line change
@@ -3,6 +3,7 @@ import { BNode } from './BNode.js';
33
import { BNodeBuilder } from './BNodeBuilder.js';
44

55
const data = [[75], [95, 64]];
6+
67
describe('class BNodeBuilder for binary trees', () => {
78
it('tree of BNode: building tree with null value', () => {
89
expect.assertions(1);

src/projecteuler/problem0013.test.js

+2
Original file line numberDiff line numberDiff line change
@@ -16,10 +16,12 @@ describe('problem 0013', () => {
1616

1717
calculated = problem0013(inputNums, firtsDigits);
1818
console.log(`PROBLEM 0013 solution found: ${calculated}`);
19+
1920
expect(calculated).toBe(solutionFound);
2021

2122
calculated = problem0013alt(inputNums, firtsDigits);
2223
console.log(`PROBLEM 0013 Alternative solution found: ${calculated}`);
24+
2325
expect(calculated).toBe(solutionFound);
2426
});
2527
});

src/projecteuler/problem0016.test.js

+2
Original file line numberDiff line numberDiff line change
@@ -29,10 +29,12 @@ describe('problem 0016', () => {
2929

3030
calculated = problem0016(base, exponent);
3131
console.log(`PROBLEM 0016 solution found: ${calculated}`);
32+
3233
expect(calculated).toBe(solutionFound);
3334

3435
calculated = problem0016alt(base, exponent);
3536
console.log(`PROBLEM 0016 Alternative solution found: ${calculated}`);
37+
3638
expect(calculated).toBe(solutionFound);
3739
});
3840
});

0 commit comments

Comments
 (0)