non-negative- Non-negative numbers  PortabilityHaskell 98
data T a Source   Note the following problems:    C a => Eq (T
a)  C a => Num (T a)  C a => Ord (T a)  Show a => Show (T a) 
Monoid (T a)  C a => C (T a)    fromNumber :: C a => a -> T
aSource  toChunks :: T a -> [a]Source  This routine exposes the
inner structure of the lazy number.  toNumber :: C a => T a ->
aSource   Remove zero chunks.  isNull :: C a => T a ->
BoolSource  isPositive :: C a => T a -> BoolSource  minMaxDiff
:: C a => T a -> T a -> (T a, T a, Bool)Source  In minMaxDiff x
y == (z,r,b) z represents min x y, r represents max x y - min x
y, and xy == b or x>y ==> not b, for x==y the value of b is
arbitrary.