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
use crate::{Arc, BTreeSet, Data, HashMap, Rc, RefCell};
pub fn new<T>(x: T) -> std::rc::Rc<std::cell::RefCell<T>> {
Rc::new(RefCell::new(x))
}
pub fn nd() -> Data {
Arc::new(Vec::new())
}
pub fn newmap<K, T>() -> RefCell<HashMap<K, T>> {
RefCell::new(HashMap::new())
}
pub fn getu64(data: &[u8], off: usize) -> u64 {
let data = &data[off..off + 8];
u64::from_le_bytes(data.try_into().unwrap())
}
pub fn setu64(data: &mut [u8], val: u64) {
data[0..8].copy_from_slice(&val.to_le_bytes());
}
pub fn getf64(data: &[u8], off: usize) -> f64 {
let data = &data[off..off + 8];
f64::from_le_bytes(data.try_into().unwrap())
}
pub fn getf32(data: &[u8], off: usize) -> f32 {
let data = &data[off..off + 4];
f32::from_le_bytes(data.try_into().unwrap())
}
pub fn get(data: &[u8], off: usize, n: usize) -> u64 {
let mut buf = [0_u8; 8];
buf[0..n].copy_from_slice(&data[off..off + n]);
u64::from_le_bytes(buf)
}
pub fn iget(data: &[u8], off: usize, n: usize) -> i64 {
let mut x: u64 = get(data, off, n);
if n < 8 {
let sign_bit = 1 << (n * 8 - 1);
if (sign_bit & x) != 0 {
x += u64::MAX << (n * 8);
}
}
x as i64
}
pub fn set(data: &mut [u8], off: usize, val: u64, n: usize) {
let bytes = val.to_le_bytes();
data[off..off + n].copy_from_slice(&bytes[0..n]);
}
macro_rules! bitmask {
( $off: expr, $len: expr ) => {
((1 << $len) - 1) << $off
};
}
macro_rules! getbits {
( $val: expr, $off: expr, $len: expr ) => {
($val & bitmask!($off, $len)) >> $off
};
}
macro_rules! setbits {
( $var: expr, $off: expr, $len: expr, $val: expr ) => {
$var = ($var & !bitmask!($off, $len)) | (($val << $off) & bitmask!($off, $len))
};
}
pub fn hex(c: u8) -> u8
{
match c {
b'0'..=b'9' => c - b'0',
b'A'..=b'F' => c + 10 - b'A',
b'a'..=b'f' => c + 10 - b'a',
_ => {
panic!()
}
}
}
pub fn parse_hex(s: &[u8]) -> Vec<u8> {
let n = s.len() / 2;
let mut result = Vec::<u8>::with_capacity(n);
for i in 0..n {
result.push(hex(s[i * 2]) * 16 + hex(s[i * 2 + 1]));
}
result
}
pub fn to_hex(bytes: &[u8]) -> String {
const HEX: &[u8; 16] = b"0123456789abcdef";
let mut s = vec![b'0', b'x'];
for b in bytes {
let b = *b as usize;
s.push(HEX[b / 16]);
s.push(HEX[b % 16]);
}
String::from_utf8(s).unwrap()
}
#[derive(Default)]
pub struct SmallSet {
pub bitset: u64,
pub overflow: BTreeSet<usize>,
}
impl SmallSet {
pub fn insert(&mut self, x: usize) {
if x < 64 {
self.bitset |= 1 << x;
} else {
self.overflow.insert(x);
}
}
pub fn contains(&self, x: usize) -> bool {
if x < 64 {
self.bitset & (1 << x) != 0
} else {
self.overflow.contains(&x)
}
}
pub fn remove(&mut self, x: usize) -> bool {
if x < 64 {
let bit: u64 = 1 << x;
let result = self.bitset & bit != 0;
self.bitset &= u64::MAX - bit;
result
} else {
self.overflow.remove(&x)
}
}
}