-
these performance improvements are described in the Brodal/Okasaki paper
-
You can find a fairly short Koka implementation of heapsort based on Binomial Heaps (as discussed by Okasaki) here: https://gist.github.com/anfelor/f6d6e437d9d47f77534cace1904bbe5e (I couldn't reduce …
-
This issue is collecting my understanding of the design of Lazy under Multicore.
## Sequential Lazy
With Sequential OCaml, trying to force a value that is currently being forced raises Undefined…
-
We briefly discussed this during 6.0 / C# 10 but ultimately punted it since the ask came in too late. We've had issues where user-written source generators can no longer observe the output of source g…
-
Currently,
```haskell
instance Semigroup (Endo a) where
...
stimes = stimesMonoid
```
`stimesMonoid` produces a balanced tree. I guess this enhances sharing within the resulting func…
-
Consider the following implementation of weight biased leftist heaps as in section 3.1 of Okasaki (though the details aren't important):
```
import std/num/int32
alias elem = int
public type h…
-
The binary tree becomes unbalanced after a number of `insert` and `remove_top` operations. Indeed, `insert` is the standard algorithm for heaps represented as Braun trees, so when given a Braun tree …
-
#558 made me notice that while the implementation of `inits` is overall optimal ( $O(n^2)$ ), it has an awkward property that evaluating the ith text in the result takes $O(i^2)$ time. Ideally this wo…
-
I'm not sure this is expected (are you not allowed to enqueue the same item twice?)
Minimal example:
```elm
empty |> enq 0 |> enq 0 |> size
--> 3
```
Trying it out in `elm-repl`:
```elm
…
-
(Sorry, newbie here.)
Trying to add `Integer`s I am getting error:
```
No instance for (Additive Integer) arising from a use of ‘+’
```
Is there a deeper reason for this or is it just not impleme…