-
`Data.Sequence` is only strict in its length and not its values - analogous to how `Data.Map.Lazy` is strict in its keys but not its values.
This is causing a space leak in my program, and ghc-heap…
-
Idiomatic Haskell very often gets around using an explicit queue by partially imitating one with a lazy list. In a linear context, this doesn't always work out so well. In particular, suppose we have …
-
We don't actually *need* a lazy spine. An alternative representation for a queue, for example:
```haskell
data N10 n a = N10 !(Array n a) !()
data N11 n a = N11 !(Array n a) !() !(Array n a)
-- …
-
Just found this repo from the mention on https://github.com/fsprojects/FSharp.Data.Adaptive/issues/17. I recently had some performance issues with F#'s built in map and so wrote my own implementation …
-
In some cases, a pure amortized data structure may only be efficient when used in a single threaded fashion. This suggests a linear interface
```haskell
-- Pairing heaps
data PQ a = ...
insert…
-
Currently, lazy types in Idris aren't memoized. That is, if we pass a value `x : Lazy a` to several different functions, and they all depend on the forced/computed value of type `a`, they will each t…
-
This is just an idea to improve `instance Ord IntSet` (related to #470 ). It's quite a pervasive change, and it'd help only in a special case - that may occur frequently, though.
When all elements …
-
I created a first set of benchmarks that on can rune with `sh benchmarks.sh`. It seems that bfn_3q is linear while bfn_2l (although quicker) is not so linear. By linear, I mean in the number of nodes.…
-
I'm working on an application which memory limits about 500MB(FLAGS_tcmalloc_heap_limit_mb). It just malloc in two size, and free randomly.
Consider the following scenario:
1. #define TCMALLOC_LARGE_…
snaix updated
8 years ago
-
To make consecutive (unboxed) `snoc` and (future) `unsnoc` operations faster, we might consider more compact representations of the tails. In particular, we can "chunk" them if we like. Something like…