Guile SRFI-146 (Mappings)
Implementation of SRFI 146 (Mappings) for Guile.
SRFI 146 defines datastructures that implement mappings (finite sets of associations consiting of a key and a value). Two types of mappings are defined: One using a comparator to define an order on the keys and another using a hash function on the keys. The datastructures and procedures are by default purely-functional.
This package re-uses the SRFI sample implementation that is based on red-black trees and Hash Array Mapped Trie (HAMT).
Contributions with bug reports and fixes, documentation, optimizations for Guile, improved tests, etc. are very welcome. Please send them to pukkamustard [at] posteo [dot] net.