Parse a query plan from JSON.

Read all remaining sections, returning them as a vector. This is a convenience method that calls [`next_section`](Self::next_section) in a loop until

Record a single added file from the working copy. Reads the file content and creates appropriate hunks for a new file. # Arguments `working_copy` -

Save global configuration to the default location

Extract KG nodes and edges from a vault entry. Returns `(Vec<KgNode>, Vec<KgEdge>)`. Does **not** store them — call `vault_store_kg` for persistence.

Verify the content hash by reading the trailer. Reads the 32-byte trailer from the source and compares it to the blake3 hash computed incrementally f

Set a change filter for state-based content retrieval. Only vertices from changes in this set (or ROOT) will be included. This enables retrieving fil

Set custom metadata.

Write a CONTENT chunk. Content is split into chunks (typically via FastCDC). Each chunk is independently compressed and content-addressed by its blak

Build the identity, generating a keypair if needed.

Create a spinner for operations with unknown duration. Spinners are used when we don't know how long an operation will take or how much work remains.

Get the recorded content for a tracked file. This method builds a **change filter** that defines the current view's content perspective, then retriev

Get the .atomicignore content for a given project kind. This function returns appropriate ignore patterns for common project types, helping users sta

Check if the view has any changes.

Get the text content of a node.

Execute the diff command. This method: 1. Finds and opens the repository 2. Gets the status of the working copy 3. Computes diffs for modified files

Serialize the provenance graph to bytes. Format: `[MAGIC: 4 bytes][postcard payload]` The hash is computed over the entire serialized output.

Sets the leaf's state.

Create a mock that returns a successful reasoning.

Start a new vault goal. Creates a goal directory under `.vault/goals/` with a `_goal.md` file containing initial metadata. Goal names are Docker-sty

Build the attestation.

Compute the output order using Tarjan's SCC algorithm. This function: 1. Runs Tarjan's algorithm to find all SCCs 2. Builds the conflict tree 3. Iden

Compute the diff between two sequences using the Patience algorithm. This algorithm often produces more intuitive diffs for source code by using uniq

Diff two byte slices as text, splitting on newlines. This is a convenience function that handles the common case of diffing two text files. It splits

Consumes the context and returns the final outcome. # Example ```rust use atomic_core::crdt::apply::{ApplyContext, ApplyOptions}; let mut context =

Get the graph_op header in unified diff format. Returns a string like `@@ -1,5 +1,6 @@`

Returns `true` if there are no nodes.

Iterate over the hunks.

Lift a memory from its frontmatter spine and markdown body. `memoryKind`, `status`, `about`, `derivedFrom`, `supersedes`, and `previousRevision` are

Create an input for a modified file.

Print a blank line for visual separation.

Print an error message to stderr. The message is formatted in red with an X prefix. # Arguments `message` - The message to print # Example ```rus

Push a child and increment the last span's child count. This is a convenience method that combines pushing a child and updating the count on the most

Helper to record a change with a message.

Create the reverse edge modification. This creates an edge that undoes this modification: - Swaps `previous` and `flag` - Uses the given `introduced_

Execute the log command. This method: 1. Finds the repository root 2. Opens the repository 3. Queries history based on options 4. Formats and display

Set the agent identity for sessions created by this orchestrator. Called by the CLI hook handler after construction, before dispatching events. This

Set the children start index for the last span. This should be called before pushing that span's children. # Panics Panics if the graph has no vert

Tokenize text for the FTS inverted index. Extracts lowercase alphanumeric words of length >= 3, filtering out stop words (common English + programmin

Validate a canonical Intent node against `IntentShape` (+ sub-shapes).

Set the AI vendor.

Helper: create a minimal writer with header + hash table already written.

Adds a new file and returns its trunk ID. Creates a `TrunkOp::Create` for the file. Use [`add_line`](Self::add_line) to add content to the file.

Apply the common (non-strategy-specific) actions from a transition result to the given session state. This updates `phase`, `last_interaction`, and `

Build a `SessionEnvelope` for embedding in `HashedChange.metadata`.

Build a `Provenance` entry for an agent turn. Populates vendor, model, tool, suggestion type, session ID, and prompt hash. Token usage and cost can b

Collect all change `NodeId`s visible from a view, including parent views. For **draft** views this walks the full overlay chain (other draft ancestor

Convert a `GraphOp<Option<Hash>>` to a [`CompactGraphOp`]. This is the main entry point for compacting a full graph operation before serialization. I

Convert a remote error to a CLI error. Maps the various remote error types to appropriate CLI error types with user-friendly messages and suggestions

Get the number of entries yielded so far.

Helper to create a file in the repository and add it.

Get the change dependencies.

Encode trunk data as variable-length bytes for storage. # Layout ```text ┌────────────────────────────────────────────────┐ │ Bytes 0-7: inode (u64

Get a reference to the file operations.

Finishes building and returns the result.

Get the recorded content for a tracked file on a specific view. Like `get_file_content`, but reads from the specified view instead of the current vie

* Check whether a session exists without creating it.

Consume this writer and return the underlying writer.

Check if this row has no cells.

Iterate forward (non-parent) edges from a vertex. Returns typed [`ForwardEdge`] values. When `include_deleted` is true, deleted edges (`BlockDeleted`

Iterate parent (reverse) edges of a vertex. Returns typed [`ParentEdge`] values. When `include_deleted` is true, deleted parent edges are included; o

Get the text content of a node.

Get the text content of a node.

Record a file write. # Arguments `path` - The path of the file that was written `bytes` - The number of bytes written # Example ```rust use atomic