benford

This crate provides a way to test of some given set of numbers conforms to Benford's 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::::default(); for val in fibonacci { if val != 0 { tester.addsample::(val.into()); } } assert!(tester.isbenford()); ```

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::::default(); for val in fibonacci { if val != 0 { tester.addsample::(val.into()); } } assert!(! tester.isbenford()); assert!(tester.isbenfordwith_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.addsample::(val.into()); } assert!(! tester.isbenford()) ```

License: GPL-3.0