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

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")]
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
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. An error is thrown if the IntMap is already empty. Note, this is not the same behavior Map.
deleteMin :: IntMap a -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(min(n,W)). Delete the minimal key. An error is thrown if the IntMap is already empty. Note, this is not the same behavior Map.
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.
deleteMin :: Set a -> Set a
containers Data.Set
O(log n). Delete the minimal element.
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
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

Show more results