js-merging
Merging code bricks for JavaScript. Parent is aureooms/js-sort.
merging.iterables( compare.increasing , count( 0 , 2 ) , count( 1 , 3 ) ) ;
// 0 1 2 4 4 6 7 8 10 10 ...
Can be managed through jspm, duo, component, bower, ender, jam, spm, and npm.
Install
jspm
jspm install github:aureooms/js-merging
# or
jspm install npm:@aureooms/js-merging
duo
No install step needed for duo!
component
component install aureooms/js-merging
bower
bower install @aureooms/js-merging
ender
ender add @aureooms/js-merging
jam
jam install @aureooms/js-merging
spm
spm install @aureooms/js-merging --save
npm
npm install @aureooms/js-merging --save
Require
jspm
let merging = require( "github:aureooms/js-merging" ) ;
// or
import merging from '@aureooms/js-merging' ;
duo
let merging = require( "aureooms/js-merging" ) ;
component, ender, spm, npm
let merging = require( "@aureooms/js-merging" ) ;
bower
The script tag exposes the global variable merging
.
<script src="bower_components/@aureooms/js-merging/js/dist/merging.min.js"></script>
Alternatively, you can use any tool mentioned here.
jam
require( [ "@aureooms/js-merging" ] , function ( merging ) { ... } ) ;
Use
/** array sequential merge */
let merge = merging.tapemerge ;
/** iterables sequential merg */
let merge = merging.iterables ;
/** generic template for a merging algorithm */
merging.merge ;
// for example
let array = require( "@aureooms/js-array" ) ;
let search = require( "@aureooms/js-search" ) ;
let merge = merging._merge( search.binarysearch , array.copy ) ;
/** Hwang-Lin algorithm (static version)*/
let merge = merging._hlstatic( search.binarysearch , array.copy ) ;