mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
46 lines
875 B
JavaScript
46 lines
875 B
JavaScript
import { isDivisible } from '../IsDivisible'
|
|
|
|
describe('isDivisible', () => {
|
|
const testCases = [
|
|
[0, 1, true],
|
|
[0, 2, true],
|
|
[1, 1, true],
|
|
[1, 2, false],
|
|
[2, 1, true],
|
|
[4, 4, true],
|
|
[16, 4, true],
|
|
[36978235, 5, true],
|
|
[36978235, 4, false],
|
|
[4.5, 1.5, true],
|
|
[4.5, 1.2, false],
|
|
[5, 0, false],
|
|
[5, -0, false]
|
|
]
|
|
|
|
test.each(testCases)(
|
|
'if parameters are (%i, %i) it returns %p',
|
|
(dividend, divisor, expected) => {
|
|
expect(isDivisible(dividend, divisor)).toBe(expected)
|
|
}
|
|
)
|
|
|
|
const errorCases = [
|
|
[NaN, NaN],
|
|
[NaN, 1],
|
|
[1, NaN],
|
|
['1', 1],
|
|
[1, '1'],
|
|
[1, true],
|
|
[false, 2]
|
|
]
|
|
|
|
test.each(errorCases)(
|
|
'throws an error if parameters are (%p, %p)',
|
|
(dividend, divisor) => {
|
|
expect(() => {
|
|
isDivisible(dividend, divisor)
|
|
}).toThrow()
|
|
}
|
|
)
|
|
})
|