Re: [racket-users] Seeking good benchmark code for immutable hash and hash set usage

(sorry for the self-followup; the unifier uses immutable hashes; grep suggests the other hashes that get used a lot are mutable hashes) On Thu, Aug 22, 2019 at 9:33 AM Robby Findler wrote: > > It looks like the pattern unifier uses hashes. I'm not sure if it they > would end up being good benchma

Re: [racket-users] Seeking good benchmark code for immutable hash and hash set usage

It looks like the pattern unifier uses hashes. I'm not sure if it they would end up being good benchmarks (probably best to try to instrument the hashes to see if they actually get used a lot or not) but there are redex benchmarks that measure how long it takes to find specific bugs and one of the

Re: [racket-users] Seeking good benchmark code for immutable hash and hash set usage

Thanks Ben! - Jon On Wed, Aug 21, 2019 at 10:04 PM Ben Greenman wrote: > > A few of the GTP benchmarks [1] use immutable hashes. Here's a link > with the ones that look most interesting: > > http://ccs.neu.edu/home/types/tmp/gtp-hash.tar.gz > > > And here's a small (untyped) program that uses cod

Re: [racket-users] Seeking good benchmark code for immutable hash and hash set usage

A few of the GTP benchmarks [1] use immutable hashes. Here's a link with the ones that look most interesting: http://ccs.neu.edu/home/types/tmp/gtp-hash.tar.gz And here's a small (untyped) program that uses code from the tr-pfds library to make a trie: http://ccs.neu.edu/home/types/tmp/trie.tar

[racket-users] Seeking good benchmark code for immutable hash and hash set usage

Hello Racketeers, I'm looking for examples of code that would make good benchmarks for evaluating the performance of immutable hashes. Some background: Immutable hashes used to be implemented in Racket as red-black trees. That was changed to hash array mapped tries (HAMTs) a number of years back.