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. Equal :: PartialOrdering

   radix-tree	Data.Radix1Tree.Word8.Strict

2. Equal :: PartialOrdering

   radix-tree	Data.RadixTree.Word8.Lazy

3. Equal :: PartialOrdering

   radix-tree	Data.RadixTree.Word8.Strict

4. Equal :: PartialOrdering

   radix-tree	Data.Zebra.Word

5. Equal :: Relation

   rampart	Rampart

   Interval x is equal to Interval y.

   lesser x == lesser y &&
   greater x == greater y
   

   +---+
   | x |
   +---+
   +---+
   | y |
   +---+
   

6. module Algorithm.EqSat

   Equality Saturation for SRTree Heavily based on hegg (https:/github.comalt-romes/hegg by alt-romes)

7. data EqualityConstraint s v

   srtree	Algorithm.SRTree.NonlinearOpt

   An equality constraint, comprised of both the constraint function (or functions, if a preconditioner is used) along with the desired tolerance.

8. EqualityConstraint :: Constraint s v -> Double -> EqualityConstraint s v

   srtree	Algorithm.SRTree.NonlinearOpt

   No documentation available.

9. type EqualityConstraints = [EqualityConstraint ScalarConstraint VectorConstraint]

   srtree	Algorithm.SRTree.NonlinearOpt

   A collection of equality constraints that do not supply constraint derivatives.

10. type EqualityConstraintsD = [EqualityConstraint ScalarConstraintD VectorConstraintD]

    srtree	Algorithm.SRTree.NonlinearOpt

    A collection of equality constraints that supply constraint derivatives.

Page 41 of many | Previous | Next