Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
product3With :: (a -> b -> c -> d) -> [[a]] -> [[b]] -> [[c]] -> [[d]]extrapolate Test.Extrapolate Like productWith, but over 3 lists of tiers.
productMaybeWith :: (a -> b -> Maybe c) -> [[a]] -> [[b]] -> [[c]]extrapolate Test.Extrapolate Take the product of lists of tiers by a function returning a Maybe value discarding Nothing values.
products :: [[[a]]] -> [[[a]]]extrapolate Test.Extrapolate Takes the product of N lists of tiers, producing lists of length N. Alternatively, takes as argument a list of lists of tiers of elements; returns lists combining elements of each list of tiers.
products [xss] = mapT (:[]) xss products [xss,yss] = mapT (\(x,y) -> [x,y]) (xss >< yss) products [xss,yss,zss] = product3With (\x y z -> [x,y,z]) xss yss zss
product3With :: (a -> b -> c -> d) -> [[a]] -> [[b]] -> [[c]] -> [[d]]extrapolate Test.Extrapolate.Core Like productWith, but over 3 lists of tiers.
productMaybeWith :: (a -> b -> Maybe c) -> [[a]] -> [[b]] -> [[c]]extrapolate Test.Extrapolate.Core Take the product of lists of tiers by a function returning a Maybe value discarding Nothing values.
products :: [[[a]]] -> [[[a]]]extrapolate Test.Extrapolate.Core Takes the product of N lists of tiers, producing lists of length N. Alternatively, takes as argument a list of lists of tiers of elements; returns lists combining elements of each list of tiers.
products [xss] = mapT (:[]) xss products [xss,yss] = mapT (\(x,y) -> [x,y]) (xss >< yss) products [xss,yss,zss] = product3With (\x y z -> [x,y,z]) xss yss zss
-
grisette Grisette.Core Useful utility function for building merge strategies for product types manually. For example, to build the merge strategy for the following product type, one could write
data X = X { x1 :: Int, x2 :: Bool } product2Strategy X (\(X a b) -> (a, b)) rootStrategy rootStrategy :: MergingStrategy X -
grisette Grisette.Internal.Core.Data.Class.Mergeable Useful utility function for building merge strategies for product types manually. For example, to build the merge strategy for the following product type, one could write
data X = X { x1 :: Int, x2 :: Bool } product2Strategy X (\(X a b) -> (a, b)) rootStrategy rootStrategy :: MergingStrategy X productG :: Graph -> Graph -> Graphhgal Data.Graph.Construction No documentation available.
-
hledger-web Hledger.Web.Import No documentation available.