Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Next release 2.5.0 #657

Merged
merged 3 commits into from
Mar 1, 2024
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
📝 docs(README.md): update changelog for version 2.5 with improvements…
… to limit

🚀 chore(package.json): bump version to 2.5.0 for latest changes and improvements
  • Loading branch information
ignlg committed Mar 1, 2024
commit 8e6896fd4ab6a14b03512d3da4846505a5f32a4f
6 changes: 6 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
@@ -43,6 +43,12 @@ heap vs array: push + top(50) of 100

## Changelog

### 2.5

- Improves the `limit` property to support negative, Infinity, and NaN values. They will be set as `0` and the heap will not be limited.
- Adds the `setLimit` method to set the limit of the heap. It returns `NaN` if the limit is negative, or NaN. This method is useful to check if the limit was set as expected.
- Improves tests and documentation.

### 2.4

- Adds the `indexOf` method to find the first index of an element in the heap.
2 changes: 1 addition & 1 deletion package.json
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
{
"name": "heap-js",
"version": "2.4.0",
"version": "2.5.0",
"description": "Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.",
"keywords": [
"heap",
Loading