Hoogle Search
Within LTS Haskell 24.58 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
*** ) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')basic-prelude CorePrelude Split the input between the two argument arrows and combine their output. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.
(
*** ) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')classy-prelude ClassyPrelude Split the input between the two argument arrows and combine their output. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.
(
*** ) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')essence-of-live-coding LiveCoding Split the input between the two argument arrows and combine their output. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.
(
*** ) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')rebase Rebase.Prelude Split the input between the two argument arrows and combine their output. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.
-
rhine FRP.Rhine.SN.Combinators Compose two signal networks on the same clock in data-parallel. At one tick of cl, both networks are stepped.
(
*** ) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')base-prelude BasePrelude Split the input between the two argument arrows and combine their output. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.
-
beam-core Database.Beam.Query No documentation available.
(
*** ) :: (a -> b) -> (c -> d) -> (a, c) -> (b, d)speculate Test.Speculate.Utils No documentation available.
(
*** ) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')synthesizer-dimensional Synthesizer.Dimensional.Causal.Process Split the input between the two argument arrows and combine their output. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.
(
*** ) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')LambdaHack Game.LambdaHack.Core.Prelude Split the input between the two argument arrows and combine their output. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.