bit-buf 0.1.0

I needed this.
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

use crate::{Storage, StorageMut};

/// The main structure
///
/// Keeps track of the data storage and a cursor for automatic operations
#[derive(Debug)]
pub struct BitBuf<S> {
  data: S,
  pos: usize,
}

impl<S> BitBuf<S> {
  /// Construct from provided data storage
  pub const fn from(data: S) -> Self {
    Self { data, pos: 0 }
  }

  /// Get the underlying bytes from the storage
  #[inline(always)]
  pub fn bytes(&self) -> &[u8]
  where
    S: Storage,
  {
    self.data.as_bytes()
  }

  /// Get the underlying bytes from the storage
  #[inline(always)]
  pub fn bytes_mut(&mut self) -> &mut [u8]
  where
    S: StorageMut,
  {
    self.data.as_bytes_mut()
  }

  /// Advance the internal cursor for automatic operations
  ///
  /// <div class="warning">
  ///
  /// This does not enforce that the cursor stay within storage bounds
  ///
  /// </div>
  #[inline(always)]
  pub fn advance(&mut self, bits: usize) -> &mut Self {
    self.pos += bits;
    self
  }

  /// Set the internal cursor for automatic operations
  ///
  /// <div class="warning">
  ///
  /// This does not enforce that the cursor stay within storage bounds
  ///
  /// </div>
  #[inline(always)]
  pub fn seek(&mut self, offset: usize) -> &mut Self {
    self.pos = offset;
    self
  }

  /// Checks if the internal cursor for automatic operations is aligned on the start of a byte
  ///
  /// <div class="warning">
  ///
  /// This does not care whether the cursor is outside storage bounds
  ///
  /// </div>
  #[inline(always)]
  pub fn is_aligned(&self) -> bool {
    self.pos.is_multiple_of(8)
  }
}