Skip to main content

DocumentTree

Struct DocumentTree 

Source
pub struct DocumentTree { /* private fields */ }
Expand description

A hierarchical document tree structure.

Uses an arena-based tree representation for efficient traversal and node manipulation.

Implementations§

Source§

impl DocumentTree

Source

pub fn new(title: &str, content: &str) -> Self

Create a new document tree with a root node.

Source

pub fn from_raw(arena: Arena<TreeNode>, root_id: NodeId) -> Self

Create a document tree from an existing arena and root ID.

This is useful for deserialization and testing.

Source

pub fn root(&self) -> NodeId

Get the root node ID.

Source

pub fn arena(&self) -> &Arena<TreeNode>

Get a reference to the underlying arena.

Source

pub fn get(&self, id: NodeId) -> Option<&TreeNode>

Get a node by its ID.

Returns None if the node doesn’t exist.

Source

pub fn get_mut(&mut self, id: NodeId) -> Option<&mut TreeNode>

Get a mutable reference to a node by its ID.

Returns None if the node doesn’t exist.

Source

pub fn add_child( &mut self, parent: NodeId, title: &str, content: &str, ) -> NodeId

Add a child node to the specified parent.

Returns the ID of the newly created child node. The structure is automatically calculated based on siblings.

Source

pub fn add_child_with_pages( &mut self, parent: NodeId, title: &str, content: &str, start_page: usize, end_page: usize, ) -> NodeId

Add a child node with page boundaries.

Returns the ID of the newly created child node.

Source

pub fn is_leaf(&self, id: NodeId) -> bool

Check if a node is a leaf (has no children).

Source

pub fn child_count(&self, id: NodeId) -> usize

Get the number of children of a node.

This is more efficient than children().len() as it doesn’t allocate.

Source

pub fn children_iter(&self, id: NodeId) -> impl Iterator<Item = NodeId> + '_

Get the children of a node as an iterator.

Use this instead of children() when you only need to iterate, as it avoids allocating a Vec.

Source

pub fn children(&self, id: NodeId) -> Vec<NodeId>

Get the children of a node.

Returns a Vec for cases where you need owned access to the children. Consider using children_iter() if you only need to iterate.

Source

pub fn parent(&self, id: NodeId) -> Option<NodeId>

Get the parent of a node.

Returns None if the node is the root or doesn’t have a parent.

Source

pub fn siblings_iter(&self, id: NodeId) -> impl Iterator<Item = NodeId> + '_

Get the siblings of a node (excluding the node itself).

Returns an empty iterator for the root node.

Source

pub fn ancestors_iter(&self, id: NodeId) -> impl Iterator<Item = NodeId> + '_

Get the ancestors of a node from parent to root.

Returns an empty iterator for the root node.

Source

pub fn path_from_root(&self, id: NodeId) -> Vec<NodeId>

Get the path from root to a node (inclusive).

Returns the path as a Vec starting from the root.

Source

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

Get the depth of a node (root = 0).

Source

pub fn first_child(&self, id: NodeId) -> Option<NodeId>

Get the first child of a node.

Returns None if the node has no children.

Source

pub fn last_child(&self, id: NodeId) -> Option<NodeId>

Get the last child of a node.

Returns None if the node has no children.

Source

pub fn leaves(&self) -> Vec<NodeId>

Get all leaf nodes in the tree.

Uses cached leaves if available, otherwise rebuilds the cache.

Source

pub fn rebuild_leaves_cache(&mut self)

Rebuild the leaves cache.

Call this after deserialization or batch modifications.

Source

pub fn invalidate_leaves_cache(&mut self)

Invalidate the leaves cache.

Called automatically by mutation methods.

Source

pub fn traverse(&self) -> Vec<NodeId>

Get all nodes in the tree (depth-first order).

Source

pub fn node_count(&self) -> usize

Get the number of nodes in the tree.

Source

pub fn set_summary(&mut self, id: NodeId, summary: &str)

Update a node’s summary.

Source

pub fn set_content(&mut self, id: NodeId, content: &str)

Update a node’s content.

Source

pub fn set_structure(&mut self, id: NodeId, structure: &str)

Update a node’s structure index.

Source

pub fn set_page_boundaries(&mut self, id: NodeId, start: usize, end: usize)

Set page boundaries for a node.

Source

pub fn set_line_indices(&mut self, id: NodeId, start: usize, end: usize)

Set line indices for a node.

Source

pub fn page_range(&self, id: NodeId) -> Option<(usize, usize)>

Get page range for a node.

Source

pub fn contains_page(&self, id: NodeId, page: usize) -> bool

Check if a node contains a specific page.

Source

pub fn find_by_structure(&self, structure: &str) -> Option<NodeId>

Find a node by its structure index.

This is a convenience method that builds an index if needed. For repeated queries, build a RetrievalIndex once.

Source

pub fn find_by_page(&self, page: usize) -> Option<NodeId>

Find the most specific node containing a page.

This is a convenience method that builds an index if needed. For repeated queries, build a RetrievalIndex once.

Source

pub fn find_nodes_by_page_range(&self, start: usize, end: usize) -> Vec<NodeId>

Get all nodes whose page range overlaps with the given range.

Source

pub fn set_node_id(&mut self, id: NodeId, node_id: &str)

Set the node ID (identifier string).

Source

pub fn set_physical_index(&mut self, id: NodeId, index: &str)

Set the physical index marker.

Source

pub fn set_token_count(&mut self, id: NodeId, count: usize)

Update token count for a node.

Source

pub fn to_structure_json(&self, doc_name: &str) -> DocumentStructure

Export the tree structure to JSON format (PageIndex compatible).

Source

pub fn build_retrieval_index(&self) -> RetrievalIndex

Build a retrieval index for efficient operations.

This should be called once after the tree is fully constructed. The index provides O(1) access to commonly needed traversal data.

§Example
let tree = /* build tree */;
let index = tree.build_retrieval_index();

// Fast access to leaves
for leaf in index.leaves() {
    // process leaf
}

// Fast path lookup
if let Some(path) = index.path_to(node_id) {
    // path[0] = root, path[-1] = node_id
}

// Fast structure lookup
if let Some(node) = index.find_by_structure("2.1.3") {
    // Found section 2.1.3
}

// Fast page lookup
if let Some(node) = index.find_by_page(42) {
    // Found node containing page 42
}

Trait Implementations§

Source§

impl Clone for DocumentTree

Source§

fn clone(&self) -> DocumentTree

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for DocumentTree

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for DocumentTree

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl<'de> Deserialize<'de> for DocumentTree

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl Serialize for DocumentTree

Source§

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

Serialize this value into the given Serde serializer. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> PolicyExt for T
where T: ?Sized,

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,