Hoogle Search

Within LTS Haskell 24.57 (ghc-9.10.3)

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

  1. modifyMany :: (Collection c, Monoid (c v), Ord k) => (c v -> c v) -> k -> Multimap c k v -> Multimap c k v

    more-containers Data.Multimap

    Modifies a key's collection using an arbitrary function. More specifically, this function lifts an operation over a collection of values into a multimap operation. Sample use to filter even values from a SetMultimap: 

    let ms = fromList [('a', 1), ('a', 2)] :: SetMultimap Char Int
modifyMany (Set.filter even) 'a' ms == fromList [('a', 1)]

  2. modifyManyF :: (Collection c, Monoid (c v), Ord k, Functor f) => (c v -> f (c v)) -> k -> Multimap c k v -> f (Multimap c k v)

    more-containers Data.Multimap

    Modifies a key's collection using an arbitrary function. This is the applicative version of modifyMany.

  3. prependMany :: (Collection c, Monoid (c v), Ord k) => k -> c v -> Multimap c k v -> Multimap c k v

    more-containers Data.Multimap

    O(log m * C) Prepends a collection of values to a key's collection.

  4. many :: MonadPlus m => m a -> m [a]

    network-uri-template Network.URI.Template.Internal.Parse

    many p applies the parser p zero or more times and returns a list of the values returned by p. 

    identifier = (:) <$> letter <*> many (alphaNumChar <|> char '_')

  5. manyTill :: MonadPlus m => m a -> m end -> m [a]

    network-uri-template Network.URI.Template.Internal.Parse

    manyTill p end applies parser p zero or more times until parser end succeeds. Returns the list of values returned by p. Note that end result is consumed and lost. Use manyTill_ if you wish to keep it. See also: skipMany, skipManyTill.

  6. manyTill_ :: MonadPlus m => m a -> m end -> m ([a], end)

    network-uri-template Network.URI.Template.Internal.Parse

    manyTill_ p end applies parser p zero or more times until parser end succeeds. Returns the list of values returned by p and the end result. Use manyTill if you have no need in the result of the end. See also: skipMany, skipManyTill.

  7. skipMany :: MonadPlus m => m a -> m ()

    network-uri-template Network.URI.Template.Internal.Parse

    skipMany p applies the parser p zero or more times, skipping its result. See also: manyTill, skipManyTill.

  8. skipManyTill :: MonadPlus m => m a -> m end -> m end

    network-uri-template Network.URI.Template.Internal.Parse

    skipManyTill p end applies the parser p zero or more times skipping results until parser end succeeds. Result parsed by end is then returned. See also: manyTill, skipMany.

  9. XAnything :: String -> X

    nicify-lib Text.Nicify

    No documentation available.

  10. type CouldBeAnyOf (e :: [Type]) (xs :: [Type]) = All Map CouldBe e xs

    oops Control.Monad.Oops

    Listing larger variants' constraints might amplify the noise of functions' signatures. The CouldBeAnyOfF constraint lets us specify several types a variant may contain in a single type-level list, as opposed to several independent constraints. So, we could replace, f :: (e CouldBe Int, e CouldBe Bool, e CouldBe Char) => VariantF IO e with the equivalent constraint, f :: e CouldBeAnyOf '[Int, Bool, Char] => VariantF IO e As CouldBeAnyOf is just short-hand, we can use throw just like when we have CouldBe constraints: 

    >>> :set -XTypeOperators

>>> :{
f :: e `CouldBeAnyOf` '[Int, Bool, Char] => Variant e
f = throw 'c'
:}
    ... and eliminate constraints in just the same way: 
    >>> :{
g :: e `CouldBeAnyOf` '[Int, Bool] => Either (Variant e) Char
g = catch @Char f
:}

Page 234 of many | Previous | Next