Modulenumeric-prelude-0.4.4Haskell98

Number.Physical.UnitDatabase

Tools for creating a data base of physical units and for extracting data from it

5 types
19 values

Packagenumeric-prelude-0.4.4
Exports24
LanguageHaskell98
LicenceBSD-3-Clause
SourceUnitDatabase.hs

typetype T i a = [UnitSet i a]

datadata InitUnitSet i a

Constructors

InitUnitSet
- initUnit :: T i
- initIndependent :: Bool
- initScales :: [InitScale a]

datadata InitScale a

Constructors

InitScale
- initSymbol :: String
- initMag :: a
- initIsUnit :: Bool
- initDefault :: Bool

datadata UnitSet i a

An entry for a unit and there scalings.

Constructors

UnitSet
- unit :: T i
- independent :: Bool
- defScaleIx :: Int
- reciprocal :: Bool
  If True the symbols must be preceded with a /. Though it sounds like an attribute of Scale it must be the same for all scales and we need it to sort positive powered unitsets to the front of the list of unit components.
- scales :: [Scale a]

Instances1Show

(Show i, Show a) => Show (UnitSet i a)Defined in numeric-prelude-0.4.4 · Number.Physical.UnitDatabase

datadata Scale a

A common scaling for a unit.

Constructors

Scale
- symbol :: String
- magnitude :: a

Instances1Show

Show a => Show (Scale a)Defined in numeric-prelude-0.4.4 · Number.Physical.UnitDatabase

valueextractOne :: [a] -> a

valueinitScale :: String -> a -> Bool -> Bool -> InitScale a

valueinitUnitSet :: T i -> Bool -> [InitScale a] -> InitUnitSet i a

valuecreateScale :: InitScale a -> Scale a

valuecreateUnitSet :: InitUnitSet i a -> UnitSet i a

valueshowableUnit :: InitUnitSet i a -> Maybe (InitUnitSet i a)

valuepowerOfUnitSet :: (Ord i, C a) => Int -> UnitSet i a -> UnitSet i a

Raise all scales of a unit and the unit itself to the n-th power

valuepowerOfScale :: C a => Int -> Scale a -> Scale a

valueshowExp :: Int -> String

valuepositiveToFront :: [UnitSet i a] -> [UnitSet i a]

Reorder the unit components in a way that the units with positive exponents lead the list.

valuedecompose :: (Ord i, C a) => T i -> T i a -> [UnitSet i a]

Decompose a complex unit into common ones

valuefindIndep :: Eq i => T i -> T i a -> Maybe (UnitSet i a)

valuefindClosest :: (Ord i, C a) => T i -> T i a -> UnitSet i a

valueevalDist

:: (Ord i, C a)
=> T i
-> T i a
-> [(UnitSet i a, Int)]
(UnitSet,distance) the UnitSet may contain powered units

valuefindBestExp :: Ord i => T i -> T i -> (Int, Int)

valuefindMinExp :: [(Int, Int)] -> (Int, Int)

Find the exponent that lead to minimal distance Since the list is infinite maximum will fail but the sequence is convex and thus we can abort when the distance stop falling

valuedistLE :: (Int, Int) -> (Int, Int) -> Bool

valuedistances :: Ord i => T i -> [(Int, T i)] -> [(Int, Int)]

valuelistMultiples :: (T i -> T i) -> Int -> [(Int, T i)]