loopingoptimism

5 ms·

1. 1.▲
   by loopingoptimism 9y ago

   In principle both HAMT and CHAMP compress sparse associative arrays by construction. However, the bitmap encoding of CHAMP results in a better compression for map data structures, enabled by permuting the elements that are stored in the nod
2. 2.▲
   by loopingoptimism 9y ago

   I do not know well the current state of HAMT data structures in Haskell, but there is a related thread at the Haskell subreddit that you might be interested in: https://www.reddit.com/r/haskell/comments/6tmbju
3. 3.▲
   by loopingoptimism 9y ago

   No, the linked work describes eager data structures that use techniques such as path-copying for persistence. No laziness required.
4. 4.▲
   by loopingoptimism 9y ago

   Why should that be the case? Can you point to sources where you read that? In my experience, CHAMP clearly has advantages over HAMT in this scenario. To answer your questions about using vectors of coordinates of keys: it depends on the des
5. 5.▲
   by loopingoptimism 9y ago

   The talk at Clojure West wasn't given by myself, but I found it worthwhile linking. Rather it was given by someone who independently picked up my research results and replicated them in the context of ClojureScript ( https://
6. 6.▲
   by loopingoptimism 9y ago

   Adoption (especially in industry) takes time, but there's definitely interest in the Clojure and Scala communities. The CHAMP data structure was already picked up by the ClojureScript community ( https://github.com/bendy