struct Reader<'a> {
rest: &'a [u8],
}Expand description
A cursor over the block being read.
Fields§
§rest: &'a [u8]What has not been read yet.
Implementations§
Source§impl<'a> Reader<'a>
impl<'a> Reader<'a>
Sourcefn take(&mut self, count: usize) -> Result<&'a [u8], CborError>
fn take(&mut self, count: usize) -> Result<&'a [u8], CborError>
Takes count bytes, or says how many were missing.
Sourcefn header(&mut self) -> Result<Header, CborError>
fn header(&mut self) -> Result<Header, CborError>
Reads a header, refusing every non-shortest and indefinite form.
Sourcefn bytes(&mut self, length: u64) -> Result<&'a [u8], CborError>
fn bytes(&mut self, length: u64) -> Result<&'a [u8], CborError>
Reads a byte string’s contents.
Sourcefn text(&mut self, length: u64) -> Result<String, CborError>
fn text(&mut self, length: u64) -> Result<String, CborError>
Reads a text string’s contents, which must be UTF-8.
Sourcefn map(&mut self, count: u64, depth: usize) -> Result<Value, CborError>
fn map(&mut self, count: u64, depth: usize) -> Result<Value, CborError>
Reads a map’s entries, which must be text-keyed and in order.
The ordering check is what makes decoding the inverse of encoding: a
BTreeMap would happily hold keys read in any order and re-encode
them sorted, so the block that arrived and the block that leaves would
differ while every value in them matched.
Auto Trait Implementations§
impl<'a> Freeze for Reader<'a>
impl<'a> RefUnwindSafe for Reader<'a>
impl<'a> Send for Reader<'a>
impl<'a> Sync for Reader<'a>
impl<'a> Unpin for Reader<'a>
impl<'a> UnsafeUnpin for Reader<'a>
impl<'a> UnwindSafe for Reader<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more