Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. tryCall :: (Addressable s, NFSerializable a, NFSerializable b) => s -> a -> Process (Maybe b)

   distributed-process-client-server	Control.Distributed.Process.ManagedProcess.UnsafeClient

   Version of safeCall that returns Nothing if the operation fails. Uses unsafe primitives.

2. sendAll :: Socket -> ByteString -> IO ()

   dns	Network.DNS.IO

   Send one or more encoded DNSMessage buffers over TCP, each allready encapsulated with an explicit length prefix (perhaps via encodeVC) and then concatenated into a single buffer. DO NOT use sendAll with UDP.

3. getAllArgs :: Arguments -> Option -> [String]

   docopt	System.Console.Docopt

   Returns all occurrences of a repeatable option, e.g. <file>....

4. getAllArgsM :: Monad m => Arguments -> Option -> m [String]

   docopt	System.Console.Docopt

   Deprecated: Monadic query functions will soon be removed

5. getAllArgs :: Arguments -> Option -> [String]

   docopt	System.Console.Docopt.NoTH

   Returns all occurrences of a repeatable option, e.g. <file>....

6. getAllArgsM :: Monad m => Arguments -> Option -> m [String]

   docopt	System.Console.Docopt.NoTH

   Deprecated: Monadic query functions will soon be removed

7. forkFinally :: forall (es :: [Effect]) a . (HasCallStack, Concurrent :> es) => Eff es a -> (Either SomeException a -> Eff es ()) -> Eff es ThreadId

   effectful	Effectful.Concurrent

   Lifted forkFinally.

8. equalLength :: [Sequence] -> Bool

   elynx-seq	ELynx.Sequence.Sequence

   Check if all Sequences have equal length.

9. module ELynx.Tree.Parallel

   Creation date: Mon Sep 7 13:36:45 2020. Parallel evaluation up to a given layer. By convention layer 0 only has one element: the root node. The layer 1 includes the daughter nodes of the root node, and so on. The layer to which a node belongs should not be confused with the depth of a tree.

10. getRationalLimit :: Fractional a => (a -> a -> Bool) -> [Rational] -> a

    exact-pi	Data.ExactPi

    Given an infinite converging sequence of rationals, find their limit. Takes a comparison function to determine when convergence is close enough.

    >>> getRationalLimit (==) (rationalApproximations (Exact 1 1)) :: Double
    3.141592653589793
    

Page 717 of many | Previous | Next