Data.Set.Ordered.Many

Documentation

newtype OMSet a

Ordered sets with duplicate elements.

Constructors

OMSet

Fields

• unOMSet :: Vector a

Instances

Monad OMSet

Defined in Data.Set.Ordered.Many

Methods

(>>=) :: OMSet a -> (a -> OMSet b) -> OMSet b

(>>) :: OMSet a -> OMSet b -> OMSet b

return :: a -> OMSet a

fail :: String -> OMSet a

Functor OMSet

Defined in Data.Set.Ordered.Many

Methods

fmap :: (a -> b) -> OMSet a -> OMSet b

(<$) :: a -> OMSet b -> OMSet a

Applicative OMSet

Defined in Data.Set.Ordered.Many

Methods

pure :: a -> OMSet a

(<*>) :: OMSet (a -> b) -> OMSet a -> OMSet b

liftA2 :: (a -> b -> c) -> OMSet a -> OMSet b -> OMSet c

(*>) :: OMSet a -> OMSet b -> OMSet b

(<*) :: OMSet a -> OMSet b -> OMSet a

Foldable OMSet

Defined in Data.Set.Ordered.Many

Methods

fold :: Monoid m => OMSet m -> m

foldMap :: Monoid m => (a -> m) -> OMSet a -> m

foldr :: (a -> b -> b) -> b -> OMSet a -> b

foldr' :: (a -> b -> b) -> b -> OMSet a -> b

foldl :: (b -> a -> b) -> b -> OMSet a -> b

foldl' :: (b -> a -> b) -> b -> OMSet a -> b

foldr1 :: (a -> a -> a) -> OMSet a -> a

foldl1 :: (a -> a -> a) -> OMSet a -> a

toList :: OMSet a -> [a]

null :: OMSet a -> Bool

length :: OMSet a -> Int

elem :: Eq a => a -> OMSet a -> Bool

maximum :: Ord a => OMSet a -> a

minimum :: Ord a => OMSet a -> a

sum :: Num a => OMSet a -> a

product :: Num a => OMSet a -> a

Traversable OMSet

Defined in Data.Set.Ordered.Many

Methods

traverse :: Applicative f => (a -> f b) -> OMSet a -> f (OMSet b)

sequenceA :: Applicative f => OMSet (f a) -> f (OMSet a)

mapM :: Monad m => (a -> m b) -> OMSet a -> m (OMSet b)

sequence :: Monad m => OMSet (m a) -> m (OMSet a)

Mergeable OMSet

Defined in Data.Set.Ordered.Many

Methods

mergeMap :: CommutativeId m => (a -> m) -> OMSet a -> m

merge :: (a -> b -> b) -> b -> OMSet a -> b

Ord a => HasInsert a (OMSet a)

Defined in Data.Set.Class

Methods

insert :: a -> OMSet a -> OMSet a

Eq a => HasDelete a (OMSet a)

Defined in Data.Set.Class

Methods

delete :: a -> OMSet a -> OMSet a

HasSingleton a (OMSet a)

Defined in Data.Set.Class

Methods

singleton :: a -> OMSet a

Eq a => Eq (OMSet a)

Defined in Data.Set.Ordered.Many

Methods

(==) :: OMSet a -> OMSet a -> Bool

(/=) :: OMSet a -> OMSet a -> Bool

Show a => Show (OMSet a)

Defined in Data.Set.Ordered.Many

Methods

showsPrec :: Int -> OMSet a -> ShowS

show :: OMSet a -> String

showList :: [OMSet a] -> ShowS

(Arbitrary a, Ord a, Show a) => Arbitrary (OMSet a)

Defined in Data.Set.Ordered.Many

Methods

arbitrary :: Gen (OMSet a)

shrink :: OMSet a -> [OMSet a]

Eq a => CanBeProperSubset (OMSet a)

Defined in Data.Set.Class

Methods

isProperSubsetOf :: OMSet a -> OMSet a -> Bool

Eq a => CanBeSubset (OMSet a)

Defined in Data.Set.Class

Methods

isSubsetOf :: OMSet a -> OMSet a -> Bool

HasSize (OMSet a)

Defined in Data.Set.Class

Methods

size :: OMSet a -> Int

HasEmpty (OMSet a)

Defined in Data.Set.Class

Methods

empty :: OMSet a

Eq a => HasDifference (OMSet a)

Defined in Data.Set.Class

Methods

difference :: OMSet a -> OMSet a -> OMSet a

Ord a => HasIntersection (OMSet a)

Defined in Data.Set.Class

Methods

intersection :: OMSet a -> OMSet a -> OMSet a

Ord a => HasUnion (OMSet a)

Defined in Data.Set.Class

Methods

union :: OMSet a -> OMSet a -> OMSet a

Operators

(\\) :: Eq a => OMSet a -> OMSet a -> OMSet a

Query

null :: Eq a => OMSet a -> Bool

size :: OMSet a -> Int

member :: Eq a => a -> OMSet a -> Bool

notMember :: Eq a => a -> OMSet a -> Bool

lookup :: Eq a => a -> OMSet a -> Maybe a

isSubsetOf :: Eq a => OMSet a -> OMSet a -> Bool

isProperSubsetOf :: Eq a => OMSet a -> OMSet a -> Bool

Construction

empty :: OMSet a

O(1)

singleton :: a -> OMSet a

O(1)

insert :: Ord a => a -> OMSet a -> OMSet a

O(n)

delete :: Eq a => a -> OMSet a -> OMSet a

O(n)

Combine

union :: Ord a => OMSet a -> OMSet a -> OMSet a

O(min n m)

difference :: Eq a => OMSet a -> OMSet a -> OMSet a

O(n*m)

intersection :: Ord a => OMSet a -> OMSet a -> OMSet a

O(min(n,m)) - Combines all elements of both

Filter

filter :: (a -> Bool) -> OMSet a -> OMSet a

O(n)

partition :: (a -> Bool) -> OMSet a -> (OMSet a, OMSet a)

O(n)

Map

map :: (a -> b) -> OMSet a -> OMSet b

O(n)

mapMaybe :: (a -> Maybe b) -> OMSet a -> OMSet b

O(?)

Orphan instances

MonadBase Gen Gen

Methods

liftBase :: Gen α -> Gen α