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

//! Some utilities used in SEEC.

use crate::common::BitVec;
use bitvec::prelude::BitStore;
use num_integer::div_ceil;
use rand::{CryptoRng, Fill, Rng};
use serde::{Deserialize, Serialize};
use std::cmp::Ordering;
use std::error::Error;
use std::fmt::{Display, Formatter};
use std::hash::{Hash, Hasher};
use std::ops::{BitAndAssign, BitXorAssign, RangeInclusive};
use std::{array, mem};

pub(crate) struct ByAddress<'a, T: ?Sized>(pub(crate) &'a T);

impl<'a, T: ?Sized> Hash for ByAddress<'a, T> {
    fn hash<H: Hasher>(&self, state: &mut H) {
        std::ptr::hash(self.0, state)
    }
}

impl<'a, T: ?Sized> PartialEq for ByAddress<'a, T> {
    fn eq(&self, other: &Self) -> bool {
        std::ptr::eq(self.0, other.0)
    }
}

impl<'a, T: ?Sized> Eq for ByAddress<'a, T> {}

#[derive(Eq, Debug, Clone, Serialize, Deserialize)]
pub(crate) struct RangeInclusiveStartWrapper<T> {
    pub(crate) range: RangeInclusive<T>,
}

impl<T> RangeInclusiveStartWrapper<T> {
    pub(crate) fn new(range: RangeInclusive<T>) -> RangeInclusiveStartWrapper<T> {
        RangeInclusiveStartWrapper { range }
    }
}

impl<T> PartialEq for RangeInclusiveStartWrapper<T>
where
    T: Eq,
{
    #[inline]
    fn eq(&self, other: &RangeInclusiveStartWrapper<T>) -> bool {
        self.range.start() == other.range.start() && self.range.end() == other.range.end()
    }
}

impl<T> Ord for RangeInclusiveStartWrapper<T>
where
    T: Ord,
{
    #[inline]
    fn cmp(&self, other: &RangeInclusiveStartWrapper<T>) -> Ordering {
        match self.range.start().cmp(other.range.start()) {
            Ordering::Equal => self.range.end().cmp(other.range.end()),
            not_eq => not_eq,
        }
    }
}

impl<T> PartialOrd for RangeInclusiveStartWrapper<T>
where
    T: Ord,
{
    #[inline]
    fn partial_cmp(&self, other: &RangeInclusiveStartWrapper<T>) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

/// Helper method to quickly create an array of random BitVecs.
pub(crate) fn rand_bitvecs<R: CryptoRng + Rng, const N: usize>(
    size: usize,
    rng: &mut R,
) -> [BitVec<usize>; N] {
    array::from_fn(|_| rand_bitvec(size, rng))
}

pub(crate) fn rand_bitvec<T, R>(size: usize, rng: &mut R) -> BitVec<T>
where
    T: BitStore + Copy,
    [T]: Fill,
    R: CryptoRng + Rng,
{
    let bitstore_items = div_ceil(size, mem::size_of::<T>() * 8);
    let mut buf = vec![T::ZERO; bitstore_items];
    rng.fill(&mut buf[..]);
    let mut bv = BitVec::from_vec(buf);
    bv.truncate(size);
    bv
}

/// Provides methods for fast bitwise AND and XOR on BitVecs.
pub(crate) trait BitVecExt: Sized {
    fn fast_bit_xor_mut(&mut self, other: &Self) -> &mut Self;
    fn fast_bit_and_mut(&mut self, other: &Self) -> &mut Self;

    fn fast_bit_xor(mut self, other: &Self) -> Self {
        self.fast_bit_xor_mut(other);
        self
    }
    fn fast_bit_and(mut self, other: &Self) -> Self {
        self.fast_bit_and_mut(other);
        self
    }
}

impl<T: BitStore + Copy + BitXorAssign + BitAndAssign> BitVecExt for BitVec<T> {
    fn fast_bit_xor_mut(&mut self, other: &Self) -> &mut Self {
        self.as_raw_mut_slice()
            .iter_mut()
            .zip(other.as_raw_slice())
            .for_each(|(a, b)| {
                *a ^= *b;
            });
        self
    }

    fn fast_bit_and_mut(&mut self, other: &Self) -> &mut Self {
        self.as_raw_mut_slice()
            .iter_mut()
            .zip(other.as_raw_slice())
            .for_each(|(a, b)| {
                *a &= *b;
            });
        self
    }
}

pub struct ErasedError<I>(pub I);

#[derive(Debug)]
pub struct BoxError(pub Box<dyn Error + Send + Sync>);

impl BoxError {
    pub fn from_err<E: Error + Send + Sync + 'static>(err: E) -> Self {
        Self(Box::new(err))
    }
}

impl Display for BoxError {
    fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
        self.0.fmt(f)
    }
}

impl Error for BoxError {
    fn source(&self) -> Option<&(dyn Error + 'static)> {
        self.0.source()
    }
}

impl From<Box<dyn Error + Send + Sync>> for BoxError {
    fn from(value: Box<dyn Error + Send + Sync>) -> Self {
        Self(value)
    }
}

#[allow(unused)]
pub(crate) fn take_arr<const N: usize, I: Iterator>(iter: &mut I) -> [I::Item; N] {
    array::from_fn(|_| iter.next().expect("Input array has insufficient elements"))
}