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. eqpFreeN :: Actor -> Int

    LambdaHack Game.LambdaHack.Common.Actor

    No documentation available.

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

    LambdaHack Game.LambdaHack.Common.Actor

    No documentation available.

  3. eqVR :: Ver -> VR

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

    Version range fixing a single version.

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

    edit-distance-vector Data.Vector.Distance

    Are two values equivalent?

  5. 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).

  6. 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.

  7. equateAll :: MonadEquiv c v d m => [v] -> m ()

    equivalence Data.Equivalence.Monad

    This function equates the element in the given list. That is, it unions the equivalence classes of the elements and combines their descriptor.

  8. equivalent :: MonadEquiv c v d m => v -> v -> m Bool

    equivalence Data.Equivalence.Monad

    This function decides whether the two given elements are equivalent in the current equivalence relation.

  9. equate :: forall (m :: Type -> Type) a s c . (Monad m, Applicative m, Ord a) => Equiv s c a -> a -> a -> STT s m ()

    equivalence Data.Equivalence.STT

    This function equates the two given elements. That is, it unions the equivalence classes of the two elements and combines their descriptor.

  10. equateAll :: forall (m :: Type -> Type) a s c . (Monad m, Applicative m, Ord a) => Equiv s c a -> [a] -> STT s m ()

    equivalence Data.Equivalence.STT

    This function equates the element in the given list. That is, it unions the equivalence classes of the elements and combines their descriptor.

Page 111 of many | Previous | Next