Struct FunctionInventionRecursiveChunk 

pub struct FunctionInventionRecursiveChunk {
    pub id: String,
    pub inventions: Vec<FunctionInventionChunk>,
    pub inventions_errors: Option<bool>,
    pub created: u64,
    pub object: Object,
    pub usage: Option<Usage>,
}

Fields

id: String

inventions: Vec<FunctionInventionChunk>

inventions_errors: Option<bool>

created: u64

object: Object

usage: Option<Usage>

Implementations

impl FunctionInventionRecursiveChunk

pub fn inner_errors(&self) -> impl Iterator<Item = InnerError<'_>>

Yields each inner error from the recursive chunk’s wrapped non-recursive FunctionInventionChunks.

For each wrapped invention:

1. If the wrapped invention has its own .error, yields one item with agent_completion_index: None.
2. Then yields each item from the wrapped invention’s inner_errors(), re-tagged with this wrapper’s function_invention_index and agent_completion_index: Some(non_recursive.agent_completion_index).

Lazy and zero-allocation; collect with .collect::<Vec<_>>() if you need to retain the items past the chunk’s lifetime.

pub fn push(&mut self, _: &FunctionInventionRecursiveChunk)

pub fn produce_files(&self) -> Option<(Value, Vec<LogFile>)>

Produces the [LogFile]s for the log file structure.

Returns (reference, files). All paths relative to logs/.

Trait Implementations

impl<'arbitrary> Arbitrary<'arbitrary> for FunctionInventionRecursiveChunk

fn arbitrary(u: &mut Unstructured<'arbitrary>) -> Result<Self>

Generate an arbitrary value of Self from the given unstructured data.

fn arbitrary_take_rest(u: Unstructured<'arbitrary>) -> Result<Self>

Generate an arbitrary value of Self from the entirety of the given unstructured data.

fn size_hint(depth: usize) -> (usize, Option<usize>)

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

fn try_size_hint( depth: usize, ) -> Result<(usize, Option<usize>), MaxRecursionReached>

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

impl Clone for FunctionInventionRecursiveChunk

fn clone(&self) -> FunctionInventionRecursiveChunk

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FunctionInventionRecursiveChunk

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for FunctionInventionRecursiveChunk

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<FunctionInventionRecursiveChunk> for FunctionInventionRecursive

fn from(_: FunctionInventionRecursiveChunk) -> Self

Converts to this type from the input type.

impl JsonSchema for FunctionInventionRecursiveChunk

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

impl PartialEq for FunctionInventionRecursiveChunk

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

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 FunctionInventionRecursiveChunk