Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- asSingleton :: Set a -> Maybe a
- difference1 :: Ord a => Set a -> Set a -> Maybe (Set a)
- intersects :: Ord a => Set a -> Set a -> Bool
- mapMaybe :: Ord b => (a -> Maybe b) -> Set a -> Set b
- symmetricDifference :: Ord a => Set a -> Set a -> Set a
- traverse :: (Applicative f, Ord b) => (a -> f b) -> Set a -> f (Set b)
- flatMap :: Ord b => (a -> Set b) -> Set a -> Set b
- filterM :: (Ord a, Monad m) => (a -> m Bool) -> Set a -> m (Set a)
- forMaybe :: (Ord b, Applicative f) => Set a -> (a -> f (Maybe b)) -> f (Set b)