regex-tdfa-1.3.2.5: Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base)

Safe Haskell | Safe-Inferred
Language | Haskell2010

Data.IntSet.EnumSet2

# Documentation

newtype EnumSet e Source #

Constructors

EnumSet |

Fields

- unEnumSet :: IntSet

#### Instances

Instances details

Monoid (EnumSet e) Source # |
Instance details Defined in Data.IntSet.EnumSet2 Methods mempty :: EnumSet e Source # mappend :: EnumSet e -> EnumSet e -> EnumSet e Source # mconcat :: [EnumSet e] -> EnumSet e Source #
Semigroup (EnumSet e) Source # |
Instance details Defined in Data.IntSet.EnumSet2 Methods (<>) :: EnumSet e -> EnumSet e -> EnumSet e Source # sconcat :: NonEmpty (EnumSet e) -> EnumSet e Source # stimes :: Integral b => b -> EnumSet e -> EnumSet e Source #
Read (EnumSet e) Source # |
Instance details Defined in Data.IntSet.EnumSet2 Methods readsPrec :: Int -> ReadS (EnumSet e) Source # readList :: ReadS [EnumSet e] Source # readPrec :: ReadPrec (EnumSet e) Source # readListPrec :: ReadPrec [EnumSet e] Source #
Show (EnumSet e) Source # |
Instance details Defined in Data.IntSet.EnumSet2 Methods showsPrec :: Int -> EnumSet e -> ShowS Source # show :: EnumSet e -> String Source # showList :: [EnumSet e] -> ShowS Source #
Eq (EnumSet e) Source # |
Instance details Defined in Data.IntSet.EnumSet2 Methods (==) :: EnumSet e -> EnumSet e -> Bool Source # (/=) :: EnumSet e -> EnumSet e -> Bool Source #
Ord (EnumSet e) Source # |

Instance details

Defined in Data.IntSet.EnumSet2

Methods

compare :: EnumSet e -> EnumSet e -> Ordering Source #

(<) :: EnumSet e -> EnumSet e -> Bool Source #

(<=) :: EnumSet e -> EnumSet e -> Bool Source #

(>) :: EnumSet e -> EnumSet e -> Bool Source #

(>=) :: EnumSet e -> EnumSet e -> Bool Source #

max :: EnumSet e -> EnumSet e -> EnumSet e Source #

min :: EnumSet e -> EnumSet e -> EnumSet e Source #

(\\) :: Enum e => EnumSet e -> EnumSet e -> EnumSet e Source #

null :: Enum e => EnumSet e -> Bool Source #

size :: Enum e => EnumSet e -> Int Source #

member :: Enum e => e -> EnumSet e -> Bool Source #

notMember :: Enum e => Int -> EnumSet e -> Bool Source #

isSubsetOf :: Enum e => EnumSet e -> EnumSet e -> Bool Source #

isProperSubsetOf :: Enum e => EnumSet e -> EnumSet e -> Bool Source #

empty :: Enum e => EnumSet e Source #

singleton :: Enum e => e -> EnumSet e Source #

insert :: Enum e => e -> EnumSet e -> EnumSet e Source #

delete :: Enum e => e -> EnumSet e -> EnumSet e Source #

union :: Enum e => EnumSet e -> EnumSet e -> EnumSet e Source #

unions :: Enum e => [EnumSet e] -> EnumSet e Source #

difference :: Enum e => EnumSet e -> EnumSet e -> EnumSet e Source #

intersection :: Enum e => EnumSet e -> EnumSet e -> EnumSet e Source #

filter :: Enum e => (e -> Bool) -> EnumSet e -> EnumSet e Source #

partition :: Enum e => (e -> Bool) -> EnumSet e -> (EnumSet e, EnumSet e) Source #

split :: Enum e => e -> EnumSet e -> (EnumSet e, EnumSet e) Source #

splitMember :: Enum e => e -> EnumSet e -> (EnumSet e, Bool, EnumSet e) Source #

map :: Enum e => (e -> e) -> EnumSet e -> EnumSet e Source #

fold :: Enum e => (e -> b -> b) -> b -> EnumSet e -> b Source #

elems :: Enum e => EnumSet e -> [e] Source #

toList :: Enum e => EnumSet e -> [e] Source #

fromList :: Enum e => [e] -> EnumSet e Source #

toAscList :: Enum e => EnumSet e -> [e] Source #

fromAscList :: Enum e => [e] -> EnumSet e Source #

fromDistinctAscList :: Enum e => [e] -> EnumSet e Source #

showTree :: Enum e => EnumSet e -> String Source #

showTreeWith :: Enum e => Bool -> Bool -> EnumSet e -> String Source #