traits.rs 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312
  1. use core::ops::{BitAnd, BitAndAssign, BitOrAssign, Not};
  2. /// A trait that defines generalised operations on a `Bits::Store` type.
  3. pub trait BitOps:
  4. BitAndAssign + Sized + Copy + PartialEq + Not + BitOrAssign + BitOrAssign + BitAnd
  5. {
  6. fn get(bits: &Self, index: usize) -> bool;
  7. fn set(bits: &mut Self, index: usize, value: bool) -> bool;
  8. fn set_value(bits: &mut Self, value: Self);
  9. fn len(bits: &Self) -> usize;
  10. fn first_index(bits: &Self) -> Option<usize>;
  11. fn first_false_index(bits: &Self) -> Option<usize>;
  12. fn last_index(bits: &Self) -> Option<usize>;
  13. fn last_false_index(bits: &Self) -> Option<usize>;
  14. fn next_index(bits: &Self, index: usize) -> Option<usize>;
  15. fn next_false_index(bits: &Self, index: usize) -> Option<usize>;
  16. fn prev_index(bits: &Self, index: usize) -> Option<usize>;
  17. fn prev_false_index(bits: &Self, index: usize) -> Option<usize>;
  18. fn bit_and(bits: &mut Self, other_bits: &Self);
  19. fn bit_or(bits: &mut Self, other_bits: &Self);
  20. fn bit_xor(bits: &mut Self, other_bits: &Self);
  21. fn invert(bits: &mut Self);
  22. fn make_mask(shift: usize) -> Self;
  23. fn bit_size() -> usize;
  24. fn zero() -> Self;
  25. fn max() -> Self;
  26. }
  27. macro_rules! bitops_for {
  28. ($target:ty) => {
  29. impl BitOps for $target {
  30. #[inline]
  31. fn get(bits: &Self, index: usize) -> bool {
  32. bits & (1 << index) != 0
  33. }
  34. #[inline]
  35. fn set(bits: &mut Self, index: usize, value: bool) -> bool {
  36. let mask = 1 << index;
  37. let prev = *bits & mask;
  38. if value {
  39. *bits |= mask;
  40. } else {
  41. *bits &= !mask;
  42. }
  43. prev != 0
  44. }
  45. #[inline]
  46. fn set_value(bits: &mut Self, value: Self) {
  47. *bits = value;
  48. }
  49. #[inline]
  50. fn len(bits: &Self) -> usize {
  51. bits.count_ones() as usize
  52. }
  53. #[inline]
  54. fn first_index(bits: &Self) -> Option<usize> {
  55. if *bits == 0 {
  56. None
  57. } else {
  58. Some(bits.trailing_zeros() as usize)
  59. }
  60. }
  61. #[inline]
  62. fn first_false_index(bits: &Self) -> Option<usize> {
  63. if *bits == <$target>::MAX {
  64. None
  65. } else {
  66. Some(bits.trailing_ones() as usize)
  67. }
  68. }
  69. #[inline]
  70. fn last_index(bits: &Self) -> Option<usize> {
  71. if *bits == 0 {
  72. None
  73. } else {
  74. Some(<$target>::BITS as usize - 1 - (bits.leading_zeros() as usize))
  75. }
  76. }
  77. #[inline]
  78. fn last_false_index(bits: &Self) -> Option<usize> {
  79. if *bits == <$target>::MAX {
  80. None
  81. } else {
  82. Some(<$target>::BITS as usize - 1 - bits.leading_ones() as usize)
  83. }
  84. }
  85. #[inline]
  86. fn next_index(bits: &Self, index: usize) -> Option<usize> {
  87. if *bits == 0 || index >= <$target>::BITS as usize - 1 {
  88. None
  89. } else {
  90. let intermediate =
  91. (*bits & (<$target>::MAX.overflowing_shl(1 + index as u32).0));
  92. if intermediate == 0 {
  93. None
  94. } else {
  95. Some(intermediate.trailing_zeros() as usize)
  96. }
  97. }
  98. }
  99. #[inline]
  100. fn next_false_index(bits: &Self, index: usize) -> Option<usize> {
  101. if *bits == <$target>::MAX || index >= <$target>::BITS as usize - 1 {
  102. None
  103. } else {
  104. let intermediate = (*bits | ((1 << (index + 1)) - 1));
  105. if intermediate == <$target>::MAX {
  106. None
  107. } else {
  108. Some(intermediate.trailing_ones() as usize)
  109. }
  110. }
  111. }
  112. #[inline]
  113. fn prev_index(bits: &Self, index: usize) -> Option<usize> {
  114. if *bits == 0 || index == 0 {
  115. None
  116. } else {
  117. let intermediate = bits & ((1 << index) - 1);
  118. if intermediate == 0 {
  119. None
  120. } else {
  121. Some(<$target>::BITS as usize - 1 - (intermediate.leading_zeros() as usize))
  122. }
  123. }
  124. }
  125. #[inline]
  126. fn prev_false_index(bits: &Self, index: usize) -> Option<usize> {
  127. if *bits == <$target>::MAX || index == 0 {
  128. None
  129. } else {
  130. let intermediate = bits | (<$target>::MAX.overflowing_shl(index as u32).0);
  131. if intermediate == <$target>::MAX {
  132. None
  133. } else {
  134. Some(<$target>::BITS as usize - 1 - (intermediate.leading_ones() as usize))
  135. }
  136. }
  137. }
  138. #[inline]
  139. fn bit_and(bits: &mut Self, other_bits: &Self) {
  140. *bits &= *other_bits;
  141. }
  142. #[inline]
  143. fn bit_or(bits: &mut Self, other_bits: &Self) {
  144. *bits |= *other_bits;
  145. }
  146. #[inline]
  147. fn bit_xor(bits: &mut Self, other_bits: &Self) {
  148. *bits ^= *other_bits;
  149. }
  150. #[inline]
  151. fn invert(bits: &mut Self) {
  152. *bits = !*bits;
  153. }
  154. #[inline]
  155. fn make_mask(shift: usize) -> Self {
  156. if shift == <$target>::BITS as usize {
  157. <$target>::MAX
  158. } else {
  159. (1 << shift) - 1
  160. }
  161. }
  162. #[inline]
  163. fn bit_size() -> usize {
  164. <$target>::BITS as usize
  165. }
  166. #[inline]
  167. fn zero() -> Self {
  168. 0
  169. }
  170. #[inline]
  171. fn max() -> Self {
  172. <$target>::MAX
  173. }
  174. }
  175. };
  176. }
  177. // 为 `u8` 、 `u16` 、 `u32` 和 `u64` 实现 `BitOps` trait
  178. bitops_for!(u8);
  179. bitops_for!(u16);
  180. bitops_for!(u32);
  181. bitops_for!(u64);
  182. bitops_for!(usize);
  183. /// Bitmap应当实现的trait
  184. pub trait BitMapOps<T: BitOps> {
  185. /// 获取指定index的位
  186. ///
  187. /// ## 返回
  188. ///
  189. /// - `Some(true)` - 该位为1
  190. /// - `Some(false)` - 该位为0
  191. /// - `None` - index超出范围
  192. fn get(&self, index: usize) -> Option<bool>;
  193. /// 设置指定index的位,并返回该位之前的值
  194. ///
  195. /// ## 参数
  196. ///
  197. /// - `index` - 位的index
  198. /// - `value` - 位的新值
  199. ///
  200. /// ## 返回
  201. ///
  202. /// - `Some(true)` - 该位之前为1
  203. /// - `Some(false)` - 该位之前为0
  204. /// - `None` - index超出范围
  205. fn set(&mut self, index: usize, value: bool) -> Option<bool>;
  206. /// 将所有位设置为指定值
  207. fn set_all(&mut self, value: bool);
  208. /// 获取bitmap的长度(以位为单位)
  209. ///
  210. /// ## Example
  211. ///
  212. /// ```
  213. /// use bitmap::StaticBitmap;
  214. /// use bitmap::traits::BitMapOps;
  215. ///
  216. /// let mut bitmap = StaticBitmap::<34>::new();
  217. /// assert_eq!(bitmap.len(), 34);
  218. /// ```
  219. ///
  220. fn len(&self) -> usize;
  221. /// 获取bitmap的大小(以字节为单位)
  222. fn size(&self) -> usize;
  223. /// 获取第一个为1的位的index
  224. ///
  225. /// ## 返回
  226. ///
  227. /// - `Some(index)` - 第一个为1的位的index
  228. /// - `None` - 不存在为1的位
  229. fn first_index(&self) -> Option<usize>;
  230. /// 获取第一个为0的位的index
  231. ///
  232. /// ## 返回
  233. ///
  234. /// - `Some(index)` - 第一个为0的位的index
  235. /// - `None` - 不存在为0的位
  236. fn first_false_index(&self) -> Option<usize>;
  237. /// 获取最后一个为1的位的index
  238. ///
  239. /// ## 返回
  240. ///
  241. /// - `Some(index)` - 最后一个为1的位的index
  242. /// - `None` - 不存在为1的位
  243. fn last_index(&self) -> Option<usize>;
  244. /// 获取最后一个为0的位的index
  245. ///
  246. /// ## 返回
  247. ///
  248. /// - `Some(index)` - 最后一个为0的位的index
  249. /// - `None` - 不存在为0的位
  250. fn last_false_index(&self) -> Option<usize>;
  251. /// 获取指定index之后第一个为1的位的index
  252. fn next_index(&self, index: usize) -> Option<usize>;
  253. /// 获取指定index之后第一个为0的位的index
  254. fn next_false_index(&self, index: usize) -> Option<usize>;
  255. /// 获取指定index之前第一个为1的位的index
  256. fn prev_index(&self, index: usize) -> Option<usize>;
  257. /// 获取指定index之前第一个为0的位的index
  258. fn prev_false_index(&self, index: usize) -> Option<usize>;
  259. /// 反转bitmap
  260. fn invert(&mut self);
  261. /// 判断bitmap是否满了
  262. fn is_full(&self) -> bool;
  263. /// 判断bitmap是否为空
  264. fn is_empty(&self) -> bool;
  265. /// # Safety
  266. /// *不应直接修改字节数组*
  267. ///
  268. /// 将bitmap转换为字节数组
  269. unsafe fn as_bytes(&self) -> &[u8];
  270. }