Hoogle Search
Within LTS Haskell 24.10 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
.# ) :: Coercible b a => (b -> c) -> (a -> b) -> a -> cmicrolens Lens.Micro.Internal No documentation available.
(
.# ) :: forall a b c q . (Profunctor p, Coercible b a) => p b c -> q a b -> p a cprofunctors Data.Profunctor.Unsafe Strictly map the first argument argument contravariantly with a function that is assumed operationally to be a cast, such as a newtype constructor. Note: This operation is explicitly unsafe since an implementation may choose to use unsafeCoerce to implement this combinator and it has no way to validate that your function meets the requirements. If you implement this combinator with unsafeCoerce, then you are taking upon yourself the obligation that you don't use GADT-like tricks to distinguish values. If you import Data.Profunctor.Unsafe you are taking upon yourself the obligation that you will only call this with a second argument that is operationally identity.
(.#) ≡ \p -> p `seq` \f -> lmap coerce p
(
.>> ) :: Biapply p => p a b -> p c d -> p c dsemigroupoids Data.Bifunctor.Apply a .> b ≡ const id <$> a <.> b
(
.> ) :: Apply f => f a -> f b -> f bsemigroupoids Data.Functor.Apply a .> b = const id <$> a <.> b
(
.> ) :: Apply f => f a -> f b -> f bsemigroupoids Data.Functor.Bind a .> b = const id <$> a <.> b
(
.> ) :: Apply f => f a -> f b -> f bsemigroupoids Data.Functor.Bind.Class a .> b = const id <$> a <.> b
(
.>> ) :: Biapply p => p a b -> p c d -> p c dsemigroupoids Data.Functor.Bind.Class a .> b ≡ const id <$> a <.> b
(
.<<. ) :: Bits a => a -> Int -> abase-compat Data.Bits.Compat Infix version of shiftL.
(
.>>. ) :: Bits a => a -> Int -> abase-compat Data.Bits.Compat Infix version of shiftR.
(
.^. ) :: Bits a => a -> a -> abase-compat Data.Bits.Compat Infix version of xor.