witherable

Tech stack & purpose

Witherable is a Haskell library that provides `Filterable` and `Witherable` type classes for filtering data structures with effects. The project offers indexed variants, optic-style generalized withers, and additional instances beyond what the base `witherable-class` package provides. It's built on dependencies including base-orphans, containers, hashable, transformers, unordered-containers, and vector, allowing efficient single-pass traversals with filtering rather than the less efficient `fmap catMaybes . traverse f` pattern.

Community & reference links

• discord.gg/DG93Tgs

Languages

Contributors

• 
  Fumiaki Kinoshita106 commits · 284 followers
• 
  Oleg Grenrus36 commits · 602 followers
• 
  David Feuer8 commits · 124 followers
• 
  Simon Jakobi5 commits · 117 followers
• 
  endgame4 commits · 48 followers
• 
  George Wilson4 commits · 179 followers
• 
  Andrew Martin4 commits · 120 followers
• Koji Miyazato3 commits
• James Cranch2 commits
• 
  Christopher Chalmers2 commits · 29 followers
• 
  Alexandre Esteves1 commits · 62 followers
• 
  Ali Abrar1 commits · 76 followers
• u11 commits
• Jonathan S1 commits
• Jashweii1 commits
• 
  Torgeir Strand Henriksen1 commits · 2 followers
• RyanGlScott1 commits
• 
  Jan Hrcek1 commits · 80 followers
• Josef Vlach1 commits
• 
  Sjoerd Visscher1 commits · 288 followers
• 
  ˌbodʲɪˈɡrʲim1 commits · 227 followers
• Alex R1 commits
• 
  Ryan Scott1 commits · 267 followers
• 
  Owen Shepherd1 commits · 226 followers
• 
  Hexirp1 commits · 36 followers
• 
  quasicomputational1 commits · 13 followers
• Sophie Taylor1 commits
• 
  Elliot Cameron1 commits · 169 followers