Hoogle Search

Within LTS Haskell 24.22 (ghc-9.10.3)

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

Exact lookup

1. (<&&>) :: Applicative f => f Bool -> f Bool -> f Bool

   ghc	GHC.Utils.Misc

   No documentation available.

2. (:&=) :: forall obj info (attr :: Symbol) (tag :: AttrOpTag) b . (HasAttributeList obj, info ~ ResolveAttribute attr obj, AttrInfo info, AttrBaseTypeConstraint info obj, AttrOpAllowed tag info obj, AttrTransferTypeConstraint info b, AttrSetTypeConstraint info (AttrTransferType info)) => AttrLabelProxy attr -> b -> AttrOp obj tag

   haskell-gi-base	Data.GI.Base

   Assign a value to an attribute, allocating any necessary memory for representing the Haskell value as a C value. Note that it is the responsibility of the caller to make sure that the memory is freed when no longer used, otherwise there will be a memory leak. In the majority of cases you probably want to use := instead, which has no potential memory leaks (at the cost of sometimes requiring some explicit Haskell -> C marshalling).

3. (:&=) :: forall obj info (attr :: Symbol) (tag :: AttrOpTag) b . (HasAttributeList obj, info ~ ResolveAttribute attr obj, AttrInfo info, AttrBaseTypeConstraint info obj, AttrOpAllowed tag info obj, AttrTransferTypeConstraint info b, AttrSetTypeConstraint info (AttrTransferType info)) => AttrLabelProxy attr -> b -> AttrOp obj tag

   haskell-gi-base	Data.GI.Base.Attributes

   Assign a value to an attribute, allocating any necessary memory for representing the Haskell value as a C value. Note that it is the responsibility of the caller to make sure that the memory is freed when no longer used, otherwise there will be a memory leak. In the majority of cases you probably want to use := instead, which has no potential memory leaks (at the cost of sometimes requiring some explicit Haskell -> C marshalling).

4. (:&=) :: forall obj info (attr :: Symbol) (tag :: AttrOpTag) b . (HasAttributeList obj, info ~ ResolveAttribute attr obj, AttrInfo info, AttrBaseTypeConstraint info obj, AttrOpAllowed tag info obj, AttrTransferTypeConstraint info b, AttrSetTypeConstraint info (AttrTransferType info)) => AttrLabelProxy attr -> b -> AttrOp obj tag

   haskell-gi-base	Data.GI.Base.ShortPrelude

   Assign a value to an attribute, allocating any necessary memory for representing the Haskell value as a C value. Note that it is the responsibility of the caller to make sure that the memory is freed when no longer used, otherwise there will be a memory leak. In the majority of cases you probably want to use := instead, which has no potential memory leaks (at the cost of sometimes requiring some explicit Haskell -> C marshalling).

5. (%&) :: forall k (is :: IxList) s t a b l (js :: IxList) s' t' a' b' . Optic k is s t a b -> (Optic k is s t a b -> Optic l js s' t' a' b') -> Optic l js s' t' a' b'

   optics-core	Optics.Internal.Optic

   Flipped function application, specialised to optics and binding tightly. Useful for post-composing optics transformations:

   >>> toListOf (ifolded %& ifiltered (\i s -> length s <= i)) ["", "a","abc"]
   ["","a"]
   

6. (%&) :: forall k (is :: IxList) s t a b l (js :: IxList) s' t' a' b' . Optic k is s t a b -> (Optic k is s t a b -> Optic l js s' t' a' b') -> Optic l js s' t' a' b'

   optics-core	Optics.Optic

   Flipped function application, specialised to optics and binding tightly. Useful for post-composing optics transformations:

   >>> toListOf (ifolded %& ifiltered (\i s -> length s <= i)) ["", "a","abc"]
   ["","a"]
   

7. (<&>) :: Functor f => f a -> (a -> b) -> f b

   optics-core	Optics.Optic

   Flipped version of <$>.

   (<&>) = flip fmap
   

   Examples

   Apply (+1) to a list, a Just and a Right:

   >>> Just 2 <&> (+1)
   Just 3
   

   >>> [1,2,3] <&> (+1)
   [2,3,4]
   

   >>> Right 3 <&> (+1)
   Right 4
   

8. (:&:) :: Selector -> Selector -> Selector

   markdown-unlit	Text.Markdown.Unlit

   No documentation available.

9. (<&>) :: Functor f => f a -> (a -> b) -> f b

   rio	RIO.Prelude

   Flipped version of <$>.

   (<&>) = flip fmap
   

   Examples

   Apply (+1) to a list, a Just and a Right:

   >>> Just 2 <&> (+1)
   Just 3
   

   >>> [1,2,3] <&> (+1)
   [2,3,4]
   

   >>> Right 3 <&> (+1)
   Right 4
   

10. data a :& b

    diagrams-lib	Diagrams.Coordinates

    A pair of values, with a convenient infix (left-associative) data constructor.

Page 28 of many | Previous | Next