Copyright | Edward Kmett 2011 Bryan O'Sullivan 2008 |
---|---|
License | BSD3 |
Maintainer | ekmett@gmail.com |
Stability | experimental |
Portability | non-portable (BangPatterns, MagicHash) |
Safe Haskell | Trustworthy |
Language | Haskell2010 |
Fast set membership tests for byte values. The set representation is unboxed for efficiency and uses one bit per byte to represent the presence or absence of a byte in the set.
This is a fairly minimal API. You probably want to use CharSet.