✨ feat: First draft.

Author: make-github-pseudonymous-again

README.md

@@ -1,4 +1,4 @@
-[@aureooms/js-insertion-sort](https://aureooms.github.io/js-insertion-sort)
+:rewind: [@aureooms/js-insertion-sort](https://aureooms.github.io/js-insertion-sort)
 ==
 
 Insertion sorting algorithms for JavaScript.

package.json

@@ -27,6 +27,7 @@
             "transform-remove-console",
             {
               "exclude": [
+                "debug",
                 "log",
                 "error",
                 "warn"
@@ -77,6 +78,8 @@
   },
   "dependencies": {},
   "devDependencies": {
+    "@aureooms/js-array": "^4.0.0",
+    "@aureooms/js-in-situ-sort-spec": "^8.0.0",
     "@babel/cli": "7.11.6",
     "@babel/core": "7.11.6",
     "@babel/preset-env": "7.11.5",
@@ -101,7 +104,16 @@
     "lib"
   ],
   "homepage": "https://aureooms.github.io/js-insertion-sort",
-  "keywords": ["agpl", "algorithms", "insertion", "insertion-sort", "javascript", "quadratic-time", "sorting", "sorting-algorithms"],
+  "keywords": [
+    "agpl",
+    "algorithms",
+    "insertion",
+    "insertion-sort",
+    "javascript",
+    "quadratic-time",
+    "sorting",
+    "sorting-algorithms"
+  ],
   "license": "AGPL-3.0",
   "main": "lib/index.js",
   "prettier": {
@@ -114,12 +126,12 @@
   "scripts": {
     "build": "babel --delete-dir-on-start --env-name production src -d lib",
     "cover": "nyc --reporter=lcov npm test",
+    "dev": "npm run lint -- --fix && npm run cover -- -- -st --fail-fast",
     "esdoc": "esdoc",
+    "lint": "xo",
     "prepare": "npm run build",
     "release": "np",
     "test": "ava",
-    "lint": "xo",
-    "dev": "npm run lint -- --fix && npm run cover -- -- -st --fail-fast",
     "travis": "npm run lint && npm run cover"
   },
   "sideEffects": false,

src/index.js

@@ -0,0 +1,22 @@
+import sort from './sort';
+import sortTypedDecreasing from './sortTypedDecreasing';
+import sortTypedDecreasingOptimized from './sortTypedDecreasingOptimized';
+import sortTypedIncreasing from './sortTypedIncreasing';
+import sortTypedIncreasingOptimized from './sortTypedIncreasingOptimized';
+
+/* eslint import/no-anonymous-default-export: [2, {"allowObject": true}] */
+export default {
+	sort,
+	sortTypedDecreasing,
+	sortTypedDecreasingOptimized,
+	sortTypedIncreasing,
+	sortTypedIncreasingOptimized,
+};
+
+export {
+	sort,
+	sortTypedDecreasing,
+	sortTypedDecreasingOptimized,
+	sortTypedIncreasing,
+	sortTypedIncreasingOptimized,
+};

src/sort.js

@@ -0,0 +1,10 @@
+const sort = (compare, a, i, j) => {
+	for (let k = i + 1; k < j; ++k) {
+		let t = k;
+		const o = a[t];
+		while (t-- > i && compare(a[t], o) > 0) a[t + 1] = a[t];
+		a[t + 1] = o;
+	}
+};
+
+export default sort;

src/sortTypedDecreasing.js

@@ -0,0 +1,10 @@
+const sortTypedDecreasing = (a, i, j) => {
+	for (let k = i + 1; k < j; ++k) {
+		let t = k;
+		const o = a[t];
+		while (t-- > i && a[t] < o) a[t + 1] = a[t];
+		a[t + 1] = o;
+	}
+};
+
+export default sortTypedDecreasing;

src/sortTypedDecreasingOptimized.js

@@ -0,0 +1,16 @@
+import assert from 'assert';
+
+/**
+ * Hyp: a[i-1] >= max(a[i:j]).
+ */
+const sortTypedDecreasingOptimized = (a, i, j) => {
+	assert(i >= 1);
+	for (let k = i + 1; k < j; ++k) {
+		let t = k;
+		const o = a[t];
+		while (a[--t] < o) a[t + 1] = a[t];
+		a[t + 1] = o;
+	}
+};
+
+export default sortTypedDecreasingOptimized;

src/sortTypedIncreasing.js

@@ -0,0 +1,10 @@
+const sortTypedIncreasing = (a, i, j) => {
+	for (let k = i + 1; k < j; ++k) {
+		let t = k;
+		const o = a[t];
+		while (t-- > i && a[t] > o) a[t + 1] = a[t];
+		a[t + 1] = o;
+	}
+};
+
+export default sortTypedIncreasing;

src/sortTypedIncreasingOptimized.js

@@ -0,0 +1,16 @@
+import assert from 'assert';
+
+/**
+ * Hyp: a[i-1] <= min(a[i:j]).
+ */
+const sortTypedIncreasingOptimized = (a, i, j) => {
+	assert(i >= 1);
+	for (let k = i + 1; k < j; ++k) {
+		let t = k;
+		const o = a[t];
+		while (a[--t] > o) a[t + 1] = a[t];
+		a[t + 1] = o;
+	}
+};
+
+export default sortTypedIncreasingOptimized;

test/src/all.js

@@ -0,0 +1,52 @@
+// eslint-disable-next-line ava/use-test
+import ava from 'ava';
+
+import * as spec from '@aureooms/js-in-situ-sort-spec';
+import {min, copy} from '@aureooms/js-array';
+import {increasing, decreasing} from '@aureooms/js-compare';
+import {
+	sort,
+	sortTypedIncreasing,
+	sortTypedDecreasing,
+	sortTypedIncreasingOptimized,
+	sortTypedDecreasingOptimized,
+} from '../../src';
+
+const sortTyped = (compare, a, i, j) => {
+	switch (compare) {
+		case increasing:
+			return sortTypedIncreasing(a, i, j);
+		case decreasing:
+			return sortTypedDecreasing(a, i, j);
+		default:
+			throw new Error(
+				'First argument `compare` should be one of {increasing, decreasing}.',
+			);
+	}
+};
+
+const sortTypedOptimized = (compare, a, i, j) => {
+	const X = a.constructor;
+	const N = j - i;
+	const b = new X(N + 1);
+	copy(a, i, j, b, 1);
+	b[0] = min(compare, a, i, j);
+	switch (compare) {
+		case increasing:
+			sortTypedIncreasingOptimized(b, 1, N + 1);
+			return copy(b, 1, N + 1, a, i);
+		case decreasing:
+			sortTypedDecreasingOptimized(b, 1, N + 1);
+			return copy(b, 1, N + 1, a, i);
+		default:
+			throw new Error(
+				'First argument `compare` should be one of {increasing, decreasing}.',
+			);
+	}
+};
+
+spec.test(ava, [
+	['sort', sort],
+	['sortTyped', sortTyped],
+	['sortTypedOptimized', sortTypedOptimized],
+]);