oset-0.3.0.0: An insertion-order-preserving set

Copyright(C) Richard Cook 2019
LicenseMIT
Maintainerrcook@rcook.org
Stabilitystable
Portabilityportable
Safe HaskellSafe
LanguageHaskell2010

Data.Set.Ordered.Instances

Description

 
Synopsis

Documentation

newtype OSetL a Source #

A left-biased OSet

Constructors

OSetL 

Fields

Instances
Foldable OSetL Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

fold :: Monoid m => OSetL m -> m #

foldMap :: Monoid m => (a -> m) -> OSetL a -> m #

foldr :: (a -> b -> b) -> b -> OSetL a -> b #

foldr' :: (a -> b -> b) -> b -> OSetL a -> b #

foldl :: (b -> a -> b) -> b -> OSetL a -> b #

foldl' :: (b -> a -> b) -> b -> OSetL a -> b #

foldr1 :: (a -> a -> a) -> OSetL a -> a #

foldl1 :: (a -> a -> a) -> OSetL a -> a #

toList :: OSetL a -> [a] #

null :: OSetL a -> Bool #

length :: OSetL a -> Int #

elem :: Eq a => a -> OSetL a -> Bool #

maximum :: Ord a => OSetL a -> a #

minimum :: Ord a => OSetL a -> a #

sum :: Num a => OSetL a -> a #

product :: Num a => OSetL a -> a #

Eq a => Eq (OSetL a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

(==) :: OSetL a -> OSetL a -> Bool #

(/=) :: OSetL a -> OSetL a -> Bool #

(Data a, Ord a) => Data (OSetL a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OSetL a -> c (OSetL a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (OSetL a) #

toConstr :: OSetL a -> Constr #

dataTypeOf :: OSetL a -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (OSetL a)) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (OSetL a)) #

gmapT :: (forall b. Data b => b -> b) -> OSetL a -> OSetL a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OSetL a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OSetL a -> r #

gmapQ :: (forall d. Data d => d -> u) -> OSetL a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> OSetL a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> OSetL a -> m (OSetL a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OSetL a -> m (OSetL a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OSetL a -> m (OSetL a) #

Ord a => Ord (OSetL a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

compare :: OSetL a -> OSetL a -> Ordering #

(<) :: OSetL a -> OSetL a -> Bool #

(<=) :: OSetL a -> OSetL a -> Bool #

(>) :: OSetL a -> OSetL a -> Bool #

(>=) :: OSetL a -> OSetL a -> Bool #

max :: OSetL a -> OSetL a -> OSetL a #

min :: OSetL a -> OSetL a -> OSetL a #

Show a => Show (OSetL a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

showsPrec :: Int -> OSetL a -> ShowS #

show :: OSetL a -> String #

showList :: [OSetL a] -> ShowS #

Ord a => Semigroup (OSetL a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

(<>) :: OSetL a -> OSetL a -> OSetL a #

sconcat :: NonEmpty (OSetL a) -> OSetL a #

stimes :: Integral b => b -> OSetL a -> OSetL a #

Ord a => Monoid (OSetL a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

mempty :: OSetL a #

mappend :: OSetL a -> OSetL a -> OSetL a #

mconcat :: [OSetL a] -> OSetL a #

newtype OSetR a Source #

A right-biased OSet

Constructors

OSetR 

Fields

Instances
Foldable OSetR Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

fold :: Monoid m => OSetR m -> m #

foldMap :: Monoid m => (a -> m) -> OSetR a -> m #

foldr :: (a -> b -> b) -> b -> OSetR a -> b #

foldr' :: (a -> b -> b) -> b -> OSetR a -> b #

foldl :: (b -> a -> b) -> b -> OSetR a -> b #

foldl' :: (b -> a -> b) -> b -> OSetR a -> b #

foldr1 :: (a -> a -> a) -> OSetR a -> a #

foldl1 :: (a -> a -> a) -> OSetR a -> a #

toList :: OSetR a -> [a] #

null :: OSetR a -> Bool #

length :: OSetR a -> Int #

elem :: Eq a => a -> OSetR a -> Bool #

maximum :: Ord a => OSetR a -> a #

minimum :: Ord a => OSetR a -> a #

sum :: Num a => OSetR a -> a #

product :: Num a => OSetR a -> a #

Eq a => Eq (OSetR a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

(==) :: OSetR a -> OSetR a -> Bool #

(/=) :: OSetR a -> OSetR a -> Bool #

(Data a, Ord a) => Data (OSetR a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OSetR a -> c (OSetR a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (OSetR a) #

toConstr :: OSetR a -> Constr #

dataTypeOf :: OSetR a -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (OSetR a)) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (OSetR a)) #

gmapT :: (forall b. Data b => b -> b) -> OSetR a -> OSetR a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OSetR a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OSetR a -> r #

gmapQ :: (forall d. Data d => d -> u) -> OSetR a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> OSetR a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> OSetR a -> m (OSetR a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OSetR a -> m (OSetR a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OSetR a -> m (OSetR a) #

Ord a => Ord (OSetR a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

compare :: OSetR a -> OSetR a -> Ordering #

(<) :: OSetR a -> OSetR a -> Bool #

(<=) :: OSetR a -> OSetR a -> Bool #

(>) :: OSetR a -> OSetR a -> Bool #

(>=) :: OSetR a -> OSetR a -> Bool #

max :: OSetR a -> OSetR a -> OSetR a #

min :: OSetR a -> OSetR a -> OSetR a #

Show a => Show (OSetR a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

showsPrec :: Int -> OSetR a -> ShowS #

show :: OSetR a -> String #

showList :: [OSetR a] -> ShowS #

Ord a => Semigroup (OSetR a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

(<>) :: OSetR a -> OSetR a -> OSetR a #

sconcat :: NonEmpty (OSetR a) -> OSetR a #

stimes :: Integral b => b -> OSetR a -> OSetR a #

Ord a => Monoid (OSetR a) Source # 
Instance details

Defined in Data.Set.Ordered.Instances

Methods

mempty :: OSetR a #

mappend :: OSetR a -> OSetR a -> OSetR a #

mconcat :: [OSetR a] -> OSetR a #

singletonL Source #

Arguments

:: a

element

-> OSetL a

set

\(O(1)\). A left-biased singleton set containing the given element.

singletonR Source #

Arguments

:: a

element

-> OSetR a

set

\(O(1)\). A right-biased singleton set containing the given element.