dlist
Difference lists in Haskell (by spl)
vector-odd
By transportengineering
| dlist | vector-odd | |
|---|---|---|
| 2 | 1 | |
| 64 | - | |
| - | - | |
| 5.6 | - | |
| 2 months ago | - | |
| Haskell | ||
| BSD 3-clause "New" or "Revised" License | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
dlist
Posts with mentions or reviews of dlist.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-22.
-
People must see haskell-perf/sequences adding DList, Acc & snoc into comparison
Here, I just made you a ticket.
vector-odd
Posts with mentions or reviews of vector-odd.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-22.
-
People must see haskell-perf/sequences adding DList, Acc & snoc into comparison
I had a play around a while ago with a very similar idea, using a fold over a slice as the container https://gitlab.com/transportengineering/vector-odd/-/blob/master/src/Data/Vector/Odd/Slice.hs . The idea was it would keep track of the number of indirections and re-optimise (i.e. write all the elements to a vector, and then turn the CPS function into a fold over that) automatically. It would probably work better if it were actually integrated in the GC or something so it would transparently "optimise". There were some basic benchmarks that I can't remember the results for :).
What are some alternatives?
When comparing dlist and vector-odd you can also consider the following projects:
dlist-nonempty - Non-empty difference lists
sequences - Benchmarks for sequence data structures: lists, vectors, etc.
unpacked-containers - Unpacked containers using backpack
dlist-instances - orphan instances for dlist
data-r-tree - Haskell implementatio of R-Trees
data-clist - A purely functional ring data structure for Haskell.
Flood-Fill-Diagrams - A Haskell based implementation and visualization of a scanline stack based flood fill algorithm.
miso - :ramen: A tasty Haskell front-end framework