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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142

// 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::num::basic::unsigneds::PrimitiveUnsigned;
use malachite_base::num::conversion::traits::ExactFrom;
use malachite_base::test_util::bench::{BenchmarkType, run_benchmark};
use malachite_base::test_util::generators::common::{GenConfig, GenMode};
use malachite_base::test_util::runner::Runner;
use malachite_nz::integer_polynomial::IntegerPolynomial;
use malachite_nz::test_util::bench::bucketers::pair_1_integer_polynomial_bit_bucketer;
use malachite_nz::test_util::generators::integer_polynomial_unsigned_pair_gen_var_3;
use malachite_nz::test_util::integer_polynomial::arithmetic::shl::shl_naive;
use std::ops::{Shl, ShlAssign};

pub(crate) fn register(runner: &mut Runner) {
    register_unsigned_demos!(runner, demo_integer_polynomial_shl_unsigned);
    register_unsigned_demos!(runner, demo_integer_polynomial_shl_unsigned_ref);
    register_unsigned_demos!(runner, demo_integer_polynomial_shl_assign_unsigned);

    register_unsigned_benches!(
        runner,
        benchmark_integer_polynomial_shl_unsigned_evaluation_strategy
    );
    register_unsigned_benches!(runner, benchmark_integer_polynomial_shl_unsigned_algorithms);
}

fn demo_integer_polynomial_shl_unsigned<T: PrimitiveUnsigned>(
    gm: GenMode,
    config: &GenConfig,
    limit: usize,
) where
    IntegerPolynomial: Shl<T, Output = IntegerPolynomial>,
{
    for (p, bits) in integer_polynomial_unsigned_pair_gen_var_3::<T>()
        .get(gm, config)
        .take(limit)
    {
        let p_old = p.clone();
        println!("({p_old}) << {bits} = {}", p << bits);
    }
}

fn demo_integer_polynomial_shl_unsigned_ref<T: PrimitiveUnsigned>(
    gm: GenMode,
    config: &GenConfig,
    limit: usize,
) where
    for<'a> &'a IntegerPolynomial: Shl<T, Output = IntegerPolynomial>,
{
    for (p, bits) in integer_polynomial_unsigned_pair_gen_var_3::<T>()
        .get(gm, config)
        .take(limit)
    {
        println!("&({p}) << {bits} = {}", &p << bits);
    }
}

fn demo_integer_polynomial_shl_assign_unsigned<T: PrimitiveUnsigned>(
    gm: GenMode,
    config: &GenConfig,
    limit: usize,
) where
    IntegerPolynomial: ShlAssign<T>,
{
    for (mut p, bits) in integer_polynomial_unsigned_pair_gen_var_3::<T>()
        .get(gm, config)
        .take(limit)
    {
        let p_old = p.clone();
        p <<= bits;
        println!("p := {p_old}; p <<= {bits}; p = {p}");
    }
}

fn benchmark_integer_polynomial_shl_unsigned_evaluation_strategy<T: PrimitiveUnsigned>(
    gm: GenMode,
    config: &GenConfig,
    limit: usize,
    file_name: &str,
) where
    IntegerPolynomial: Shl<T, Output = IntegerPolynomial> + ShlAssign<T>,
    for<'a> &'a IntegerPolynomial: Shl<T, Output = IntegerPolynomial>,
{
    run_benchmark(
        &format!("IntegerPolynomial << {}", T::NAME),
        BenchmarkType::EvaluationStrategy,
        integer_polynomial_unsigned_pair_gen_var_3::<T>().get(gm, config),
        gm.name(),
        limit,
        file_name,
        &pair_1_integer_polynomial_bit_bucketer("p"),
        &mut [
            (
                &format!("IntegerPolynomial << {}", T::NAME),
                &mut |(p, bits)| {
                    no_out!(p << bits);
                },
            ),
            (
                &format!("&IntegerPolynomial << {}", T::NAME),
                &mut |(p, bits)| {
                    no_out!(&p << bits);
                },
            ),
            (
                &format!("IntegerPolynomial <<= {}", T::NAME),
                &mut |(mut p, bits)| {
                    p <<= bits;
                },
            ),
        ],
    );
}

fn benchmark_integer_polynomial_shl_unsigned_algorithms<T: PrimitiveUnsigned>(
    gm: GenMode,
    config: &GenConfig,
    limit: usize,
    file_name: &str,
) where
    for<'a> &'a IntegerPolynomial: Shl<T, Output = IntegerPolynomial>,
    u64: ExactFrom<T>,
{
    run_benchmark(
        &format!("IntegerPolynomial << {}", T::NAME),
        BenchmarkType::Algorithms,
        integer_polynomial_unsigned_pair_gen_var_3::<T>().get(gm, config),
        gm.name(),
        limit,
        file_name,
        &pair_1_integer_polynomial_bit_bucketer("p"),
        &mut [
            ("default", &mut |(p, bits)| no_out!(&p << bits)),
            ("naive", &mut |(p, bits)| no_out!(shl_naive(&p, bits))),
        ],
    );
}