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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

// Copyright © 2026 Mikhail Hogrefe
//
// Uses code adopted from the FLINT Library.
//
//      Copyright © 2008, 2009 William Hart
//
//      Copyright © 2014 Fredrik Johansson
//
// 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_polynomial::arithmetic::coefficient::PolynomialCoefficient;
use crate::integer_polynomial::arithmetic::mul_truncated::tiny::mul_truncated_to_out_tiny;
use crate::platform::{SignedDoubleLimb, SignedLimb};

// Sets `out` to the coefficients of the product of the polynomials with coefficients `xs` and `ys`,
// both nonempty, using single-word arithmetic. Every element of `xs` and `ys` must be a small
// `fmpz`, and every coefficient of the product, and every partial sum of the terms that make it up,
// must fit in `SMALL_FMPZ_BITCOUNT_MAX` bits. `out` must have length `xs.len() + ys.len() - 1`, so
// this is the truncated product with nothing truncated.
//
// This is equivalent to `_fmpz_poly_mul_tiny1` from `fmpz_poly/mul.c`, FLINT 3.6.0.
crate_test_fn! {
#[inline]
mul_to_out_tiny_1<C: PolynomialCoefficient>(out: &mut [C], xs: &[C], ys: &[C]) {
    assert_eq!(out.len(), xs.len() + ys.len() - 1);
    mul_truncated_to_out_tiny::<SignedLimb, C>(out, xs, ys);
}}

// Sets `out` to the coefficients of the product of the polynomials with coefficients `xs` and `ys`,
// both nonempty, using double-word arithmetic. Every element of `xs` and `ys` must be a small
// `fmpz`, and every coefficient of the product, and every partial sum of the terms that make it up,
// must fit in `2 * Limb::WIDTH - 1` bits. `out` must have length `xs.len() + ys.len() - 1`.
//
// This is equivalent to `_fmpz_poly_mul_tiny2` from `fmpz_poly/mul.c`, FLINT 3.6.0.
crate_test_fn! {
#[inline]
mul_to_out_tiny_2<C: PolynomialCoefficient>(out: &mut [C], xs: &[C], ys: &[C]) {
    assert_eq!(out.len(), xs.len() + ys.len() - 1);
    mul_truncated_to_out_tiny::<SignedDoubleLimb, C>(out, xs, ys);
}}