Data.Number.IReal.FoldB

Documentation

foldb :: (a -> a -> a) -> a -> [a] -> a

Balanced fold, minimizing depth of call tree. Assumes associative operator. Often much more efficient than foldl/foldr when type a is IReal and the list is long.

foldb1 :: (a -> a -> a) -> [a] -> a

Balanced fold for associative operator over non-empty list.

bsum :: Num a => [a] -> a

Balanced sum, reorganized for (much) better efficiency when type a is IReal and the list is long.

foldb' :: (a -> a -> a) -> a -> [a] -> a

isum' :: [IReal] -> IReal

isumN' :: Integer -> [IReal] -> IReal

1st arg should be length of 2nd arg.