Regex.Internal.CharSet

This is an internal module. You probably don't need to import this. Import Data.CharSet instead.

WARNING

Definitions in this module allow violating invariants that would otherwise be guaranteed by non-internal modules. Use at your own risk!

Documentation

newtype CharSet

A set of Chars.

The members are stored as contiguous ranges of Chars. This is efficient when the members form contiguous ranges since many Chars can be represented with just one range.

Constructors

CharSet

Fields

• unCharSet :: IntMap Char

Instances

Monoid CharSet

mempty = empty

Defined in Regex.Internal.CharSet

Methods

mempty :: CharSet

mappend :: CharSet -> CharSet -> CharSet

mconcat :: [CharSet] -> CharSet

Semigroup CharSet

(<>) = union

Defined in Regex.Internal.CharSet

Methods

(<>) :: CharSet -> CharSet -> CharSet

sconcat :: NonEmpty CharSet -> CharSet

stimes :: Integral b => b -> CharSet -> CharSet

IsString CharSet

fromString = fromList

Defined in Regex.Internal.CharSet

Methods

fromString :: String -> CharSet

Show CharSet

Defined in Regex.Internal.CharSet

Methods

showsPrec :: Int -> CharSet -> ShowS

show :: CharSet -> String

showList :: [CharSet] -> ShowS

Eq CharSet

Defined in Regex.Internal.CharSet

Methods

(==) :: CharSet -> CharSet -> Bool

(/=) :: CharSet -> CharSet -> Bool

empty :: CharSet

The empty set.

singleton :: Char -> CharSet

\(O(1)\). A set of one Char.

fromRange :: (Char, Char) -> CharSet

\(O(1)\). A Char range (inclusive).

fromList :: [Char] -> CharSet

\(O(s \min(s,C))\). Create a set from Chars in a list.

fromRanges :: [(Char, Char)] -> CharSet

\(O(n \min(n,C))\). Create a set from the given Char ranges (inclusive).

insert :: Char -> CharSet -> CharSet

\(O(\min(n,C))\). Insert a Char into a set.

insertRange :: (Char, Char) -> CharSet -> CharSet

\(O(\min(n,C))\). Insert all Chars in a range (inclusive) into a set.

delete :: Char -> CharSet -> CharSet

\(O(\min(n,C))\). Delete a Char from a set.

deleteRange :: (Char, Char) -> CharSet -> CharSet

\(O(\min(n,C))\). Delete a Char range (inclusive) from a set.

map :: (Char -> Char) -> CharSet -> CharSet

\(O(s \min(s,C))\). Map a function over all Chars in a set.

not :: CharSet -> CharSet

\(O(n)\). The complement of a set.

union :: CharSet -> CharSet -> CharSet

\(O(m \min(n+m,C))\). The union of two sets.

Prefer strict left-associative unions, since this is a strict structure and the runtime is linear in the size of the second argument.

difference :: CharSet -> CharSet -> CharSet

\(O(m \min(n+m,C))\). The difference of two sets.

intersection :: CharSet -> CharSet -> CharSet

\(O(n + m \min(n+m,C))\). The intersection of two sets.

member :: Char -> CharSet -> Bool

\(O(\min(n,C))\). Whether a Char is in a set.

notMember :: Char -> CharSet -> Bool

\(O(\min(n,C))\). Whether a Char is not in a set.

elems :: CharSet -> [Char]

\(O(s)\). The Chars in a set.

ranges :: CharSet -> [(Char, Char)]

\(O(n)\). The contiguous ranges of Chars in a set.

valid :: CharSet -> Bool

Is the internal structure of the set valid?