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. equivalent :: License -> License -> Bool

    spdx 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
    

  2. eqSat :: forall (m :: Type -> Type) . Monad m => Fix SRTree -> [Rule] -> CostFun -> Int -> EGraphST m (Fix SRTree)

    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.

  3. eqConstraintFunctions :: EqualityConstraint s v -> Constraint s v

    srtree Algorithm.SRTree.NonlinearOpt

    No documentation available.

  4. eqConstraintTolerance :: EqualityConstraint s v -> Double

    srtree Algorithm.SRTree.NonlinearOpt

    No documentation available.

  5. eqBy :: (IsStream t, Monad m) => (a -> b -> Bool) -> t m a -> t m b -> m Bool

    streamly Streamly.Internal.Data.Stream.IsStream

    Compare two streams for equality using an equality function.

  6. eqBy :: (IsStream t, Monad m) => (a -> b -> Bool) -> t m a -> t m b -> m Bool

    streamly Streamly.Prelude

    Compare two streams for equality using an equality function.

  7. eqStruct :: Struct t => t s -> t s -> Bool

    structs Data.Struct

    No documentation available.

  8. eqStruct :: Struct t => t s -> t s -> Bool

    structs Data.Struct.Internal

    No documentation available.

  9. equivalenceClasses :: Label lb => LabelMap lb -> Set lb -> [EquivalenceClass lb]

    swish Swish.GraphMatch

    Return the equivalence classes of the supplied nodes using the label map.

  10. equivalentTo :: Ord o => Sig s1 o x -> Sig s2 o x -> RefinementProperty o x

    tasty-dejafu Test.Tasty.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.

Page 128 of many | Previous | Next