polylog 2.6.0

Rust implementation of polylogarithms.
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

use num::complex::Complex;
use polylog::Li1;
mod common;


#[test]
fn test_values() {
    let eps = 1e-14_f64;
    let values = common::read_data_file("Li1.txt").unwrap();

    for &(v, li1) in values.iter() {
        assert_eq_complex!(v.li1(), li1, eps);

        if v.im == 0.0_f64 {
            assert_eq_float!(v.re.li1(), li1.re, eps);
        }
    }

    assert!(1.0_f64.li1().is_infinite());
    assert!(Complex::new(1.0_f64, 0.0_f64).li1().is_infinite());

    // test value that causes overflow if squared
    assert!(!Complex::new(1e300_f64, 1.0_f64).li1().is_infinite());
    assert!(!Complex::new(1.0_f64, 1e300_f64).li1().is_infinite());
    assert_eq_complex!(Complex::new(1e300_f64, 1.0_f64).li1(), Complex::new(-690.77552789821371_f64, 3.14159265358979_f64), eps);
    assert_eq_complex!(Complex::new(1.0_f64, 1e300_f64).li1(), Complex::new(-690.77552789821371_f64, 1.5707963267948966_f64), eps);
}


#[test]
fn test_signed_zero() {
    let pz64 = 0.0_f64;
    let nz64 = -0.0_f64;

    assert!(pz64.li1().is_sign_positive());
    assert!(nz64.li1().is_sign_negative());

    assert!(Complex::new(pz64, pz64).li1().re.is_sign_positive());
    assert!(Complex::new(pz64, pz64).li1().im.is_sign_positive());
    assert!(Complex::new(pz64, nz64).li1().re.is_sign_positive());
    assert!(Complex::new(pz64, nz64).li1().im.is_sign_negative());
    assert!(Complex::new(nz64, pz64).li1().re.is_sign_negative());
    assert!(Complex::new(nz64, pz64).li1().im.is_sign_positive());
    assert!(Complex::new(nz64, nz64).li1().re.is_sign_negative());
    assert!(Complex::new(nz64, nz64).li1().im.is_sign_negative());
}