Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. DUALTree :: Maybe (DUALTreeU d u a l) -> DUALTree d u a l

   dual-tree	Data.Tree.DUAL.Internal

   No documentation available.

2. data DUALTreeNE d u a l

   dual-tree	Data.Tree.DUAL.Internal

   Non-empty DUAL-trees.

3. newtype DUALTreeU d u a l

   dual-tree	Data.Tree.DUAL.Internal

   A non-empty DUAL-tree paired with a cached u value. These should never be constructed directly; instead, use pullU.

4. DUALTreeU :: (u, DUALTreeNE d u a l) -> DUALTreeU d u a l

   dual-tree	Data.Tree.DUAL.Internal

   No documentation available.

5. DualInfeasible :: FailureType

   coinor-clp	Numeric.COINOR.CLP

   No documentation available.

6. module Data.Recursive.DualBool

   The type RDualBool is like Bool, but allows recursive definitions:

   >>> :{
   let x = RDB.true
   y = x RDB.&& z
   z = y RDB.|| RDB.false
   in RDB.get x
   :}
   True
   

   This finds the greatest solution, i.e. prefers True over False:

   >>> :{
   let x = x RDB.&& y
   y = y RDB.&& x
   in (RDB.get x, RDB.get y)
   :}
   (True,True)
   

   Use RBool from Data.Recursive.Bool if you want the least solution.

7. data DualBasis

   algebra	Numeric.Algebra.Dual

   dual number basis, D^2 = 0. D /= 0.

8. data Dual' a

   algebra	Numeric.Coalgebra.Dual

   No documentation available.

9. Dual' :: a -> a -> Dual' a

   algebra	Numeric.Coalgebra.Dual

   No documentation available.

10. data DualBasis'

    algebra	Numeric.Coalgebra.Dual

    dual number basis, D^2 = 0. D /= 0.

Page 6 of many | Previous | Next