proton-0.0.4
Safe HaskellNone
LanguageHaskell2010

Proton.PreGrate

Documentation

aligner :: (s -> k -> a) -> ((k -> b) -> t) -> Grate s t a b Source #

alignMap :: Ord k => Set k -> Grate (Map k a) (Map k b) (Maybe a) (Maybe b) Source #

alignMapWithDefault :: Ord k => Set k -> a -> Grate (Map k a) (Map k b) a b Source #

alignList :: Int -> Grate [a] [b] (Maybe a) (Maybe b) Source #

alignListWithDefault :: Int -> a -> Grate [a] [b] a b Source #

alignMapMonoid :: (Monoid a, Ord k) => Set k -> Grate (Map k a) (Map k b) a b Source #

alignListMonoid :: Monoid a => Int -> Grate [a] [b] a b Source #

newtype Intersection a Source #

Constructors

Intersection (Set a) 

Instances

Instances details
Ord a => Semigroup (Intersection a) Source # 
Instance details

Defined in Proton.PreGrate

fullAlignMap :: (Ord k, MStrong p, Closed p) => p a b -> p (Map k a) (Map k b) Source #

fullAlignList :: (MStrong p, Closed p) => p a b -> p [a] [b] Source #

zipBy :: forall f p s t a b m. (Representable f, MStrong p, Closed p, Monoid m) => (s -> (f a, m)) -> (f b -> m -> t) -> p a b -> p s t Source #