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.

  1. type family ListSum (w :: [Type]) = (r :: Type) | r -> w

    witness Data.Type.Witness.Specific.List.Sum

    No documentation available.

  2. data ListSumType (wit :: Type -> Type) t

    witness Data.Type.Witness.Specific.List.Sum

    No documentation available.

  3. MkListSumType :: forall (wit :: Type -> Type) (lt :: [Type]) . ListType wit lt -> ListSumType wit (ListSum lt)

    witness Data.Type.Witness.Specific.List.Sum

    No documentation available.

  4. injectiveListSum :: forall (a :: [Type]) (b :: [Type]) . ListSum a ~ ListSum b => a :~: b

    witness Data.Type.Witness.Specific.List.Sum

    workaround for https://gitlab.haskell.org/ghc/ghc/issues/10833

  5. listSumEq :: forall w (t :: [Type]) . (forall a . () => w a -> Dict (Eq a)) -> ListType w t -> Dict (Eq (ListSum t))

    witness Data.Type.Witness.Specific.List.Sum

    No documentation available.

  6. listSumShow :: forall w (t :: [Type]) . (forall a . () => w a -> Dict (Show a)) -> ListType w t -> Dict (Show (ListSum t))

    witness Data.Type.Witness.Specific.List.Sum

    No documentation available.

  7. mapListSum :: forall w (t :: [Type]) . ListType w t -> (forall a . () => w a -> a -> a) -> ListSum t -> ListSum t

    witness Data.Type.Witness.Specific.List.Sum

    No documentation available.

  8. Consume :: (ByteString -> IO Result) -> Result

    zstd Codec.Compression.Zstd.Streaming

    Provide the function with more input for the streaming operation to continue. This function is ephemeral. You should call it exactly once, and discard it immediately after you call it. To signal the end of a stream of data, supply an empty input.

  9. type ArgumentConsumer a = String -> [String] -> a

    ALUT Sound.ALUT.Initialization

    No documentation available.

  10. asum :: Alternative m => [m a] -> m a

    Agda Agda.Utils.List

    A version of asum that avoids a final empty. It is right-folding just like asum. Precondition: the right-unit law holds, i.e. m | A.empty = m.

Page 187 of many | Previous | Next