{- |
Copyright   :  (c) Henning Thielemann 2007-2010

Maintainer  :  haskell@henning-thielemann.de
Stability   :  stable
Portability :  Haskell 98

A type class for non-negative numbers.
Prominent instances are 'Numeric.NonNegative.Wrapper.T' and peano numbers.
Types from "Data.Word" would also be candidates.
However, there is no 'Monoid' instance for 'Word' types
and they have wrap-around semantics.
This class cannot do any checks,
but it let you show to the user what arguments your function expects.
Thus you must define class instances with care.
In fact many standard functions ('take', '(!!)', ...)
should have this type class constraint.
-}
module Numeric.NonNegative.Class (
   C(..),
   splitDefault,

   (-|),
   zero,
   add,
   sum,
   maximum,

   switchDifferenceNegative,
   switchDifferenceOrdering,
   ) where

import Data.Monoid (Monoid, )
import qualified Data.Monoid as Monoid

import Prelude hiding (sum, maximum, )


{- |
Instances of this class must ensure non-negative values.
We cannot enforce this by types, but the type class constraint @NonNegative.C@
avoids accidental usage of types which allow for negative numbers.

The Monoid superclass contributes a zero and an addition.
-}
class (Ord a, Monoid a) => C a where
   {- |
   @split x y == (m,(b,d))@ means that
   @b == (x<=y)@,
   @m == min x y@,
   @d == max x y - min x y@, that is @d == abs(x-y)@.

   We have chosen this function as base function,
   since it provides comparison and subtraction in one go,
   which is important for replacing common structures like

   > if x<=y
   >   then f(x-y)
   >   else g(y-x)

   that lead to a memory leak for peano numbers.
   We have choosen the simple check @x<=y@
   instead of a full-blown @compare@,
   since we want @Zero <= undefined@ for peano numbers.
   Because of undefined values 'split' is in general
   not commutative in the sense

   > let (m0,(b0,d0)) = split x y
   >     (m1,(b1,d1)) = split y x
   > in  m0==m1 && d0==d1

   The result values are in the order
   in which they are generated for Peano numbers.
   We have chosen the nested pair instead of a triple
   in order to prevent a memory leak
   that occurs if you only use @b@ and @d@ and ignore @m@.
   This is demonstrated by test cases
   Chunky.splitSpaceLeak3 and Chunky.splitSpaceLeak4.
   -}
   split :: a -> a -> (a, (Bool, a))


{- |
Default implementation for wrapped types of 'Ord' and 'Num' class.
-}
{-# INLINE splitDefault #-}
splitDefault ::
   (Ord b, Num b) =>
   (a -> b) -> (b -> a) -> a -> a -> (a, (Bool, a))
splitDefault :: forall b a.
(Ord b, Num b) =>
(a -> b) -> (b -> a) -> a -> a -> (a, (Bool, a))
splitDefault a -> b
unpack b -> a
pack a
px a
py =
   let x :: b
x = a -> b
unpack a
px
       y :: b
y = a -> b
unpack a
py
   in  if b
xb -> b -> Bool
forall a. Ord a => a -> a -> Bool
<=b
y
         then (b -> a
pack b
x, (Bool
True,  b -> a
pack (b
yb -> b -> b
forall a. Num a => a -> a -> a
-b
x)))
         else (b -> a
pack b
y, (Bool
False, b -> a
pack (b
xb -> b -> b
forall a. Num a => a -> a -> a
-b
y)))


zero :: C a => a
zero :: forall a. C a => a
zero = a
forall a. Monoid a => a
Monoid.mempty

-- like (+)
infixl 6 `add`

add :: C a => a -> a -> a
add :: forall a. C a => a -> a -> a
add = a -> a -> a
forall a. Monoid a => a -> a -> a
Monoid.mappend

sum :: C a => [a] -> a
sum :: forall a. C a => [a] -> a
sum = [a] -> a
forall a. Monoid a => [a] -> a
Monoid.mconcat

{- |
Left biased maximum of a list of numbers that can also be empty.
It holds

> maximum [] == zero
-}
maximum :: C a => [a] -> a
maximum :: forall a. C a => [a] -> a
maximum = (a -> a -> a) -> a -> [a] -> a
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl a -> a -> a
forall a. Ord a => a -> a -> a
max a
forall a. C a => a
zero

{- |
In @switchDifferenceNegative x y branchXminusY branchYminusX@
the function @branchXminusY@ is applied to @x-y@
if this difference is non-negative,
otherwise @branchYminusX@ is applied to @y-x@.
-}
switchDifferenceNegative ::
   C a =>
   a -> a -> (a -> b) -> (a -> b) -> b
switchDifferenceNegative :: forall a b. C a => a -> a -> (a -> b) -> (a -> b) -> b
switchDifferenceNegative a
x a
y a -> b
branchXminusY a -> b
branchYminusX =
   let (Bool
b,a
d) = (a, (Bool, a)) -> (Bool, a)
forall a b. (a, b) -> b
snd ((a, (Bool, a)) -> (Bool, a)) -> (a, (Bool, a)) -> (Bool, a)
forall a b. (a -> b) -> a -> b
$ a -> a -> (a, (Bool, a))
forall a. C a => a -> a -> (a, (Bool, a))
split a
y a
x
   in  if Bool
b
         then a -> b
branchXminusY a
d
         else a -> b
branchYminusX a
d


{- |
In @switchDifferenceOrdering x y branchZero branchXminusY branchYminusX@
-}
switchDifferenceOrdering ::
   C a =>
   a -> a -> b -> (a -> b) -> (a -> b) -> b
switchDifferenceOrdering :: forall a b. C a => a -> a -> b -> (a -> b) -> (a -> b) -> b
switchDifferenceOrdering a
x a
y b
branchZero a -> b
branchXminusY a -> b
branchYminusX =
   let (Bool
b,a
d) = (a, (Bool, a)) -> (Bool, a)
forall a b. (a, b) -> b
snd ((a, (Bool, a)) -> (Bool, a)) -> (a, (Bool, a)) -> (Bool, a)
forall a b. (a -> b) -> a -> b
$ a -> a -> (a, (Bool, a))
forall a. C a => a -> a -> (a, (Bool, a))
split a
y a
x
   in  if Bool
b
         then
           if a
da -> a -> Bool
forall a. Eq a => a -> a -> Bool
==a
forall a. C a => a
zero
             then b
branchZero
             else a -> b
branchXminusY a
d
         else a -> b
branchYminusX a
d


{- |
@x -| y == max 0 (x-y)@

The default implementation is not efficient,
because it compares the values and then subtracts, again, if safe.
@max 0 (x-y)@ is more elegant and efficient
but not possible in the general case,
since @x-y@ may already yield a negative number.
-}
(-|) :: C a => a -> a -> a
a
x -| :: forall a. C a => a -> a -> a
-| a
y  =
   let (Bool
b,a
d) = (a, (Bool, a)) -> (Bool, a)
forall a b. (a, b) -> b
snd ((a, (Bool, a)) -> (Bool, a)) -> (a, (Bool, a)) -> (Bool, a)
forall a b. (a -> b) -> a -> b
$ a -> a -> (a, (Bool, a))
forall a. C a => a -> a -> (a, (Bool, a))
split a
y a
x
   in  if Bool
b then a
d else a
forall a. C a => a
zero