Safe Haskell  None 

Language  Haskell2010 
Synopsis
 newtype SetsWith k c a = SetsWith {
 unSetsWith :: (a > k, Map k (c a))
 (\\) :: (Ord k, HasDifference (c a)) => SetsWith k c a > SetsWith k c a > SetsWith k c a
 null :: SetsWith k c a > Bool
 size :: SetsWith k c a > Int
 member :: Ord k => a > SetsWith k c a > Bool
 notMember :: Ord k => a > SetsWith k c a > Bool
 lookupLT :: Ord k => a > SetsWith k c a > Maybe (c a)
 lookupGT :: Ord k => a > SetsWith k c a > Maybe (c a)
 lookupLE :: Ord k => a > SetsWith k c a > Maybe (c a)
 lookupGE :: Ord k => a > SetsWith k c a > Maybe (c a)
 isSubsetOf :: (Ord k, Eq (c a), CanBeSubset (c a)) => SetsWith k c a > SetsWith k c a > Bool
 isProperSubsetOf :: (Ord k, Eq (c a), CanBeSubset (c a)) => SetsWith k c a > SetsWith k c a > Bool
 empty :: (a > k) > SetsWith k c a
 singleton :: (Ord k, HasUnion (c a), HasSingleton a (c a)) => (a > k) > a > SetsWith k c a
 insert :: (Ord k, HasUnion (c a), HasSingleton a (c a)) => a > SetsWith k c a > SetsWith k c a
 delete :: (Ord k, Eq (c a), HasEmpty (c a), HasDelete a (c a)) => a > SetsWith k c a > SetsWith k c a
 union :: (Ord k, HasUnion (c a)) => SetsWith k c a > SetsWith k c a > SetsWith k c a
 difference :: (Ord k, Eq (c a), HasEmpty (c a), HasDifference (c a)) => SetsWith k c a > SetsWith k c a > SetsWith k c a
 intersection :: (Ord k, Eq (c a), HasEmpty (c a), HasIntersection (c a)) => SetsWith k c a > SetsWith k c a > SetsWith k c a
 filter :: (Eq (c a), HasEmpty (c a), Witherable c) => (a > Bool) > SetsWith k c a > SetsWith k c a
 partition :: (c a > Bool) > SetsWith k c a > (SetsWith k c a, SetsWith k c a)
 split :: Ord k => a > SetsWith k c a > (SetsWith k c a, SetsWith k c a)
 splitMember :: Ord k => a > SetsWith k c a > (SetsWith k c a, Bool, SetsWith k c a)
 splitRoot :: Ord k => SetsWith k c a > [SetsWith k c a]
 lookupIndex :: Ord k => a > SetsWith k c a > Maybe Int
 findIndex :: Ord k => a > SetsWith k c a > Int
 setAt :: Int > SetsWith k c a > c a
 deleteAt :: Int > SetsWith k c a > SetsWith k c a
 map :: Functor c => (a > b) > (b > a) > SetsWith k c a > SetsWith k c b
 mapMaybe :: (Eq (c b), HasEmpty (c b), Witherable c) => (a > Maybe b) > (b > a) > SetsWith k c a > SetsWith k c b
 foldr :: Foldable c => (a > b > b) > b > SetsWith k c a > b
 foldl :: Foldable c => (b > a > b) > b > SetsWith k c a > b
 foldr' :: Foldable c => (a > b > b) > b > SetsWith k c a > b
 foldl' :: Foldable c => (b > a > b) > b > SetsWith k c a > b
 fold :: Foldable c => (a > b > b) > b > SetsWith k c a > b
 findMin :: (Ord a, Foldable c) => SetsWith k c a > a
 findMax :: (Ord a, Foldable c) => SetsWith k c a > a
 deleteMin :: SetsWith k c a > SetsWith k c a
 deleteMax :: SetsWith k c a > SetsWith k c a
 deleteFindMin :: SetsWith k c a > (c a, SetsWith k c a)
 deleteFindMax :: SetsWith k c a > (c a, SetsWith k c a)
 minView :: SetsWith k c a > Maybe (c a, SetsWith k c a)
 maxView :: SetsWith k c a > Maybe (c a, SetsWith k c a)
 elems :: (HasUnion (c a), HasEmpty (c a)) => SetsWith k c a > c a
 toList :: SetsWith k c a > (a > k, [c a])
 fromList :: (Ord k, HasSingleton a (c a), HasUnion (c a), Foldable f) => (a > k) > f a > SetsWith k c a
 toAscList :: SetsWith k c a > [c a]
 toDescList :: SetsWith k c a > [c a]
 fromAscList :: (Eq k, HasSingleton a (c a)) => (a > k) > [a] > SetsWith k c a
 fromDistinctAscList :: HasSingleton a (c a) => (a > k) > [a] > SetsWith k c a
 showTree :: (Show k, Show (c a)) => SetsWith k c a > String
 showTreeWith :: (k > c a > String) > Bool > Bool > SetsWith k c a > String
Documentation
newtype SetsWith k c a Source #
SetsWith  

Instances
Operators
Query
isSubsetOf :: (Ord k, Eq (c a), CanBeSubset (c a)) => SetsWith k c a > SetsWith k c a > Bool Source #
isProperSubsetOf :: (Ord k, Eq (c a), CanBeSubset (c a)) => SetsWith k c a > SetsWith k c a > Bool Source #
Construction
singleton :: (Ord k, HasUnion (c a), HasSingleton a (c a)) => (a > k) > a > SetsWith k c a Source #
insert :: (Ord k, HasUnion (c a), HasSingleton a (c a)) => a > SetsWith k c a > SetsWith k c a Source #
delete :: (Ord k, Eq (c a), HasEmpty (c a), HasDelete a (c a)) => a > SetsWith k c a > SetsWith k c a Source #
Combine
difference :: (Ord k, Eq (c a), HasEmpty (c a), HasDifference (c a)) => SetsWith k c a > SetsWith k c a > SetsWith k c a Source #
intersection :: (Ord k, Eq (c a), HasEmpty (c a), HasIntersection (c a)) => SetsWith k c a > SetsWith k c a > SetsWith k c a Source #
filter :: (Eq (c a), HasEmpty (c a), Witherable c) => (a > Bool) > SetsWith k c a > SetsWith k c a Source #
mapMaybe :: (Eq (c b), HasEmpty (c b), Witherable c) => (a > Maybe b) > (b > a) > SetsWith k c a > SetsWith k c b Source #
deleteFindMin :: SetsWith k c a > (c a, SetsWith k c a) Source #
deleteFindMax :: SetsWith k c a > (c a, SetsWith k c a) Source #
fromList :: (Ord k, HasSingleton a (c a), HasUnion (c a), Foldable f) => (a > k) > f a > SetsWith k c a Source #
toDescList :: SetsWith k c a > [c a] Source #
fromAscList :: (Eq k, HasSingleton a (c a)) => (a > k) > [a] > SetsWith k c a Source #
fromDistinctAscList :: HasSingleton a (c a) => (a > k) > [a] > SetsWith k c a Source #