Struct Attrs 

pub struct Attrs(pub Vec<(Cow<'static, str>, NodeValue)>);

A collection of node attributes stored as key-value pairs. Uses a Vec internally for better cache locality with small attribute counts (typically 3-6). Values can be either strings or JIDs, avoiding stringification overhead for JID attributes. Keys use Cow<'static, str> to avoid heap allocation for compile-time-known strings (e.g., “type”, “id”, “to”) which are the vast majority of attribute keys.

Tuple Fields

0: Vec<(Cow<'static, str>, NodeValue)>

Implementations

impl Attrs

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

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

Get a reference to the NodeValue for a key, or None if not found. Uses linear search which is efficient for small attribute counts.

pub fn contains_key(&self, key: &str) -> bool

Check if a key exists.

pub fn insert( &mut self, key: impl Into<Cow<'static, str>>, value: impl Into<NodeValue>, )

Insert a key-value pair. If the key already exists, update the value.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> impl Iterator<Item = (&Cow<'static, str>, &NodeValue)>

Iterate over key-value pairs.

pub fn push( &mut self, key: impl Into<Cow<'static, str>>, value: impl Into<NodeValue>, )

Push a key-value pair without checking for duplicates. Use this when building from a known-unique source (e.g., decoding).

pub fn push_value( &mut self, key: impl Into<Cow<'static, str>>, value: NodeValue, )

Push a NodeValue directly without conversion. Slightly more efficient when you already have a NodeValue.

pub fn keys(&self) -> impl Iterator<Item = &Cow<'static, str>>

Iterate over keys only.

Trait Implementations

impl Clone for Attrs

fn clone(&self) -> Attrs

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Attrs

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

Formats the value using the given formatter.

impl Default for Attrs

fn default() -> Attrs

Returns the “default value” for a type.

impl FromIterator<(Cow<'static, str>, NodeValue)> for Attrs

fn from_iter<I: IntoIterator<Item = (Cow<'static, str>, NodeValue)>>( iter: I, ) -> Self

Creates a value from an iterator.

impl<'a> IntoIterator for &'a Attrs

Borrowed iterator implementation.

type Item = (&'a Cow<'static, str>, &'a NodeValue)

The type of the elements being iterated over.

type IntoIter = Map<Iter<'a, (Cow<'static, str>, NodeValue)>, fn(&'a (Cow<'static, str>, NodeValue)) -> (&'a Cow<'static, str>, &'a NodeValue)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for Attrs

Owned iterator implementation (consuming).

type Item = (Cow<'static, str>, NodeValue)

The type of the elements being iterated over.

type IntoIter = IntoIter<(Cow<'static, str>, NodeValue)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for Attrs

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