1385 /// and having constant capacity typically can have a very simple |
1385 /// and having constant capacity typically can have a very simple |
1386 /// implementation. |
1386 /// implementation. |
1387 fn vec_of_empty(sets_size: usize, vec_len: usize) -> Vec<Self>; |
1387 fn vec_of_empty(sets_size: usize, vec_len: usize) -> Vec<Self>; |
1388 |
1388 |
1389 /// The size of the bit mask in memory |
1389 /// The size of the bit mask in memory |
1390 #[allow(unused)] |
|
1391 fn size(&self) -> usize; |
1390 fn size(&self) -> usize; |
1392 |
1391 |
1393 /// The number of elements that can be represented in the set. |
1392 /// The number of elements that can be represented in the set. |
1394 /// |
1393 /// |
1395 /// Another way to put it is that it is the highest integer `C` such that |
1394 /// Another way to put it is that it is the highest integer `C` such that |
1396 /// the set is guaranteed to always be a subset of the integer range |
1395 /// the set is guaranteed to always be a subset of the integer range |
1397 /// `[0, C)` |
1396 /// `[0, C)` |
1398 #[allow(unused)] |
|
1399 fn capacity(&self) -> usize; |
1397 fn capacity(&self) -> usize; |
1400 |
1398 |
1401 /// Declare `n` to belong to the set |
1399 /// Declare `n` to belong to the set |
1402 fn add(&mut self, n: usize); |
1400 fn add(&mut self, n: usize); |
1403 |
1401 |
1404 /// Declare `n` not to belong to the set |
1402 /// Declare `n` not to belong to the set |
1405 #[allow(unused)] |
|
1406 fn discard(&mut self, n: usize); |
1403 fn discard(&mut self, n: usize); |
1407 |
1404 |
1408 /// Replace this bit set by its union with other |
1405 /// Replace this bit set by its union with other |
1409 fn union(&mut self, other: &Self); |
1406 fn union(&mut self, other: &Self); |
1410 |
1407 |