Data.Set.Ordered.Many.With

Documentation

newtype SetsWith k c a

Constructors

SetsWith

Fields

unSetsWith :: (a -> k, Map k (c a))

Instances

(Ord k, HasUnion (c a), HasSingleton a (c a)) => HasInsert a (SetsWith k c a)

(Ord k, Eq (c a), HasEmpty (c a), HasDelete a (c a)) => HasDelete a (SetsWith k c a)

Foldable c => Foldable (SetsWith k c)

Functor c => Invariant (SetsWith k c)

(Ord k, HasUnion (c a), HasSingleton a (c a)) => HasSingletonWith (a -> k) a (SetsWith k c a)

HasEmptyWith (a -> k) (SetsWith k c a)

(Eq (c a), Eq k) => Eq (SetsWith k c a)

(Ord k, Eq (c a), CanBeSubset (c a)) => CanBeProperSubset (SetsWith k c a)

(Ord k, Eq (c a), CanBeSubset (c a)) => CanBeSubset (SetsWith k c a)

HasSize (SetsWith k c a)

(Ord k, Eq (c a), HasEmpty (c a), HasDifference (c a)) => HasDifference (SetsWith k c a)

(Ord k, Eq (c a), HasEmpty (c a), HasIntersection (c a)) => HasIntersection (SetsWith k c a)

(Ord k, HasUnion (c a)) => HasUnion (SetsWith k c a)

Operators

(\\) :: (Ord k, HasDifference (c a)) => SetsWith k c a -> SetsWith k c a -> SetsWith k c a

Query

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

Construction

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

Combine

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

Deletes entire set with minimum key

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