1 // Copyright 2013 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! The exponential distribution.
16 use distributions
::{ziggurat, ziggurat_tables, Sample, IndependentSample}
;
18 /// A wrapper around an `f64` to generate Exp(1) random numbers.
20 /// See `Exp` for the general exponential distribution.Note that this
21 // has to be unwrapped before use as an `f64` (using either
22 /// `*` or `mem::transmute` is safe).
24 /// Implemented via the ZIGNOR variant[1] of the Ziggurat method. The
25 /// exact description in the paper was adjusted to use tables for the
26 /// exponential distribution rather than normal.
28 /// [1]: Jurgen A. Doornik (2005). [*An Improved Ziggurat Method to
29 /// Generate Normal Random
30 /// Samples*](http://www.doornik.com/research/ziggurat.pdf). Nuffield
32 #[derive(Copy, Clone)]
33 pub struct Exp1(pub f64);
35 // This could be done via `-rng.gen::<f64>().ln()` but that is slower.
38 fn rand
<R
:Rng
>(rng
: &mut R
) -> Exp1
{
40 fn pdf(x
: f64) -> f64 {
44 fn zero_case
<R
:Rng
>(rng
: &mut R
, _u
: f64) -> f64 {
45 ziggurat_tables
::ZIG_EXP_R
- rng
.gen
::<f64>().ln()
48 Exp1(ziggurat(rng
, false,
49 &ziggurat_tables
::ZIG_EXP_X
,
50 &ziggurat_tables
::ZIG_EXP_F
,
55 /// The exponential distribution `Exp(lambda)`.
57 /// This distribution has density function: `f(x) = lambda *
58 /// exp(-lambda * x)` for `x > 0`.
59 #[derive(Copy, Clone)]
61 /// `lambda` stored as `1/lambda`, since this is what we scale by.
66 /// Construct a new `Exp` with the given shape parameter
67 /// `lambda`. Panics if `lambda <= 0`.
68 pub fn new(lambda
: f64) -> Exp
{
69 assert
!(lambda
> 0.0, "Exp::new called with `lambda` <= 0");
70 Exp { lambda_inverse: 1.0 / lambda }
74 impl Sample
<f64> for Exp
{
75 fn sample
<R
: Rng
>(&mut self, rng
: &mut R
) -> f64 { self.ind_sample(rng) }
77 impl IndependentSample
<f64> for Exp
{
78 fn ind_sample
<R
: Rng
>(&self, rng
: &mut R
) -> f64 {
79 let Exp1(n
) = rng
.gen
::<Exp1
>();
80 n
* self.lambda_inverse
86 use std
::prelude
::v1
::*;
88 use distributions
::{Sample, IndependentSample}
;
93 let mut exp
= Exp
::new(10.0);
94 let mut rng
= ::test
::rng();
96 assert
!(exp
.sample(&mut rng
) >= 0.0);
97 assert
!(exp
.ind_sample(&mut rng
) >= 0.0);
102 fn test_exp_invalid_lambda_zero() {
107 fn test_exp_invalid_lambda_neg() {
116 use std
::prelude
::v1
::*;
118 use self::test
::Bencher
;
119 use std
::mem
::size_of
;
121 use distributions
::Sample
;
124 fn rand_exp(b
: &mut Bencher
) {
125 let mut rng
= ::test
::weak_rng();
126 let mut exp
= Exp
::new(2.71828 * 3.14159);
129 for _
in 0..::RAND_BENCH_N
{
130 exp
.sample(&mut rng
);
133 b
.bytes
= size_of
::<f64>() as u64 * ::RAND_BENCH_N
;