adic 0.5.1

Arithmetic and rootfinding for p-adic 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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95

#![allow(dead_code)]

use crate::{
    divisible::Prime,
    error::{AdicError, AdicResult},
    sequence::Sequence,
    traits::{AdicPrimitive, PrimedInto, PrimedFrom},
};
use super::{KernelSeries, PowerSeries};


impl<'a, A> KernelSeries<'a, A>
where A: AdicPrimitive {

    /// Create an adic polynomial by priming the given unprimed `coefficients` with prime `p`
    pub fn new_with_prime<P, S>(p: P, coefficients: S) -> Self
    where P: Into<Prime>, S: Sequence + 'a, S::Term: PrimedInto<A> {
        let p = p.into();
        let primed_coefficients = coefficients.term_map(move |n| n.primed_into(p));
        Self::new(primed_coefficients)
    }

    /// Prime for this adic polynomial
    pub fn p(&self) -> AdicResult<Prime> {
        self.term_sequence().term_local_prime().ok_or(AdicError::NoPrimeSet)
    }

}

impl<'a, A, N> PrimedFrom<KernelSeries<'a, N>> for KernelSeries<'a, A>
where A: AdicPrimitive, N: PrimedInto<A> {
    fn primed_from<P>(p: P, n: KernelSeries<'a, N>) -> Self
    where P: Into<Prime> {
        let p = p.into();
        Self::new_with_prime(p, n.term_sequence())
    }
}


impl<'a, A> PowerSeries<'a, A>
where A: AdicPrimitive {

    /// Create an adic polynomial by priming the given unprimed `coefficients` with prime `p`
    pub fn new_with_prime<P, S>(p: P, coefficients: S) -> Self
    where P: Into<Prime>, S: Sequence + 'a, S::Term: PrimedInto<A> {
        let p = p.into();
        let primed_coefficients = coefficients.term_map(move |n| n.primed_into(p));
        Self::new(primed_coefficients)
    }

    /// Prime for this adic polynomial
    pub fn p(&self) -> AdicResult<Prime> {
        self.coefficients().term_local_prime().ok_or(AdicError::NoPrimeSet)
    }

}

impl<'a, A, N> PrimedFrom<PowerSeries<'a, N>> for PowerSeries<'a, A>
where A: AdicPrimitive, N: PrimedInto<A> {
    fn primed_from<P>(p: P, n: PowerSeries<'a, N>) -> Self
    where P: Into<Prime> {
        let p = p.into();
        Self::new_with_prime(p, n.coefficients())
    }
}



#[cfg(test)]
mod tests {
    use crate::{
        divisible::Prime,
        mapping::Mapping,
        traits::{AdicPrimitive, PrimedFrom, PrimedInto},
        EAdic,
    };
    use super::{KernelSeries, PowerSeries};

    #[test]
    fn new() {
        let _ = KernelSeries::<EAdic>::new(vec![EAdic::one(5)]);
        let _ = PowerSeries::<EAdic>::new_with_prime(5, vec![1]);
        let _ = KernelSeries::<EAdic>::primed_from(5, KernelSeries::new(vec![1]));
        let _: PowerSeries<EAdic> = PowerSeries::new(vec![1]).primed_into(5);
    }

    #[test]
    #[should_panic(expected="MixedCharacteristic")]
    fn mismatched_p() {
        let series = PowerSeries::new(vec![EAdic::zero(3), EAdic::one(3)]);
        assert_eq!(Ok(Prime::from(3)), series.p());
        let _ = series.eval(EAdic::zero(5));
    }

}