malachite-base 0.13.0

A collection of utilities, including new arithmetic traits and iterators that generate all values of a type.
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

// Copyright © 2026 Mikhail Hogrefe
//
// This file is part of Malachite.
//
// Malachite is free software: you can redistribute it and/or modify it under the terms of the GNU
// Lesser General Public License (LGPL) as published by the Free Software Foundation; either version
// 3 of the License, or (at your option) any later version. See <https://www.gnu.org/licenses/>.

use crate::num::basic::unsigneds::PrimitiveUnsigned;
use crate::polynomial::Polynomial;
use crate::test_util::unsigned_polynomial::arithmetic::mod_mul::*;
use crate::unsigned_polynomial::UnsignedPolynomial;

// Raises the polynomial to the power `e` modulo `m` by `e` schoolbook multiplications modulo `m`,
// starting from 1 and truncating after each one.
pub fn mod_pow_truncated_naive<T: PrimitiveUnsigned>(
    p: &UnsignedPolynomial<T>,
    e: u64,
    len: u64,
    m: T,
) -> UnsignedPolynomial<T> {
    let p = p.truncate(len);
    let mut power = UnsignedPolynomial::one().truncate(len) % m;
    for _ in 0..e {
        power = mod_mul_polynomial_naive(&power, &p, m).truncate(len);
    }
    power
}