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
29

// 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::unsigned_polynomial::UnsignedPolynomial;
use alloc::vec::Vec;
use core::cmp::max;

// Subtracts the polynomials coefficient by coefficient with `ModSub` for `T`, reading each
// coefficient through `coefficient`, which gives zero past the degree, and building the result with
// `from_coefficients_asc`, which trims. Nothing is shared with the implementation.
pub fn mod_sub_naive<T: PrimitiveUnsigned>(
    p: &UnsignedPolynomial<T>,
    q: &UnsignedPolynomial<T>,
    m: T,
) -> UnsignedPolynomial<T> {
    let len = max(p.len(), q.len());
    UnsignedPolynomial::from_coefficients_asc(
        (0..len)
            .map(|i| p.coefficient(i).mod_sub(q.coefficient(i), m))
            .collect::<Vec<T>>(),
    )
}