Safe Haskell | Safe-Inferred |
---|---|
Language | GHC2021 |
Documentation
A data structure storing mappings that are constant on intervals.
If the space of keys not discrete, then these mappings are right-continuous: values are in general defined on intervals $a leq x < b$ which are closed on the left and open on the right.
Instances
Ord k => Mapping k (Piecewise k) Source # | |
Defined in Data.Mapping.Piecewise cst :: v -> Piecewise k v Source # act :: Piecewise k v -> k -> v Source # isConst :: Ord v => Piecewise k v -> Maybe v Source # mtraverse :: (Applicative f, Ord v) => (u -> f v) -> Piecewise k u -> f (Piecewise k v) Source # mmap :: Ord v => (u -> v) -> Piecewise k u -> Piecewise k v Source # mergeA :: (Applicative f, Ord w) => (u -> v -> f w) -> Piecewise k u -> Piecewise k v -> f (Piecewise k w) Source # merge :: Ord w => (u -> v -> w) -> Piecewise k u -> Piecewise k v -> Piecewise k w Source # | |
Foldable (Piecewise k) Source # | |
Defined in Data.Mapping.Piecewise fold :: Monoid m => Piecewise k m -> m # foldMap :: Monoid m => (a -> m) -> Piecewise k a -> m # foldMap' :: Monoid m => (a -> m) -> Piecewise k a -> m # foldr :: (a -> b -> b) -> b -> Piecewise k a -> b # foldr' :: (a -> b -> b) -> b -> Piecewise k a -> b # foldl :: (b -> a -> b) -> b -> Piecewise k a -> b # foldl' :: (b -> a -> b) -> b -> Piecewise k a -> b # foldr1 :: (a -> a -> a) -> Piecewise k a -> a # foldl1 :: (a -> a -> a) -> Piecewise k a -> a # toList :: Piecewise k a -> [a] # null :: Piecewise k a -> Bool # length :: Piecewise k a -> Int # elem :: Eq a => a -> Piecewise k a -> Bool # maximum :: Ord a => Piecewise k a -> a # minimum :: Ord a => Piecewise k a -> a # | |
Neighbourly (Piecewise k) Source # | |
Defined in Data.Mapping.Piecewise | |
(Show k, Show v) => Show (Piecewise k v) Source # | |
(Eq v, Eq k) => Eq (Piecewise k v) Source # | |
(Ord v, Ord k) => Ord (Piecewise k v) Source # | |
Defined in Data.Mapping.Piecewise compare :: Piecewise k v -> Piecewise k v -> Ordering # (<) :: Piecewise k v -> Piecewise k v -> Bool # (<=) :: Piecewise k v -> Piecewise k v -> Bool # (>) :: Piecewise k v -> Piecewise k v -> Bool # (>=) :: Piecewise k v -> Piecewise k v -> Bool # |
piecewiseFromAsc :: Eq k => v -> [(k, v)] -> Piecewise k v Source #