Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

1. type Consume s = s -> ByteString -> Either s (ByteString, ByteString)

   binary	Data.Binary.Get.Internal

   No documentation available.

2. absentSumFieldError :: a

   ghc-prim	GHC.Prim.Panic

   Closure introduced by GHC.Stg.Unarise for unused unboxed sum fields. See Note [aBSENT_SUM_FIELD_ERROR_ID] in GHC.Core.Make

3. asumOf :: Alternative f => Getting (Endo (f a)) s (f a) -> s -> f a

   lens	Control.Lens.Combinators

   The sum of a collection of actions, generalizing concatOf.

   >>> asumOf both ("hello","world")
   "helloworld"
   

   >>> asumOf each (Nothing, Just "hello", Nothing)
   Just "hello"
   

   asum ≡ asumOf folded
   

   asumOf :: Alternative f => Getter s (f a)     -> s -> f a
   asumOf :: Alternative f => Fold s (f a)       -> s -> f a
   asumOf :: Alternative f => Lens' s (f a)      -> s -> f a
   asumOf :: Alternative f => Iso' s (f a)       -> s -> f a
   asumOf :: Alternative f => Traversal' s (f a) -> s -> f a
   asumOf :: Alternative f => Prism' s (f a)     -> s -> f a
   

4. msumOf :: MonadPlus m => Getting (Endo (m a)) s (m a) -> s -> m a

   lens	Control.Lens.Combinators

   The sum of a collection of actions, generalizing concatOf.

   >>> msumOf both ("hello","world")
   "helloworld"
   

   >>> msumOf each (Nothing, Just "hello", Nothing)
   Just "hello"
   

   msum ≡ msumOf folded
   

   msumOf :: MonadPlus m => Getter s (m a)     -> s -> m a
   msumOf :: MonadPlus m => Fold s (m a)       -> s -> m a
   msumOf :: MonadPlus m => Lens' s (m a)      -> s -> m a
   msumOf :: MonadPlus m => Iso' s (m a)       -> s -> m a
   msumOf :: MonadPlus m => Traversal' s (m a) -> s -> m a
   msumOf :: MonadPlus m => Prism' s (m a)     -> s -> m a
   

5. asumOf :: Alternative f => Getting (Endo (f a)) s (f a) -> s -> f a

   lens	Control.Lens.Fold

   The sum of a collection of actions, generalizing concatOf.

   >>> asumOf both ("hello","world")
   "helloworld"
   

   >>> asumOf each (Nothing, Just "hello", Nothing)
   Just "hello"
   

   asum ≡ asumOf folded
   

   asumOf :: Alternative f => Getter s (f a)     -> s -> f a
   asumOf :: Alternative f => Fold s (f a)       -> s -> f a
   asumOf :: Alternative f => Lens' s (f a)      -> s -> f a
   asumOf :: Alternative f => Iso' s (f a)       -> s -> f a
   asumOf :: Alternative f => Traversal' s (f a) -> s -> f a
   asumOf :: Alternative f => Prism' s (f a)     -> s -> f a
   

6. msumOf :: MonadPlus m => Getting (Endo (m a)) s (m a) -> s -> m a

   lens	Control.Lens.Fold

   The sum of a collection of actions, generalizing concatOf.

   >>> msumOf both ("hello","world")
   "helloworld"
   

   >>> msumOf each (Nothing, Just "hello", Nothing)
   Just "hello"
   

   msum ≡ msumOf folded
   

   msumOf :: MonadPlus m => Getter s (m a)     -> s -> m a
   msumOf :: MonadPlus m => Fold s (m a)       -> s -> m a
   msumOf :: MonadPlus m => Lens' s (m a)      -> s -> m a
   msumOf :: MonadPlus m => Iso' s (m a)       -> s -> m a
   msumOf :: MonadPlus m => Traversal' s (m a) -> s -> m a
   msumOf :: MonadPlus m => Prism' s (m a)     -> s -> m a
   

7. prismSum :: APrism s t a b -> APrism s t c d -> Prism s t (Either a c) (Either b d)

   lens	Control.Lens.Unsound

   A dual of lensProduct: a prism sum. The law

   preview l (review l b) ≡ Just b
   

   breaks with

   >>> let badPrism :: Prism' (Maybe Char) (Either Char Char); badPrism = prismSum _Just _Just
   
   >>> preview badPrism (review badPrism (Right 'x'))
   Just (Left 'x')
   

   We put in Right value, but get back Left. Are you looking for without?

8. _UnboxedSumE :: Prism' Exp (Exp, SumAlt, SumArity)

   lens	Language.Haskell.TH.Lens

   No documentation available.

9. _UnboxedSumP :: Prism' Pat (Pat, SumAlt, SumArity)

   lens	Language.Haskell.TH.Lens

   No documentation available.

10. _UnboxedSumT :: Prism' Type SumArity

    lens	Language.Haskell.TH.Lens

    No documentation available.

Page 81 of many | Previous | Next