Hi Ambrose,
This looks very interesting, and I look forward to investigating it further
when I have a moment.
Once comment on the defrecords generated at runtime based on small keysets
- I'd be very careful with this sort of optimisation, and it needs much
more than micro-benchmarks to establish
Looks good stuff.
Would be very nice to port to cljs.
Then you could have a very compelling demo in the browser.
On Tuesday, 6 December 2016 23:32:29 UTC+2, Ambrose Bonnaire-Sergeant wrote:
>
> Link: https://github.com/frenchy64/optimized-kw-maps
>
> On Tue, Dec 6, 2016 at 4:16 PM, Ambrose Bonnair
Link: https://github.com/frenchy64/optimized-kw-maps
On Tue, Dec 6, 2016 at 4:16 PM, Ambrose Bonnaire-Sergeant <
abonnaireserge...@gmail.com> wrote:
> Hi,
>
> I've been having a ton of fun this semester learning about
> Hash Array Mapped Tries (like PersistentHashMap).
>
> Link
>
> I have written
The "Link" doesn't seem to be working for me (it isn't actually a
link). Is this some sort of gateway tested - if you aren't clever
enough to figure it out you don't deserve to get in? ;-).
On 6 December 2016 at 21:16, Ambrose Bonnaire-Sergeant
wrote:
> Hi,
>
> I've been having a ton of fun this
Hi,
I've been having a ton of fun this semester learning about
Hash Array Mapped Tries (like PersistentHashMap).
Link
I have written a visual tutorial for HAMT's, as well
as a reference implementation in Clojure that supports
trie visualisations with Rhizome.
There's also a little prototype+wri