1
 2
 3
 4
 5
 6
 7
 8
 9
10
11

//! `ben` is an efficient Bencode parser which parses the structure into
//! a flat stream of tokens rather than an actual tree and thus avoids
//! unneccessary allocations.

mod node;
mod parse;

pub use node::{Node, List, Dict};
pub use parse::Error;

pub type Result<T> = std::result::Result<T, Error>;