Struct SearchLimits 

pub struct SearchLimits {
    pub actions: u32,
    pub model_turns: u32,
    pub tool_calls: u32,
    pub mutations: u32,
    pub verifier_runs: u32,
    pub tokens: u64,
    pub elapsed_secs: u64,
    pub result_bytes: u64,
    pub workspace_files: u64,
    pub workspace_bytes: u64,
}

The forest’s finite limits (Definition 5). One set per forest.

Fields

actions: u32

model_turns: u32

tool_calls: u32

mutations: u32

verifier_runs: u32

tokens: u64

elapsed_secs: u64

result_bytes: u64

workspace_files: u64

Cumulative eager-copy file reservations across every fork.

workspace_bytes: u64

Cumulative eager-copy byte reservations across every fork.

Implementations

impl SearchLimits

pub fn release_default() -> Self

A finite release-default limit set (system 20’s starting posture).

Trait Implementations

impl Clone for SearchLimits

fn clone(&self) -> SearchLimits

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SearchLimits

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SearchLimits

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for SearchLimits

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for SearchLimits

impl StructuralPartialEq for SearchLimits