1. 8

  2. 1

    Apropos, is there anything like a performant (fast + memory efficient) FST library for Haskell for representing large maps? The ones I’ve found so far seem a bit too “academic”, compared to something like https://github.com/BurntSushi/fst (e.g. https://github.com/redelmann/nlp-haskell/blob/master/DFA.hs uses Data.Map for transitions, http://hackage.haskell.org/package/HaLeX-1.2.6/docs/src/Language-HaLex-Dfa.html#Dfa uses plain lists for the set of states …).