Copyright | (C) Richard Cook 2019 |
---|---|
License | MIT |
Maintainer | rcook@rcook.org |
Stability | stable |
Portability | portable |
Safe Haskell | None |
Language | Haskell2010 |
Documentation
A left-biased OSet
.
Instances
Foldable OSetL Source # | |
Defined in Data.Set.Ordered.LR 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 # elem :: Eq a => a -> OSetL a -> Bool # maximum :: Ord a => OSetL a -> a # minimum :: Ord a => OSetL a -> a # | |
Ord a => PreserveL a OSetL Source # | |
OrderedSet a OSetL Source # | |
Defined in Data.Set.Ordered.LR singleton :: a -> OSetL a Source # fromListL :: [a] -> OSetL a Source # fromListR :: [a] -> OSetL a Source # member :: a -> OSetL a -> Bool Source # notMember :: a -> OSetL a -> Bool Source # map :: Ord b => (a -> b) -> OSetL a -> OSetL b Source # filter :: (a -> Bool) -> OSetL a -> OSetL a Source # size :: OSetL a -> Int Source # toSeq :: OSetL a -> Seq a Source # toAscList :: OSetL a -> [a] Source # findIndex :: a -> OSetL a -> Maybe Index Source # elemAt :: OSetL a -> Index -> Maybe a Source # | |
Eq a => Eq (OSetL a) Source # | |
(Data a, Ord a) => Data (OSetL a) Source # | |
Defined in Data.Set.Ordered.LR 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 # | |
Show a => Show (OSetL a) Source # | |
Ord a => Semigroup (OSetL a) Source # | |
Ord a => Monoid (OSetL a) Source # | |
A right-biased OSet
.
Instances
Foldable OSetR Source # | |
Defined in Data.Set.Ordered.LR 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 # elem :: Eq a => a -> OSetR a -> Bool # maximum :: Ord a => OSetR a -> a # minimum :: Ord a => OSetR a -> a # | |
Ord a => PreserveR a OSetR Source # | |
OrderedSet a OSetR Source # | |
Defined in Data.Set.Ordered.LR singleton :: a -> OSetR a Source # fromListL :: [a] -> OSetR a Source # fromListR :: [a] -> OSetR a Source # member :: a -> OSetR a -> Bool Source # notMember :: a -> OSetR a -> Bool Source # map :: Ord b => (a -> b) -> OSetR a -> OSetR b Source # filter :: (a -> Bool) -> OSetR a -> OSetR a Source # size :: OSetR a -> Int Source # toSeq :: OSetR a -> Seq a Source # toAscList :: OSetR a -> [a] Source # findIndex :: a -> OSetR a -> Maybe Index Source # elemAt :: OSetR a -> Index -> Maybe a Source # | |
Eq a => Eq (OSetR a) Source # | |
(Data a, Ord a) => Data (OSetR a) Source # | |
Defined in Data.Set.Ordered.LR 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 # | |
Show a => Show (OSetR a) Source # | |
Ord a => Semigroup (OSetR a) Source # | |
Ord a => Monoid (OSetR a) Source # | |