{-# OPTIONS_HADDOCK prune #-}
{-# LANGUAGE BangPatterns #-}
module Numeric.Eproc.Common (
Bettor(..)
, Verdict(..)
, ConfigError(..)
, BetState(..)
, init_bet
, bet_lambda
, step_bet
, finite
, log_sum_exp
, log_sum_exps
, log2_dbl
) where
import qualified Data.List as L
import GHC.Float (log1p)
data Bettor =
Fixed {-# UNPACK #-} !Double
| Adaptive
| Newton
deriving (Bettor -> Bettor -> Bool
(Bettor -> Bettor -> Bool)
-> (Bettor -> Bettor -> Bool) -> Eq Bettor
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: Bettor -> Bettor -> Bool
== :: Bettor -> Bettor -> Bool
$c/= :: Bettor -> Bettor -> Bool
/= :: Bettor -> Bettor -> Bool
Eq, Int -> Bettor -> ShowS
[Bettor] -> ShowS
Bettor -> String
(Int -> Bettor -> ShowS)
-> (Bettor -> String) -> ([Bettor] -> ShowS) -> Show Bettor
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> Bettor -> ShowS
showsPrec :: Int -> Bettor -> ShowS
$cshow :: Bettor -> String
show :: Bettor -> String
$cshowList :: [Bettor] -> ShowS
showList :: [Bettor] -> ShowS
Show)
data Verdict =
Reject
| Continue
deriving (Verdict -> Verdict -> Bool
(Verdict -> Verdict -> Bool)
-> (Verdict -> Verdict -> Bool) -> Eq Verdict
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: Verdict -> Verdict -> Bool
== :: Verdict -> Verdict -> Bool
$c/= :: Verdict -> Verdict -> Bool
/= :: Verdict -> Verdict -> Bool
Eq, Int -> Verdict -> ShowS
[Verdict] -> ShowS
Verdict -> String
(Int -> Verdict -> ShowS)
-> (Verdict -> String) -> ([Verdict] -> ShowS) -> Show Verdict
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> Verdict -> ShowS
showsPrec :: Int -> Verdict -> ShowS
$cshow :: Verdict -> String
show :: Verdict -> String
$cshowList :: [Verdict] -> ShowS
showList :: [Verdict] -> ShowS
Show)
data ConfigError =
InvalidAlpha {-# UNPACK #-} !Double
| InvalidBounds {-# UNPACK #-} !Double {-# UNPACK #-} !Double
| InvalidNullMean
{-# UNPACK #-} !Double
{-# UNPACK #-} !Double
{-# UNPACK #-} !Double
| InvalidNullInterval
{-# UNPACK #-} !Double
{-# UNPACK #-} !Double
{-# UNPACK #-} !Double
{-# UNPACK #-} !Double
| InvalidBaselineRate {-# UNPACK #-} !Double
| InvalidComponentCount {-# UNPACK #-} !Int
| InvalidGridSize {-# UNPACK #-} !Int
deriving (ConfigError -> ConfigError -> Bool
(ConfigError -> ConfigError -> Bool)
-> (ConfigError -> ConfigError -> Bool) -> Eq ConfigError
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: ConfigError -> ConfigError -> Bool
== :: ConfigError -> ConfigError -> Bool
$c/= :: ConfigError -> ConfigError -> Bool
/= :: ConfigError -> ConfigError -> Bool
Eq, Int -> ConfigError -> ShowS
[ConfigError] -> ShowS
ConfigError -> String
(Int -> ConfigError -> ShowS)
-> (ConfigError -> String)
-> ([ConfigError] -> ShowS)
-> Show ConfigError
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> ConfigError -> ShowS
showsPrec :: Int -> ConfigError -> ShowS
$cshow :: ConfigError -> String
show :: ConfigError -> String
$cshowList :: [ConfigError] -> ShowS
showList :: [ConfigError] -> ShowS
Show)
finite :: Double -> Bool
finite :: Double -> Bool
finite Double
x = Bool -> Bool
not (Double -> Bool
forall a. RealFloat a => a -> Bool
isNaN Double
x) Bool -> Bool -> Bool
&& Bool -> Bool
not (Double -> Bool
forall a. RealFloat a => a -> Bool
isInfinite Double
x)
{-# INLINE finite #-}
log_sum_exp :: Double -> Double -> Double
log_sum_exp :: Double -> Double -> Double
log_sum_exp !Double
a !Double
b
| Double
a Double -> Double -> Bool
forall a. Ord a => a -> a -> Bool
>= Double
b = Double
a Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double -> Double
forall a. Floating a => a -> a
log1p (Double -> Double
forall a. Floating a => a -> a
exp (Double
b Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
a))
| Bool
otherwise = Double
b Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double -> Double
forall a. Floating a => a -> a
log1p (Double -> Double
forall a. Floating a => a -> a
exp (Double
a Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
b))
{-# INLINE log_sum_exp #-}
log_sum_exps :: [Double] -> Double
log_sum_exps :: [Double] -> Double
log_sum_exps [Double]
les = case [Double]
les of
[] -> Double -> Double
forall a. Num a => a -> a
negate (Double
1 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
0)
(Double
l : [Double]
ls) ->
let !m :: Double
m = (Double -> Double -> Double) -> Double -> [Double] -> Double
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
L.foldl' Double -> Double -> Double
forall a. Ord a => a -> a -> a
max Double
l [Double]
ls
in if Double -> Bool
forall a. RealFloat a => a -> Bool
isInfinite Double
m
then Double
m
else Double
m Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double -> Double
forall a. Floating a => a -> a
log ((Double -> Double -> Double) -> Double -> [Double] -> Double
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
L.foldl' (\ !Double
acc Double
v -> Double
acc Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double -> Double
forall a. Floating a => a -> a
exp (Double
v Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
m)) Double
0 [Double]
les)
{-# INLINE log_sum_exps #-}
log2_dbl :: Double
log2_dbl :: Double
log2_dbl = Double -> Double
forall a. Floating a => a -> a
log Double
2
{-# INLINE log2_dbl #-}
data BetState =
SFixed
| SAdaptive
{-# UNPACK #-} !Double
{-# UNPACK #-} !Double
{-# UNPACK #-} !Int
| SNewton
{-# UNPACK #-} !Double
{-# UNPACK #-} !Double
init_bet :: Bettor -> BetState
init_bet :: Bettor -> BetState
init_bet Bettor
b = case Bettor
b of
Fixed Double
_ -> BetState
SFixed
Bettor
Adaptive -> Double -> Double -> Int -> BetState
SAdaptive Double
0 Double
0 Int
0
Bettor
Newton -> Double -> Double -> BetState
SNewton Double
0 Double
1.0e-6
{-# INLINE init_bet #-}
ons_lr :: Double
ons_lr :: Double
ons_lr = Double
2 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ (Double
2 Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double -> Double
forall a. Floating a => a -> a
log Double
3)
{-# INLINE ons_lr #-}
bet_lambda :: Bettor -> Double -> BetState -> Double
bet_lambda :: Bettor -> Double -> BetState -> Double
bet_lambda Bettor
b !Double
lam_max !BetState
s = case Bettor
b of
Fixed Double
lam -> Double -> Double -> Double
forall a. Ord a => a -> a -> a
max Double
0 (Double -> Double -> Double
forall a. Ord a => a -> a -> a
min Double
lam_max Double
lam)
Bettor
Adaptive -> case BetState
s of
SAdaptive !Double
sm !Double
sm2 !Int
n
| Int
n Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
0 -> Double
0
| Bool
otherwise ->
let !nd :: Double
nd = Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
n
!mu :: Double
mu = Double
sm Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
nd
!mu2 :: Double
mu2 = Double
mu Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
mu
!var :: Double
var = Double -> Double -> Double
forall a. Ord a => a -> a -> a
max Double
0 (Double
sm2 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
nd Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
mu2)
!den :: Double
den = Double
var Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
mu2
!raw :: Double
raw = if Double
den Double -> Double -> Bool
forall a. Eq a => a -> a -> Bool
== Double
0 then Double
0 else Double
mu Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
den
in Double -> Double -> Double
forall a. Ord a => a -> a -> a
max Double
0 (Double -> Double -> Double
forall a. Ord a => a -> a -> a
min Double
lam_max Double
raw)
BetState
_ -> Double
0
Bettor
Newton -> case BetState
s of
SNewton !Double
lam Double
_ -> Double
lam
BetState
_ -> Double
0
{-# INLINE bet_lambda #-}
step_bet :: Bettor -> Double -> BetState -> Double -> BetState
step_bet :: Bettor -> Double -> BetState -> Double -> BetState
step_bet Bettor
b !Double
lam_max !BetState
s !Double
z = case Bettor
b of
Fixed Double
_ -> BetState
SFixed
Bettor
Adaptive -> case BetState
s of
SAdaptive !Double
sm !Double
sm2 !Int
n -> Double -> Double -> Int -> BetState
SAdaptive (Double
sm Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
z) (Double
sm2 Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
z Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
z) (Int
n Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1)
BetState
_ -> Double -> Double -> Int -> BetState
SAdaptive Double
z (Double
z Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
z) Int
1
Bettor
Newton -> case BetState
s of
SNewton !Double
lam !Double
acc ->
let !denom :: Double
denom = Double
1 Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
lam Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
z
!g :: Double
g = if Double
denom Double -> Double -> Bool
forall a. Eq a => a -> a -> Bool
== Double
0 then Double
0 else Double -> Double
forall a. Num a => a -> a
negate Double
z Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
denom
!acc' :: Double
acc' = Double
acc Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
g Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
g
!lam' :: Double
lam' = Double
lam Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
ons_lr Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
g Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
acc'
!clp :: Double
clp = Double -> Double -> Double
forall a. Ord a => a -> a -> a
max Double
0 (Double -> Double -> Double
forall a. Ord a => a -> a -> a
min Double
lam_max Double
lam')
in Double -> Double -> BetState
SNewton Double
clp Double
acc'
BetState
_ -> Double -> Double -> BetState
SNewton Double
0 Double
1.0e-6
{-# INLINE step_bet #-}