-
Hi Andre.
I was thinking of learning RUST by implementing Okasaki's Purely Functional Data Structures and found this repository.
I am curious if you have done any performance comparison done against…
-
Red-black-trees, "index-able" lists etc. Red-black-trees can be based on Okasaki's definitions. Also see this paper: http://matt.might.net/papers/germane2014deletion.pdf
On general guidelines for c…
-
The reference manual [states](http://agda.readthedocs.io/en/v2.5.3/language/built-ins.html#strictness) that "`primForce e f` is compiled (by the GHC backend) to `let x = e in seq x (f x)`". However, t…
-
They pop up quite often and I would find comfort in having them in `containers` instead of a 'third-party package' like [dequeue](https://hackage.haskell.org/package/dequeue-0.1.12).
-
Currently, the bottleneck of RedPRL is the the telescope library. It needs a deque, which is implemented as a list now. There are many plausible approaches:
1. Deques as pairs of lists: constant am…
-
Hello,
thank you for open-sourcing your RedBlackTree algorithm.
I've created a Java implementation based on the book "Purely Functional Data Structures" by Chris Okasaki. While searching for the…
-
```
match Weak.get_copy bucket i with
| Some v when v.node = d ->
begin match Weak.get bucket i with
| Some v -> v
| None -> loop (i+1)
…
-
I was wondering, what is your take on mutability vs. immutability for Crystal? Do you think it would be sensible to default to immutable strings, arrays and maps?
-
Hi,
I'm playing with immer for a project at the minute, but i also need immutable maps. I'm considering porting either Clojure's HAMTs or the CHAMP variant. Did you have any plans in this direction…
-
The current implementation of `sample()` is:
```ts
function sample(f: (a: A, b: B) => C, sampler: Stream, s: Stream): Stream;
```
I'd like to suggest that `b` should be the first argument of `…