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
use core::cmp::*;
use awint_internals::*;
use crate::Bits;
impl PartialEq for Bits {
fn eq(&self, rhs: &Self) -> bool {
self.bw() == rhs.bw() && self.const_eq(rhs).unwrap()
}
}
impl Eq for Bits {}
impl Bits {
pub const fn is_zero(&self) -> bool {
for_each!(self, x, {
if x != 0 {
return false
}
});
true
}
pub const fn is_umax(&self) -> bool {
for_each!(self, x, {0..(self.len() - 1)} {
if x != MAX {
return false
}
});
if self.extra() == 0 {
self.last() == MAX
} else {
self.last() == (MAX >> self.unused())
}
}
pub const fn is_imax(&self) -> bool {
for_each!(self, x, {0..(self.len() - 1)} {
if x != MAX {
return false
}
});
if self.extra() == 0 {
self.last() == MAX >> 1
} else {
self.last() == !(MAX << (self.extra() - 1))
}
}
pub const fn is_imin(&self) -> bool {
for_each!(self, x, {0..(self.len() - 1)} {
if x != 0 {
return false
}
});
if self.extra() == 0 {
self.last() == (isize::MIN as usize)
} else {
self.last() == (1 << (self.extra() - 1))
}
}
pub const fn is_uone(&self) -> bool {
if self.first() != 1 {
return false
}
for_each!(self, x, {1..self.len()} {
if x != 0 {
return false
}
});
true
}
pub const fn const_eq(&self, rhs: &Self) -> Option<bool> {
binop_for_each!(self, rhs, x, y, {0..self.len()}.rev() {
if x != y {
return Some(false)
}
});
Some(true)
}
pub const fn const_ne(&self, rhs: &Self) -> Option<bool> {
binop_for_each!(self, rhs, x, y, {0..self.len()}.rev() {
if x != y {
return Some(true)
}
});
Some(false)
}
pub const fn ult(&self, rhs: &Self) -> Option<bool> {
binop_for_each!(self, rhs, x, y, {0..self.len()}.rev() {
if x < y {
return Some(true)
} else if x != y {
return Some(false)
}
});
Some(false)
}
pub const fn ule(&self, rhs: &Self) -> Option<bool> {
binop_for_each!(self, rhs, x, y, {0..self.len()}.rev() {
if x < y {
return Some(true)
} else if x != y {
return Some(false)
}
});
Some(true)
}
pub const fn ugt(&self, rhs: &Self) -> Option<bool> {
binop_for_each!(self, rhs, x, y, {0..self.len()}.rev() {
if x < y {
return Some(false)
} else if x != y {
return Some(true)
}
});
Some(false)
}
pub const fn uge(&self, rhs: &Self) -> Option<bool> {
binop_for_each!(self, rhs, x, y, {0..self.len()}.rev() {
if x < y {
return Some(false)
} else if x != y {
return Some(true)
}
});
Some(true)
}
pub const fn ilt(&self, rhs: &Self) -> Option<bool> {
binop_for_each!(self, rhs, x, y, {
if self.msb() != rhs.msb() {
return Some(self.msb())
}
},
{0..self.len()}.rev() {
if x < y {
return Some(true)
} else if x != y {
return Some(false)
}
});
Some(false)
}
pub const fn ile(&self, rhs: &Self) -> Option<bool> {
binop_for_each!(self, rhs, x, y, {
if self.msb() != rhs.msb() {
return Some(self.msb())
}
},
{0..self.len()}.rev() {
if x < y {
return Some(true)
} else if x != y {
return Some(false)
}
});
Some(true)
}
pub const fn igt(&self, rhs: &Self) -> Option<bool> {
binop_for_each!(self, rhs, x, y, {
if self.msb() != rhs.msb() {
return Some(rhs.msb())
}
},
{0..self.len()}.rev() {
if x < y {
return Some(false)
} else if x != y {
return Some(true)
}
});
Some(false)
}
pub const fn ige(&self, rhs: &Self) -> Option<bool> {
binop_for_each!(self, rhs, x, y, {
if self.msb() != rhs.msb() {
return Some(rhs.msb())
}
},
{0..self.len()}.rev() {
if x < y {
return Some(false)
} else if x != y {
return Some(true)
}
});
Some(true)
}
}