[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Raising awareness about guile-pfds status

From: Linus Björnstam
Subject: Re: Raising awareness about guile-pfds status
Date: Mon, 15 Jul 2019 22:50:05 +0200
User-agent: Cyrus-JMAP/3.1.6-731-g19d3b16-fmstable-20190627v1

If it is HAMTs or persistent vectors you want, I have a git repo of Andy's Fash 
and Fector (functional hashmaps and functional.vectors). Fash lacks some parts 
to become a fast implementation of (srfi 146 hash), like being able to properly 
delete keys. I would implement it myself if I had any friggin idea what the 
code did, but to my limited mind it is quite impenetrable.

Other than that, I have a decently fast implementation of a pairing heap in my 
Nietzsche repo, which I found is generally slightly faster than the height 
balanced leftist tree in the PFDS library (and, should be said, about an order 
of magnitude slower than a regular binary heap using vectors).

The Fector library:

The fash library:

My pairing heap:

I don't know how using records compares to using cons pairs in guile, but there 
might be some speed gains. It also lacks a proper (as in fast) list->node 
because my 23 year old me didn't know how to implement it. It should be 

Fash and Fector are very fast. Andy likes speed :)

  Linus Björnstam

On Mon, 15 Jul 2019, at 18:06, Amirouche Boubekki wrote:
> The original maintainer of guile-pfds is sadly not responding to my mails.
> Right now, guile-pfds is the goto solution for functional data structures
> in Guile,
> and prolly other Scheme implementations.
> At least the hamt has a bug, see
> I think this is a very important package especially for guile that doesn't
> have a functional hashmaps.
> Anyone willing to take ownership of the project?
> ref:
> -- 
> Amirouche ~ amz3 ~

reply via email to

[Prev in Thread] Current Thread [Next in Thread]