Safe Haskell | Trustworthy |
---|---|

Language | Haskell98 |

Lists suitable for parallel execution (taken from Hackage's monad-par package). (For converting to regular lists, there is the toList function in Data.Foldable.)

# Documentation

Monad AList Source # | |

Functor AList Source # | |

Applicative AList Source # | |

Foldable AList Source # | |

Traversable AList Source # | |

MonadPlus AList Source # | |

Alternative AList Source # | |

Eq t => Eq (AList t) Source # | |

Data t => Data (AList t) Source # | |

Ord t => Ord (AList t) Source # | |

Show t => Show (AList t) Source # | |

assocFold :: (c -> c -> c) -> AList c -> c Source #

Folds the AList with a function, that must be associative. This allows parallelism to be introduced.

findAList :: Eq a => (a -> Bool) -> AList a -> Maybe a Source #

Find the first element satisfying a predicate.

concatAList :: Monad m => m (m b) -> m b Source #

Concatenate an AList of ALists.