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

use crate::divisible::{Divisible, Prime};


#[derive(Debug, Clone, Copy, Eq, PartialEq, Hash)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
/// Real sign of adic number.
/// Only applicable to exact rational numbers, since inexact or irrational numbers have no definable sign.
/// Private, to avoid confusion
pub (super) enum Sign {
    /// Positive
    Pos,
    /// Negative
    Neg
}

impl Sign {
    /// Return 0 if positive and p-1 if negative
    pub (super) fn mod_p(self, p: Prime) -> u32 {
        match self {
            Self::Pos => 0,
            Self::Neg => p.m1(),
        }
    }
}

impl std::ops::Mul for Sign {
    type Output = Sign;
    fn mul(self, rhs: Self) -> Self::Output {
        match (self, rhs) {
            (Sign::Pos, Sign::Pos) | (Sign::Neg, Sign::Neg) => Sign::Pos,
            (Sign::Pos, Sign::Neg) | (Sign::Neg, Sign::Pos) => Sign::Neg,
        }
    }
}

impl std::iter::Product for Sign {
    fn product<I: Iterator<Item = Self>>(iter: I) -> Self {
        iter.fold(Self::Pos, |acc, x| acc * x)
    }
}


impl From<Sign> for i32 {
    fn from(other: Sign) -> i32 {
        match other {
            Sign::Pos => 1,
            Sign::Neg => -1,
        }
    }
}