Skip to content

Commit fbeb3e8

Browse files
a-flying-potatomake-github-pseudonymous-again
a-flying-potato
authored and
make-github-pseudonymous-again
committed
🤖 chore: Lint source files.
These changes were automatically generated by a transform whose code can be found at: - https://github.com/aureooms/rejuvenate/blob/b20db05e5e78828d9a6224e5da5d23341866d340/src/transforms/sources:initial-lint.js Please contact the author of the transform if you believe there was an error.
1 parent 37234a1 commit fbeb3e8

29 files changed

+149
-154
lines changed

‎doc/scripts/header.js

+18-22
Original file line numberDiff line numberDiff line change
@@ -1,34 +1,30 @@
1-
var domReady = function(callback) {
2-
var state = document.readyState ;
3-
if ( state === 'interactive' || state === 'complete' ) {
4-
callback() ;
5-
}
6-
else {
1+
const domReady = function (callback) {
2+
const state = document.readyState;
3+
if (state === 'interactive' || state === 'complete') {
4+
callback();
5+
} else {
76
document.addEventListener('DOMContentLoaded', callback);
87
}
9-
} ;
10-
8+
};
119

12-
domReady(function(){
13-
14-
var projectname = document.createElement('a');
10+
domReady(() => {
11+
const projectname = document.createElement('a');
1512
projectname.classList.add('project-name');
1613
projectname.text = 'aureooms/js-maximum-matching';
17-
projectname.href = './index.html' ;
14+
projectname.href = './index.html';
1815

19-
var header = document.getElementsByTagName('header')[0] ;
20-
header.insertBefore(projectname,header.firstChild);
16+
const header = document.querySelectorAll('header')[0];
17+
header.insertBefore(projectname, header.firstChild);
2118

22-
var testlink = document.querySelector('header > a[data-ice="testLink"]') ;
23-
testlink.href = 'https://coveralls.io/github/aureooms/js-maximum-matching' ;
24-
testlink.target = '_BLANK' ;
19+
const testlink = document.querySelector('header > a[data-ice="testLink"]');
20+
testlink.href = 'https://coveralls.io/github/aureooms/js-maximum-matching';
21+
testlink.target = '_BLANK';
2522

26-
var searchBox = document.querySelector('.search-box');
27-
var input = document.querySelector('.search-input');
23+
const searchBox = document.querySelector('.search-box');
24+
const input = document.querySelector('.search-input');
2825

29-
// active search box when focus on searchBox.
30-
input.addEventListener('focus', function(){
26+
// Active search box when focus on searchBox.
27+
input.addEventListener('focus', () => {
3128
searchBox.classList.add('active');
3229
});
33-
3430
});

‎src/cardinality/approx/bipartite.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
1-
import general from "./general.js";
1+
import general from './general.js';
22

33
export default general;

‎src/cardinality/approx/general.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
import general from "../opt/general.js";
1+
import general from '../opt/general.js';
22

33
const generalApprox = (edges, _eps) => general(edges);
44
export default generalApprox;

‎src/cardinality/approx/index.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
import bipartite from "./bipartite.js";
2-
import general from "./general.js";
1+
import bipartite from './bipartite.js';
2+
import general from './general.js';
33

44
export default general;
55

‎src/cardinality/index.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
import approx from "./approx/index.js";
2-
import opt from "./opt/index.js";
1+
import approx from './approx/index.js';
2+
import opt from './opt/index.js';
33

44
export default opt;
55

‎src/cardinality/opt/bipartite.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
1-
import general from "./general.js";
1+
import general from './general.js';
22

33
export default general;

‎src/cardinality/opt/general.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
import blossomNoChecks from "../../core/blossomNoChecks.js";
2-
import addDefaultWeight from "../../addDefaultWeight.js";
1+
import blossomNoChecks from '../../core/blossomNoChecks.js';
2+
import addDefaultWeight from '../../addDefaultWeight.js';
33

44
const general = (edges) => blossomNoChecks(addDefaultWeight(edges), true);
55

‎src/cardinality/opt/index.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
import bipartite from "./bipartite.js";
2-
import general from "./general.js";
1+
import bipartite from './bipartite.js';
2+
import general from './general.js';
33

44
export default general;
55

‎src/core/blossom/blossom.js

+27-27
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,14 @@
11
import assert from 'assert';
2-
import min from "./min.js";
3-
import rotate from "./rotate.js";
4-
import verifyOptimum from "./verifyOptimum.js";
5-
import checkDelta2 from "./checkDelta2.js";
6-
import checkDelta3 from "./checkDelta3.js";
7-
import statistics from "./statistics.js";
8-
import endpoints from "./endpoints.js";
9-
import neighbours from "./neighbours.js";
10-
import blossomLeaves from "./blossomLeaves.js";
11-
import blossomEdges from "./blossomEdges.js";
2+
import min from './min.js';
3+
import rotate from './rotate.js';
4+
import verifyOptimum from './verifyOptimum.js';
5+
import checkDelta2 from './checkDelta2.js';
6+
import checkDelta3 from './checkDelta3.js';
7+
import statistics from './statistics.js';
8+
import endpoints from './endpoints.js';
9+
import neighbours from './neighbours.js';
10+
import blossomLeaves from './blossomLeaves.js';
11+
import blossomEdges from './blossomEdges.js';
1212

1313
// Adapted from http://jorisvr.nl/maximummatching.html
1414
// All credit for the implementation goes to Joris van Rantwijk [http://jorisvr.nl].
@@ -281,7 +281,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
281281
' w=' +
282282
w +
283283
') -> ' +
284-
b
284+
b,
285285
);
286286
blossombase[b] = base;
287287
blossomparent[b] = -1;
@@ -299,7 +299,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
299299
endps.push(labelend[bv]);
300300
assert(
301301
label[bv] === 2 ||
302-
(label[bv] === 1 && labelend[bv] === mate[blossombase[bv]])
302+
(label[bv] === 1 && labelend[bv] === mate[blossombase[bv]]),
303303
);
304304
// Trace one step back.
305305
assert(labelend[bv] >= 0);
@@ -320,7 +320,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
320320
endps.push(labelend[bw] ^ 1);
321321
assert(
322322
label[bw] === 2 ||
323-
(label[bw] === 1 && labelend[bw] === mate[blossombase[bw]])
323+
(label[bw] === 1 && labelend[bw] === mate[blossombase[bw]]),
324324
);
325325
// Trace one step back.
326326
assert(labelend[bw] >= 0);
@@ -404,7 +404,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
404404
// Expand the given top-level blossom.
405405
const expandBlossom = (b, endstage) => {
406406
console.debug(
407-
'DEBUG: expandBlossom(' + b + ',' + endstage + ') ' + blossomchilds[b]
407+
'DEBUG: expandBlossom(' + b + ',' + endstage + ') ' + blossomchilds[b],
408408
);
409409
// Convert sub-blossoms into top-level blossoms.
410410
for (let i = 0; i < blossomchilds[b].length; ++i) {
@@ -569,7 +569,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
569569
endpoint[p ^ 1] +
570570
' (k=' +
571571
Math.floor(p / 2) +
572-
')'
572+
')',
573573
);
574574
}
575575

@@ -588,7 +588,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
588588
const w = edges[k][1];
589589

590590
console.debug(
591-
'DEBUG: augmentMatching(' + k + ') (v=' + v + ' w=' + w + ')'
591+
'DEBUG: augmentMatching(' + k + ') (v=' + v + ' w=' + w + ')',
592592
);
593593
console.debug('DEBUG: PAIR ' + v + ' ' + w + ' (k=' + k + ')');
594594

@@ -631,7 +631,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
631631
// it will be assigned to mate[s] in the next step.
632632
p = labelend[bt] ^ 1;
633633
console.debug(
634-
'DEBUG: PAIR ' + s + ' ' + t + ' (k=' + Math.floor(p / 2) + ')'
634+
'DEBUG: PAIR ' + s + ' ' + t + ' (k=' + Math.floor(p / 2) + ')',
635635
);
636636
}
637637
};
@@ -684,7 +684,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
684684

685685
// Continue labeling until all vertices which are reachable
686686
// through an alternating path have got a label.
687-
while (queue.length && !augmented) {
687+
while (queue.length > 0 && !augmented) {
688688
// Take an S vertex from the queue.
689689
const v = queue.pop();
690690
console.debug('DEBUG: POP v=' + v);
@@ -746,13 +746,13 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
746746
const b = inblossom[v];
747747
if (bestedge[b] === -1 || kslack < slack(bestedge[b]))
748748
bestedge[b] = k;
749-
} else if (label[w] === 0) {
750-
// W is a free vertex (or an unreached vertex inside
749+
} else if (
750+
label[w] === 0 && // W is a free vertex (or an unreached vertex inside
751751
// a T-blossom) but we can not reach it yet;
752752
// keep track of the least-slack edge that reaches w.
753-
if (bestedge[w] === -1 || kslack < slack(bestedge[w]))
754-
bestedge[w] = k;
755-
}
753+
(bestedge[w] === -1 || kslack < slack(bestedge[w]))
754+
)
755+
bestedge[w] = k;
756756
}
757757
}
758758

