| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
SetMaybe
Contents
Description
Sets of Maybe a values.
Synopsis
- data SetMaybe t = SetMaybe {
- _smSet :: Set t
- _smNothing :: Bool
- smNothing :: forall t f. Functor f => (Bool -> f Bool) -> SetMaybe t -> f (SetMaybe t)
- smSet :: forall t1 t2 f. Functor f => (Set t1 -> f (Set t2)) -> SetMaybe t1 -> f (SetMaybe t2)
- empty :: SetMaybe t
- setOfNothing :: SetMaybe t
- singleton :: Maybe t -> SetMaybe t
- union :: Ord t => SetMaybe t -> SetMaybe t -> SetMaybe t
- isSubsetOf :: Ord t => SetMaybe t -> SetMaybe t -> Bool
- member :: Ord t => Maybe t -> SetMaybe t -> Bool
Documentation
A set of Maybe t is stored as a set of t
plus a flag wether Nothing is in the set.
Constructors
| SetMaybe | |
Fields
| |
Instances
| DebugPrint t => DebugPrint (SetMaybe t) Source # | |
| (Read t, Ord t) => Read (SetMaybe t) Source # | |
| Show t => Show (SetMaybe t) Source # | |
| Eq t => Eq (SetMaybe t) Source # | |
| Ord t => Ord (SetMaybe t) Source # | |
smSet :: forall t1 t2 f. Functor f => (Set t1 -> f (Set t2)) -> SetMaybe t1 -> f (SetMaybe t2) Source #
setOfNothing :: SetMaybe t Source #