Struct FragmentTable 

pub struct FragmentTable { /* private fields */ }

Every fragment an app declares, keyed by Fragment::key.

Ordered rather than hashed: the artifact encodes the table field by field, so a stable order is what makes two builds of the same sources produce the same bytes.

Implementations

impl FragmentTable

pub fn new() -> Self

Empty table.

pub fn insert(&mut self, fragment: Fragment) -> Result<(), FragmentError>

Add fragment under its own key.

A key already holding the same declaration absorbs the new origins and keeps one entry, which is what an include reached from two paths produces. A key holding a different declaration is an error: keys are content-addressed, so two different bodies under one key means the content that produced the key was not the content being stored.

pub fn get(&self, key: &str) -> Option<&Fragment>

Look a fragment up by key.

pub fn iter(&self) -> impl Iterator<Item = (&String, &Fragment)>

Every fragment, in key order.

pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut Fragment>

Every fragment, in key order, for a pass that rewrites bodies.

pub fn by_component(&self, name: &str) -> Option<(&Fragment, bool)>

The fragment a candela component name reaches, with whether the baked body is what calling the function would have returned.

A name no component carries yields None, which the caller reports as an unknown tag.

pub fn component(&self, name: &str) -> Option<&FragmentComponent>

The candela component a use site naming name reaches.

A function that has to run is reached by name alone, so this answers without reference to the block it happens to be attached to.

pub fn names(&self) -> BTreeSet<String>

Every name a use site may write: each fragment key, plus each candela component name.

pub fn len(&self) -> usize

How many fragments are declared.

pub fn is_empty(&self) -> bool

Whether the table declares nothing.

pub fn merge(&mut self, other: FragmentTable) -> Result<(), FragmentError>

Fold other into this table, applying the same collision rule per key. Used to combine what markup declared with what the scripts declared.

Trait Implementations

impl Clone for FragmentTable

fn clone(&self) -> FragmentTable

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FragmentTable

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

Formats the value using the given formatter.

impl Default for FragmentTable

fn default() -> FragmentTable

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for FragmentTable

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for FragmentTable

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.