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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
// 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 core::ops::{Shl, ShlAssign, Shr, ShrAssign};
use malachite_base::num::arithmetic::traits::UnsignedAbs;
use malachite_base::num::basic::traits::Zero;
use malachite_base::num::conversion::traits::ExactFrom;
fn shl_unsigned_assign<T>(x: &mut Rational, bits: T)
where
u64: TryFrom<T>,
{
if *x == 0u32 {
return;
}
let denominator_zeros = x.denominator.trailing_zeros().unwrap();
let bits_64 = u64::exact_from(bits);
if denominator_zeros >= bits_64 {
x.denominator >>= bits_64;
} else {
x.denominator >>= denominator_zeros;
x.numerator <<= bits_64 - denominator_zeros;
}
}
fn shl_unsigned_ref<T>(x: &Rational, bits: T) -> Rational
where
u64: TryFrom<T>,
{
if *x == 0u32 {
return x.clone();
}
let denominator_zeros = x.denominator.trailing_zeros().unwrap();
let bits_64 = u64::exact_from(bits);
if denominator_zeros >= bits_64 {
Rational {
sign: x.sign,
numerator: x.numerator.clone(),
denominator: &x.denominator >> bits_64,
}
} else {
Rational {
sign: x.sign,
numerator: &x.numerator << (bits_64 - denominator_zeros),
denominator: &x.denominator >> denominator_zeros,
}
}
}
macro_rules! impl_shl_unsigned {
($t:ident) => {
impl Shl<$t> for Rational {
type Output = Rational;
/// Left-shifts a [`Rational`] (multiplies it by a power of 2), taking it by value.
///
/// $$
/// f(x, k) = x2^k.
/// $$
///
/// # Worst-case complexity
/// $T(n, m) = O(n + m)$
///
/// $M(n, m) = O(n + m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is `self.significant_bits()`, and
/// $m$ is `bits`.
///
/// # Examples
/// See [here](super::shl#shl).
#[inline]
fn shl(mut self, bits: $t) -> Rational {
self <<= bits;
self
}
}
impl Shl<$t> for &Rational {
type Output = Rational;
/// Left-shifts a [`Rational`] (multiplies it by a power of 2), taking it by value.
///
/// $$
/// f(x, k) = x2^k.
/// $$
///
/// # Worst-case complexity
/// $T(n, m) = O(n + m)$
///
/// $M(n, m) = O(n + m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is `self.significant_bits()`, and
/// $m$ is `bits`.
///
/// # Examples
/// See [here](super::shl#shl).
#[inline]
fn shl(self, bits: $t) -> Rational {
shl_unsigned_ref(self, bits)
}
}
impl ShlAssign<$t> for Rational {
/// Left-shifts a [`Rational`] (multiplies it by a power of 2), in place.
///
/// $$
/// x \gets x2^k.
/// $$
///
/// # Worst-case complexity
/// $T(n, m) = O(n + m)$
///
/// $M(n, m) = O(n + m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is `self.significant_bits()`, and
/// $m$ is `bits`.
///
/// # Examples
/// See [here](super::shl#shl_assign).
#[inline]
fn shl_assign(&mut self, bits: $t) {
shl_unsigned_assign(self, bits);
}
}
};
}
apply_to_unsigneds!(impl_shl_unsigned);
fn shl_signed_ref<'a, U, S: Copy + Ord + UnsignedAbs<Output = U> + Zero>(
x: &'a Rational,
bits: S,
) -> Rational
where
&'a Rational: Shl<U, Output = Rational> + Shr<U, Output = Rational>,
{
if bits >= S::ZERO {
x << bits.unsigned_abs()
} else {
x >> bits.unsigned_abs()
}
}
fn shl_assign_signed<U, S: Copy + Ord + UnsignedAbs<Output = U> + Zero>(x: &mut Rational, bits: S)
where
Rational: ShlAssign<U> + ShrAssign<U>,
{
if bits >= S::ZERO {
*x <<= bits.unsigned_abs();
} else {
*x >>= bits.unsigned_abs();
}
}
macro_rules! impl_shl_signed {
($t:ident) => {
impl Shl<$t> for Rational {
type Output = Rational;
/// Left-shifts a [`Rational`] (multiplies it or divides it by a power of 2), taking it
/// by value.
///
/// $$
/// f(x, k) = x2^k.
/// $$
///
/// # Worst-case complexity
/// $T(n, m) = O(n + m)$
///
/// $M(n, m) = O(n + m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is `self.significant_bits()`, and
/// $m$ is `max(bits, 0)`.
///
/// See [here](super::shl#shl).
#[inline]
fn shl(mut self, bits: $t) -> Rational {
self <<= bits;
self
}
}
impl Shl<$t> for &Rational {
type Output = Rational;
/// Left-shifts a [`Rational`] (multiplies or divides it by a power of 2), taking it by
/// reference.
///
/// $$
/// f(x, k) = x2^k.
/// $$
///
/// # Worst-case complexity
/// $T(n, m) = O(n + m)$
///
/// $M(n, m) = O(n + m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is `self.significant_bits()`, and
/// $m$ is `max(bits, 0)`.
///
/// See [here](super::shl#shl).
#[inline]
fn shl(self, bits: $t) -> Rational {
shl_signed_ref(self, bits)
}
}
impl ShlAssign<$t> for Rational {
/// Left-shifts a [`Rational`] (multiplies or divides it by a power of 2), in place.
///
/// $$
/// x \gets x2^k.
/// $$
///
/// # Worst-case complexity
/// $T(n, m) = O(n + m)$
///
/// $M(n, m) = O(n + m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is `self.significant_bits()`, and
/// $m$ is `bits`.
///
/// See [here](super::shl#shl_assign).
fn shl_assign(&mut self, bits: $t) {
shl_assign_signed(self, bits);
}
}
};
}
apply_to_signeds!(impl_shl_signed);