💥 refactor!: Only use named exports and test build.

BREAKING CHANGE: Default exports are not available anymore.

Author: make-github-pseudonymous-again

README.md

@@ -6,12 +6,12 @@ Parent is [js-algorithms](https://github.com/make-github-pseudonymous-again/js-a
 See [docs](https://graph-algorithm.github.io/maximum-matching/index.html).
 
 ```js
-import maximumMatching, {iter} from '@graph-algorithm/maximum-matching';
+import {iter, weight as maximumMatching} from '@graph-algorithm/maximum-matching';
 const edges = [[1, 2, 10], [2, 3, 11]] ;
 const matching = maximumMatching(edges) ; // [-1, -1, 3, 2]
 [...iter(matching)]; // [ [2, 3] ]
 
-import maximumCardinalityMatching from '@graph-algorithm/maximum-matching/cardinality';
+import {opt as maximumCardinalityMatching} from '@graph-algorithm/maximum-matching/cardinality/index.js';
 for (const edge of iter(maximumCardinalityMatching([[1, 2], [2, 3], [3, 4]]))) {
 	console.log(edge);
 }

package.json

@@ -88,7 +88,7 @@
     "@node-loader/core": "2.0.0",
     "@node-loader/import-maps": "1.1.0",
     "ava": "6.1.1",
-    "babel-plugin-replace-import-extension": "^1.1.4",
+    "babel-plugin-replace-import-extension": "1.1.4",
     "babel-plugin-transform-remove-console": "6.9.4",
     "babel-plugin-unassert": "3.2.0",
     "babel-preset-minify": "0.5.2",

src/addDefaultWeight.js

@@ -1,2 +1,2 @@
-const addDefaultWeight = (edges) => edges.map(([u, v, w]) => [u, v, w || 1]);
-export default addDefaultWeight;
+export const addDefaultWeight = (edges) =>
+	edges.map(([u, v, w]) => [u, v, w || 1]);

src/cardinality/approx/bipartite.js

@@ -1 +1 @@
-export {default} from './general.js';
+export {general as bipartite} from './general.js';

src/cardinality/approx/general.js

@@ -1,4 +1,3 @@
-import general from '../opt/general.js';
+import {general as generalOpt} from '../opt/general.js';
 
-const generalApprox = (edges, _eps) => general(edges);
-export default generalApprox;
+export const general = (edges, _eps) => generalOpt(edges);

src/cardinality/approx/index.js

@@ -1,2 +1,2 @@
-export {default as bipartite} from './bipartite.js';
-export {default, default as general} from './general.js';
+export {bipartite} from './bipartite.js';
+export {general} from './general.js';

src/cardinality/index.js

@@ -1,2 +1,2 @@
-export {default as approx} from './approx/index.js';
-export {default, default as opt} from './opt/index.js';
+export {general as approx} from './approx/index.js';
+export {general as opt} from './opt/index.js';

src/cardinality/opt/bipartite.js

@@ -1 +1 @@
-export {default} from './general.js';
+export {general as bipartite} from './general.js';

src/cardinality/opt/general.js

@@ -1,6 +1,5 @@
-import addDefaultWeight from '../../addDefaultWeight.js';
-import blossomNoChecks from '../../core/blossomNoChecks.js';
+import {addDefaultWeight} from '../../addDefaultWeight.js';
+import {blossomNoChecks} from '../../core/blossomNoChecks.js';
 
-const general = (edges) => blossomNoChecks(addDefaultWeight(edges), true);
-
-export default general;
+export const general = (edges) =>
+	blossomNoChecks(addDefaultWeight(edges), true);

src/cardinality/opt/index.js

@@ -1,2 +1,2 @@
-export {default as bipartite} from './bipartite.js';
-export {default, default as general} from './general.js';
+export {bipartite} from './bipartite.js';
+export {general} from './general.js';

src/core/blossom/blossom.js

@@ -1,15 +1,15 @@
 import assert from 'assert';
 
-import blossomEdges from './blossomEdges.js';
-import blossomLeaves from './blossomLeaves.js';
-import checkDelta2 from './checkDelta2.js';
-import checkDelta3 from './checkDelta3.js';
-import endpoints from './endpoints.js';
-import min from './min.js';
-import neighbours from './neighbours.js';
-import rotate from './rotate.js';
-import statistics from './statistics.js';
-import verifyOptimum from './verifyOptimum.js';
+import {blossomEdges} from './blossomEdges.js';
+import {blossomLeaves} from './blossomLeaves.js';
+import {checkDelta2} from './checkDelta2.js';
+import {checkDelta3} from './checkDelta3.js';
+import {endpoints} from './endpoints.js';
+import {min} from './min.js';
+import {neighbours} from './neighbours.js';
+import {rotate} from './rotate.js';
+import {statistics} from './statistics.js';
+import {verifyOptimum} from './verifyOptimum.js';
 
 // Adapted from http://jorisvr.nl/maximummatching.html
 // All credit for the implementation goes to Joris van Rantwijk [http://jorisvr.nl].
@@ -29,7 +29,7 @@ import verifyOptimum from './verifyOptimum.js';
 // A C program for maximum weight matching by Ed Rothberg was used extensively
 // to validate this new code.
 
-export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
+export function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
 	// Check delta2/delta3 computation after every substage;
 	// only works on integer weights, slows down the algorithm to O(n^4).
 	if (CHECK_DELTA === undefined) CHECK_DELTA = false;

src/core/blossom/blossomEdges.js

@@ -1,6 +1,6 @@
-import blossomLeaves from './blossomLeaves.js';
+import {blossomLeaves} from './blossomLeaves.js';
 
-export default function* blossomEdges(nvertex, blossomchilds, neighbend, bv) {
+export function* blossomEdges(nvertex, blossomchilds, neighbend, bv) {
 	for (const v of blossomLeaves(nvertex, blossomchilds, bv)) {
 		for (const p of neighbend[v]) yield Math.floor(p / 2);
 	}

src/core/blossom/blossomLeaves.js

@@ -1,7 +1,7 @@
 /**
  * Generate the leaf vertices of a blossom via depth-first search.
  */
-export default function* blossomLeaves(nvertex, nodes, b) {
+export function* blossomLeaves(nvertex, nodes, b) {
 	if (b < nvertex) yield b;
 	else yield* _blossomLeavesDFS(nvertex, nodes, nodes[b].slice());
 }

src/core/blossom/checkDelta2.js

@@ -1,7 +1,7 @@
 import assert from 'assert';
 
 // Check optimized delta2 against a trivial computation.
-const checkDelta2 = ({
+export const checkDelta2 = ({
 	nvertex,
 	neighbend,
 	label,
@@ -52,5 +52,3 @@ const checkDelta2 = ({
 		}
 	}
 };
-
-export default checkDelta2;

src/core/blossom/checkDelta3.js

@@ -1,9 +1,9 @@
 import assert from 'assert';
 
-import blossomLeaves from './blossomLeaves.js';
+import {blossomLeaves} from './blossomLeaves.js';
 
 // Check optimized delta3 against a trivial computation.
-const checkDelta3 = ({
+export const checkDelta3 = ({
 	nvertex,
 	edges,
 	blossomparent,
@@ -54,5 +54,3 @@ const checkDelta3 = ({
 		console.debug('bk=' + bk + ' tbk=' + tbk + ' bd=' + bd + ' tbd=' + tbd);
 	assert(bd === tbd);
 };
-
-export default checkDelta3;

src/core/blossom/endpoints.js

@@ -1,10 +1,8 @@
-const endpoints = (nedge, edges) => {
+export const endpoints = (nedge, edges) => {
 	const endpoint = [];
 	for (let p = 0; p < nedge; ++p) {
 		endpoint.push(edges[p][0], edges[p][1]);
 	}
 
 	return endpoint;
 };
-
-export default endpoints;

src/core/blossom/index.js

@@ -1,6 +1,6 @@
-export {default as checkDelta2} from './checkDelta2.js';
-export {default as checkDelta3} from './checkDelta3.js';
-export {default as rotate} from './rotate.js';
-export {default as min} from './min.js';
-export {default, default as blossom} from './blossom.js';
-export {default as verifyOptimum} from './verifyOptimum.js';
+export {checkDelta2} from './checkDelta2.js';
+export {checkDelta3} from './checkDelta3.js';
+export {rotate} from './rotate.js';
+export {min} from './min.js';
+export {blossom} from './blossom.js';
+export {verifyOptimum} from './verifyOptimum.js';

src/core/blossom/min.js

@@ -1,7 +1,5 @@
-const min = (a, i, j) => {
+export const min = (a, i, j) => {
 	let o = a[i];
 	for (++i; i < j; ++i) if (a[i] < o) o = a[i];
 	return o;
 };
-
-export default min;

src/core/blossom/neighbours.js

@@ -1,4 +1,4 @@
-const neighbours = (nvertex, nedge, edges) => {
+export const neighbours = (nvertex, nedge, edges) => {
 	const neighbend = [];
 
 	for (let i = 0; i < nvertex; ++i) neighbend.push([]);
@@ -12,5 +12,3 @@ const neighbours = (nvertex, nedge, edges) => {
 
 	return neighbend;
 };
-
-export default neighbours;

src/core/blossom/rotate.js

@@ -1,8 +1,6 @@
-const rotate = (a, n) => {
+export const rotate = (a, n) => {
 	const head = a.splice(0, n);
 	for (let i = 0; i < n; ++i) {
 		a.push(head[i]);
 	}
 };
-
-export default rotate;

src/core/blossom/statistics.js

@@ -1,6 +1,6 @@
 import assert from 'assert';
 
-const statistics = (edges) => {
+export const statistics = (edges) => {
 	const nedge = edges.length;
 	let nvertex = 0;
 	let maxweight = 0;
@@ -20,5 +20,3 @@ const statistics = (edges) => {
 
 	return [nvertex, nedge, maxweight];
 };
-
-export default statistics;

src/core/blossom/verifyOptimum.js

@@ -1,9 +1,9 @@
 import assert from 'assert';
 
-import min from './min.js';
+import {min} from './min.js';
 
 // Verify that the optimum solution has been reached.
-const verifyOptimum = ({
+export const verifyOptimum = ({
 	nvertex,
 	edges,
 	maxCardinality,
@@ -80,5 +80,3 @@ const verifyOptimum = ({
 	}
 	// Ok.
 };
-
-export default verifyOptimum;

src/core/blossomNoChecks.js

@@ -1,5 +1,3 @@
-import blossom from './blossom/index.js';
+import {blossom} from './blossom/index.js';
 
-const blossomNoChecks = blossom(false, false);
-
-export default blossomNoChecks;
+export const blossomNoChecks = blossom(false, false);

src/core/index.js

@@ -1,11 +1,2 @@
-import blossom from './blossom/index.js';
-import blossomNoChecks from './blossomNoChecks.js';
-
-/* eslint import/no-anonymous-default-export: [2, {"allowObject": true}] */
-export default {
-	blossom,
-	blossomNoChecks,
-};
-
-export {default as blossom} from './blossom/index.js';
-export {default as blossomNoChecks} from './blossomNoChecks.js';
+export {blossom} from './blossom/index.js';
+export {blossomNoChecks} from './blossomNoChecks.js';

src/index.js

@@ -1,5 +1,4 @@
-export {default as cardinality} from './cardinality/index.js';
-export {default as iter} from './iter.js';
-export {default as core} from './core/index.js';
-export {default as addDefaultWeight} from './addDefaultWeight.js';
-export {default as weight, default} from './weight/index.js';
+export {addDefaultWeight} from './addDefaultWeight.js';
+export {iter} from './iter.js';
+export {opt as cardinality} from './cardinality/index.js';
+export {opt as weight} from './weight/index.js';

src/iter.js

@@ -1,4 +1,4 @@
-export default function* iter(matching) {
+export function* iter(matching) {
 	let i = 0;
 	for (const j of matching) {
 		// This takes care of j === -1

src/weight/approx/bipartite.js

@@ -1 +1 @@
-export {default} from './general.js';
+export {general as bipartite} from './general.js';

src/weight/approx/general.js

@@ -1,4 +1,3 @@
-import general from '../opt/general.js';
+import {general as generalOpt} from '../opt/general.js';
 
-const generalApprox = (edges, _eps) => general(edges);
-export default generalApprox;
+export const general = (edges, _eps) => generalOpt(edges);

src/weight/approx/index.js

@@ -1,2 +1,2 @@
-export {default as bipartite} from './bipartite.js';
-export {default, default as general} from './general.js';
+export {bipartite} from './bipartite.js';
+export {general} from './general.js';

src/weight/index.js

@@ -1,2 +1,2 @@
-export {default as approx} from './approx/index.js';
-export {default, default as opt} from './opt/index.js';
+export {general as approx} from './approx/index.js';
+export {general as opt} from './opt/index.js';

src/weight/opt/bipartite.js

@@ -1 +1 @@
-export {default} from './general.js';
+export {general as bipartite} from './general.js';

src/weight/opt/general.js

@@ -1,5 +1,3 @@
-import blossomNoChecks from '../../core/blossomNoChecks.js';
+import {blossomNoChecks} from '../../core/blossomNoChecks.js';
 
-const general = (edges) => blossomNoChecks(edges);
-
-export default general;
+export const general = (edges) => blossomNoChecks(edges);

src/weight/opt/index.js

@@ -1,2 +1,2 @@
-export {default as bipartite} from './bipartite.js';
-export {default, default as general} from './general.js';
+export {bipartite} from './bipartite.js';
+export {general} from './general.js';

test/src/cardinality.js

@@ -2,11 +2,11 @@ import test from 'ava';
 
 import {enumerate} from '@iterable-iterator/zip';
 
-import maximumCardinalityMatching from '../../src/cardinality/index.js';
-import blossom from '../../src/core/blossom/index.js';
-
 import {addDefaultWeight} from '#module';
 
+import {opt as maximumCardinalityMatching} from '#module/cardinality/index.js';
+import {blossom} from '#module/core/blossom/index.js';
+
 const macro = (t, algorithm, edges, expected) => {
 	const input = edges.map((edge) => edge.slice()); // Deepcopy
 	const result = algorithm(edges);

test/src/readme.js

@@ -1,8 +1,8 @@
 import test from 'ava';
 
-import maximumCardinalityMatching from '../../src/cardinality/index.js';
+import {iter, weight as maximumMatching} from '#module';
 
-import maximumMatching, {iter} from '#module';
+import {opt as maximumCardinalityMatching} from '#module/cardinality/index.js';
 
 test('weight', (t) => {
 	const edges = [

test/src/weight.js

@@ -2,9 +2,9 @@ import test from 'ava';
 
 import {enumerate} from '@iterable-iterator/zip';
 
-import blossom from '../../src/core/blossom/index.js';
+import {weight as maximumMatching} from '#module';
 
-import maximumMatching from '#module';
+import {blossom} from '#module/core/blossom/index.js';
 
 const macro = (t, algorithm, edges, expected) => {
 	const input = edges.map((edge) => edge.slice()); // Deepcopy

yarn.lock

@@ -2602,7 +2602,7 @@ babel-plugin-polyfill-regenerator@^0.5.5:
   dependencies:
     "@babel/helper-define-polyfill-provider" "^0.5.0"
 
-babel-plugin-replace-import-extension@^1.1.4:
+[email protected]:
   version "1.1.4"
   resolved "https://registry.yarnpkg.com/babel-plugin-replace-import-extension/-/babel-plugin-replace-import-extension-1.1.4.tgz#bfe96afd8363e47b9512086bfc0953e0493f4427"
   integrity sha512-UJi5YV31JxoaHHxhytRhQqOQN3+ZsaoXVia7e58yc35pe4tNjNr7BdznnDvIPbEG/4u5kf+lLDk9peaxsOPxGw==