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
use std::mem;
use std::ops::{Index, IndexMut};
use std::ops::Range;
use bit_vec::BitVec;
use row::{BitVecSlice, Iter};
use submatrix::{BitSubMatrix, BitSubMatrixMut};
use util::round_up_to_next;
use super::{BITS, TRUE, FALSE};
#[derive(Clone, Debug, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct BitMatrix {
bit_vec: BitVec,
row_bits: usize,
}
impl BitMatrix {
pub fn new(rows: usize, row_bits: usize) -> Self {
BitMatrix {
bit_vec: BitVec::from_elem(round_up_to_next(row_bits, BITS) * rows, false),
row_bits: row_bits,
}
}
#[inline]
fn num_rows(&self) -> usize {
if self.row_bits == 0 {
0
} else {
let row_blocks = round_up_to_next(self.row_bits, BITS) / BITS;
self.bit_vec.storage().len() / row_blocks
}
}
pub fn size(&self) -> (usize, usize) {
(self.num_rows(), self.row_bits)
}
#[inline]
pub fn set(&mut self, row: usize, col: usize, enabled: bool) {
let row_size_in_bits = round_up_to_next(self.row_bits, BITS);
self.bit_vec.set(row * row_size_in_bits + col, enabled);
}
pub fn grow(&mut self, num_rows: usize, value: bool) {
self.bit_vec.grow(round_up_to_next(self.row_bits, BITS) * num_rows, value);
}
#[inline]
pub fn sub_matrix(&self, range: Range<usize>) -> BitSubMatrix {
let row_size = round_up_to_next(self.row_bits, BITS) / BITS;
BitSubMatrix::new(
&self.bit_vec.storage()[range.start * row_size .. range.end * row_size],
self.row_bits
)
}
#[inline]
pub fn split_at(&self, row: usize)
-> (BitSubMatrix,
&BitVecSlice,
BitSubMatrixMut) {
unsafe {
(mem::transmute(self.sub_matrix(0 .. row)),
mem::transmute(&self[row]),
mem::transmute(self.sub_matrix(row + 1 .. self.num_rows())))
}
}
#[inline]
pub fn split_at_mut(&mut self, row: usize)
-> (BitSubMatrixMut,
&mut BitVecSlice,
BitSubMatrixMut) {
unsafe {
(mem::transmute(self.sub_matrix(0 .. row)),
mem::transmute(&mut self[row]),
mem::transmute(self.sub_matrix(row + 1 .. self.num_rows())))
}
}
pub fn iter_row(&self, row: usize) -> Iter {
BitVecSlice::new(&self[row]).iter_bits(self.row_bits)
}
pub fn transitive_closure(&mut self) {
assert_eq!(self.num_rows(), self.row_bits);
for pos in 0 .. self.row_bits {
let (mut rows0, row, mut rows1) = self.split_at_mut(pos);
for dst_row in rows0.iter_mut().chain(rows1.iter_mut()) {
if dst_row[pos] {
for (dst, src) in dst_row.iter_mut().zip(row.iter()) {
*dst |= *src;
}
}
}
}
}
}
impl Index<usize> for BitMatrix {
type Output = BitVecSlice;
#[inline]
fn index(&self, row: usize) -> &BitVecSlice {
let row_size = round_up_to_next(self.row_bits, BITS) / BITS;
unsafe {
mem::transmute(
&self.bit_vec.storage()[row * row_size .. (row + 1) * row_size]
)
}
}
}
impl IndexMut<usize> for BitMatrix {
#[inline]
fn index_mut(&mut self, row: usize) -> &mut BitVecSlice {
let row_size = round_up_to_next(self.row_bits, BITS) / BITS;
unsafe {
mem::transmute(
&mut self.bit_vec.storage_mut()[row * row_size .. (row + 1) * row_size]
)
}
}
}
impl Index<(usize, usize)> for BitMatrix {
type Output = bool;
#[inline]
fn index(&self, (row, col): (usize, usize)) -> &bool {
let row_size_in_bits = round_up_to_next(self.row_bits, BITS);
if self.bit_vec.get(row * row_size_in_bits + col).unwrap() {
&TRUE
} else {
&FALSE
}
}
}
#[test]
fn test_empty() {
let mut matrix = BitMatrix::new(0, 0);
for _ in 0..3 {
assert_eq!(matrix.num_rows(), 0);
assert_eq!(matrix.size(), (0, 0));
matrix.transitive_closure();
}
}