https://github.com/samuelschlesinger/haskell-performance

This is a grab-bag of haskell data structure and algorithm benchmarks.
https://github.com/samuelschlesinger/haskell-performance

Last synced: 20 days ago
JSON representation

This is a grab-bag of haskell data structure and algorithm benchmarks.

• Host: GitHub
• URL: https://github.com/samuelschlesinger/haskell-performance
• Owner: SamuelSchlesinger
• Created: 2020-10-17T20:54:53.000Z (about 4 years ago)
• Default Branch: main
• Last Pushed: 2020-10-18T22:26:34.000Z (about 4 years ago)
• Last Synced: 2024-10-27T19:10:57.760Z (2 months ago)
• Language: HTML
• Size: 1.63 MB
• Stars: 4
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md

Awesome Lists containing this project

README

        
# Miscellaneous Haskell Benchmarks

This is a repository to store various benchmarks of Haskell data structures

and algorithms. Generate the report by typing into your terminal:

```bash

$ sh generate-report.sh

```

Currently, we have strings vs text and strict maps vs hashmaps, as these

are the data structures I most often have to choose between. For almost

everything, text is faster than string, which was to be expected. On the

other hand, hashmaps have slower updates than maps but much faster lookups,

so what you choose there is dependent on the situation. Consuming the entirety

of a map via `foldl'` or `foldr` is also much faster for maps rather than

hashmaps, so if you're going to be doing a lot of that it makes sense to

keep things in a map.

The bench.html currently in this repository was generated with GHC 8.10.