Hoogle Search

Within LTS Haskell 24.50 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. breakOnAll :: HasCallStack => Text -> Text -> [(Text, Text)]

    text Data.Text.Lazy

    O(n+m) Find all non-overlapping instances of needle in haystack. Each element of the returned list consists of a pair:

    • The entire string prior to the kth match (i.e. the prefix)
    • The kth match, followed by the remainder of the string
    Examples: 
    breakOnAll "::" ""
==> []
breakOnAll "/" "a/b/c/"
==> [("a", "/b/c/"), ("a/b", "/c/"), ("a/b/c", "/")]
    This function is strict in its first argument, and lazy in its second. In (unlikely) bad cases, this function's time complexity degrades towards O(n*m). The needle parameter may not be empty.

  2. fromDistinctAscList_linkAll :: FromDistinctMonoState k a -> Map k a

    containers Data.Map.Internal

    No documentation available.

  3. fromDistinctDescList_linkAll :: FromDistinctMonoState k a -> Map k a

    containers Data.Map.Internal

    No documentation available.

  4. type CallCC (m :: Type -> Type) a b = a -> m b -> m a -> m a

    transformers Control.Monad.Signatures

    Signature of the callCC operation, introduced in Control.Monad.Trans.Cont. Any lifting function liftCallCC should satisfy 

    • lift (f k) = f' (lift . k) => lift
(cf f) = liftCallCC cf f'

  5. liftCallCC :: CallCC m (a, w) (b, w) -> CallCC (AccumT w m) a b

    transformers Control.Monad.Trans.Accum

    Uniform lifting of a callCC operation to the new monad. This version rolls back to the original output history on entering the continuation.

  6. liftCallCC' :: CallCC m (a, w) (b, w) -> CallCC (AccumT w m) a b

    transformers Control.Monad.Trans.Accum

    In-situ lifting of a callCC operation to the new monad. This version uses the current output history on entering the continuation. It does not satisfy the uniformity property (see Control.Monad.Signatures).

  7. finallyE :: forall (m :: Type -> Type) e a . Monad m => ExceptT e m a -> ExceptT e m () -> ExceptT e m a

    transformers Control.Monad.Trans.Except

    finallyE a b executes computation a followed by computation b, even if a exits early by throwing an exception. In the latter case, the exception is re-thrown after b has been executed.

  8. liftCallCC :: CallCC m (Either e a) (Either e b) -> CallCC (ExceptT e m) a b

    transformers Control.Monad.Trans.Except

    Lift a callCC operation to the new monad.

  9. liftCallCC :: CallCC m a b -> CallCC (IdentityT m) a b

    transformers Control.Monad.Trans.Identity

    Lift a callCC operation to the new monad.

  10. liftCallCC :: CallCC m (Maybe a) (Maybe b) -> CallCC (MaybeT m) a b

    transformers Control.Monad.Trans.Maybe

    Lift a callCC operation to the new monad.

Page 194 of many | Previous | Next