Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. (.:?) :: FromJSON a => Object -> Key -> Parser (Maybe a)

   gogol-core	Gogol.Data.JSON

   Retrieve the value associated with the given key of an Object. The result is Nothing if the key is not present or if its value is Null, or empty if the value cannot be converted to the desired type. This accessor is most useful if the key and value can be absent from an object without affecting its validity. If the key and value are mandatory, use .: instead.

2. (.=) :: (KeyValue e kv, ToJSON v) => Key -> v -> kv

   gogol-core	Gogol.Data.JSON

   No documentation available.

3. (.~) :: ASetter s t a b -> b -> s -> t

   microlens	Lens.Micro

   (.~) assigns a value to the target. It's the same thing as using (%~) with const:

   l .~ x = l %~ const x
   

   See set if you want a non-operator synonym. Here it is used to change 2 fields of a 3-tuple:

   >>> (0,0,0) & _1 .~ 1 & _3 .~ 3
   (1,0,3)
   

4. (.#) :: Coercible b a => (b -> c) -> (a -> b) -> a -> c

   microlens	Lens.Micro.Internal

   No documentation available.

5. (.#) :: forall a b c q . (Profunctor p, Coercible b a) => p b c -> q a b -> p a c

   profunctors	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
   

6. (.>>) :: Biapply p => p a b -> p c d -> p c d

   semigroupoids	Data.Bifunctor.Apply

   a .> b ≡ const id <$> a <.> b
   

7. (.>) :: Apply f => f a -> f b -> f b

   semigroupoids	Data.Functor.Apply

   a .> b = const id <$> a <.> b
   

8. (.>) :: Apply f => f a -> f b -> f b

   semigroupoids	Data.Functor.Bind

   a .> b = const id <$> a <.> b
   

9. (.>) :: Apply f => f a -> f b -> f b

   semigroupoids	Data.Functor.Bind.Class

   a .> b = const id <$> a <.> b
   

10. (.>>) :: Biapply p => p a b -> p c d -> p c d

    semigroupoids	Data.Functor.Bind.Class

    a .> b ≡ const id <$> a <.> b
    

Page 9 of many | Previous | Next