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. evaluateEvenPolynomialL :: Num a => a -> [a] -> a

   math-functions	Numeric.Polynomial

   No documentation available.

2. evaluateOddPolynomial :: (Vector v a, Num a) => a -> v a -> a

   math-functions	Numeric.Polynomial

   Evaluate polynomial with only odd powers using Horner's method. Coefficients starts from lowest. In pseudocode:

   evaluateOddPolynomial x [1,2,3] = 1*x + 2*x^3 + 3*x^5
   

3. evaluateOddPolynomialL :: Num a => a -> [a] -> a

   math-functions	Numeric.Polynomial

   No documentation available.

4. evaluatePolynomial :: (Vector v a, Num a) => a -> v a -> a

   math-functions	Numeric.Polynomial

   Evaluate polynomial using Horner's method. Coefficients starts from lowest. In pseudocode:

   evaluateOddPolynomial x [1,2,3] = 1 + 2*x + 3*x^2
   

5. evaluatePolynomialL :: Num a => a -> [a] -> a

   math-functions	Numeric.Polynomial

   No documentation available.

6. evaluateNF :: (NFData a, MonadIO m) => a -> m a

   relude	Relude.DeepSeq

   Alias for evaluateWHNF . force with a clearer name.

   >>> let list = [1..5] :: [Int]
   
   >>> :sprint list
   list = _
   
   >>> () <$ evaluateNF list
   
   >>> :sprint list
   list = [1,2,3,4,5]
   

7. evaluateNF_ :: (NFData a, MonadIO m) => a -> m ()

   relude	Relude.DeepSeq

   Alias for evaluateWHNF . rnf. Similar to evaluateNF but discards the resulting value.

   >>> let list = [1..5] :: [Int]
   
   >>> :sprint list
   list = _
   
   >>> evaluateNF_ list
   
   >>> :sprint list
   list = [1,2,3,4,5]
   

8. evaluateWHNF :: MonadIO m => a -> m a

   relude	Relude.DeepSeq

   Lifted alias for evaluate with a clearer name.

   >>> let list = [1..5] :: [Int]
   
   >>> :sprint list
   list = _
   
   >>> () <$ evaluateWHNF list
   
   >>> :sprint list
   list = 1 : _
   

9. evaluateWHNF_ :: MonadIO m => a -> m ()

   relude	Relude.DeepSeq

   Like evaluateWHNF but discards value.

   >>> let list = [1..5] :: [Int]
   
   >>> :sprint list
   list = _
   
   >>> evaluateWHNF_ list
   
   >>> :sprint list
   list = 1 : _
   

10. evaluate' :: (HasCallStack, Index ix, Source r e) => Array r ix e -> ix -> e

    massiv	Data.Massiv.Array

    Similar to evaluateM, but will throw an error on out of bounds indices.

    Examples

    >>> import Data.Massiv.Array
    
    >>> evaluate' (range Seq (Ix2 10 20) (100 :. 210)) 50
    60 :. 70
    

Page 6 of many | Previous | Next