Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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.Lazy

2. Equal :: PartialOrdering

   radix-tree	Data.Radix1Tree.Word8.Strict

3. Equal :: PartialOrdering

   radix-tree	Data.RadixTree.Word8.Lazy

4. Equal :: PartialOrdering

   radix-tree	Data.RadixTree.Word8.Strict

5. Equal :: PartialOrdering

   radix-tree	Data.Zebra.Word

6. Equal :: Relation

   rampart	Rampart

   Interval x is equal to Interval y.

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

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

7. module Algorithm.EqSat

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

8. 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.

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

   srtree	Algorithm.SRTree.NonlinearOpt

   No documentation available.

10. type EqualityConstraints = [EqualityConstraint ScalarConstraint VectorConstraint]

    srtree	Algorithm.SRTree.NonlinearOpt

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

Page 41 of many | Previous | Next