Hoogle Search
Within LTS Haskell 24.20 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
.! ) :: FromField a => Record -> Int -> Parser acsv-conduit Data.CSV.Conduit.Conversion Alias for index.
(
.: ) :: FromField a => NamedRecord -> ByteString -> Parser acsv-conduit Data.CSV.Conduit.Conversion Alias for lookup.
(
.= ) :: ToField a => ByteString -> a -> (ByteString, ByteString)csv-conduit Data.CSV.Conduit.Conversion Alias for namedField.
(
.= ) :: (KeyValue e kv, ToJSON v) => Key -> v -> kvede Text.EDE No documentation available.
(
.$ ) :: forall x (xs :: [Type]) . Show x => Predicate (x ': xs) -> (Var, x) -> Predicate xsfalsify Test.Falsify.Predicate Infix version of at Typical usage example:
assert $ P.relatedBy ("equiv", equiv) .$ ("x", x) .$ ("y", y)(
... ) :: (c -> d) -> (a -> b -> c) -> a -> b -> dfitspec Test.FitSpec.Utils Compose composed with compose operator.
(f ... g) x y === f (g x y)
(
.> ) :: (a -> b) -> (b -> c) -> a -> cflow Flow Left-associative compose operator. Read as "compose forward" or "and then". Use this to create long chains of computation that suggest which direction things move in.
>>> let f = succ .> recip .> negate >>> f 3 -0.25
Or use it anywhere you would use (>>>).\ x -> (f .> g) x == g (f x)
\ x -> (f .> g .> h) x == h (g (f x))
-
free-vl Control.Monad.Free.VanLaarhovenE Helper combinator for creating values of 'Effects effects m'
(
... ) :: a -> Proof p -> a ::: pgdp Data.Refined Given a value and a proof, attach the proof as a ghost proof on the value.
(
...> ) :: (a ::: p) -> (p -> Proof q) -> a ::: qgdp Data.Refined Apply an implication to the ghost proof attached to a value, leaving the value unchanged.