Alternative f => [f a] -> f a -containers -base -network

oneof :: [Gen a] -> Gen a

QuickCheck Test.QuickCheck.Gen, QuickCheck Test.QuickCheck

Randomly uses one of the given generators. The input list must be non-empty.

MkRose :: a -> [Rose a] -> Rose a

QuickCheck Test.QuickCheck.Property

getLPath :: Node -> LRTree a -> LPath a

fgl Data.Graph.Inductive.Internal.RootPath

preservingMatrix :: IO a -> IO a

OpenGL Graphics.Rendering.OpenGL.GL.CoordTrans

Push the current matrix stack down by one, duplicating the current matrix, excute the given action, and pop the current matrix stack, replacing the current matrix with the one below it on the stack (i.e. restoring it to its previous state). The returned value is that of the given action. Note that a round-trip to the server is probably required. For a more efficient version, see unsafePreservingMatrix.

unsafePreservingMatrix :: IO a -> IO a

OpenGL Graphics.Rendering.OpenGL.GL.CoordTrans

A more efficient, but potentially dangerous version of preservingMatrix: The given action is not allowed to throw an exception or change the current matrix mode permanently.

normalizeHostHeader :: Request ty -> Request ty

HTTP Network.HTTP.Base

joinPath :: [FilePath] -> FilePath

filepath System.FilePath.Windows, filepath System.FilePath.Posix

Join path elements back together. > Valid x => joinPath (splitPath x) == x > joinPath [] == "" > Posix: joinPath ["test","file","path"] == "test/file/path"

cat :: [Doc] -> Doc

pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint

Either hcat or vcat.

cat :: [Doc] -> Doc

template-haskell Language.Haskell.TH.PprLib

Either hcat or vcat

fcat :: [Doc] -> Doc

pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint

"Paragraph fill" version of cat.

fcat :: [Doc] -> Doc

template-haskell Language.Haskell.TH.PprLib

"Paragraph fill" version of cat