malachite-nz 0.13.0

The bignum types Natural and Integer, with efficient algorithms partially derived from GMP and FLINT.
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::integer::Integer;
use crate::integer_polynomial::IntegerPolynomial;
use alloc::vec::Vec;
use malachite_base::num::arithmetic::traits::PowerOf2;
use malachite_base::num::basic::unsigneds::PrimitiveUnsigned;
use malachite_base::num::conversion::traits::ExactFrom;
use malachite_base::polynomial::Polynomial;

// Multiplies every coefficient, read one at a time through `coefficient`, by 2 to the power of
// `bits`, and normalizes the result. Nothing is shared with the implementation.
pub fn shl_naive<T: PrimitiveUnsigned>(p: &IntegerPolynomial, bits: T) -> IntegerPolynomial
where
    u64: ExactFrom<T>,
{
    let factor = Integer::power_of_2(u64::exact_from(bits));
    IntegerPolynomial::from_coefficients_asc(
        (0..p.len())
            .map(|i| p.coefficient(i) * &factor)
            .collect::<Vec<Integer>>(),
    )
}