Hoogle Search
Within LTS Haskell 24.52 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
partialord Data.PartialOrd A data type representing relationships between two objects in a poset: they can be related (by EQ', LT' or GT'; like EQ, LT or GT), or unrelated (NT').
-
partialord Data.PartialOrd Maps partially ordered for pointwise comparison, where empty values are considered minimal. This is commonplace, but by no means the only conceivably ordering on Map.
PointwisePositive :: Map k v -> PointwisePositive k vpartialord Data.PartialOrd No documentation available.
-
partialord Data.PartialOrd Lists partially ordered by prefix inclusion
-
partialord Data.PartialOrd No documentation available.
-
Implements "patience diff" and the patience algorithm for the longest increasing subsequence problem.
-
Standard PCG Random Number Generator with chosen streams. See http://www.pcg-random.org for details.
import Control.Monad.ST import System.Random.PCG three :: [Double] three = runST $ do g <- create a <- uniform g b <- uniform g c <- uniform g return [a,b,c]
module System.Random.PCG.Fast.
Pure Experimental pure haskell version of the fast variant of the PCG random number generator. This module can perform faster than the c bindings version, especially for parallel code. See http://www.pcg-random.org for details.
import Control.Monad.ST import System.Random.PCG.Fast.Pure three :: [Double] three = runST $ do g <- create a <- uniform g b <- uniform g c <- uniform g return [a,b,c]
-
Standard PCG Random Number Generator with chosen streams, written in pure haskell. See http://www.pcg-random.org for details.
import Control.Monad.ST import System.Random.PCG.Pure three :: [Double] three = runST $ do g <- create a <- uniform g b <- uniform g c <- uniform g return [a,b,c]
module Pdf.Content.Encoding.
PdfDoc No documentation available.