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.

Exact lookup

1. ProcessLinkException :: ProcessId -> DiedReason -> ProcessLinkException

   distributed-process	Control.Distributed.Process.Internal.Types

   No documentation available.

2. data ProcessMonitorNotification

   distributed-process	Control.Distributed.Process.Internal.Types

   Message sent by process monitors

3. ProcessMonitorNotification :: MonitorRef -> ProcessId -> DiedReason -> ProcessMonitorNotification

   distributed-process	Control.Distributed.Process.Internal.Types

   No documentation available.

4. data ProcessRegistrationException

   distributed-process	Control.Distributed.Process.Internal.Types

   Exception thrown when a process attempts to register a process under an already-registered name or to unregister a name that hasn't been registered. Returns the name and the identifier of the process that owns it, if any.

5. ProcessRegistrationException :: String -> !Maybe ProcessId -> ProcessRegistrationException

   distributed-process	Control.Distributed.Process.Internal.Types

   No documentation available.

6. data ProcessSignal

   distributed-process	Control.Distributed.Process.Internal.Types

   Signals to the node controller (see NCMsg)

7. module Control.Distributed.Process.Management.Internal.Trace.Primitives

   Keeps the tracing API calls separate from the Tracer implementation, which allows us to avoid a nasty import cycle between tracing and the messaging primitives that rely on it, and also between the node controller (which requires access to the tracing related elements of our RemoteTable) and the Debug module, which requires forkProcess. This module is also used by the management agent, which relies on the tracing infrastructure's messaging fabric.

8. Prefixed :: Text -> Doc a -> Doc a

   doclayout	Text.DocLayout

   Doc with each line prefixed with text. Note that trailing blanks are omitted from the prefix when the line after it is empty.

9. data Partition (b :: a -> Exp Bool) (c :: [a]) (d :: ([a], [a]))

   first-class-families	Fcf

   Split a list into one where all elements satisfy a predicate, and a second where no elements satisfy it.

   Example

   >>> :kind! Eval (Partition ((>=) 35) [20, 30, 40, 50])
   Eval (Partition ((>=) 35) [20, 30, 40, 50]) :: ([Natural],
   [Natural])
   = '([20, 30], [40, 50])
   

10. data Pure (b :: a) (c :: a)

    first-class-families	Fcf

    No documentation available.

Page 335 of many | Previous | Next