out -package:GenericPretty

out :: Graph gr => gr a b -> Node -> [LEdge b]
ghc GHC.Data.Graph.Inductive.Graph, fgl Data.Graph.Inductive.Graph, ghc-lib GHC.Data.Graph.Inductive.Graph
Find all outward-bound LEdges for the given Node.
out :: String -> BrowserAction t ()
HTTP Network.Browser
out :: Fix p a -> p (Fix p a) a
bifunctors Data.Bifunctor.Fix
out :: Fix (f :: Type -> Type) -> f (Fix f)
clay Clay.Selector
out :: Reproducible a => String -> ByteString -> String -> ELynx a ()
elynx-tools ELynx.Tools.ELynx
Write a result with a given name to file with given extension or standard output. Supports compression.
out :: Events
poll System.Posix.Poll
Out :: Direction
dbus DBus.Introspection.Types
Out :: Event
zeromq4-haskell System.ZMQ4 System.ZMQ4.Monadic
ZMQ_POLLOUT (outgoing messages, i.e. at least 1 byte can be written)
Out :: TimeclockCode
hledger-lib Hledger.Data Hledger.Data.Types
data Out
zstd Codec.Compression.Zstd.Base Codec.Compression.Zstd.FFI
A tag type to indicate that a Buffer is used for tracking output.
OUT :: TypeCategory
morpheus-graphql-core Data.Morpheus.Types.Internal.AST
type OUT = 'OUT
morpheus-graphql-core Data.Morpheus.Types.Internal.AST
data Out
pooled-io Control.Concurrent.PooledIO.Sequence, concurrent-split Control.Concurrent.Split.Class, stm-split Control.Concurrent.STM.Split.Class
module Language.GraphQL.Type.Out
graphql
Output types and values, monad transformer stack used by the GraphQL resolvers. This module is intended to be imported qualified, to avoid name clashes with In.
type family Out cl
rhine FRP.Rhine FRP.Rhine.Schedule
The clock that represents the rate at which data leaves the system.
Out :: StorageQualifier
language-glsl Language.GLSL.Syntax
Out :: Ext
liquid-fixpoint Language.Fixpoint.Utils.Files
Output from constraint solving (fixpoint)
type Out = T Out
concurrent-split Control.Concurrent.Split.Chan Control.Concurrent.Split.MVar, stm-split Control.Concurrent.STM.Split.Chan Control.Concurrent.STM.Split.MVar
Out :: RedirOp
language-bash Language.Bash.Syntax
>
Out :: Event
poll System.Posix.Poll
outputNL :: NewlineMode -> Newline
base System.IO GHC.IO.Handle GHC.IO.Handle.Types
the representation of newlines on output
outdegree :: Graph -> Array Vertex Int
containers Data.Graph
A table of the count of edges from each node.

Examples

outdegree (buildG (0,-1) []) == array (0,-1) []

outdegree (buildG (0,2) [(0,1), (1,2)]) == array (0,2) [(0,1),(1,1),(2,0)]
output :: Result -> String
QuickCheck Test.QuickCheck Test.QuickCheck Test.QuickCheck Test.QuickCheck
Printed output
outside :: forall (p :: Type -> Type -> Type) s t a b r . Representable p => APrism s t a b -> Lens (p t r) (p s r) (p b r) (p a r)
lens Control.Lens.Combinators Control.Lens.Prism
Use a Prism as a kind of first-class pattern. 
outside :: Prism s t a b -> Lens (t -> r) (s -> r) (b -> r) (a -> r)
outputSpeed :: TerminalAttributes -> BaudRate
unix System.Posix.Terminal