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
//! Byte-level operations
/// Split bytes at most n times
pub fn splitn<D: AsRef<[u8]>>(n: usize, data: &D, seperator: impl AsRef<[u8]>) -> Vec<&[u8]> {
// as ref
let sep = seperator.as_ref();
let mut data = data.as_ref();
// scan for seperator position
let mut buf = Vec::with_capacity(n);
while let Some(pos) = scan(data, sep) {
// check if n-length reached
if buf.len() + 1 == n {
break;
}
// split and add to buf
let (split, rest) = data.split_at(pos);
buf.push(split);
// remove seperator
data = rest.split_at(sep.len()).1;
}
// add remaining bytes and return
buf.push(data);
buf
}
/// Split bytes
pub fn split<D: AsRef<[u8]>>(data: &D, seperator: impl AsRef<[u8]>) -> Vec<&[u8]> {
// as ref
let sep = seperator.as_ref();
let mut data = data.as_ref();
// scan for seperator position
let mut buf = Vec::new();
while let Some(pos) = scan(data, sep) {
// split and add to buf
let (split, rest) = data.split_at(pos);
buf.push(split);
// remove seperator
data = rest.split_at(sep.len()).1;
}
// add remaining bytes and return
buf.push(data);
buf
}
/// Returns index of first byte in pattern
pub fn scan(data: impl AsRef<[u8]>, pattern: impl AsRef<[u8]>) -> Option<usize> {
// as ref
let data: &[u8] = data.as_ref();
let pat: &[u8] = pattern.as_ref();
// checks
if pat.len() > data.len() {
return None;
}
// iterate through data bytes
let mut found = 0usize;
for (i, &d) in data.iter().enumerate() {
// check if pattern matches
if d == pat[found] {
// found another byte
found += 1;
// check if found all
if found == pat.len() {
// return index of first byte in pattern
return Some(i + 1 - pat.len());
}
} else {
// pattern interrupted
found = 0;
}
}
// not found
None
}