Copyright | (c) OleksandrZhabenko 2021 |
---|---|
License | MIT |
Maintainer | olexandr543@yahoo.com |
Stability | Experimental |
Safe Haskell | None |
Language | Haskell2010 |
A library that can be used as a case ... of
constuction analogue for the Hashable keys.
For the large lists can be more time efficient than CaseBi.Arr.getBFst' analogue. For the lists of Int
s
the benchmarks does not show significant improvements, but it definitely uses more memory if linked statically.
If you plan to use it together with the former one, please, use qualified import to avoid names ambiguity.
Documentation
lookupLSized :: (Eq k, Hashable k, Traversable t) => Int -> [(k, v)] -> t k -> ST s (t (Maybe v)) Source #
getBFstLL' :: (Eq k, Hashable k) => b -> [(k, b)] -> [k] -> [b] Source #