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
|
# Shared Bit-Slice Reverse Chunking
This iterator yields successive non-overlapping chunks of a bit-slice. Chunking
advances one subslice at a time, starting at the end of the bit-slice.
If the original bit-slice’s length is not evenly divided by the chunk width,
then the final chunk will be the remainder, and will be shorter than requested.
It is created by the [`BitSlice::rchunks`] method.
## Original
[`slice::RChunks`](core::slice::RChunks)
## Examples
```rust
use bitvec::prelude::*;
let bits = bits![0, 1, 0, 0, 0, 1, 1, 1];
let mut chunks = bits.rchunks(3);
assert_eq!(chunks.next().unwrap(), bits![1; 3]);
assert_eq!(chunks.next().unwrap(), bits![0; 3]);
assert_eq!(chunks.next().unwrap(), bits![0, 1]);
assert!(chunks.next().is_none());
```
[`BitSlice::rchunks`]: crate::slice::BitSlice::rchunks
|
