úÎN¢KÂ.      !"#$%&'()*+,- Safe-Inferred!Like .=, but run all the actions in parallel threads, collecting up P the results and returning them all. Does not return until all actions finish. like 1 but without bothering to keep the return values like 4 but not even bothering to track success or failure 9 of the child threads. Still waits for them all though. EExecute an action repeatedly as long as the given boolean expression A returns True. The condition is evaluated before the loop body. # Collects the results into a list. EExecute an action repeatedly as long as the given boolean expression @ returns True. The condition is evaluated before the loop body. ( Collects the results into an arbitrary / value. EExecute an action repeatedly as long as the given boolean expression A returns True. The condition is evaluated before the loop body.  Discards results. LExecute an action repeatedly until its result fails to satisfy a predicate, 1 and return that result (discarding all others). GExecute an action forever, feeding the result of each execution as the  input to the next. JExecute an action repeatedly until the condition expression returns True. P The condition is evaluated after the loop body. Collects results into a list. 8 Parameters are arranged for infix usage. eg. do {...}   ... JExecute an action repeatedly until the condition expression returns True. J The condition is evaluated after the loop body. Collects results into a   MonadPlus value. 8 Parameters are arranged for infix usage. eg. do {...}   ... JExecute an action repeatedly until the condition expression returns True. D The condition is evaluated after the loop body. Discards results. 8 Parameters are arranged for infix usage. eg. do {...}   ...  Analogue of (0) 0 Yields the result of applying f until p holds. EExecute an action repeatedly until its result satisfies a predicate, 1 and return that result (discarding all others). As long as the supplied Maybe expression returns Just _ , the loop ; body will be called and passed the value contained in the 1 . Results  are collected into a list. As long as the supplied Maybe expression returns Just _ , the loop ; body will be called and passed the value contained in the 1 . Results 6 are collected into an arbitrary MonadPlus container. As long as the supplied Maybe expression returns Just _ , the loop ; body will be called and passed the value contained in the 1 . Results  are discarded. Run the supplied Maybe+ computation repeatedly until it returns a  value. Returns that value.  The supplied Maybe/ expression will be repeatedly called until it  returns 22. All values returned are collected into a list.  The supplied Maybe/ expression will be repeatedly called until it  returns 27. All values returned are collected into an arbitrary  / thing.  The supplied Maybe/ expression will be repeatedly called until it  returns 2&. All values returned are discarded. CRepeatedly evaluates the second argument until the value satisfies J the given predicate, and returns a list of all values that satisfied the B predicate. Discards the final one (which failed the predicate). CRepeatedly evaluates the second argument until the value satisfies $ the given predicate, and returns a / collection of all values U that satisfied the predicate. Discards the final one (which failed the predicate). See -. This is a monad-friendly version of that. See 4. This is a monad-friendly version of that, with a M twist. Rather than returning a list, it returns any MonadPlus type of your  choice. CCompose a list of monadic actions into one action. Composes using  (3>) - that is, the output of each action is fed to the input of  the one after it in the list. short-circuit 4& for values of type Monad m => m Bool short-circuit 5& for values of type Monad m => m Bool short-circuit 6 with a list of "monadic predicates" . Tests the G value presented against each predicate in turn until one passes, then N returns True without any further processing. If none passes, returns False. short-circuit 7 with a list of "monadic predicates". Tests the value O presented against each predicate in turn until one fails, then returns False.  if none fail, returns True. short-circuit 6 with a "monadic predicate". short-circuit 7 with a "monadic predicate". like " but trims both ends of the list. !Lreturn the first value from a list, if any, satisfying the given predicate. .  !"#$%&'()*+,-.  !"#$%&'()*+,-.  !"#$%&'()*+,-.  !"#$%&'()*+,-8      !"#$%&'()*+,-./0123423526728928:23;2<=2<>2<?2<@Amonad-loops-0.4.2Control.Monad.Loops Data.ListunfoldrforkMapM forkMapM_ forkMapM__whileMwhileM'whileM_ iterateWhile iterateM_untilMuntilM'untilM_ iterateUntilM iterateUntil whileJust whileJust' whileJust_ untilJustunfoldMunfoldM'unfoldM_ unfoldWhileM unfoldWhileM'unfoldrM unfoldrM'concatMandMorManyPMallPManyMallM dropWhileMtrimMfirstM minimaOnByM maximaOnByM minimaByM maximaByM minimaOnM maximaOnM minimumOnByM maximumOnByM minimumByM maximumByM minimumOnM maximumOnMbase Control.MonadmapM MonadPlusGHC.Baseuntil Data.MaybeJustNothing>=>GHC.Listandoranyall