Hoogle Search
Within LTS Haskell 24.5 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
equal :: forall a (t :: Language) . Eq a => Proxy a -> SumType t -> SumType tpurescript-bridge Language.PureScript.Bridge.SumType Ensure that an Eq instance is generated for your type.
eqOfLe :: POrder a => a -> a -> Boolrec-def Data.POrder The eqOfLe method checks _related_ elements for equality. Formally: For all x ⊑ y, eqOfLe x y == True iff x == y. This can be more efficient than testing for equality. For example for sets, (==) needs to compare the elements, but eqOfLe only needs to compare sizes. It is always ok to use (==) here.
-
shell-conduit Data.Conduit.Shell No documentation available.
equalFiles :: ProcessType r => rshell-conduit Data.Conduit.Shell No documentation available.
-
shell-conduit Data.Conduit.Shell.PATH No documentation available.
equalFiles :: ProcessType r => rshell-conduit Data.Conduit.Shell.PATH No documentation available.
equivalent :: License -> License -> Boolspdx Distribution.SPDX.Extra Check wheather two LicenseExpression are equivalent.
>>> unsafeParseExpr "(MIT AND GPL-2.0-only)" `equivalent` unsafeParseExpr "(GPL-2.0-only AND MIT)" True
>>> unsafeParseExpr "MIT" `equivalent` unsafeParseExpr "MIT OR BSD-3-Clause" False
-
srtree Algorithm.EqSat runs equality saturation from an expression tree, a given set of rules, and a cost function. Returns the tree with the smallest cost.
eqConstraintFunctions :: EqualityConstraint s v -> Constraint s vsrtree Algorithm.SRTree.NonlinearOpt No documentation available.
eqConstraintTolerance :: EqualityConstraint s v -> Doublesrtree Algorithm.SRTree.NonlinearOpt No documentation available.