Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

  1. (>>=%) :: Monad (Flip t c) => t a c -> (a -> t b c) -> t b c

    type-flip Data.Type.Flip

    No documentation available.

  2. (-%-) :: Expr -> Expr -> Expr

    express Data.Express.Fixtures

    The % constructor lifted over Exprs. 

    > val (2 :: Integer) -%- val (3 :: Integer)
2 % 3 :: Ratio Integer
    This only accepts Exprs bound to the Integer type.

  3. (^%) :: forall (m :: Nat) a . (KnownNat m, Integral a) => Mod m -> a -> Mod m

    mod Data.Mod

    Drop-in replacement for ^ with much better performance. Negative powers are allowed, but may throw DivideByZero, if an argument is not coprime with the modulus. 

    >>> :set -XDataKinds

>>> 3 ^% 4 :: Mod 10    -- 3 ^ 4 = 81 ≡ 1 (mod 10)
1

>>> 3 ^% (-1) :: Mod 10 -- 3 * 7 = 21 ≡ 1 (mod 10)
7

>>> 4 ^% (-1) :: Mod 10 -- 4 and 10 are not coprime
(*** Exception: divide by zero

  4. (^%) :: forall (m :: Nat) a . (KnownNat m, Integral a) => Mod m -> a -> Mod m

    mod Data.Mod.Word

    Drop-in replacement for ^ with a bit better performance. Negative powers are allowed, but may throw DivideByZero, if an argument is not coprime with the modulus. 

    >>> :set -XDataKinds

>>> 3 ^% 4 :: Mod 10    -- 3 ^ 4 = 81 ≡ 1 (mod 10)
1

>>> 3 ^% (-1) :: Mod 10 -- 3 * 7 = 21 ≡ 1 (mod 10)
7

>>> 4 ^% (-1) :: Mod 10 -- 4 and 10 are not coprime
(*** Exception: divide by zero

  5. (^%) :: forall (m :: Nat) a . (KnownNat m, Integral a) => Mod m -> a -> Mod m

    arithmoi Math.NumberTheory.Moduli.Class

    Drop-in replacement for ^ with much better performance. Negative powers are allowed, but may throw DivideByZero, if an argument is not coprime with the modulus. 

    >>> :set -XDataKinds

>>> 3 ^% 4 :: Mod 10    -- 3 ^ 4 = 81 ≡ 1 (mod 10)
1

>>> 3 ^% (-1) :: Mod 10 -- 3 * 7 = 21 ≡ 1 (mod 10)
7

>>> 4 ^% (-1) :: Mod 10 -- 4 and 10 are not coprime
(*** Exception: divide by zero

  6. (<%) :: forall k l m u v a b (js :: IxList) (is :: IxList) s t . (JoinKinds k l m, IxOptic l u v a b, NonEmptyIndices js) => Optic k is s t u v -> Optic l js u v a b -> Optic m is s t a b

    optics-extra Optics.Indexed

    Compose two indexed optics and drop indices of the right one. (If you want to compose an indexed and a non-indexed optic, you can just use (%).) 

    >>> itoListOf (ifolded <% ifolded) ["foo", "bar"]
[(0,'f'),(0,'o'),(0,'o'),(1,'b'),(1,'a'),(1,'r')]

  7. (<%>) :: forall k l m s t a b (is :: IxList) i (js :: IxList) j u v . (JoinKinds k l m, IxOptic m s t a b, HasSingleIndex is i, HasSingleIndex js j) => Optic k is s t u v -> Optic l js u v a b -> Optic m (WithIx (i, j)) s t a b

    optics-extra Optics.Indexed

    Compose two indexed optics. Their indices are composed as a pair. 

    >>> itoListOf (ifolded <%> ifolded) ["foo", "bar"]
[((0,0),'f'),((0,1),'o'),((0,2),'o'),((1,0),'b'),((1,1),'a'),((1,2),'r')]

  8. (<%=) :: forall k b s m (is :: IxList) a . (PermeableOptic k b, MonadState s m) => Optic k is s s a b -> (a -> b) -> m (ViewResult k b)

    optics-extra Optics.State.Operators

    Modify the target of a PermeableOptic into your Monad's state by a user supplied function and return the result.

  9. (<<%=) :: forall k a s m (is :: IxList) b . (PermeableOptic k a, MonadState s m) => Optic k is s s a b -> (a -> b) -> m (ViewResult k a)

    optics-extra Optics.State.Operators

    Modify the target of a PermeableOptic into your Monad's state by a user supplied function and return the old value that was replaced.

  10. (&%) :: forall (tag :: Symbol) m n . (Sayable tag m, Pretty n) => m -> n -> Saying tag

    sayable Text.Sayable

    A helper operator allowing a Sayable item to be composed with a Pretty item into a Saying. This is infrequently used and primarily allows the composition of a data object which has a Prettyprinter instance but no Sayable instance. 

    >>> sez @"info" $ t'"hello" &% (t'"world", t'"!")
"hello (world, !)"

Page 34 of many | Previous | Next