use malachite_base::num::arithmetic::mod_power_of_2_inverse::mod_power_of_2_inverse_fast;
use malachite_base::num::basic::signeds::PrimitiveSigned;
use malachite_base::num::basic::unsigneds::PrimitiveUnsigned;
use malachite_base::num::conversion::traits::WrappingFrom;
use malachite_base::test_util::bench::bucketers::pair_2_bucketer;
use malachite_base::test_util::bench::{run_benchmark, BenchmarkType};
use malachite_base::test_util::generators::common::{GenConfig, GenMode};
use malachite_base::test_util::generators::unsigned_pair_gen_var_39;
use malachite_base::test_util::num::arithmetic::mod_power_of_2_inverse::*;
use malachite_base::test_util::runner::Runner;
pub(crate) fn register(runner: &mut Runner) {
register_unsigned_demos!(runner, demo_mod_power_of_2_inverse);
register_unsigned_signed_match_benches!(runner, benchmark_mod_power_of_2_inverse_algorithms);
}
fn demo_mod_power_of_2_inverse<T: PrimitiveUnsigned>(gm: GenMode, config: GenConfig, limit: usize) {
for (n, pow) in unsigned_pair_gen_var_39::<T>().get(gm, &config).take(limit) {
if let Some(inverse) = n.mod_power_of_2_inverse(pow) {
println!("{}⁻¹ ≡ {} mod 2^{}", n, inverse, pow);
} else {
println!("{} is not invertible mod 2^{}", n, pow);
}
}
}
fn benchmark_mod_power_of_2_inverse_algorithms<
U: PrimitiveUnsigned + WrappingFrom<S>,
S: PrimitiveSigned + WrappingFrom<U>,
>(
gm: GenMode,
config: GenConfig,
limit: usize,
file_name: &str,
) {
run_benchmark(
&format!("{}.mod_power_of_2_inverse(u64)", U::NAME),
BenchmarkType::Algorithms,
unsigned_pair_gen_var_39::<U>().get(gm, &config),
gm.name(),
limit,
file_name,
&pair_2_bucketer("pow"),
&mut [
("default", &mut |(n, pow)| {
no_out!(n.mod_power_of_2_inverse(pow))
}),
("Euclidean", &mut |(n, pow)| {
no_out!(mod_power_of_2_inverse_euclidean::<U, S>(n, pow))
}),
("fast", &mut |(n, pow)| {
no_out!(mod_power_of_2_inverse_fast(n, pow))
}),
],
);
}