Do syntax-properties use immutable hash tables? If so, turnstile languages might be a good source of benchmarks.
-- Sent from my phoneamajig > On Aug 28, 2019, at 17:13, Jon Zeppieri <[email protected]> wrote: > >> On Sun, Aug 25, 2019 at 8:51 PM Jon Zeppieri <[email protected]> wrote: >> >> I'm still looking for good examples of Racket code that heavily >> exercise immutable hashes and/or sets. > > I have two more benchmarks: > > 1. expand: > racket bootstrap-run.rkt -c <tmp dir> -l racket/base > > 2. redex (from Robby): > > #lang racket > (require redex/examples/poly-stlc > redex/reduction-semantics) > > (random-seed <seed>) > > (define (generate) > ((match-lambda [`(typeof • ,M ,τ) M] > [#f #f]) > (generate-term poly-stlc #:satisfying (typeof • M τ) 3))) > > (time > (void > (for/list ([x (in-range 100)]) > (generate)))) > > === > > But neither shows a significant advantage for either hash > implementation. Graph is attached. > > -- > You received this message because you are subscribed to the Google Groups > "Racket Developers" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To view this discussion on the web visit > https://groups.google.com/d/msgid/racket-dev/CAKfDxxyZ9FFfTiOkmf5VgLsCZAzmw3-CivgrsqA%2B52DdpEZzSg%40mail.gmail.com. > <expand.png> -- You received this message because you are subscribed to the Google Groups "Racket Developers" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-dev/3A1A232B-1C91-47BA-9B77-0B674C1D1337%40williamjbowman.com.
