> My lazy-sequence implementation was exactly following SICP: while
> theoretically pure and good, might not be the best in practice, so I believe
> your implementation can be much better.
>
> Major performance boost in stateful implementation compared to lazy-sequence
> with delay and force co
Alexis King writes:
> > How does this compare to https://github.com/ijp/pfds/ or the work
> > described in http://www.ccs.neu.edu/racket/pubs/sfp10-kth.pdf ?
>
> In the case of the former, that targets R6RS, while this is
> intended to be a more “native” Racket solution. The latter is in
>
> How does this compare to https://github.com/ijp/pfds/ or the work described
> in http://www.ccs.neu.edu/racket/pubs/sfp10-kth.pdf ?
In the case of the former, that targets R6RS, while this is intended to be a
more “native” Racket solution. The latter is in Typed Racket, while this is
currentl
On 28/05/2015 09:59, Alexis King wrote:
As a followup to my last thread regarding my generic collections library, I
have now created a package that uses it to define an entirely new data
structure. I've implemented Clojure's 32-way bitmapped tries to create a
persistent vector implementation.
As a followup to my last thread regarding my generic collections library, I
have now created a package that uses it to define an entirely new data
structure. I've implemented Clojure's 32-way bitmapped tries to create a
persistent vector implementation. If you're interested in trying it out, it'
5 matches
Mail list logo
