Alternative f => [f a] -> f a -base
Randomly uses one of the given generators. The input list must be non-empty.
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")]
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")]
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.
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.
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.
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.
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.
O(n). The reverse of a sequence.
O(log n). Delete the maximal element.
O(log n). Delete the minimal element.
Join path elements back together.
> Valid x => joinPath (splitPath x) == x
> joinPath [] == ""
> Posix: joinPath ["test","file","path"] == "test/file/path"
Either hcat or vcat
"Paragraph fill" version of cat.
"Paragraph fill" version of cat
"Paragraph fill" version of sep.
"Paragraph fill" version of sep
Either hsep or vcat
Flexible type extension
Flexible type extension
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))
Modifies a generator using an integer seed.
Overrides the size parameter. Returns a generator which uses the given size instead of the runtime-size parameter.
Generates a value that satisfies a predicate.
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).
A more efficient, but potentially dangerous version of renderPrimitive: The given action is not allowed to throw an exception.
catchIO a h handles IO action exceptions throughout codebase; version-specific tweaks better go here.
O(n). Filter all values that satisfy some predicate.
> filter (> "a") (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
> filter (> "x") (fromList [(5,"a"), (3,"b")]) == empty
> filter (< "a") (fromList [(5,"a"), (3,"b")]) == empty
O(log n). Update the value at the maximal key.
> updateMax (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "Xa")]
> updateMax (\ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
O(min(n,W)). Update the value at the maximal key.
> updateMax (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "Xa")]
> updateMax (\ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
Show more results