Releases: shawnsmithdev/wbtree
Releases · shawnsmithdev/wbtree
v0.0.4 - Remove unused code in 'top'
ca562cb
This commit was signed with the committer’s verified signature.
The key has expired.
shawnsmithdev
Shawn Smith
Remove dead code in 'top' foreach func
v0.0.3 - Add Greatest/Least methods, optimize memory
Add ReverseForEach, Least & Greatest methods * Refactor to avoid excessive slice allocation and resizing in Keys() * Add several effecient getters for partial tree results (TODO testing): * Greatest (nodes) * GreatestKeys * GreatestValues * Least (nodes) * LeastKeys * LeastValues * Add ReverseForEach for custom iteration in reverse dfs order * Update README
v0.0.2 - Add ForEach
989212a
This commit was signed with the committer’s verified signature.
The key has expired.
shawnsmithdev
Shawn Smith
Add ForEach
v0.0.1 - initial commit
3bac7ab
This commit was signed with the committer’s verified signature.
The key has expired.
shawnsmithdev
Shawn Smith
It is a weight balanced binary search tree. What more could you want?