vector-sorting-benchmarks
I want to beat std::sort with Haskell. (by sergv)
countwords
Playing with counting word frequencies (and performance) in various languages. (by unhammer)
Our great sponsors
| vector-sorting-benchmarks | countwords | |
|---|---|---|
| 1 | 2 | |
| 1 | 4 | |
| - | - | |
| 10.0 | 10.0 | |
| over 1 year ago | over 1 year ago | |
| C | Rust | |
| - | MIT 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.
vector-sorting-benchmarks
Posts with mentions or reviews of vector-sorting-benchmarks.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-11-13.
-
Limits of possible performance improvements of Haskell/GHC code?
I recently tried to implement quicksort on vectors in Haskell aiming to make it fast enough to be comparable to C++. If you're curious you can check out https://github.com/sergv/vector-sorting-benchmarks. After some time and research on what C++ actually does I reimplemented it in Haskell and the result managed to stay within reasonable % of C++. E.g. sorting 1000 arrays of 20000 8-byte integers on my machine takes 523ms in C++ (with ffi overhead) and 545ms in fastest Haskell algorithm with closest others taking around 650ms.
countwords
Posts with mentions or reviews of countwords.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-05.
-
High-Performance Haskell?
Wow, thanks for the code review! Noted – I'll try them out when I have some time
-
Limits of possible performance improvements of Haskell/GHC code?
In addition to what's mentioned, the "default" libraries people use are often not the best-performing ones. E.g. Data.Vector.Hashtables is often much faster than Data.HashMap.Strict (which again is typically faster than Data.Map). And we find performance papercuts in common libraries that may simply be due to not enough people optimising for speed.
What are some alternatives?
When comparing vector-sorting-benchmarks and countwords you can also consider the following projects:
text - Haskell library for space- and time-efficient operations over Unicode text.
linear-builder - Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.