úÎ÷     None'!"&'(*+-0134579<>@CFHIKLNUVhA proper implementation of the list monad-transformer. Useful for streaming of monadic data structures.Since it has instances of  and 0, you can use general utilities packages like  ,http://hackage.haskell.org/package/monadplus "monadplus" with it.[Execute in the inner monad, getting the head and the tail. Returns nothing if it's empty.9Execute, getting the head. Returns nothing if it's empty.9Execute, getting the tail. Returns nothing if it's empty.%Execute, checking whether it's empty.Execute, applying a left fold. A version of !, which allows early termination.Execute, folding to a list. QExecute, folding to a list in the reverse order. Performs more efficiently than . FExecute, traversing the stream with a side effect in the inner monad. UExecute, consuming a list of the specified length and returning the remainder stream. Prepend an element. Construct from any foldable.EConstruct from an MVar, interpreting the value of Nothing as the end.-Construct by unfolding a pure data structure./Construct by unfolding a monadic data structurefThis is the most memory-efficient way to construct ListT where the length depends on the inner monad.Produce an infinite stream.PA transformation, which traverses the stream with an action in the inner monad.0A transformation, reproducing the behaviour of  Data.List..0A transformation, reproducing the behaviour of  Data.List..KA transformation, which slices a list into chunks of the specified length.#  !"#$  "  !"#$%      !"#$%&'(listt_BG7SYPTIy4THKES117IAGUListT Data.Listtakedropunconsheadtailnullfold foldMaybetoList toReverseList traverse_splitAtcons fromFoldablefromMVarunfoldunfoldMrepeattraverseslicebaseGHC.Base MonadPlus Alternative$fMonadErroreListT$fMonadBaseControlbListT$fMonadBasebListT $fMMonadListT$fMFunctorListT$fMonadIOListT$fMonadTransListT$fMonadPlusListT $fMonadListT$fAlternativeListT$fApplicativeListT$fFunctorListT $fMonoidListT