vector-odd
By transportengineering
sequences
Benchmarks for sequence data structures: lists, vectors, etc. (by haskell-perf)
vector-odd | sequences | |
---|---|---|
1 | 2 | |
- | 86 | |
- | - | |
- | 0.0 | |
- | over 2 years ago | |
Haskell | ||
- | - |
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.
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 :).
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 vector-odd and sequences you can also consider the following projects:
dlist - Difference lists in Haskell