Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  1. requestMethod :: JsonRpcRequest -> Text

    mcp-server MCP.Server.JsonRpc

    No documentation available.

  2. testMerkleProofN :: Int -> IO Bool

    merkle-tree Crypto.Hash.MerkleTree

    Constructs a merkle tree and random leaf root to test inclusion of

  3. fadeEndsTMB :: Char -> Float -> FilePath -> IO ()

    mmsyn7l MMSyn7l

    Variant of the fadeEndsTMN with the both equal percentages specified by the Float argument. It must be in the range (0..50]. Otherwise, the function returns error.

  4. fadeEndsTMN :: Char -> Float -> Float -> FilePath -> IO ()

    mmsyn7l MMSyn7l

    Applies "fade" effect (the type is specified by the Char argument, for more information, please, refer to the SoX documentation) to the both ends of the sound with header (supported by SoX). The Float arguments specify the percentages of the length of the sound that is faded-in and faded-out respectively. Otherwise, the function returns an error.

  5. hoistMaybe :: forall (m :: Type -> Type) b . Applicative m => Maybe b -> MaybeT m b

    monadology Control.Monad.Ology.Specific.MaybeT

    Convert a Maybe computation to MaybeT.

  6. type ListMultimap = Multimap []

    more-containers Data.Multimap

    A multimap with list values. Note that lists do not support efficient appends or sizing, so several multimap operations will have higher complexity than for other collections. If performance is a concern, consider using a SeqMultimap instead. See Data.Multimap.List for operations specific to this type.

  7. type ListMultimap = Multimap []

    more-containers Data.Multimap.List

    A multimap with list values. Note that lists do not support efficient appends or sizing, so several multimap operations will have higher complexity than for other collections. If performance is a concern, consider using a SeqMultimap instead. See Data.Multimap.List for operations specific to this type.

  8. listM :: MonadIO m => Maybe OllamaConfig -> m (Either OllamaError Models)

    ollama-haskell Data.Ollama.List

    MonadIO version of list for use in monadic contexts. Lifts the list function into a MonadIO context, allowing it to be used in monadic computations. Example: 

    >>> import Control.Monad.IO.Class

>>> runReaderT (listM Nothing) someContext
Right (Models [ModelInfo ...])

  9. hoistMaybe :: forall e (es :: [Type]) m a . (MonadError (Variant es) m, CouldBe es e) => e -> Maybe a -> m a

    oops Control.Monad.Oops

    When the expression of type 'Maybe a' evaluates to Nothing, throw the specified value, otherwise return a.

  10. atLeastMin :: Int -> RE c a -> RE c [a]

    parser-regex Regex.Base

    At least n times. Minimal, i.e. biased towards matching less.

Page 194 of many | Previous | Next