benford 0.1.2

library to test the Benford-ness of a given set of numbers
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

# benford

This crate provides a way to test if some given set of numbers conforms to
[Benford's law](https://en.wikipedia.org/wiki/Benford%27s_law)

Currently, only the first digit is being used. You can use your own method
of mapping a number to a digit, by implementing [`BenfordClass`]

## Example 1: Fibonacci numbers are Benford ...

```rust
use benford::{BenfordTester, FirstDigitBase10, Fibonacci};

let mut tester = BenfordTester::default();
let mut fibonacci = Fibonacci::<u64>::default();
for val in fibonacci {
    if val != 0 {
        tester.add_sample::<FirstDigitBase10>(val.into());
    }
}
assert!(tester.is_benford());
```

## Example 2: ... but only with limited confidence

if your test set is too small

```rust
use benford::{Alpha, BenfordTester, FirstDigitBase10, Fibonacci};

let mut tester = BenfordTester::default();
let mut fibonacci = Fibonacci::<u16>::default();
for val in fibonacci {
    if val != 0 {
        tester.add_sample::<FirstDigitBase10>(val.into());
    }
}
assert!(! tester.is_benford());
assert!(tester.is_benford_with_alpha(Alpha::Point9));
```

## Example 3: Natural numbers are not Benford

```rust
use benford::{BenfordTester, FirstDigitBase10};

let mut tester = BenfordTester::default();
for val in 1..u16::MAX {
    tester.add_sample::<FirstDigitBase10>(val.into());
}
assert!(! tester.is_benford())
```

License: GPL-3.0