Enum BencodeItemView

pub enum BencodeItemView<'a> {
    Integer(i64),
    ByteString(&'a [u8]),
    List(Vec<BencodeItemView<'a>>),
    Dictionary(BTreeMap<&'a [u8], BencodeItemView<'a>>),
}

Representation of bencode blobs as a tree. The lifetime is tied to the text in memory, achieving almost zero copy. This is perhaps unsuitable for large bencode blobs since the entire blob may not fit inside the memory.

An owned version is on the agenda but I can’t be bothered right now.

Variants

Integer(i64)

Bencode integers are represented as i64 for now, technically this is not to specification since no range limit is specified in the bencode document.

ByteString(&'a [u8])

Bencode strings are not guaranteed to be UTF-8, thus using a byte slice

List(Vec<BencodeItemView<'a>>)

Bencode lists, note lists may not be homogeneous

Dictionary(BTreeMap<&'a [u8], BencodeItemView<'a>>)

Bencode dictionary, note lists may not be homogeneous. Bencode dictionary by specification must be lexicographically sorted, BTree preserves ordering

Trait Implementations

impl<'a> Clone for BencodeItemView<'a>

fn clone(&self) -> BencodeItemView<'a>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a> Debug for BencodeItemView<'a>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a> Hash for BencodeItemView<'a>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a> Ord for BencodeItemView<'a>

fn cmp(&self, other: &BencodeItemView<'a>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'a> PartialEq for BencodeItemView<'a>

fn eq(&self, other: &BencodeItemView<'a>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a> PartialOrd for BencodeItemView<'a>

fn partial_cmp(&self, other: &BencodeItemView<'a>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a> Eq for BencodeItemView<'a>

impl<'a> StructuralPartialEq for BencodeItemView<'a>