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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
use core::{
cmp,
convert::TryInto,
};
use alloc::{
borrow::ToOwned,
string::String,
vec::Vec,
};
pub enum SeekFrom {
Start(u64),
End(i64),
Current(i64),
}
#[derive(Clone, Debug)]
pub struct ByteCursor {
inner: Vec<u8>,
pos: u64,
}
impl ByteCursor {
#[must_use]
pub const fn new(inner: Vec<u8>) -> Self { Self { pos: 0, inner } }
#[must_use]
pub fn into_inner(self) -> Vec<u8> { self.inner }
#[must_use]
pub const fn get_ref(&self) -> &Vec<u8> { &self.inner }
pub fn get_mut(&mut self) -> &mut Vec<u8> { &mut self.inner }
#[must_use]
pub const fn position(&self) -> u64 { self.pos }
pub fn set_position(&mut self, pos: u64) { self.pos = pos }
pub fn read(&mut self, buf: &mut [u8]) -> usize {
let from = &mut self.fill_buf();
let amt = cmp::min(buf.len(), from.len());
let (a, b) = from.split_at(amt);
if amt == 1 {
buf[0] = a[0];
}
else {
buf[..amt].copy_from_slice(a);
}
*from = b;
self.pos += amt as u64;
amt
}
pub fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), String> {
let n = buf.len();
let from = &mut self.fill_buf();
if buf.len() > from.len() {
return Err("failed to fill whole buffer".to_owned());
}
let (a, b) = from.split_at(buf.len());
if buf.len() == 1 {
buf[0] = a[0];
}
else {
buf.copy_from_slice(a);
}
*from = b;
self.pos += n as u64;
Ok(())
}
pub fn fill_buf(&mut self) -> &[u8] {
let amt = cmp::min(self.pos, self.inner.len() as u64);
&self.inner[(amt as usize)..]
}
pub fn seek(&mut self, style: &SeekFrom) -> Result<u64, String> {
let (base_pos, offset) = match style {
SeekFrom::Start(n) => {
self.pos = *n;
return Ok(*n);
}
SeekFrom::End(n) => {
let x: &[u8] = self.inner.as_ref();
(x.len() as u64, n)
}
SeekFrom::Current(n) => (self.pos, n),
};
let new_pos = if *offset >= 0 {
base_pos.checked_add(*offset as u64)
}
else {
base_pos.checked_sub((offset.wrapping_neg()) as u64)
};
match new_pos {
Some(n) => {
self.pos = n;
Ok(self.pos)
}
None => {
Err("invalid seek to a negative or overflowing position".to_owned())
}
}
}
pub fn write(&mut self, buf: &[u8]) -> Result<usize, String> {
let vec = &mut self.inner;
let pos: usize = self.pos.try_into().map_err(|_| {
"cursor position exceeds maximum possible vector length".to_owned()
})?;
let len = vec.len();
if len < pos {
vec.resize(pos, 0);
}
{
let space = vec.len() - pos;
let (left, right) = buf.split_at(cmp::min(space, buf.len()));
vec[pos..pos + left.len()].copy_from_slice(left);
vec.extend_from_slice(right);
}
self.pos = (pos + buf.len()) as u64;
Ok(buf.len())
}
pub fn write_all(&mut self, mut buf: &[u8]) -> Result<(), String> {
while !buf.is_empty() {
match self.write(buf) {
Ok(0) => {
return Err("failed to write whole buffer".to_owned());
}
Ok(n) => buf = &buf[n..],
Err(e) => return Err(e),
}
}
Ok(())
}
}