https://github.com/iraikov/chicken-binary-heap
Binary heap implementation in Chicken Scheme
https://github.com/iraikov/chicken-binary-heap
Last synced: 4 months ago
JSON representation
Binary heap implementation in Chicken Scheme
- Host: GitHub
- URL: https://github.com/iraikov/chicken-binary-heap
- Owner: iraikov
- License: gpl-3.0
- Created: 2016-04-26T19:59:52.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2024-11-29T16:58:13.000Z (11 months ago)
- Last Synced: 2025-01-30T16:27:53.708Z (8 months ago)
- Language: Scheme
- Size: 19.5 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# binary-heap
Binary heap implementation in Chicken Scheme.
## Documentation
The `binary-heap` library is based on the Ocaml heap implementation by
Jean-Christophe Filliatre.
Heaps are encoded as binary trees that have the heap property, namely
the value of any node is greater or equal than the nodes in its left
and right subtrees.
### Constructors
A binary-heap object is created by procedure `make-binary-heap`:
make-binary-heap:: KEY-COMPARE-PROC -> HEAP
where KEY-COMPARE-PROC is a user-supplied function that takes two keys
and returns a negative, positive, or zero number depending on how the
first key compares to the second.
### Predicates
heap-empty? :: HEAP -> BOOL
returns #t if the heap is empty, #f otherwise
### Accessors
heap-get-max :: HEAP -> ELEMENT
returns a (key . value) pair for an association in the heap with the
largest key. If the heap is empty, an error is signalled.
heap-size :: HEAP -> INT
returns the size (the number of associations) in the heap
### Transformers
heap-insert :: KEY * VALUE * HEAP -> HEAP
returns a new heap object that contains the given association, while
the original heap object is unmodified.
heap-delete-max :: HEAP -> HEAP
removes the max key and the corresponding association from the
heap. Returns a (key . value) pair of the removed association. If the
heap is empty, an error is signalled.
### Combinators
heap-for-each :: PROC * HEAP -> VOID
applies the given procedure PROC to each (key . value) association of
the heap, from the one with the smallest key all the way to the one
with the max key, in an ascending order of keys.
heap-fold :: PROC * INIT * HEAP -> RESULT
given the associations in the heap ordered by the descending order of
keys: `(key-n . value-n) ... (key-2 . value-2) (key-1 . value-1)`
the procedure returns the result of the successive function
applications `(PROC value-1 (PROC value-2 ... (PROC value-n
INITIAL)`.
## Examples
## Version history
- 2.0 : Removed message-based interface in favor of a simple procedural interface
- 1.2 : Test script updated to return proper exit code
- 1.1 : Documentation converted to wiki format
- 1.0 : Initial release
## License
>
> Copyright 2009-2016 Ivan Raikov
>
> This program is free software: you can redistribute it and/or modify
> it under the terms of the GNU General Public License as published by
> the Free Software Foundation, either version 3 of the License, or (at
> your option) any later version.
>
> This program is distributed in the hope that it will be useful, but
> WITHOUT ANY WARRANTY; without even the implied warranty of
> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
> General Public License for more details.
>
> A full copy of the GPL license can be found at
> .