@@ -776,7 +776,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
776776
endpoint,
777777
bestedge,
778778
slack,
779-
inblossom
779+
inblossom,
780780
});
781781
checkDelta3({
782782
nvertex,
@@ -788,7 +788,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
788788
endpoint,
789789
bestedge,
790790
slack,
791-
inblossom
791+
inblossom,
792792
});
793793
}
794794

@@ -877,7 +877,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
877877
deltatype === 1 ||
878878
deltatype === 2 ||
879879
deltatype === 3 ||
880-
deltatype === 4
880+
deltatype === 4,
881881
);
882882
if (deltatype === 1) {
883883
// No further improvement possible; optimum reached.
@@ -931,7 +931,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
931931
endpoint,
932932
dualvar,
933933
blossombase,
934-
blossomendps
934+
blossomendps,
935935
});
936936

937937
// Transform mate[] such that mate[v] is the vertex to which v is paired.

‎src/core/blossom/blossomEdges.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
import blossomLeaves from "./blossomLeaves.js";
1+
import blossomLeaves from './blossomLeaves.js';
22

33
export default function* blossomEdges(nvertex, blossomchilds, neighbend, bv) {
44
for (const v of blossomLeaves(nvertex, blossomchilds, bv)) {

‎src/core/blossom/blossomLeaves.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ export default function* blossomLeaves(nvertex, nodes, b) {
77
}
88

99
function* _blossomLeavesDFS(nvertex, nodes, queue) {
10-
while (queue.length !== 0) {
10+
while (queue.length > 0) {
1111
const b = queue.pop();
1212
if (b < nvertex) yield b;
1313
else for (const t of nodes[b]) queue.push(t);

‎src/core/blossom/checkDelta2.js

+3-3
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ const checkDelta2 = ({
88
endpoint,
99
bestedge,
1010
slack,
11-
inblossom
11+
inblossom,
1212
}) => {
1313
for (let v = 0; v < nvertex; ++v) {
1414
if (label[inblossom[v]] === 0) {
@@ -41,13 +41,13 @@ const checkDelta2 = ({
4141
' bestedge=' +
4242
bestedge[v] +
4343
' slack=' +
44-
slack(bestedge[v])
44+
slack(bestedge[v]),
4545
);
4646
}
4747

4848
assert(
4949
(bk === -1 && bestedge[v] === -1) ||
50-
(bestedge[v] !== -1 && bd === slack(bestedge[v]))
50+
(bestedge[v] !== -1 && bd === slack(bestedge[v])),
5151
);
5252
}
5353
}

‎src/core/blossom/checkDelta3.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
import assert from 'assert';
2-
import blossomLeaves from "./blossomLeaves.js";
2+
import blossomLeaves from './blossomLeaves.js';
33

44
// Check optimized delta3 against a trivial computation.
55
const checkDelta3 = ({
@@ -12,7 +12,7 @@ const checkDelta3 = ({
1212
endpoint,
1313
bestedge,
1414
slack,
15-
inblossom
15+
inblossom,
1616
}) => {
1717
let bk = -1;
1818
let bd = null;

‎src/core/blossom/endpoints.js

+1-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
const endpoints = (nedge, edges) => {
22
const endpoint = [];
33
for (let p = 0; p < nedge; ++p) {
4-
endpoint.push(edges[p][0]);
5-
endpoint.push(edges[p][1]);
4+
endpoint.push(edges[p][0], edges[p][1]);
65
}
76

87
return endpoint;

‎src/core/blossom/index.js

+6-6
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
1-
import blossom from "./blossom.js";
2-
import checkDelta2 from "./checkDelta2.js";
3-
import checkDelta3 from "./checkDelta3.js";
4-
import min from "./min.js";
5-
import rotate from "./rotate.js";
6-
import verifyOptimum from "./verifyOptimum.js";
1+
import blossom from './blossom.js';
2+
import checkDelta2 from './checkDelta2.js';
3+
import checkDelta3 from './checkDelta3.js';
4+
import min from './min.js';
5+
import rotate from './rotate.js';
6+
import verifyOptimum from './verifyOptimum.js';
77

88
export default blossom;
99

‎src/core/blossom/verifyOptimum.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
import assert from 'assert';
2-
import min from "./min.js";
2+
import min from './min.js';
33

44
// Verify that the optimum solution has been reached.
55
const verifyOptimum = ({
@@ -12,7 +12,7 @@ const verifyOptimum = ({
1212
endpoint,
1313
dualvar,
1414
blossombase,
15-
blossomendps
15+
blossomendps,
1616
}) => {
1717
let i;
1818
let j;

‎src/core/blossomNoChecks.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
import blossom from "./blossom/index.js";
1+
import blossom from './blossom/index.js';
22

33
const blossomNoChecks = blossom(false, false);
44

‎src/core/index.js

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
1-
import blossom from "./blossom/index.js";
2-
import blossomNoChecks from "./blossomNoChecks.js";
1+
import blossom from './blossom/index.js';
2+
import blossomNoChecks from './blossomNoChecks.js';
33

44
/* eslint import/no-anonymous-default-export: [2, {"allowObject": true}] */
55
export default {
66
blossom,
7-
blossomNoChecks
7+
blossomNoChecks,
88
};
99

1010
export {blossom, blossomNoChecks};

‎src/index.js

+5-5
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
1-
import cardinality from "./cardinality/index.js";
2-
import core from "./core/index.js";
3-
import weight from "./weight/index.js";
4-
import iter from "./iter.js";
5-
import addDefaultWeight from "./addDefaultWeight.js";
1+
import cardinality from './cardinality/index.js';
2+
import core from './core/index.js';
3+
import weight from './weight/index.js';
4+
import iter from './iter.js';
5+
import addDefaultWeight from './addDefaultWeight.js';
66

77
export default weight;
88

‎src/weight/approx/bipartite.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
1-
import general from "./general.js";
1+
import general from './general.js';
22

33
export default general;

‎src/weight/approx/general.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
import general from "../opt/general.js";
1+
import general from '../opt/general.js';
22

33
const generalApprox = (edges, _eps) => general(edges);
44
export default generalApprox;

0 commit comments

Comments
 (0)