binar 0.1.1

High-performance binary arithmetic.
Documentation 
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

use crate::{BitLength, Bitwise, BitwiseMut, BitwisePair, BitwisePairMut};
use sorted_iter::assume::AssumeSortedByItemExt;

pub trait BitwiseTruncated<Inner: ?Sized>
where
    Self: AsRef<Inner> + BitLength,
    Inner: Bitwise,
{
    #[inline]
    fn index(&self, index: usize) -> bool {
        assert!(index < self.bit_len());
        self.as_ref().index(index)
    }
    #[inline]
    fn weight(&self) -> usize {
        self.as_ref().weight()
    }
    #[inline]
    fn parity(&self) -> bool {
        self.as_ref().parity()
    }
    #[inline]
    fn is_zero(&self) -> bool {
        self.as_ref().is_zero()
    }
    #[inline]
    fn is_unit(&self, index: usize) -> bool {
        assert!(index < self.bit_len());
        self.as_ref().is_unit(index)
    }
    #[inline]
    fn support<'a>(&'a self) -> impl sorted_iter::SortedIterator<Item = usize>
    where
        Inner: 'a,
    {
        self.as_ref().support().take(self.bit_len()).assume_sorted_by_item()
    }
    #[inline]
    fn max_support(&self) -> Option<usize> {
        self.as_ref().max_support()
    }
    #[inline]
    fn min_support(&self) -> Option<usize> {
        self.as_ref().min_support()
    }
}

impl<T, Inner> BitwiseTruncated<Inner> for T
where
    T: AsRef<Inner> + BitLength,
    Inner: ?Sized + Bitwise,
{
}

pub trait BitwiseMutTruncated<Inner: ?Sized>
where
    Self: AsMut<Inner> + BitLength,
    Inner: BitwiseMut,
{
    #[inline]
    fn assign_index(&mut self, index: usize, to: bool) {
        assert!(index < self.bit_len());
        self.as_mut().assign_index(index, to);
    }

    #[inline]
    fn negate_index(&mut self, index: usize) {
        assert!(index < self.bit_len());
        self.as_mut().negate_index(index);
    }

    #[inline]
    fn clear_bits(&mut self) {
        self.as_mut().clear_bits();
    }

    fn assign_random(&mut self, bit_count: usize, random_number_generator: &mut impl rand::Rng)
    where
        Self: BitLength,
    {
        for j in 0..bit_count {
            self.assign_index(j, random_number_generator.r#gen());
        }
    }
}

impl<T, Inner> BitwiseMutTruncated<Inner> for T
where
    T: AsMut<Inner> + BitLength,
    Inner: ?Sized + BitwiseMut,
{
}

pub trait BitwisePairTruncated<Other: ?Sized, Inner: ?Sized, InnerOther: ?Sized = Inner>
where
    Self: AsRef<Inner> + BitLength,
    Other: AsRef<InnerOther> + BitLength,
    Inner: Bitwise,
    InnerOther: Bitwise,
    Inner: BitwisePair<InnerOther>,
{
    #[inline]
    fn dot(&self, other: &Other) -> bool {
        assert_eq!(self.bit_len(), other.bit_len());
        self.as_ref().dot(other.as_ref())
    }
    #[inline]
    fn and_weight(&self, other: &Other) -> usize {
        assert_eq!(self.bit_len(), other.bit_len());
        self.as_ref().and_weight(other.as_ref())
    }
    #[inline]
    fn or_weight(&self, other: &Other) -> usize {
        assert_eq!(self.bit_len(), other.bit_len());
        self.as_ref().or_weight(other.as_ref())
    }
    #[inline]
    fn xor_weight(&self, other: &Other) -> usize {
        assert_eq!(self.bit_len(), other.bit_len());
        self.as_ref().xor_weight(other.as_ref())
    }
}

impl<T, Other, Inner, InnerOther> BitwisePairTruncated<Other, Inner, InnerOther> for T
where
    T: ?Sized + AsRef<Inner> + BitLength,
    Other: ?Sized + AsRef<InnerOther> + BitLength,
    Inner: ?Sized + Bitwise,
    InnerOther: ?Sized + Bitwise,
    Inner: BitwisePair<InnerOther>,
{
}

pub trait BitwisePairMutTruncated<Other: ?Sized, BorrowedSelf: ?Sized, BorrowedOther: ?Sized = BorrowedSelf>
where
    Self: AsMut<BorrowedSelf> + BitLength,
    Other: AsRef<BorrowedOther> + BitLength,
    BorrowedSelf: Bitwise,
    BorrowedOther: Bitwise,
    BorrowedSelf: BitwisePairMut<BorrowedOther>,
{
    #[inline]
    fn assign(&mut self, other: &Other) {
        assert_eq!(self.bit_len(), other.bit_len());
        self.as_mut().assign(other.as_ref());
    }
    #[inline]
    fn bitxor_assign(&mut self, other: &Other) {
        assert_eq!(self.bit_len(), other.bit_len());
        self.as_mut().bitxor_assign(other.as_ref());
    }
    #[inline]
    fn bitand_assign(&mut self, other: &Other) {
        assert_eq!(self.bit_len(), other.bit_len());
        self.as_mut().bitand_assign(other.as_ref());
    }
    #[inline]
    fn bitor_assign(&mut self, other: &Other) {
        assert_eq!(self.bit_len(), other.bit_len());
        self.as_mut().bitor_assign(other.as_ref());
    }
}

impl<Bits, Other, BorrowedSelf, BorrowedOther> BitwisePairMutTruncated<Other, BorrowedSelf, BorrowedOther> for Bits
where
    Bits: ?Sized + AsMut<BorrowedSelf> + BitLength,
    Other: ?Sized + AsRef<BorrowedOther> + BitLength,
    BorrowedSelf: ?Sized + Bitwise,
    BorrowedOther: ?Sized + Bitwise,
    BorrowedSelf: BitwisePairMut<BorrowedOther>,
{
}