Agena v. 2.27.7 (15/5/2022, Alexander Walz) |
Readme/What's new |
2.27.7, May 15, 2022
- `purge` can now delete a consecutive range of elements from a table array, sequence or register, moving excess elements down to close the space.
- The new function `skew.reorder` balances a skew heap.
- The `heaps` package now features binary heaps, providing almost the same functionality as already available for skew heaps while being at least
25 times faster. Examples:
> import heaps
> h := binary.new();
> binary.include(h, 3, 'Florida')
> binary.include(h, 0, 'Alabama')
> binary.include(h, 1, 'Texas')
> binary.include(h, 2, 'Louisiana')
> binary.include(h, 4, 'Mississippi')
> binary.include(h, 10, 'Georgia')
> binary.include(h, 7, 'Virginia')
> binary.indices(h):
[0, 1, 2, 3, 4, 7, 10]
> binary.entries(h):
[Alabama, Texas, Louisiana, Florida, Mississippi, Virginia, Georgia]
> f := binary.iterate(h);
> f():
0 Alabama
> f():
1 Texas
> f():
2 Louisiana
(and so forth)
> binary.remove(h):
0 Alabama
> binary.remove(h):
1 Texas
> binary.remove(h):
2 Louisiana
(and so forth)
- The scheme files have been corrected and updated.
- Extended the test cases.
- The Primer and Reference has been improved. |
Comments
Alexander Walz
Sat, 13/05/2017 - 20:06
Permalink
Hello,
Add new comment