Regarding data structures, there are some additions that should be made to the
standard clojure versions. There would be no reason to implement a regular
leftwise-dense persistent vector when there is something like RRB-trees
available, which provide no slowdown compared to the leftwise dense
On Sat, Mar 4, 2023, at 5:28 AM, Linus Björnstam wrote:
> Andy already has a fast implementation of functional hashtables
> ("fash") which are of a particular high quality. They do not support
> element removal which should be trivial to add. Other than that it has
> all the basic
Hi Dave,
"Thompson, David" writes:
[..]
> Your Guile port of (srfi srfi-146 hash) looks really nice! A
> functional hash is the most important data structure for our needs at
> Spritely. Do you know if it's thread-safe (unlike vhashes)? Andy's
> fash implementation uses atomic boxes, for
