💥 BREAKING CHANGE: Remove Ford-Johnson implementation.

README.md

@@ -11,7 +11,10 @@ Parent is [@aureooms/js-algorithms](https://github.com/aureooms/js-algorithms).
 > working. Documentation may be present. Coherence may be. Maybe.
 
 ```js
-let fordjohnson = sort._fordjohnson( search.binarysearch ) ;
+import {isSorted} from '@aureooms/js-sort';
+import {increasing, decreasing} from '@aureooms/js-compare';
+isSorted(increasing, [1, 2, 3], 0, 3); // true
+isSorted(decreasing, [1, 2, 3], 0, 3); // false
 ```
 
 [![License](https://img.shields.io/github/license/aureooms/js-sort.svg)](https://raw.githubusercontent.com/aureooms/js-sort/master/LICENSE)
@@ -39,6 +42,7 @@ This package has several children:
     - [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-merge-insertion-sort](https://github.com/aureooms/js-merge-insertion-sort): Ford-Johnson algorithm 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

doc/manual/example.md

@@ -1,29 +1,23 @@
 # Examples
 ```js
-import array from "@aureooms/js-array" ;
-import search from "@aureooms/js-search" ;
-import compare from "@aureooms/js-compare" ;
-
-let fordjohnson = function ( compare , a , i , j ) {
-
-	sort._fordjohnson( search.binarysearch )( compare , array.swap , a , i , j ) ;
-
-} ;
+import * as sort from "@aureooms/js-sort" ;
+import {increasing, decreasing} from "@aureooms/js-compare" ;
 
 let a = [ 1 , 6 , 5 , 3 , 2 , 4 ] ;
+let {selectionsort, isSorted} = sort;
 
-fordjohnson( compare.increasing , a , 0 , a.length ) ;
+selectionsort( increasing , a , 0 , a.length ) ;
 
 a ; // [ 1 , 2 , 3 , 4 , 5 , 6 ]
+isSorted(increasing, a, 0, a.length); // true
 
-fordjohnson( compare.decreasing , a , 0 , a.length ) ;
+selectionsort( decreasing , a , 0 , a.length ) ;
 
 a ; // [ 6 , 5 , 4 , 3 , 2 , 1 ]
+isSorted(decreasing, a, 0, a.length); // true
 
 // but also
 
-/** selectionsort */
-let selectionsort = sort.selectionsort ;
 /** bubblesort */
-let bubblesort = sort.bubblesort ;
+let {bubblesort} = sort ;
 ```

package.json

@@ -83,7 +83,6 @@
     "@aureooms/js-in-situ-sort-spec": "8.0.0",
     "@aureooms/js-itertools": "4.1.0",
     "@aureooms/js-random": "2.0.0",
-    "@aureooms/js-search": "0.0.4",
     "@babel/cli": "7.11.6",
     "@babel/core": "7.11.6",
     "@babel/preset-env": "7.11.5",

src/sort/index.js

@@ -1,3 +1,2 @@
 export * from './bubblesort' ;
-export * from './fordjohnson' ;
 export * from './selectionsort' ;

test/src/inplacesort.js

@@ -1,14 +1,9 @@
 import ava from 'ava' ;
 
-import { swap } from "@aureooms/js-array" ;
-import { binarysearch } from "@aureooms/js-search" ;
 import * as spec from "@aureooms/js-in-situ-sort-spec" ;
 import * as sort from "../../src" ;
 
 spec.test( ava , [
 	[ "selectionsort", sort.selectionsort ],
-	[ "bubblesort", sort.bubblesort ],
-	[ "fordjohnson" , function ( compare , a , i , j ) {
-		sort._fordjohnson( binarysearch )( compare , swap , a , i , j ) ;
-	} ]
+	[ "bubblesort", sort.bubblesort ]
 ] ) ;

test/src/whole.js

@@ -1,7 +1,6 @@
 import test from 'ava' ;
 
 import { iota , swap } from "@aureooms/js-array" ;
-import search from "@aureooms/js-search" ;
 import { shuffle } from "@aureooms/js-random" ;
 import * as compare from "@aureooms/js-compare" ;
 import * as itertools from "@aureooms/js-itertools" ;
@@ -51,13 +50,7 @@ itertools.product( [
 
 [
 	[ "selectionsort", sort.selectionsort ],
-	[ "bubblesort", sort.bubblesort ],
-	[ "fordjohnson" , function ( compare , a , i , j ) {
-
-		sort._fordjohnson( search.binarysearch )( compare , swap , a , i , j ) ;
-
-	} ]
-
+	[ "bubblesort", sort.bubblesort ]
 ],
 
 [

yarn.lock

@@ -54,11 +54,6 @@
   resolved "https://registry.yarnpkg.com/@aureooms/js-random/-/js-random-2.0.0.tgz#f62c6954ed79bd9a520197125ee3cfbe14b00d72"
   integrity sha1-9ixpVO15vZpSAZcSXuPPvhSwDXI=
 
-"@aureooms/js-search@0.0.4":
-  version "0.0.4"
-  resolved "https://registry.yarnpkg.com/@aureooms/js-search/-/js-search-0.0.4.tgz#e7082a7de169c80710924f5292b631a2c1bb9a41"
-  integrity sha1-5wgqfeFpyAcQkk9SkrYxosG7mkE=
-
 "@aureooms/js-sort@^7.0.0":
   version "7.0.0"
   resolved "https://registry.yarnpkg.com/@aureooms/js-sort/-/js-sort-7.0.0.tgz#db3c8b93acd93ee0500462b2cec29239c3deb34d"