Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. gsumConToSchema :: forall (c :: Meta) (f :: Type -> Type) . (GToSchema (C1 c f), Constructor c) => SchemaOptions -> Proxy (C1 c f) -> Declare (Definitions Schema) [(Text, Referenced Schema)]

   openapi3	Data.OpenApi.Internal.Schema

   No documentation available.

2. gsumConToSchemaWith :: forall (c :: Meta) (f :: Type -> Type) . (GToSchema (C1 c f), Constructor c) => Maybe (Referenced Schema) -> SchemaOptions -> Proxy (C1 c f) -> (Text, Referenced Schema)

   openapi3	Data.OpenApi.Internal.Schema

   Convert one component of the sum to schema, to be later combined with oneOf.

3. gsumToSchema :: GSumToSchema f => SchemaOptions -> Proxy f -> WriterT AllNullary (Declare (Definitions Schema)) [(Text, Referenced Schema)]

   openapi3	Data.OpenApi.Internal.Schema

   No documentation available.

4. class HasSummary s a | s -> a

   openapi3	Data.OpenApi.Lens

   No documentation available.

5. asum :: (Foldable t, Alternative f) => t (f a) -> f a

   protolude	Protolude

   The sum of a collection of actions using (<|>), generalizing concat. asum is just like msum, but generalised to Alternative.

   Examples

   Basic usage:

   >>> asum [Just "Hello", Nothing, Just "World"]
   Just "Hello"
   

6. msum :: (Foldable t, MonadPlus m) => t (m a) -> m a

   protolude	Protolude

   The sum of a collection of actions using (<|>), generalizing concat. msum is just like asum, but specialised to MonadPlus.

   Examples

   Basic usage, using the MonadPlus instance for Maybe:

   >>> msum [Just "Hello", Nothing, Just "World"]
   Just "Hello"
   

7. unboxedSumNameDegree_maybe :: Name -> Maybe Int

   th-desugar	Language.Haskell.TH.Desugar

   Extract the degree of an unboxed sum Name. In addition to recognizing unboxed sum syntax (e.g., ''()), this also recognizes ''SumN# (for unboxed N-ary sum type constructors). In recent versions of GHC, ''Sum2# is a synonym for ''(), ''Sum3# is a synonym for ''(), and so on. As a result, we must check for ''SumN# in unboxedSumNameDegree_maybe to be thorough.

8. combineSum :: forall (n :: Nat) (m :: Nat) . KnownNat n => Either (Finite n) (Finite m) -> Finite (n + m)

   finite-typelits	Data.Finite

   Left-biased (left values come first) disjoint union of finite sets.

9. separateSum :: forall (n :: Nat) (m :: Natural) . KnownNat n => Finite (n + m) -> Either (Finite n) (Finite m)

   finite-typelits	Data.Finite

   Take a Left-biased disjoint union apart.

10. combineSum :: forall (n :: Nat) (m :: Natural) a . (SaneIntegral a, KnownIntegral a n, Limited a (n + m)) => Either (Finite a n) (Finite a m) -> Finite a (n + m)

    finite-typelits	Data.Finite.Integral

    Left-biased (left values come first) disjoint union of finite sets.

Page 126 of many | Previous | Next