Enum Bencode 

pub enum Bencode {
    Dict(BTreeMap<Vec<u8>, Bencode>),
    List(Vec<Bencode>),
    ByteString(Vec<u8>),
    Int(i64),
}

A found bencode object whilst parsing, only one is returned from parse due to the bencode spec

Variants

Dict(BTreeMap<Vec<u8>, Bencode>)

Lexographically-ordered dictionary from d3:keyi6e9:other key12:second valuee.

The first value is equivilant to a Bencode::ByteString and second is a recursive Bencode block

List(Vec<Bencode>)

Variable-sized array (list) of further Bencodes from l4:this2:is1:a4:liste

ByteString(Vec<u8>)

A bytestring containing multiple bytes from 11:string here

Int(i64)

Parsed integer from a direct i0e

Implementations

impl Bencode

pub fn dict(self) -> Option<BTreeMap<Vec<u8>, Bencode>>

Bencode::Dict exposing method

pub fn list(self) -> Option<Vec<Bencode>>

Bencode::List exposing method

pub fn bytestring(self) -> Option<Vec<u8>>

Bencode::ByteString exposing method

pub fn int(self) -> Option<i64>

Bencode::Int exposing method

Trait Implementations

impl Clone for Bencode

fn clone(&self) -> Bencode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Bencode

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

Formats the value using the given formatter.

impl PartialEq for Bencode

fn eq(&self, other: &Bencode) -> 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 StructuralPartialEq for Bencode