| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
Autolib.Set
Contents
Synopsis
- data Set a
- addToSet :: Ord a => Set a -> a -> Set a
- cardinality :: Set a -> Int
- cross :: (Ord a, Ord b) => Set a -> Set b -> Set (a, b)
- delFromSet :: Ord a => Set a -> a -> Set a
- elementOf :: Ord a => a -> Set a -> Bool
- emptySet :: Set a
- intersect :: Ord a => Set a -> Set a -> Set a
- isEmptySet :: Set a -> Bool
- minusSet :: Ord a => Set a -> Set a -> Set a
- mkSet :: Ord a => [a] -> Set a
- nonempty :: Ord a => Set a -> Bool
- setToList :: Set a -> [a]
- sfilter :: Ord a => (a -> Bool) -> Set a -> Set a
- smap :: (Ord a, Ord b) => (a -> b) -> Set a -> Set b
- subseteq :: Ord a => Set a -> Set a -> Bool
- subsets :: Ord a => Set a -> [Set a]
- teilfolgen :: Int -> [a] -> [[a]]
- teilmengen :: Ord a => Int -> Set a -> [Set a]
- union :: Ord a => Set a -> Set a -> Set a
- unionManySets :: (Foldable f, Ord a) => f (Set a) -> Set a
- unitSet :: a -> Set a
- module Autolib.Xml
Documentation
A set of values a.
Instances
| Eq1 Set # | Since: containers-0.5.9 |
| Ord1 Set # | Since: containers-0.5.9 |
Defined in Data.Set.Internal | |
| Show1 Set # | Since: containers-0.5.9 |
| Foldable Set # | Folds in order of increasing key. |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldMap' :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
| Hashable1 Set # | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| Lift a => Lift (Set a :: Type) # | Since: containers-0.6.6 |
| (Ord a, Reader a) => Reader (Set a) Source # | |
Defined in Autolib.Set | |
| Nice [a] => Nice (Set a) Source # | |
| ToDoc [a] => ToDoc (Set a) Source # | |
| NFData a => NFData (Set a) # | |
Defined in Data.Set.Internal | |
| Ord a => Monoid (Set a) # | |
| Ord a => Semigroup (Set a) # | Since: containers-0.5.7 |
| (Data a, Ord a) => Data (Set a) # | |
Defined in Data.Set.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Set a -> c (Set a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Set a) # dataTypeOf :: Set a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Set a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Set a)) # gmapT :: (forall b. Data b => b -> b) -> Set a -> Set a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQ :: (forall d. Data d => d -> u) -> Set a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Set a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # | |
| Ord a => IsList (Set a) # | Since: containers-0.5.6.2 |
| (Read a, Ord a) => Read (Set a) # | |
| Show a => Show (Set a) # | |
| Eq a => Eq (Set a) # | |
| Ord a => Ord (Set a) # | |
| Hashable v => Hashable (Set v) # | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| Ord a => Container (Set a) [a] Source # | |
| type Item (Set a) # | |
Defined in Data.Set.Internal | |
cardinality :: Set a -> Int Source #
isEmptySet :: Set a -> Bool Source #
teilfolgen :: Int -> [a] -> [[a]] Source #
module Autolib.Xml