Skip to content

Update dependency eslint-plugin-jest to v28.8.0 #498

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Aug 8, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 7 additions & 7 deletions package-lock.json

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion package.json
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@
"eslint-config-airbnb-base": "15.0.0",
"eslint-config-prettier": "9.1.0",
"eslint-plugin-import": "2.29.1",
"eslint-plugin-jest": "28.7.0",
"eslint-plugin-jest": "28.8.0",
"eslint-plugin-prettier": "5.2.1",
"eslint-watch": "8.0.0",
"jest": "29.7.0",
Expand Down
5 changes: 5 additions & 0 deletions src/hackerrank/implementation/betweenTwoSets.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -11,22 +11,27 @@ describe('between Two Sets', () => {

const calculatedA = getTotalX([], input);
console.log(`Between Two Sets getTotalX([], ${input}): ${calculatedA}`);

expect(calculatedA).toBe(solutionFound);

const calculatedB = getTotalX(input, []);
console.log(`Between Two Sets getTotalX(${input}, []): ${calculatedB}`);

expect(calculatedB).toBe(solutionFound);

const calculatedC = getTotalX([], []);
console.log(`Between Two Sets getTotalX([], []): ${calculatedC}`);

expect(calculatedC).toBe(solutionFound);

const calculatedD = isFactor(1, []);
console.log(`Between Two Sets isFactor(1, []): ${calculatedD}`);

expect(calculatedD).toBe(false);

const calculatedE = factorOf(1, []);
console.log(`Between Two Sets factorOf(1, []): ${calculatedE}`);

expect(calculatedE).toBe(false);
});

Expand Down
4 changes: 4 additions & 0 deletions src/hackerrank/implementation/kangaroo.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -17,6 +17,7 @@ describe('number Line Jumps', () => {
console.log(
`number Line Jumps(${x1}, ${v1}, ${x2}, ${v2}) Border case: ${calculated}`
);

expect(calculated).toBe(solutionFound);
});

Expand All @@ -34,6 +35,7 @@ describe('number Line Jumps', () => {
console.log(
`number Line Jumps(${x1}, ${v1}, ${x2}, ${v2}) Border case: ${calculated}`
);

expect(calculated).toBe(solutionFound);
});

Expand All @@ -51,6 +53,7 @@ describe('number Line Jumps', () => {
console.log(
`number Line Jumps(${x1}, ${v1}, ${x2}, ${v2}) Test case 0: ${calculated}`
);

expect(calculated).toBe(solutionFound);
});

Expand All @@ -68,6 +71,7 @@ describe('number Line Jumps', () => {
console.log(
`number Line Jumps(${x1}, ${v1}, ${x2}, ${v2}) Test case 1: ${calculated}`
);

expect(calculated).toBe(solutionFound);
});
});
Original file line number Diff line number Diff line change
Expand Up @@ -23,6 +23,7 @@ const TEST_CASES = [
expected: 'Yes'
}
];

describe('ctci_ransom_note', () => {
it('checkMagazine test cases', () => {
expect.assertions(3);
Expand Down
1 change: 1 addition & 0 deletions src/hackerrank/warmup/birthdayCakeCandles.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -24,6 +24,7 @@ describe('birthdayCakeCandles', () => {
console.log(
`birthdayCakeCandles(${test.input}) Test case 0: ${calculated}`
);

expect(calculated).toBe(test.answer);
}
});
Expand Down
1 change: 1 addition & 0 deletions src/hackerrank/warmup/timeConversion.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -14,6 +14,7 @@ describe('timeConversion', () => {
for (const test of tests) {
const calculated = timeConversion(test.input);
console.log(`timeConversion(${test.input}) Test case 0: ${calculated}`);

expect(calculated).toBe(test.answer);
}
});
Expand Down
1 change: 1 addition & 0 deletions src/projecteuler/lib/BNodeBuilder.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,7 @@ import { BNode } from './BNode.js';
import { BNodeBuilder } from './BNodeBuilder.js';

const data = [[75], [95, 64]];

describe('class BNodeBuilder for binary trees', () => {
it('tree of BNode: building tree with null value', () => {
expect.assertions(1);
Expand Down
2 changes: 2 additions & 0 deletions src/projecteuler/problem0013.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -16,10 +16,12 @@ describe('problem 0013', () => {

calculated = problem0013(inputNums, firtsDigits);
console.log(`PROBLEM 0013 solution found: ${calculated}`);

expect(calculated).toBe(solutionFound);

calculated = problem0013alt(inputNums, firtsDigits);
console.log(`PROBLEM 0013 Alternative solution found: ${calculated}`);

expect(calculated).toBe(solutionFound);
});
});
2 changes: 2 additions & 0 deletions src/projecteuler/problem0016.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -29,10 +29,12 @@ describe('problem 0016', () => {

calculated = problem0016(base, exponent);
console.log(`PROBLEM 0016 solution found: ${calculated}`);

expect(calculated).toBe(solutionFound);

calculated = problem0016alt(base, exponent);
console.log(`PROBLEM 0016 Alternative solution found: ${calculated}`);

expect(calculated).toBe(solutionFound);
});
});