-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | See README for more info
--   
--   See README for more info
@package Set
@version 0.0.2.0

module Data.Set.Class
class Set set where {
    type family Elem set;
}
empty :: Set set => set
fold :: (Set set, Monoid (Elem set)) => set -> Elem set
foldMap :: (Set set, Monoid a) => (Elem set -> a) -> set -> a
foldr :: Set set => (Elem set -> a -> a) -> a -> set -> a
foldl :: Set set => (a -> Elem set -> a) -> a -> set -> a
toList :: Set set => set -> [Elem set]

-- | <i>Deprecated: use <a>size</a></i>
length :: Set set => set -> Int
size :: Set set => set -> Int
null :: Set set => set -> Bool
mapMaybe :: Set set => (Elem set -> Maybe (Elem set)) -> set -> set
mapEither :: Set set => (Elem set -> Either (Elem set) (Elem set)) -> set -> (set, set)
filter :: Set set => (Elem set -> Bool) -> set -> set
member :: Set set => Elem set -> set -> Bool
fromList :: Set set => [Elem set] -> set
insert :: Set set => Elem set -> set -> set
delete :: Set set => Elem set -> set -> set
singleton :: Set set => Elem set -> set
union :: Set set => set -> set -> set
intersection :: Set set => set -> set -> set
difference :: Set set => set -> set -> set
symmetricDifference :: Set set => set -> set -> set
(⊆) :: Set set => set -> set -> Bool
instance GHC.Classes.Ord a => Data.Set.Class.Set (Data.Set.Internal.Set a)
instance Data.Set.Class.Set Data.IntSet.Internal.IntSet