Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. (%%%%%) :: (Show a, Show b, Show c, Show d, Show e) => String -> (a, b, c, d, e) -> String

    percent-format Text.PercentFormat

    Formats five values into a string without finalizing.

  2. (%%%%%%) :: (Show a, Show b, Show c, Show d, Show e, Show f) => String -> (a, b, c, d, e, f) -> String

    percent-format Text.PercentFormat

    Formats six values into a string without finalizing.

  3. (%:>) :: Parser a -> PStruct (a -> b) -> PStruct b

    servant-cli Servant.CLI.Internal.PStruct

    Add a request body to all endpoints. If done more than once per endpoint, it runs *both* parsers; however, we can only send one request body, so this is undefined behavior as a client.

  4. (%!!) :: forall (f :: Type -> Type) (n :: Nat) c . (CFoldable f, Dom f c) => Sized f n c -> Ordinal n -> c

    sized Data.Sized

    Safe indexing with Ordinals. Since 0.7.0.0

  5. (%|) :: Moddable a => Pattern a -> Pattern a -> Pattern a

    tidal Sound.Tidal.Boot

    No documentation available.

  6. (%<=?) :: forall (m :: Nat) (n :: Nat) p q . (KnownNat m, KnownNat n) => p m -> q n -> m :<=? n

    typelits-witnesses GHC.TypeLits.Compare

    Compare m and n, classifying their relationship into some constructor of :<=?.

  7. (%*) :: forall (n :: Nat) (m :: Nat) . SNat n -> SNat m -> SNat (n * m)

    typelits-witnesses GHC.TypeLits.Witnesses

    Multiplication of SNats. This also will provide the correct KnownNat instance for SNat (n * m), so can be used as a way to "multiply" KnownNat instances. This stands in for the function with the same name from Data.Singletons.Prelude.Num.

  8. (%+) :: forall (n :: Nat) (m :: Nat) . SNat n -> SNat m -> SNat (n + m)

    typelits-witnesses GHC.TypeLits.Witnesses

    Addition of SNats. This also will provide the correct KnownNat instance for SNat (n + m), so can be used as a way to "add" KnownNat instances. This stands in for the function with the same name from Data.Singletons.Prelude.Num.

  9. (%-) :: forall (n :: Nat) (m :: Nat) . SNat n -> SNat m -> SNat (n - m)

    typelits-witnesses GHC.TypeLits.Witnesses

    Subtraction of SNats. Note that this is unsafe, as will trigger a run-time underflow if m is bigger than n even though it will always succeed at compiletime. This also will provide the correct KnownNat instance for SNat (n - m), so can be used as a way to "subtract" KnownNat instances. This stands in for the function with the same name from Data.Singletons.Prelude.Num.

  10. (%<=?) :: forall (n :: Nat) (m :: Nat) . SNat n -> SNat m -> n :<=? m

    typelits-witnesses GHC.TypeLits.Witnesses

    Compare n and m, categorizing them into one of the constructors of :<=?.

Page 25 of many | Previous | Next