Struct binjs_io::simple::TreeTokenWriter

pub struct TreeTokenWriter { /* fields omitted */ }

A trivial tree writer, without any kind of optimization.

Methods

impl TreeTokenWriter

pub fn new() -> Self

pub fn data(&self) -> Option<&[u8]>

Trait Implementations

impl TokenWriterWithTree for TreeTokenWriter

type Tree = AbstractTree

type Data = Box<[u8]>

The type of data generated by this writer. Typically some variant of Vec<u8>.

fn done(self) -> Result<Self::Data, TokenWriterError>

Finish writing, produce data.

fn float(&mut self, data: Option<f64>) -> Result<Self::Tree, TokenWriterError>

Write a single number.

fn bool(&mut self, data: Option<bool>) -> Result<Self::Tree, TokenWriterError>

Write single bool.

fn offset(&mut self) -> Result<Self::Tree, TokenWriterError>

Write the number of bytes left in this tuple.

fn unsigned_long(&mut self, data: u32) -> Result<Self::Tree, TokenWriterError>

Write a single u32.

fn string(
    &mut self,
    data: Option<&SharedString>
) -> Result<Self::Tree, TokenWriterError>

Write a single UTF-8 string.

fn list(
    &mut self,
    items: Vec<Self::Tree>
) -> Result<Self::Tree, TokenWriterError>

Lists are represented as:

• ""
• number of items (u32);
• items
• ""

The number of bytes is the total size of

• number of items;
• items.

fn tagged_tuple(
    &mut self,
    tag: &InterfaceName,
    children: &[(&FieldName, Self::Tree)]
) -> Result<Self::Tree, TokenWriterError>

For this example, we use a very, very, very suboptimal encoding.

• - kind (string, \0 terminated) - number of items (varnum) - field names (string, \0 terminated)
• contents

fn string_enum(
    &mut self,
    str: &SharedString
) -> Result<Self::Tree, TokenWriterError>

Write a single UTF-8 value from a string enumeration.

fn property_key(
    &mut self,
    value: Option<&PropertyKey>
) -> Result<Self::Tree, TokenWriterError>

fn identifier_name(
    &mut self,
    value: Option<&IdentifierName>
) -> Result<Self::Tree, TokenWriterError>