♻️ refactor: Only keep Ford-Johnson algorithm implementation.

Author: make-github-pseudonymous-again

.esdoc.json

@@ -35,7 +35,7 @@
           "autoPrivate": true
         },
         "brand": {
-          "title": "@aureooms/js-sort"
+          "title": "@aureooms/js-merge-insertion-sort"
         },
         "test": {
           "type": "ava",

README.md

@@ -1,52 +1,31 @@
-:signal_strength: [@aureooms/js-sort](https://aureooms.github.io/js-sort)
+:person_fencing: [@aureooms/js-merge-insertion-sort](https://aureooms.github.io/js-merge-insertion-sort)
 ==
 
 <img src="http://www.explainxkcd.com//wiki/images/b/bc/ineffective_sorts.png" width="864">
 
-Sorting algorithms for JavaScript.
-See [docs](https://aureooms.github.io/js-sort).
-Parent is [@aureooms/js-algorithms](https://github.com/aureooms/js-algorithms).
-
-> :building_construction: Caveat emptor! This is work in progress. Code may be
-> working. Documentation may be present. Coherence may be. Maybe.
+[Ford-Johnson algorithm](https://en.wikipedia.org/wiki/Merge-insertion_sort) for JavaScript.
+See [docs](https://aureooms.github.io/js-merge-insertion-sort).
+Parent is [@aureooms/js-sort](https://github.com/aureooms/js-sort).
 
 ```js
-let fordjohnson = sort._fordjohnson( search.binarysearch ) ;
+import { fordjohnson } from "@aureooms/js-merge-insertion-sort" ;
+import { binarysearch } from "@aureooms/js-search" ;
+import { swap } from "@aureooms/js-array" ;
+const fj = fordjohnson( binarysearch ) ;
+const sort = (compare, a, i, j) => fj(compare, swap, a, i, j) ;
 ```
 
-[![License](https://img.shields.io/github/license/aureooms/js-sort.svg)](https://raw.githubusercontent.com/aureooms/js-sort/master/LICENSE)
-[![Version](https://img.shields.io/npm/v/@aureooms/js-sort.svg)](https://www.npmjs.org/package/@aureooms/js-sort)
-[![Build](https://img.shields.io/travis/aureooms/js-sort/master.svg)](https://travis-ci.org/aureooms/js-sort/branches)
-[![Dependencies](https://img.shields.io/david/aureooms/js-sort.svg)](https://david-dm.org/aureooms/js-sort)
-[![Dev dependencies](https://img.shields.io/david/dev/aureooms/js-sort.svg)](https://david-dm.org/aureooms/js-sort?type=dev)
-[![GitHub issues](https://img.shields.io/github/issues/aureooms/js-sort.svg)](https://github.com/aureooms/js-sort/issues)
-[![Downloads](https://img.shields.io/npm/dm/@aureooms/js-sort.svg)](https://www.npmjs.org/package/@aureooms/js-sort)
-
-[![Code issues](https://img.shields.io/codeclimate/issues/aureooms/js-sort.svg)](https://codeclimate.com/github/aureooms/js-sort/issues)
-[![Code maintainability](https://img.shields.io/codeclimate/maintainability/aureooms/js-sort.svg)](https://codeclimate.com/github/aureooms/js-sort/trends/churn)
-[![Code coverage (cov)](https://img.shields.io/codecov/c/gh/aureooms/js-sort/master.svg)](https://codecov.io/gh/aureooms/js-sort)
-[![Code technical debt](https://img.shields.io/codeclimate/tech-debt/aureooms/js-sort.svg)](https://codeclimate.com/github/aureooms/js-sort/trends/technical_debt)
-[![Documentation](https://aureooms.github.io/js-sort//badge.svg)](https://aureooms.github.io/js-sort//source.html)
-[![Package size](https://img.shields.io/bundlephobia/minzip/@aureooms/js-sort)](https://bundlephobia.com/result?p=@aureooms/js-sort)
-
-## Children
-
-This package has several children:
-
-  - [aureooms/js-bucketsort](https://github.com/aureooms/js-bucketsort): bucketsort for JavaScript
-  - [aureooms/js-countingsort](https://github.com/aureooms/js-countingsort): countingsort for JavaScript
-  - [aureooms/js-in-situ-sort-spec](https://github.com/aureooms/js-in-situ-sort-spec): in place sorting for JavaScript
-    - [aureooms/js-heapsort](https://github.com/aureooms/js-heapsort): heapsort for JavaScript
-    - [aureooms/js-quicksort](https://github.com/aureooms/js-quicksort): quicksort for JavaScript
-    - [aureooms/js-insertion-sort](https://github.com/aureooms/js-insertion-sort): Insertion sorting algorithms for JavaScript
-  - [aureooms/js-mergesort](https://github.com/aureooms/js-mergesort): mergesort for JavaScript
-  - [aureooms/js-odd-even-mergesort](https://github.com/aureooms/js-odd-even-mergesort): Batcher's odd-even mergesort for JavaScript
-  - [aureooms/js-radix-sort](https://github.com/aureooms/js-radix-sort): Radix sorting algorithms for JavaScript
-  - [aureooms/js-merging](https://github.com/aureooms/js-merging): merging for JavaScript
-  - [aureooms/js-partition](https://github.com/aureooms/js-partition): partition for JavaScript
-  - [aureooms/js-selection](https://github.com/aureooms/js-selection): selection for JavaScript
-
-
-## Reference
-
-  - http://sorting.at
+[![License](https://img.shields.io/github/license/aureooms/js-merge-insertion-sort.svg)](https://raw.githubusercontent.com/aureooms/js-merge-insertion-sort/master/LICENSE)
+[![Version](https://img.shields.io/npm/v/@aureooms/js-merge-insertion-sort.svg)](https://www.npmjs.org/package/@aureooms/js-merge-insertion-sort)
+[![Build](https://img.shields.io/travis/aureooms/js-merge-insertion-sort/master.svg)](https://travis-ci.org/aureooms/js-merge-insertion-sort/branches)
+[![Dependencies](https://img.shields.io/david/aureooms/js-merge-insertion-sort.svg)](https://david-dm.org/aureooms/js-merge-insertion-sort)
+[![Dev dependencies](https://img.shields.io/david/dev/aureooms/js-merge-insertion-sort.svg)](https://david-dm.org/aureooms/js-merge-insertion-sort?type=dev)
+[![GitHub issues](https://img.shields.io/github/issues/aureooms/js-merge-insertion-sort.svg)](https://github.com/aureooms/js-merge-insertion-sort/issues)
+[![Downloads](https://img.shields.io/npm/dm/@aureooms/js-merge-insertion-sort.svg)](https://www.npmjs.org/package/@aureooms/js-merge-insertion-sort)
+
+[![Code issues](https://img.shields.io/codeclimate/issues/aureooms/js-merge-insertion-sort.svg)](https://codeclimate.com/github/aureooms/js-merge-insertion-sort/issues)
+[![Code maintainability](https://img.shields.io/codeclimate/maintainability/aureooms/js-merge-insertion-sort.svg)](https://codeclimate.com/github/aureooms/js-merge-insertion-sort/trends/churn)
+[![Code coverage (cov)](https://img.shields.io/codecov/c/gh/aureooms/js-merge-insertion-sort/master.svg)](https://codecov.io/gh/aureooms/js-merge-insertion-sort)
+[![Code technical debt](https://img.shields.io/codeclimate/tech-debt/aureooms/js-merge-insertion-sort.svg)](https://codeclimate.com/github/aureooms/js-merge-insertion-sort/trends/technical_debt)
+[![Documentation](https://aureooms.github.io/js-merge-insertion-sort//badge.svg)](https://aureooms.github.io/js-merge-insertion-sort//source.html)
+[![Package size](https://img.shields.io/bundlephobia/minzip/@aureooms/js-merge-insertion-sort)](https://bundlephobia.com/result?p=@aureooms/js-merge-insertion-sort)

doc/manual/installation.md

@@ -5,10 +5,10 @@ or [npm](https://github.com/npm/npm).
 
 ### jspm
 ```terminal
-jspm install npm:@aureooms/js-sort
+jspm install npm:@aureooms/js-merge-insertion-sort
 ```
 
 ### npm
 ```terminal
-npm install @aureooms/js-sort --save
+npm install @aureooms/js-merge-insertion-sort --save
 ```

doc/manual/usage.md

@@ -9,7 +9,7 @@ import 'regenerator-runtime/runtime' ;
 
 Then
 ```js
-const measure = require( '@aureooms/js-sort' ) ;
+const measure = require( '@aureooms/js-merge-insertion-sort' ) ;
 // or
-import measure from '@aureooms/js-sort' ;
+import measure from '@aureooms/js-merge-insertion-sort' ;
 ```

doc/scripts/header.js

@@ -13,14 +13,14 @@ domReady(function(){
 
 	var projectname = document.createElement('a');
 	projectname.classList.add('project-name');
-	projectname.text = 'aureooms/js-sort';
+	projectname.text = 'aureooms/js-merge-insertion-sort';
 	projectname.href = './index.html' ;
 
 	var header = document.getElementsByTagName('header')[0] ;
 	header.insertBefore(projectname,header.firstChild);
 
 	var testlink = document.querySelector('header > a[data-ice="testLink"]') ;
-	testlink.href = 'https://coveralls.io/github/aureooms/js-sort' ;
+	testlink.href = 'https://coveralls.io/github/aureooms/js-merge-insertion-sort' ;
 	testlink.target = '_BLANK' ;
 
 	var searchBox = document.querySelector('.search-box');

package.json

@@ -1,5 +1,5 @@
 {
-  "name": "@aureooms/js-sort",
+  "name": "@aureooms/js-merge-insertion-sort",
   "description": "sorting code bricks for JavaScript",
   "version": "7.0.0",
   "author": "Aurélien Ooms <[email protected]>",
@@ -73,7 +73,7 @@
     }
   },
   "bugs": {
-    "url": "https://github.com/aureooms/js-sort/issues"
+    "url": "https://github.com/aureooms/js-merge-insertion-sort/issues"
   },
   "dependencies": {},
   "devDependencies": {
@@ -105,7 +105,7 @@
   "files": [
     "lib"
   ],
-  "homepage": "http://aureooms.github.io/js-sort/",
+  "homepage": "http://aureooms.github.io/js-merge-insertion-sort/",
   "keywords": [
     "bricks",
     "javascript",
@@ -117,7 +117,7 @@
   "license": "AGPL-3.0",
   "main": "lib/index.js",
   "repository": {
-    "url": "https://github.com/aureooms/js-sort.git",
+    "url": "https://github.com/aureooms/js-merge-insertion-sort.git",
     "type": "git"
   },
   "scripts": {

src/sort/fordjohnson.js renamed to src/fordjohnson.js

@@ -1,7 +1,7 @@
 
-export function _fordjohnson ( binarysearch ) {
+export default function fordjohnson ( binarysearch ) {
 
-	const fordjohnson = function ( compare , swap , a , i , j ) {
+	const sort = function ( compare , swap , a , i , j ) {
 
 		var m , k , t , y , p , q , r , x , l , w , s , pairswap ;
 
@@ -29,7 +29,7 @@ export function _fordjohnson ( binarysearch ) {
 			swap( a , i + m , j + m ) ;
 		} ;
 
-		fordjohnson( compare , pairswap , a , i , i + m ) ;
+		sort( compare , pairswap , a , i , i + m ) ;
 
 		// merge the rest of the array into the front, one item at a time
 
@@ -88,6 +88,6 @@ export function _fordjohnson ( binarysearch ) {
 
 	} ;
 
-	return fordjohnson ;
+	return sort ;
 
 }

src/index.js

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

src/sort/bubblesort.js

@@ -0,0 +1,12 @@
+import ava from 'ava' ;
+
+import * as spec from "@aureooms/js-in-situ-sort-spec" ;
+
+import { swap } from "@aureooms/js-array" ;
+import { binarysearch } from "@aureooms/js-search" ;
+import {fordjohnson} from "../../src" ;
+
+const fj = fordjohnson( binarysearch ) ;
+const sort = (compare, a, i, j) => fj(compare, swap, a, i, j) ;
+
+spec.test( ava , [ [ "fordjohnson" , sort ] ] ) ;