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

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
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
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.

Show more results