charset-0.3.9: Fast unicode character sets based on complemented PATRICIA tries
Copyright(c) Edward Kmett 2010-2011
LicenseBSD3
Maintainerekmett@gmail.com
Stabilityexperimental
Portabilityportable
Safe HaskellTrustworthy
LanguageHaskell2010

Data.CharSet

Description

A CharSet is an efficient representation of a set of Char values designed for fast membership tests.

As an example build isAlpha will create a set of alphabetic characters. We can then use member on the generated set to efficiently test if a given Char represents an alphabetic character.

Designed to be imported qualified:

import Data.CharSet (CharSet)
import qualified Data.CharSet as CharSet
Synopsis

Set type

data CharSet Source #

Stored as a (possibly negated) IntSet and a fast set used for the head byte.

The set of valid (possibly negated) head bytes is stored unboxed as a 32-byte bytestring-based lookup table.

Constructors

CharSet !Bool !ByteSet !IntSet 

Instances

Instances details
Bounded CharSet Source # 
Instance details

Defined in Data.CharSet

Eq CharSet Source # 
Instance details

Defined in Data.CharSet

Data CharSet Source # 
Instance details

Defined in Data.CharSet

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CharSet -> c CharSet Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CharSet Source #

toConstr :: CharSet -> Constr Source #

dataTypeOf :: CharSet -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CharSet) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CharSet) Source #

gmapT :: (forall b. Data b => b -> b) -> CharSet -> CharSet Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CharSet -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CharSet -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> CharSet -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> CharSet -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CharSet -> m CharSet Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CharSet -> m CharSet Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CharSet -> m CharSet Source #

Ord CharSet Source # 
Instance details

Defined in Data.CharSet

Read CharSet Source # 
Instance details

Defined in Data.CharSet

Show CharSet Source # 
Instance details

Defined in Data.CharSet

IsString CharSet Source #
= CharSet.fromList
Instance details

Defined in Data.CharSet

Semigroup CharSet Source # 
Instance details

Defined in Data.CharSet

Monoid CharSet Source # 
Instance details

Defined in Data.CharSet

Operators

Query

null :: CharSet -> Bool Source #

O(n) worst case

size :: CharSet -> Int Source #

O(n)

Construction

build :: (Char -> Bool) -> CharSet Source #

Applies a predicate across the whole range of possible character values to create a set of only those characters which satisfy the predicate.

As an example build isAlpha will generate a CharSet of all alphabetic characters.

Combine

Filter

Map

Fold

fold :: (Char -> b -> b) -> b -> CharSet -> b Source #

Conversion

List

Ordered list

IntMaps

Array