reform 0.1.0

A symbolic manipulation toolkit which aims to handle expressions with billions of terms, taking up terabytes of diskspace.
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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111

use num_traits::{One, Pow, Zero};
use number::Number;
use poly::raw::finitefield::FiniteField;
use poly::raw::zp::ufield;
use rug::Integer;
use std::fmt::{Debug, Display};
use std::ops::{Div, MulAssign, Neg, Rem};
use tools::GCD;

pub trait MulModNum {
    fn mul_num(&self, n: ufield) -> Self;
    fn mod_num(&self, n: ufield) -> Self;
}

pub trait ToFiniteField {
    fn to_finite_field(&self, p: ufield) -> FiniteField;
    fn from_finite_field(&FiniteField) -> Self;
}

/// Trait for rings.
pub trait Ring:
   // Copy
    Zero
    + One
    + Debug
    + Display
    + MulModNum
    + GCD
    + Pow<u32, Output = Self>
    + MulAssign
    + Neg<Output = Self>
    + Div<Output = Self>
    + Rem<Output = Self>
    + ToFiniteField
    + Eq
    + Clone
{
}

impl<
        T: Zero
            + One
            + Debug
            + Display
            + MulModNum
            + GCD
            + Pow<u32, Output = Self>
            + MulAssign
            + Neg<Output = Self>
            + Div<Output = Self>
            + Rem<Output = Self>
            + ToFiniteField
            + Eq
            + Clone,
    > Ring for T
{
}

impl ToFiniteField for i64 {
    fn to_finite_field(&self, p: ufield) -> FiniteField {
        FiniteField::from_i64(*self, p)
    }

    fn from_finite_field(ff: &FiniteField) -> i64 {
        if ff.n > ff.p / 2 {
            ff.n as i64 - ff.p as i64
        } else {
            ff.n as i64
        }
    }
}

impl MulModNum for i64 {
    fn mul_num(&self, n: ufield) -> i64 {
        self * (n as i64)
    }

    fn mod_num(&self, n: ufield) -> i64 {
        self % (n as i64)
    }
}

impl MulModNum for Number {
    fn mul_num(&self, n: ufield) -> Number {
        self.clone() * Number::SmallInt(n as isize)
    }

    fn mod_num(&self, n: ufield) -> Number {
        self.clone() % Number::SmallInt(n as isize)
    }
}

impl ToFiniteField for Number {
    fn to_finite_field(&self, p: ufield) -> FiniteField {
        match *self {
            Number::SmallInt(i) => FiniteField::from_i64(i as i64, p),
            Number::BigInt(ref i) => {
                FiniteField::from_i64((i.clone() % Integer::from(p)).to_i64().unwrap(), p)
            }
            _ => unreachable!(),
        }
    }

    fn from_finite_field(ff: &FiniteField) -> Number {
        Number::SmallInt(if ff.n > ff.p / 2 {
            ff.n as isize - ff.p as isize
        } else {
            ff.n as isize
        })
    }
}