malachite-q 0.14.0

The arbitrary-precision type Rational, 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

// 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::Rational;
use crate::rational_polynomial::RationalPolynomial;
use alloc::vec::Vec;
use malachite_base::polynomial::Polynomial;

// Multiplies the coefficient of x^i, read one at a time through `coefficient` as a `Rational`, by i
// for each i from 1, and rebuilds the polynomial from the results. Nothing is shared with the
// implementation.
pub fn derivative_naive(p: &RationalPolynomial) -> RationalPolynomial {
    RationalPolynomial::from_coefficients_asc(
        (1..p.len())
            .map(|i| p.coefficient(i) * Rational::from(i))
            .collect::<Vec<Rational>>(),
    )
}