module Data.Micro where
import Prelude
import Control.DeepSeq
import Data.AdditiveGroup
import Data.Basis
import Data.Data
import Data.Int
import Data.Ix
import Data.Ratio
import Data.VectorSpace
#if !SHOW_INTERNAL
import Text.Printf
#endif
newtype Micro = Micro Int64
deriving (Eq, Ord, Enum, Ix, Bounded, NFData, Data, Typeable)
#if SHOW_INTERNAL
deriving instance Show Micro
#else
instance Show Micro where
show (Micro a) = printf "%d.%06u" q r where
(q, r) = divMod a 1000000
#endif
toMicro :: Rational -> Micro
toMicro r = Micro (fromInteger $ 1000000 * numerator r `div` denominator r)
#if INSTANCE_NUM
instance Num Micro where
Micro a + Micro b = Micro (a + b)
Micro a Micro b = Micro (a b)
Micro a * Micro b = Micro ((quot a 1000) * (quot b 1000))
negate (Micro a) = Micro (negate a)
abs (Micro a) = Micro (abs a)
signum (Micro a) = Micro (signum a * 1000000)
fromInteger a = Micro (fromInteger a * 1000000)
instance Fractional Micro where
Micro a / Micro b = Micro (quot (a * 1000) (b * 1000))
recip (Micro a) = Micro (quot 1000000 a)
fromRational = toMicro
#endif
microQuotRem :: Micro -> Micro -> (Int64, Micro)
microQuotRem (Micro a) (Micro b) = (n, Micro f) where
(n, f) = quotRem a b
instance AdditiveGroup Micro where
zeroV = Micro 0
Micro a ^+^ Micro b = Micro (a + b)
negateV (Micro a) = Micro (negate a)
instance VectorSpace Micro where
type Scalar Micro = Rational
s *^ Micro a = Micro . fromInteger $
toInteger a * numerator s `quot` denominator s
instance HasBasis Micro where
type Basis Micro = ()
basisValue () = 1
decompose (Micro a) = [((), fromIntegral a % 1000000)]
decompose' (Micro a) = const (fromIntegral a % 1000000)
(^/^) :: (HasBasis v, Basis v ~ (), Scalar v ~ s, Fractional s) => v -> v -> s
x ^/^ y = decompose' x () / decompose' y ()