non-negative-0.0.5.1: Non-negative numbersSource codeContentsIndex
Numeric.NonNegative.Chunky
PortabilityHaskell 98
Stabilitystable
Maintainerhaskell@henning-thielemann.de
Description
A lazy number type, which is a generalization of lazy Peano numbers. Comparisons can be made lazy and thus computations are possible which are impossible with strict number types, e.g. you can compute let y = min (1+y) 2 in y. You can even work with infinite values. However, depending on the granularity, the memory consumption is higher than that for strict number types. This number type is of interest for the merge operation of event lists, which allows for co-recursive merges.
Synopsis
data T a
fromChunks :: C a => [a] -> T a
fromNumber :: C a => a -> T a
toChunks :: T a -> [a]
toNumber :: C a => T a -> a
zero :: T a
normalize :: C a => T a -> T a
isNull :: C a => T a -> Bool
isPositive :: C a => T a -> Bool
minMaxDiff :: C a => T a -> T a -> (T a, T a, Bool)
Documentation
data T a Source

A chunky non-negative number is a list of non-negative numbers. It represents the sum of the list elements. It is possible to represent a finite number with infinitely many chunks by using an infinite number of zeros.

Note the following problems:

Addition is commutative only for finite representations. E.g. let y = min (1+y) 2 in y is defined, let y = min (y+1) 2 in y is not.

fromChunks :: C a => [a] -> T aSource
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
zero :: T aSource
normalize :: C a => T a -> T 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.
Produced by Haddock version 2.6.1