✨ feat(minima): Export clarkson as minima.

Author: make-github-pseudonymous-again

README.md

@@ -8,17 +8,17 @@ See [docs](https://aureooms.github.io/js-poset).
 Parent is [@aureooms/js-algorithms](https://github.com/aureooms/js-algorithms).
 
 ```js
-import {clarkson} from '@aureooms/js-poset';
+import {minima} from '@aureooms/js-poset';
 import {increasing} from '@aureooms/js-compare';
 
 const a = [4, 12, 2, 6, 3];
 
 const divides = (a, b) => b % a === 0;
-const n = clarkson(divides, a, 0, a.length); // 2
+const n = minima(divides, a, 0, a.length); // 2
 a.slice(0, n).sort(increasing); // 2 3
 
 const norel = (_a, _b) => false;
-clarkson(norel, a, 0, a.length); // a.length
+minima(norel, a, 0, a.length); // a.length
 ```
 
 [![License](https://img.shields.io/github/license/aureooms/js-poset.svg)](https://raw.githubusercontent.com/aureooms/js-poset/master/LICENSE)

src/index.js

@@ -1 +1,8 @@
-export * from './minima';
+import minima from './minima';
+
+/* eslint import/no-anonymous-default-export: [2, {"allowObject": true}] */
+export default {
+	minima
+};
+
+export {minima};

src/minima/clarkson.js

@@ -22,7 +22,7 @@
  * -------------------- Kenneth L. Clarkson -
  */
 
-export function clarkson(prec, a, i, j) {
+export default function clarkson(prec, a, i, j) {
 	//
 	// This algorithm reorganizes the input array `a` as follows
 	//  - elements that are minima are put at the front of `a`

src/minima/index.js

@@ -1 +1,5 @@
-export * from './clarkson';
+import clarkson from './clarkson';
+
+export default clarkson;
+
+export {clarkson};

test/src/minima.js

@@ -1,6 +1,6 @@
 import test from 'ava';
 
-import {clarkson} from '../../src';
+import {minima} from '../../src';
 
 import {sort} from '@aureooms/js-insertion-sort';
 import {alloc, iota} from '@aureooms/js-array';
@@ -15,7 +15,7 @@ test('minima 1', (t) => {
 
 	shuffle(a, 0, a.length);
 
-	const min = clarkson(divides, a, 0, a.length);
+	const min = minima(divides, a, 0, a.length);
 
 	t.is(min, 1, 'minima set has cardinality 1');
 
@@ -31,7 +31,7 @@ test('minima 2,3', (t) => {
 
 	shuffle(a, i, j);
 
-	const min = clarkson(divides, a, i, j);
+	const min = minima(divides, a, i, j);
 
 	t.is(min - i, 2, 'minima set has cardinality 2');
 
@@ -50,7 +50,7 @@ test('minima totally unordered set', (t) => {
 
 	shuffle(a, 0, n);
 
-	const min = clarkson(norel, a, 0, n);
+	const min = minima(norel, a, 0, n);
 
 	t.deepEqual(min, n, 'minima set has cardinality n');
 });