comparison-sorting / merging

:waning_gibbous_moon: Merging algorithms for JavaScript

@aureooms/js-merging

Merging library for JavaScript. See docs. 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 ...

merging's Issues

Dependency Dashboard

This issue lists Renovate updates and detected dependencies. Read the Dependency Dashboard docs to learn more.

Warning

These dependencies are deprecated:

Datasource	Name	Replacement PR?
npm	@aureooms/js-array
npm	@aureooms/js-compare
npm	@aureooms/js-functools
npm	@aureooms/js-itertools
npm	@aureooms/js-random
npm	@babel/polyfill

Rate-Limited

These updates are currently rate-limited. Click on a checkbox below to force their creation now.

• Update dependency np to v10
• Update dependency nyc to v17
• 🔐 Create all rate-limited PRs at once 🔐

Edited/Blocked

These updates have been manually edited so Renovate will no longer make changes. To discard all commits and start over, click on a checkbox.

• Update dependency coveralls to v3.1.1
• Update dependency @aureooms/js-itertools to v5.1.1
• Update dependency babel-plugin-unassert to v3.2.0
• Update dependency @aureooms/js-compare to v2
• Update dependency @aureooms/js-random to v3
• Update dependency @aureooms/js-sort to v8

Open

These updates have all been created already. Click a checkbox below to force a retry/rebase of any.

• Update babel monorepo (@babel/cli, @babel/core, @babel/preset-env, @babel/register)
• Update dependency np to v7.7.0
• Update dependency regenerator-runtime to v0.14.1
• Update dependency ava to v6
• Click on this checkbox to rebase all open PRs at once

Detected dependencies

npm

package.json

• @aureooms/js-array 4.0.0
• @aureooms/js-compare 1.4.8
• @aureooms/js-functools 2.0.3
• @aureooms/js-itertools 5.0.1
• @aureooms/js-random 2.0.0
• @aureooms/js-search 0.0.4
• @aureooms/js-sll 1.0.2
• @aureooms/js-sort 7.0.0
• @babel/cli 7.13.10
• @babel/core 7.13.10
• @babel/polyfill 7.12.1
• @babel/preset-env 7.13.10
• @babel/register 7.13.8
• ava 3.15.0
• babel-plugin-transform-remove-console 6.9.4
• babel-plugin-unassert 3.0.1
• babel-preset-power-assert 3.0.0
• coveralls 3.1.0
• esdoc 1.1.0
• esdoc-inject-script-plugin 1.0.0
• esdoc-inject-style-plugin 1.0.0
• esdoc-standard-plugin 1.0.0
• np 7.4.0
• nyc 15.1.0
• power-assert 1.6.1
• regenerator-runtime 0.13.7

travis

.travis.yml

---

• Check this box to trigger a request for Renovate to run again on this repository

more obvious tapemerge implementation

use

while ( true ) {

    if ( ai >= aj ) {
        while ( bi < bj ) { ... }
        return ;
    }

    if ( bi >= bj ) {
        do { ... } while ( ai < aj ) ;
        return ;
    }

    if ( compare( a[ai] , b[bi] ) <= 0 ) {
        ...
    }

    else {
        ...
    }

    ++ci ;

}

implement Huffman merging

test stability

Action Required: Fix Renovate Configuration

There is an error with this repository's Renovate configuration that needs to be fixed. As a precaution, Renovate will stop PRs until it is resolved.

Error type: undefined. Note: this is a nested preset so please contact the preset author if you are unable to fix it yourself.

Original Hwang-Lin algorithm

The current implementation is a static version of the algorithm as described in

MANACHER, Glenn K. The Ford-Johnson sorting algorithm is not optimal. Journal of the ACM (JACM), 1979, vol. 26, no 3, p. 441-456.

and

MANACHER, Glenn K. Significant improvements to the Hwang-Lin merging algorithm. Journal of the ACM (JACM), 1979, vol. 26, no 3, p. 434-440.

merge for iterables