Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. (.|) :: Strategy a -> Strategy a -> Strategy a

    LambdaHack Game.LambdaHack.Client.AI.Strategy

    Strategy with the actions from both argument strategies, with original frequencies.

  2. (.~~) :: (Backprop a, Backprop b, Reifies s W) => Lens' b a -> BVar s a -> BVar s b -> BVar s b

    backprop Numeric.Backprop

    An infix version of setVar, meant to evoke parallels to .~ from lens. With normal values, you can set something in a value with a lens:

    x & myLens .~ y
    
    would "set" a part of x :: b, specified by myLens :: Lens' a b, to a new value y :: a.
    xVar & myLens .~~ yVar
    
    would "set" a part of xVar :: BVar s b (a BVar holding a b), specified by myLens :: Lens' a b, to a new value given by yVar :: BVar s a. The result is a new (updated) value of type BVar s b. This is the main way to set values inside BVars of container types. Note that this does not incurr the performance overhead issues of viewVar and ^^., and is fairly cheap.

  3. (.~~) :: (Num a, Num b, Reifies s W) => Lens' b a -> BVar s a -> BVar s b -> BVar s b

    backprop Numeric.Backprop.Num

    .~~, but with Num constraints instead of Backprop constraints.

  4. (.&&.) :: VR -> VR -> VR

    cabal-install-solver Distribution.Solver.Modular.Version

    Intersect two version ranges.

  5. (.||.) :: VR -> VR -> VR

    cabal-install-solver Distribution.Solver.Modular.Version

    Union of two version ranges.

  6. (.|) :: forall (m :: Type -> Type) a b c r . Monad m => ConduitT a b m () -> ConduitT b c m r -> ConduitT a c m r

    classy-prelude-conduit ClassyPrelude.Conduit

    Combine two Conduits together into a new Conduit (aka fuse). Output from the upstream (left) conduit will be fed into the downstream (right) conduit. Processing will terminate when downstream (right) returns. Leftover data returned from the right Conduit will be discarded. Equivalent to fuse and =$=, however the latter is deprecated and will be removed in a future version. Note that, while this operator looks like categorical composition (from Control.Category), there are a few reasons it's different:

    • The position of the type parameters to ConduitT do not match. We would need to change ConduitT i o m r to ConduitT r m i o, which would preclude a Monad or MonadTrans instance.
    • The result value from upstream and downstream are allowed to differ between upstream and downstream. In other words, we would need the type signature here to look like ConduitT a b m r -> ConduitT b c m r -> ConduitT a c m r.
    • Due to leftovers, we do not have a left identity in Conduit. This can be achieved with the underlying Pipe datatype, but this is not generally recommended. See https://stackoverflow.com/a/15263700.

  7. (.=) :: Eq t => Lens s s t t -> FieldDescription t -> SectionSpec s ()

    config-ini Data.Ini.Config.Bidir

    Associate a field description with a field. If this field is not present when parsing, it will attempt to fall back on a default, and if no default value is present, it will fail to parse. When serializing an INI file, this will produce all the comments associated with the field description followed by the value of the field in the.

  8. (.=?) :: Eq t => Lens s s (Maybe t) (Maybe t) -> FieldDescription t -> SectionSpec s ()

    config-ini Data.Ini.Config.Bidir

    Associate a field description with a field of type "Maybe a". When parsing, this field will be initialized to Nothing if it is not found, and to a Just value if it is. When serializing an INI file, this will try to serialize a value

  9. (./) :: forall x (xs :: [Type]) . x -> Many xs -> Many (x ': xs)

    data-diverse Data.Diverse.Many

    Infix version of consMany. Mnemonic: Element on the left is smaller ./ than the larger Many to the right.

  10. (./) :: forall x (xs :: [Type]) . x -> Many xs -> Many (x ': xs)

    data-diverse Data.Diverse.Many.Internal

    Infix version of consMany. Mnemonic: Element on the left is smaller ./ than the larger Many to the right.

Page 34 of many | Previous | Next