{-# OPTIONS_HADDOCK prune #-}
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE RecordWildCards #-}
module Numeric.Eproc.ConfSeq.Bernoulli (
Config
, State
, ConfigError(..)
, config
, initial
, from_counts
, update
, interval
, samples
, successes
) where
import qualified Data.List as L
import Numeric (log1p)
import Numeric.Eproc.Common (ConfigError(..), finite)
data Config = Config {
Config -> Double
cfg_alpha :: {-# UNPACK #-} !Double
, Config -> Double
cfg_log_thresh :: {-# UNPACK #-} !Double
}
data State = State {
State -> Int
st_n :: {-# UNPACK #-} !Int
, State -> Int
st_s :: {-# UNPACK #-} !Int
}
config :: Double -> Either ConfigError Config
config :: Double -> Either ConfigError Config
config !Double
alpha
| Bool -> Bool
not (Double -> Bool
finite Double
alpha Bool -> Bool -> Bool
&& Double
alpha Double -> Double -> Bool
forall a. Ord a => a -> a -> Bool
> Double
0 Bool -> Bool -> Bool
&& Double
alpha Double -> Double -> Bool
forall a. Ord a => a -> a -> Bool
< Double
1) =
ConfigError -> Either ConfigError Config
forall a b. a -> Either a b
Left (Double -> ConfigError
InvalidAlpha Double
alpha)
| Bool
otherwise = Config -> Either ConfigError Config
forall a b. b -> Either a b
Right (Double -> Double -> Config
Config Double
alpha (Double -> Double
forall a. Floating a => a -> a
log (Double
1 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
alpha)))
{-# INLINE config #-}
initial :: Config -> State
initial :: Config -> State
initial Config
_ = Int -> Int -> State
State Int
0 Int
0
{-# INLINE initial #-}
from_counts :: Int -> Int -> Maybe State
from_counts :: Int -> Int -> Maybe State
from_counts !Int
s !Int
n
| Int
s Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
< Int
0 Bool -> Bool -> Bool
|| Int
n Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
< Int
s = Maybe State
forall a. Maybe a
Nothing
| Bool
otherwise = State -> Maybe State
forall a. a -> Maybe a
Just (Int -> Int -> State
State Int
n Int
s)
{-# INLINE from_counts #-}
update :: Config -> State -> Bool -> State
update :: Config -> State -> Bool -> State
update Config
_ (State Int
n Int
s) Bool
x = Int -> Int -> State
State (Int
n Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) (if Bool
x then Int
s Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1 else Int
s)
{-# INLINE update #-}
samples :: State -> Int
samples :: State -> Int
samples = State -> Int
st_n
{-# INLINE samples #-}
successes :: State -> Int
successes :: State -> Int
successes = State -> Int
st_s
{-# INLINE successes #-}
interval :: Config -> State -> (Double, Double)
interval :: Config -> State -> (Double, Double)
interval Config{Double
cfg_alpha :: Config -> Double
cfg_log_thresh :: Config -> Double
cfg_alpha :: Double
cfg_log_thresh :: Double
..} (State Int
n Int
s)
| Int
n Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
0 = (Double
0, Double
1)
| Bool
otherwise = (Double
lower, Double
upper)
where
!phat :: Double
phat = Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
s Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
n :: Double
!ln1 :: Double
ln1 = Double -> Double
forall a. Floating a => a -> a
log (Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
n Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
1)
inside :: Double -> Bool
inside Double
r = Double -> Double
forall a. Num a => a -> a
negate Double
ln1 Double -> Double -> Double
forall a. Num a => a -> a -> a
- Int -> Int -> Double -> Double
log_binom Int
s Int
n Double
r Double -> Double -> Bool
forall a. Ord a => a -> a -> Bool
< Double
cfg_log_thresh
lower :: Double
lower
| Int
s Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
0 = Double
0
| Bool
otherwise = (Double, Double) -> Double
forall a b. (a, b) -> a
fst (Double -> Double -> (Double, Double)
bisect Double
0 Double
phat)
upper :: Double
upper
| Int
s Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
n = Double
1
| Bool
otherwise = (Double, Double) -> Double
forall a b. (a, b) -> b
snd (Double -> Double -> (Double, Double)
bisect Double
phat Double
1)
bisect :: Double -> Double -> (Double, Double)
bisect Double
lo Double
hi = Double -> Double -> (Double, Double)
go Double
lo Double
hi
where
!side :: Bool
side = Double -> Bool
inside Double
lo
go :: Double -> Double -> (Double, Double)
go Double
x Double
y =
let !m :: Double
m = Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
+ (Double
y Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
x) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
2
in if Double
m Double -> Double -> Bool
forall a. Ord a => a -> a -> Bool
<= Double
x Bool -> Bool -> Bool
|| Double
m Double -> Double -> Bool
forall a. Ord a => a -> a -> Bool
>= Double
y then (Double
x, Double
y)
else if Double -> Bool
inside Double
m Bool -> Bool -> Bool
forall a. Eq a => a -> a -> Bool
== Bool
side then Double -> Double -> (Double, Double)
go Double
m Double
y else Double -> Double -> (Double, Double)
go Double
x Double
m
log_binom :: Int -> Int -> Double -> Double
log_binom :: Int -> Int -> Double -> Double
log_binom Int
s Int
n Double
r
| Int
s Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
0 = Double
nN Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double -> Double
forall a. Floating a => a -> a
log1p (Double -> Double
forall a. Num a => a -> a
negate Double
r)
| Int
s Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
n = Double
nN Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double -> Double
forall a. Floating a => a -> a
log Double
r
| Bool
otherwise =
Int -> Double
stirlerr Int
n Double -> Double -> Double
forall a. Num a => a -> a -> a
- Int -> Double
stirlerr Int
s Double -> Double -> Double
forall a. Num a => a -> a -> a
- Int -> Double
stirlerr (Int
n Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
s)
Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double -> Double -> Double
bd0 Double
sN (Double
nN Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
r) Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double -> Double -> Double
bd0 Double
fN (Double
nN Double -> Double -> Double
forall a. Num a => a -> a -> a
* (Double
1 Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
r))
Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
0.5 Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double -> Double
forall a. Floating a => a -> a
log (Double
nN Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ (Double
tau Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
sN Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
fN))
where
!nN :: Double
nN = Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
n :: Double
!sN :: Double
sN = Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
s :: Double
!fN :: Double
fN = Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral (Int
n Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
s) :: Double
bd0 :: Double -> Double -> Double
bd0 :: Double -> Double -> Double
bd0 !Double
x !Double
np
| Double -> Double
forall a. Num a => a -> a
abs (Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
np) Double -> Double -> Bool
forall a. Ord a => a -> a -> Bool
< Double
0.1 Double -> Double -> Double
forall a. Num a => a -> a -> a
* (Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
np) =
let !v :: Double
v = (Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
np) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ (Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
np)
go :: Double -> Double -> Double -> Double
go !Double
acc !Double
ej !Double
j =
let !ej' :: Double
ej' = Double
ej Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
v Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
v
!acc' :: Double
acc' = Double
acc Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
ej' Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ (Double
2 Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
j Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
1)
in if Double
acc' Double -> Double -> Bool
forall a. Eq a => a -> a -> Bool
== Double
acc then Double
acc' else Double -> Double -> Double -> Double
go Double
acc' Double
ej' (Double
j Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
1)
in Double -> Double -> Double -> Double
go ((Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
np) Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
v) (Double
2 Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
v) (Double
1 :: Double)
| Bool
otherwise = Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double -> Double
forall a. Floating a => a -> a
log (Double
x Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
np) Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
np Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
x
stirlerr :: Int -> Double
stirlerr :: Int -> Double
stirlerr Int
k
| Int
k Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
< Int
16 = Int -> Double
log_factorial Int
k Double -> Double -> Double
forall a. Num a => a -> a -> a
- (Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double -> Double
forall a. Floating a => a -> a
log Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double
0.5 Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double -> Double
forall a. Floating a => a -> a
log (Double
tau Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
x))
| Int
k Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
500 = (Double
s0 Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
s1 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
xx) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
x
| Int
k Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
80 = (Double
s0 Double -> Double -> Double
forall a. Num a => a -> a -> a
- (Double
s1 Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
s2 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
xx) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
xx) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
x
| Int
k Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
35 = (Double
s0 Double -> Double -> Double
forall a. Num a => a -> a -> a
- (Double
s1 Double -> Double -> Double
forall a. Num a => a -> a -> a
- (Double
s2 Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
s3 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
xx) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
xx) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
xx) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
x
| Bool
otherwise = (Double
s0 Double -> Double -> Double
forall a. Num a => a -> a -> a
- (Double
s1 Double -> Double -> Double
forall a. Num a => a -> a -> a
- (Double
s2 Double -> Double -> Double
forall a. Num a => a -> a -> a
- (Double
s3 Double -> Double -> Double
forall a. Num a => a -> a -> a
- Double
s4 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
xx) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
xx) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
xx) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
xx) Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
x
where
!x :: Double
x = Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
k :: Double
!xx :: Double
xx = Double
x Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
x
s0 :: Double
s0 = Double
1 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
12
s1 :: Double
s1 = Double
1 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
360
s2 :: Double
s2 = Double
1 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
1260
s3 :: Double
s3 = Double
1 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
1680
s4 :: Double
s4 = Double
1 Double -> Double -> Double
forall a. Fractional a => a -> a -> a
/ Double
1188
log_factorial :: Int -> Double
log_factorial :: Int -> Double
log_factorial Int
k = (Double -> Int -> Double) -> Double -> [Int] -> 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 Int
j -> Double
acc Double -> Double -> Double
forall a. Num a => a -> a -> a
+ Double -> Double
forall a. Floating a => a -> a
log (Int -> Double
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
j)) Double
0 [Int
2 .. Int
k]
tau :: Double
tau :: Double
tau = Double
2 Double -> Double -> Double
forall a. Num a => a -> a -> a
* Double
forall a. Floating a => a
pi