dlist
Difference lists in Haskell (by spl)
sequences
Benchmarks for sequence data structures: lists, vectors, etc. (by haskell-perf)
| dlist | sequences | |
|---|---|---|
| 2 | 2 | |
| 64 | 86 | |
| - | - | |
| 5.6 | 0.0 | |
| 2 months ago | over 2 years ago | |
| Haskell | 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.
sequences
Posts with mentions or reviews of sequences.
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
As !! is used very rarely (& in lot of cases algorithm can be re-thought to other way). Comparing to cons,snoc,<>, which are used more frequently then fold*,traverse - which are used more frequently than !! - I agree that the lack of built-in !! is not hat big of a deal for me, in the end I can add indexDList = fromList $ (toList x) !! i into Utils if I ever need one (because I would still save a lot of computations on cons,snoc,<> phases & would wait on https://github.com/haskell-perf/sequences/issues/26 results.
What are some alternatives?
When comparing dlist and sequences you can also consider the following projects:
dlist-nonempty - Non-empty difference lists
vector-odd
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