Struct List 

pub struct List {
    pub ordered: bool,
    pub items: Vec<String>,
    pub depths: Vec<usize>,
}

Fields

ordered: bool

items: Vec<String>

depths: Vec<usize>

Nesting depth of each item, parallel to items (depths[i] is the indent level of items[i], 0 = top level). Marker-style list nesting (kopitiam_token_max.md task #16): reconstruction infers depth from the left-edge x-indentation of each item’s line and the renderer indents accordingly.

Why a parallel Vec, not Vec<ListItem>

items stays Vec<String> so existing readers that iterate the item text unchanged (e.g. kopitiam-insurance’s clause ingest, which appends each item as a line) keep compiling and behaving exactly as before. A flat list built by hand can leave depths empty, which List::depth reads as “every item is top level” — so a Default/ hand-constructed list needs no depth bookkeeping.

Invariant: depths is either empty (all top level) or exactly items.len() long. List::depth upholds the “empty means flat” reading regardless.

Implementations

impl List

pub fn flat(ordered: bool, items: Vec<String>) -> Self

A flat list (every item at top level), the shape hand-built call sites and pre-nesting reconstruction produce. depths is left empty, which List::depth reads as all-zero.

pub fn depth(&self, i: usize) -> usize

Nesting depth of item i (0 = top level). Returns 0 for any index when depths is empty (a flat list) or out of range, so callers never have to special-case the flat shape.

Trait Implementations

impl Clone for List

fn clone(&self) -> List

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for List

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

Formats the value using the given formatter.

impl PartialEq for List

fn eq(&self, other: &List) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for List