Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
A function to tie together two sorted Haskell Iterators
Synopsis
- orderedZip :: Monad m => (a -> b -> Ordering) -> Producer a m r1 -> Producer b m r2 -> Producer (Maybe a, Maybe b) m (r1, r2)
- orderCheckPipe :: (MonadIO m, MonadSafe m, Show a) => (a -> a -> Ordering) -> Pipe a a m r
- data WrongInputOrderException = WrongInputOrderException String
Documentation
:: Monad m | |
=> (a -> b -> Ordering) | The function to compare types of a with b |
-> Producer a m r1 | The first producer (has to be ordered) |
-> Producer b m r2 | The second producer (has to be ordered) |
-> Producer (Maybe a, Maybe b) m (r1, r2) | The merged producer |
orderedZip takes a comparison function and two producers and merges them together, creating a new Producer that yields pairs of Maybes of the two datatables provided by the two original producers. The output pairs reflect the Union of the two input producers, with Nothings indicating missing data in one of the producers at that location.
data WrongInputOrderException Source #
Instances
Eq WrongInputOrderException Source # | |
Defined in Pipes.OrderedZip | |
Show WrongInputOrderException Source # | |
Defined in Pipes.OrderedZip showsPrec :: Int -> WrongInputOrderException -> ShowS # show :: WrongInputOrderException -> String # showList :: [WrongInputOrderException] -> ShowS # | |
Exception WrongInputOrderException Source # | |