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.

Exact lookup

1. equals :: Doc

   prettyprinter-compat-wl-pprint	Text.PrettyPrint.Leijen

   No documentation available.

2. equal :: (Num prob, Eq prob, Ord a) => T prob a -> T prob a -> Bool

   probability	Numeric.Probability.Distribution

   No documentation available.

3. equalize :: a -> Seq (Seq a) -> Seq (Seq a)

   rainbox	Rainbox.Core

   Ensures that each inner Seq is the same length by adding the given empty element where needed.

4. equals :: IsString s => s

   string-combinators	Data.String.Combinators

   A '=' character.

5. equals :: forall (t :: Type -> Type) v m . BindingMonad t v m => UTerm t v -> UTerm t v -> m Bool

   unification-fd	Control.Unification

   Determine if two terms are structurally equal. This is essentially equivalent to (==) except that it does not require applying bindings before comparing, so it is more efficient. N.B., this function does not consider alpha-variance, and thus variables with different names are considered unequal. Cf., equiv.

6. equiv :: forall (t :: Type -> Type) v m . BindingMonad t v m => UTerm t v -> UTerm t v -> m (Maybe (IntMap Int))

   unification-fd	Control.Unification

   Determine if two terms are structurally equivalent; that is, structurally equal modulo renaming of free variables. Returns a mapping from variable IDs of the left term to variable IDs of the right term, indicating the renaming used.

7. equals :: forall (t :: Type -> Type) v m . BindingMonad t v m => UTerm t v -> UTerm t v -> m Bool

   unification-fd	Control.Unification.Ranked

   Determine if two terms are structurally equal. This is essentially equivalent to (==) except that it does not require applying bindings before comparing, so it is more efficient. N.B., this function does not consider alpha-variance, and thus variables with different names are considered unequal. Cf., equiv.

8. equiv :: forall (t :: Type -> Type) v m . BindingMonad t v m => UTerm t v -> UTerm t v -> m (Maybe (IntMap Int))

   unification-fd	Control.Unification.Ranked

   Determine if two terms are structurally equivalent; that is, structurally equal modulo renaming of free variables. Returns a mapping from variable IDs of the left term to variable IDs of the right term, indicating the renaming used.

9. equals :: Doc

   wl-pprint	Text.PrettyPrint.Leijen

   The document equals contains an equal sign, "=".

10. equalRegion :: Region -> Region -> IO Bool

    xmonad-contrib	XMonad.Config.Prime

    interface to the X11 library function XEqualRegion().

Page 132 of many | Previous | Next