v2.7.1

What's Changed

• Next: Use getParentIndexOf to init HeapAsync by @ignlg in #668

Full Changelog: v2.7.0...v2.7.1

v2.7.0

What's Changed

• Optimize _sortNodeUp/Down methods and _moveNode method (11x improvement) by @BeatsuDev in #664
• Optimize _sortNodeUp/Down methods and _moveNode method by @ignlg in #666
• Next: Improve performance and bump to v2.7 by @ignlg in #667

New Contributors

• @BeatsuDev made their first contribution in #664

Full Changelog: v2.6.0...v2.7.0

v2.6.0

What's Changed

• Add new methods indexOf and indexOfEvery to the Heap class by @ignlg in #650
• Next release 2.4.0 by @ignlg in #651
• Update dev dependencies to latest versions by @ignlg in #652
• Update dev dependencies and documentation by @ignlg in #653
• 🔧 chore(package.json): update dependencies by @ignlg in #654
• ⬆️ chore(package.json): update devDependencies by @ignlg in #655
• Next release 2.5.0 by @ignlg in #657
• Improve performance, upgrade packages, and bump to v2.6 by @ignlg in #658

Full Changelog: v2.3.0...v2.6.0

v2.3.0

Changelog:

• Adds the HeapAsync class, with async methods and supporting async comparators. It is a drop-in replacement for the Heap class with Promises.

100% test coverage.

v2.2.0

Quick changelog:

• Fixes .iterator() method to follow Java's PriorityQueue implementation:
  

The Iterator provided in method iterator() is not guaranteed to traverse the elements of the priority queue in any particular order.

v2.1.6

Quick changelog:

A test is fixed and all the dependencies are up to date.

v2.1.2

Dependencies upgrade.

v2.0.0

The main breaking change is that now top(N) does NOT sort the output. It should not be part of the spec for a priority queue, the output should be the top N elements. It will be partially ordered with the peek at index 0 by definition, that is all.

• top(N) is unordered, only the first element is guaranteed to be the top priority element.
• Fixes custom heap issue #31.
• Performance improvements.
• More tests, including those for custom heaps.
• Auxiliary experimental topN algorithms.
• (wip) Benchmarks.

v2.0.0-beta.1

The main breaking change is that now top(N) does NOT sort the output. It should not be part of the spec for a priority queue, the output should be the top N elements. It will be partially ordered by definition, that is all.