Struct RecursionPolicy 

pub struct RecursionPolicy {
    pub max_depth: usize,
    pub max_visits_per_node: Option<usize>,
    pub max_total_steps: usize,
}

Explicit limits that bound recursive graph execution.

The three caps are tracked independently so graph-call recursion (nested runs), node-loop recursion (a router cycling the same node), and total work (super-steps) can each be reasoned about and surfaced separately:

• max_depth bounds the run-tree depth (RecursionStack::push enforces it, failing with TinyAgentsError::SubAgentDepth).
• max_visits_per_node optionally bounds how many times any single node may be activated within one run (failing with TinyAgentsError::NodeVisitLimit).
• max_total_steps bounds the number of super-steps a single run may execute (failing with TinyAgentsError::RecursionLimit).

Fields

max_depth: usize

Maximum run-tree depth (root run included). Reaching it on a push fails.

max_visits_per_node: Option<usize>

Optional cap on activations of a single node within one run.

max_total_steps: usize

Maximum number of super-steps a single run may execute.

Trait Implementations

impl Clone for RecursionPolicy

fn clone(&self) -> RecursionPolicy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RecursionPolicy

impl Debug for RecursionPolicy

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

Formats the value using the given formatter.

impl Default for RecursionPolicy

fn default() -> Self

A conservative default: 25 levels of run-tree depth, no per-node visit cap, and 1000 super-steps per run.

impl<'de> Deserialize<'de> for RecursionPolicy

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for RecursionPolicy

impl PartialEq for RecursionPolicy

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for RecursionPolicy