charset-0.3.9: Fast unicode character sets based on complemented PATRICIA tries
CopyrightEdward Kmett 2011
Bryan O'Sullivan 2008
LicenseBSD3
Maintainerekmett@gmail.com
Stabilityexperimental
Portabilitynon-portable (BangPatterns, MagicHash)
Safe HaskellTrustworthy
LanguageHaskell2010

Data.CharSet.ByteSet

Description

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.

Synopsis

Data type

newtype ByteSet Source #

Constructors

ByteSet ByteString 

Instances

Instances details
Eq ByteSet Source # 
Instance details

Defined in Data.CharSet.ByteSet

Methods

(==) :: ByteSet -> ByteSet -> Bool #

(/=) :: ByteSet -> ByteSet -> Bool #

Ord ByteSet Source # 
Instance details

Defined in Data.CharSet.ByteSet

Show ByteSet Source # 
Instance details

Defined in Data.CharSet.ByteSet

Construction

Lookup

member :: Word8 -> ByteSet -> Bool Source #

Check the set for membership.