Copyright | (c) Ivan Lazar Miljenovic |
---|---|

License | MIT |

Maintainer | Ivan.Miljenovic@gmail.com |

Safe Haskell | None |

Language | Haskell2010 |

- spinterleave :: Monad f => (b -> b -> Ordering) -> [P a a' b () f e] -> P a a' b () f ()

# Documentation

spinterleave :: Monad f => (b -> b -> Ordering) -> [P a a' b () f e] -> P a a' b () f () Source

Interleave the elements of the provided producers such that the result consists of the values from all of them merged in by the provided comparison function.

That is, if each provided Quiver returns a sequence of ordered elements, then this would be the same as obtaining all the elements and sorting them.