3 ms·

I implemented Okasaki's persistent queue in Scheme recently using SRFI-41 streams and it was a lot of fun. Now, I need to grok things like finger trees so I ca

I implemented Okasaki's persistent queue in Scheme recently using SRFI-41 streams and it was a lot of fun. Now, I need to grok things like finger trees so I can understand persistent vectors and hash tables.

tibbe 11y ago
Look at hash array mapped tries, which is what most functional languages use to implement hashmaps.