Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
equivalentTo :: Ord o => Sig s1 o x -> Sig s2 o x -> RefinementProperty o xhunit-dejafu Test.HUnit.DejaFu Observational equivalence. True iff the result-set of the left expression is equal to the result-set of the right expression. The two signatures can have different state types, this lets you compare the behaviour of different data structures. The observation and seed types must match, however.
equalTo :: (Eq a, Show a) => a -> Filter a ()inbox Test.Inbox A filter that matches messages equal to the given one.
eqByName :: CNode a => a -> a -> Boollanguage-c Language.C.Data.Node equality by name
-
prettyprinter-compat-annotated-wl-pprint Text.PrettyPrint.Annotated.Leijen >>> equals =
-
prettyprinter-compat-wl-pprint Text.PrettyPrint.Leijen No documentation available.
equal :: (Num prob, Eq prob, Ord a) => T prob a -> T prob a -> Boolprobability Numeric.Probability.Distribution No documentation available.
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.
-
string-combinators Data.String.Combinators A '=' character.
equals :: forall (t :: Type -> Type) v m . BindingMonad t v m => UTerm t v -> UTerm t v -> m Boolunification-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.
-
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.