Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. mulFracStupid :: C a => T a -> T a -> ((T a, T a), T a)

   numeric-prelude	MathObj.PartialFraction

   Works always but simply puts the product into the last fraction.

2. divide :: C a => [a] -> [a] -> [a]

   numeric-prelude	MathObj.PowerSeries.Core

   Divide two series where the absolute term of the divisor is non-zero. That is, power series with leading non-zero terms are the units in the ring of power series. Knuth: Seminumerical algorithms

3. divideStripZero :: (C a, C a) => [a] -> [a] -> [a]

   numeric-prelude	MathObj.PowerSeries.Core

   Divide two series also if the divisor has leading zeros.

4. isValid :: [[a]] -> Bool

   numeric-prelude	MathObj.PowerSeries2

   No documentation available.

5. divide :: C a => T a -> T a -> T a

   numeric-prelude	MathObj.PowerSeries2.Core

   No documentation available.

6. divide :: Integer -> Integer -> Integer -> Integer

   numeric-prelude	Number.FixedPoint

   No documentation available.

7. divide :: Basis -> T -> T -> T

   numeric-prelude	Number.Positional

   Undefined if the divisor is zero - of course. Because it is impossible to assert that a real is zero, the routine will not throw an error in general. ToDo: Rigorously derive the minimal required magnitude of the leading divisor digit.

8. module Number.ResidueClass

   No documentation available.

9. divide :: C a => a -> a -> a -> a

   numeric-prelude	Number.ResidueClass

   No documentation available.

10. divideMaybe :: C a => a -> a -> a -> Maybe a

    numeric-prelude	Number.ResidueClass

    The division may be ambiguous. In this case an arbitrary quotient is returned.

    0:4 * 2:4 == 0/:4
    2:4 * 2:4 == 0/:4
    

Page 927 of many | Previous | Next