algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 16:26:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: Test running overhaul, switch to Prettier & reformat everything (#1407)

Browse Source 
* 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>
This commit is contained in:
Roland Hummel
2023-10-03 23:08:19 +02:00
committed by GitHub
parent 0ca18c2b2c
commit 86d333ee94
392 changed files with 5849 additions and 16622 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
Search/UnionFind.js
View File

@ -14,7 +14,7 @@
*
* you can learn more on disjoint-set / union–find data structure at https://en.wikipedia.org/wiki/Disjoint-set_data_structure
*/
function UnionFind (n, key) {
function UnionFind(n, key) {
if (!(this instanceof UnionFind)) return new UnionFind(n)
if (key && typeof key !== 'function') {
throw new Error('key has to be a function or else left undefined')
@ -22,7 +22,11 @@ function UnionFind (n, key) {
let cnt, length
// init Union Find with number of distinct groups. Each group will be referred to as index of the array of size 'size' starting at 0.
// Provide an optional key function that maps these indices. I.e. for the groups starting with 1 provide function(a){return a-1;}. The default value is function(a){return a;}.
key = key || function (a) { return a }
key =
key ||
function (a) {
return a
}
cnt = length = n
const id = new Array(n)
const sz = new Array(n)
@ -63,16 +67,21 @@ function UnionFind (n, key) {
const j = this.find(q)
if (i === j) return
if (sz[i] < sz[j]) {
id[i] = j; sz[j] += sz[i]
id[i] = j
sz[j] += sz[i]
} else {
id[j] = i; sz[i] += sz[j]
id[j] = i
sz[i] += sz[j]
}
cnt--
}
function ensureIndexWithinBounds (args) {
function ensureIndexWithinBounds(args) {
for (let i = arguments.length - 1; i >= 0; i--) {
const p = arguments[i]
if (p >= length) throw new Error('Index out of bounds. The maximum index can be length-1')
if (p >= length)
throw new Error(
'Index out of bounds. The maximum index can be length-1'
)
}
}
}