Purely functional data structures for Guile
Purely functional data structures for Guile
This package provides purely functional data structures written in R6RS Scheme and compiled for Guile. It has been tested with Racket, Guile 2, Vicare Scheme and IronScheme. Right now it contains:
queues
deques
bbtrees
sets
dlists
priority search queues (PSQs)
finger trees
sequences
heaps
hash array mapped tries (HAMTs).
| Package | guile-pfds 0.3 (history) |
| Channel | guix |
| Definition | |
| Build status | view 🚧 |
| Home page | https://github.com/ijp/pfds |
| Source |