Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. eqpOverfull :: Actor -> Int -> Bool

   LambdaHack	Game.LambdaHack.Common.Actor

   No documentation available.

2. eqVR :: Ver -> VR

   cabal-install-solver	Distribution.Solver.Modular.Version

   Version range fixing a single version.

3. eq# :: forall (n :: Nat) . KnownNat n => BitVector n -> BitVector n -> Bool

   clash-prelude	Clash.Sized.Internal.BitVector

   No documentation available.

4. eq## :: Bit -> Bit -> Bool

   clash-prelude	Clash.Sized.Internal.BitVector

   No documentation available.

5. eq# :: forall (n :: Nat) . Index n -> Index n -> Bool

   clash-prelude	Clash.Sized.Internal.Index

   No documentation available.

6. eq# :: forall (n :: Nat) . Signed n -> Signed n -> Bool

   clash-prelude	Clash.Sized.Internal.Signed

   No documentation available.

7. eq# :: forall (n :: Nat) . Unsigned n -> Unsigned n -> Bool

   clash-prelude	Clash.Sized.Internal.Unsigned

   No documentation available.

8. equivalent :: Params v o c -> v -> v -> Bool

   edit-distance-vector	Data.Vector.Distance

   Are two values equivalent?

9. package equivalence

   Maintaining an equivalence relation implemented as union-find using STT. This is an implementation of Tarjan's Union-Find algorithm (Robert E. Tarjan. "Efficiency of a Good But Not Linear Set Union Algorithm", JACM 22(2), 1975) in order to maintain an equivalence relation. This implementation is a port of the union-find package using the ST monad transformer (instead of the IO monad).

10. equate :: MonadEquiv c v d m => v -> v -> m ()

    equivalence	Data.Equivalence.Monad

    This function equates the given two elements. That is it unions the equivalence classes of the two elements.

Page 111 of many | Previous | Next