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

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.
unions :: [IntMap a] -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
The union of a list of maps. > unions [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])] > == fromList [(3, "b"), (5, "a"), (7, "C")] > unions [(fromList [(5, "A3"), (3, "B3")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "a"), (3, "b")])] > == fromList [(3, "B3"), (5, "A3"), (7, "C")]
unionsWith :: (a -> a -> a) -> [IntMap a] -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
The union of a list of maps, with a combining operation. > unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])] > == fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]
MkRose :: a -> [Rose a] -> Rose a
QuickCheck Test.QuickCheck.Property
unions :: Ord a => [Set a] -> Set a
containers Data.Set
The union of a list of sets: (unions == foldl union empty).
Node :: a -> Forest a -> Tree a
containers Data.Tree
getLPath :: Node -> LRTree a -> LPath a
fgl Data.Graph.Inductive.Internal.RootPath
Q :: (forall m. Quasi m => m a) -> Q a
template-haskell Language.Haskell.TH.Syntax
discardingRasterizer :: IO a -> IO a
OpenGL Graphics.Rendering.OpenGL.GL.PerFragment
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.
withSocketsDo :: IO a -> IO a
network Network.Socket.Internal, network Network.Socket, network Network
On Windows operating systems, the networking subsystem has to be initialised using withSocketsDo before any networking operations can be used. eg. > main = withSocketsDo $ do {...} Although this is only strictly necessary on Windows platforms, it is harmless on other platforms, so for portability it is good practice to use it all the time.
deleteMax :: IntMap a -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(min(n,W)). Delete the maximal key. Returns an empty map if the map is empty. Note that this is a change of behaviour for consistency with Map  versions prior to 0.5 threw an error if the IntMap was already empty.
deleteMin :: IntMap a -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(min(n,W)). Delete the minimal key. Returns an empty map if the map is empty. Note that this is a change of behaviour for consistency with Map  versions prior to 0.5 threw an error if the IntMap was already empty.
unQ :: Q a -> forall m. Quasi m => m a
template-haskell Language.Haskell.TH.Syntax
reverse :: Seq a -> Seq a
containers Data.Sequence
O(n). The reverse of a sequence.
deleteMax :: Set a -> Set a
containers Data.Set
O(log n). Delete the maximal element. Returns an empty set if the set is empty.
deleteMin :: Set a -> Set a
containers Data.Set
O(log n). Delete the minimal element. Returns an empty set if the set is empty.
normalizeHostHeader :: Request ty -> Request ty
HTTP Network.HTTP.Base
Deprecated: Please use Network.HTTP.Base.normalizeRequest instead
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
fsep :: [Doc] -> Doc
pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint
"Paragraph fill" version of sep.
fsep :: [Doc] -> Doc
template-haskell Language.Haskell.TH.PprLib
"Paragraph fill" version of sep
hcat :: [Doc] -> Doc
template-haskell Language.Haskell.TH.PprLib
List version of <>
hcat :: [Doc] -> Doc
pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint
List version of <>.
hsep :: [Doc] -> Doc
template-haskell Language.Haskell.TH.PprLib
List version of <+>
hsep :: [Doc] -> Doc
pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint
List version of <+>.
sep :: [Doc] -> Doc
pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint
Either hsep or vcat.
sep :: [Doc] -> Doc
template-haskell Language.Haskell.TH.PprLib
Either hsep or vcat
vcat :: [Doc] -> Doc
template-haskell Language.Haskell.TH.PprLib
List version of $$
vcat :: [Doc] -> Doc
pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint
List version of $$.
appsE :: [ExpQ] -> ExpQ
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
listE :: [ExpQ] -> ExpQ
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
tupE :: [ExpQ] -> ExpQ
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
unboxedTupE :: [ExpQ] -> ExpQ
template-haskell Language.Haskell.TH.Lib
listP :: [PatQ] -> PatQ
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
tupP :: [PatQ] -> PatQ
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
unboxedTupP :: [PatQ] -> PatQ
template-haskell Language.Haskell.TH.Lib
ext0 :: (Typeable a, Typeable b) => c a -> c b -> c a
syb Data.Generics.Aliases
Flexible type extension
ext1 :: (Data a, Typeable1 t) => c a -> (forall d. Data d => c (t d)) -> c a
syb Data.Generics.Aliases
Flexible type extension
censor :: MonadWriter w m => (w -> w) -> m a -> m a
mtl Control.Monad.Writer.Class, mtl Control.Monad.Writer.Lazy, mtl Control.Monad.Writer.Strict
censor f m is an action that executes the action m and applies the function f to its output, leaving the return value unchanged. *  f m = pass (liftM (\x -> > (x,f))  
local :: MonadReader r m => (r -> r) -> m a -> m a
mtl Control.Monad.Reader.Class, mtl Control.Monad.Reader
catchError :: MonadError e m => m a -> (e -> m a) -> m a
mtl Control.Monad.Error.Class, mtl Control.Monad.Error
qRecover :: Quasi m => m a -> m a -> m a
template-haskell Language.Haskell.TH.Syntax
above :: BlockTable a -> BlockTable a -> BlockTable a
html Text.Html.BlockTable
beside :: BlockTable a -> BlockTable a -> BlockTable a
html Text.Html.BlockTable
variant :: Integral n => n -> Gen a -> Gen a
QuickCheck Test.QuickCheck.Gen, QuickCheck Test.QuickCheck
Modifies a generator using an integer seed.
resize :: Int -> Gen a -> Gen a
QuickCheck Test.QuickCheck.Gen, QuickCheck Test.QuickCheck
Overrides the size parameter. Returns a generator which uses the given size instead of the runtime-size parameter.
suchThat :: Gen a -> (a -> Bool) -> Gen a
QuickCheck Test.QuickCheck.Gen, QuickCheck Test.QuickCheck
Generates a value that satisfies a predicate.
protect :: (AnException -> a) -> IO a -> IO a
QuickCheck Test.QuickCheck.Property
renderPrimitive :: PrimitiveMode -> IO a -> IO a
OpenGL Graphics.Rendering.OpenGL.GL.BeginEnd
Delimit the vertices that define a primitive or a group of like primitives. Only a subset of GL commands can be used in the delimited action: Those for specifying vertex coordinates (vertex, vertexv), vertex colors (color, colorv, secondaryColor, secondaryColorv, index, indexv), normal (normal, normalv), texture coordinates (texCoord, texCoordv, multiTexCoord, multiTexCoordv), and fog coordinates (fogCoord, fogCoordv). Additionally, evalPoint1, evalPoint2, evalCoord1, evalCoord1v, evalCoord2, evalCoord2v, materialAmbient, materialDiffuse, materialAmbientAndDiffuse, materialSpecular, materialEmission, materialShininess, callList, callLists, and setting edgeFlag are allowed. Writing the respective state variables is allowed in the delimited action, too. Regardless of the chosen PrimitiveMode, there is no limit to the number of vertices that can be defined during a single renderPrimitive. Lines, triangles, quadrilaterals, and polygons that are incompletely specified are not drawn. Incomplete specification results when either too few vertices are provided to specify even a single primitive or when an incorrect multiple of vertices is specified. The incomplete primitive is ignored; the rest are drawn. The minimum specification of vertices for each primitive is as follows: 1 for a point, 2 for a line, 3 for a triangle, 4 for a quadrilateral, and 3 for a polygon. Modes that require a certain multiple of vertices are Lines (2), Triangles (3), Quads (4), and QuadStrip (2).
unsafeRenderPrimitive :: PrimitiveMode -> IO a -> IO a
OpenGL Graphics.Rendering.OpenGL.GL.BeginEnd
A more efficient, but potentially dangerous version of renderPrimitive: The given action is not allowed to throw an exception.
withName :: Name -> IO a -> IO a
OpenGL Graphics.Rendering.OpenGL.GL.Selection
preservingAttrib :: [ServerAttributeGroup] -> IO a -> IO a
OpenGL Graphics.Rendering.OpenGL.GL.SavingState
preservingClientAttrib :: [ClientAttributeGroup] -> IO a -> IO a
OpenGL Graphics.Rendering.OpenGL.GL.SavingState
catchIO :: IO a -> (IOException -> IO a) -> IO a
HTTP Network.HTTP.Base
catchIO a h handles IO action exceptions throughout codebase; version-specific tweaks better go here.
catchIO_ :: IO a -> IO a -> IO a
HTTP Network.HTTP.Base

Show more results