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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53

// 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 malachite_base::test_util::bench::bucketers::pair_unsigned_polynomial_max_bit_bucketer;
use malachite_base::test_util::bench::{BenchmarkType, run_benchmark};
use malachite_base::test_util::generators::common::{GenConfig, GenMode};
use malachite_base::test_util::generators::unsigned_polynomial_pair_gen;
use malachite_base::test_util::runner::Runner;
use malachite_base::test_util::unsigned_polynomial::comparison::cmp::*;

pub(crate) fn register(runner: &mut Runner) {
    register_demo!(runner, demo_unsigned_polynomial_cmp);

    register_bench!(runner, benchmark_unsigned_polynomial_cmp_algorithms);
}

fn demo_unsigned_polynomial_cmp(gm: GenMode, config: &GenConfig, limit: usize) {
    for (p, q) in unsigned_polynomial_pair_gen().get(gm, config).take(limit) {
        println!("({}).cmp(&{}) = {:?}", p, q, p.cmp(&q));
    }
}

// `cmp`'s result is what is being timed, so the benchmark discards it on purpose.
#[allow(unused_must_use)]
fn benchmark_unsigned_polynomial_cmp_algorithms(
    gm: GenMode,
    config: &GenConfig,
    limit: usize,
    file_name: &str,
) {
    run_benchmark(
        "UnsignedPolynomial<u64>.cmp(&UnsignedPolynomial<u64>)",
        BenchmarkType::Algorithms,
        unsigned_polynomial_pair_gen().get(gm, config),
        gm.name(),
        limit,
        file_name,
        &pair_unsigned_polynomial_max_bit_bucketer("p", "q"),
        &mut [
            ("default", &mut |(p, q)| no_out!(p.cmp(&q))),
            // Gives up where the values do not fit in a `u128`, so this arm is doing less work than
            // the default one on the larger inputs rather than more.
            ("evaluating both polynomials", &mut |(p, q)| {
                no_out!(unsigned_polynomial_cmp_evaluated(&p, &q));
            }),
        ],
    );
}