Lower Impedance with Better Data Structures Chapter

haskellfoundation / hs-opt-handbook.github.io

The Haskell Optimization Handbook

https://haskell.foundation/hs-opt-handbook.github.io/

Creative Commons Attribution 4.0 International

170 stars 12 forks source link

Lower Impedance with Better Data Structures Chapter #55

Open doyougnu opened 2 years ago

doyougnu commented 2 years ago

This is domain specific, but basically choose the right data structures for your task. This is probably one of the lightest weight, simplest chapters. Perhaps it belongs to a General Guidelines chapter.

doyougnu commented 2 years ago

some obvious examples are:

don't use a list like a map
use unordered-containers if you need to index by any kind of complicated object and are using Data.Map
consider the behavior of utility functions like foldMap or Data.IntMap.compose. For example, if you are folding a lot then picking a performent folding structure is better than a worse performing one.

doyougnu commented 1 year ago

using a DList and avoiding WriterT: https://github.com/haskell/haddock/pull/1543 https://www.joachim-breitner.de/blog/761-Faster_Winter_3__Difference_Lists