pub struct RequestTrace {Show 17 fields
pub schema: TraceSchemaVersion,
pub session_id: TraceId,
pub turn_id: TraceId,
pub request_id: TraceId,
pub execution_events: Vec<ToolExecutionEvent>,
pub attempt: u32,
pub model: QualifiedModelId,
pub transport: TransportKind,
pub endpoint: EndpointMeta,
pub anatomy: RequestAnatomy,
pub wire: Option<WireMeta>,
pub system_segments: Vec<SystemSegmentMeta>,
pub messages: Vec<MessageMeta>,
pub tools: Vec<ToolMeta>,
pub cache: CacheMeta,
pub translation_losses: Vec<TranslationLoss>,
pub outcome: TransportOutcome,
}Expand description
One synaps-request-trace/1 record: metadata for a single request
attempt. Field order is the canonical, deterministic serialization order.
Fields§
§schema: TraceSchemaVersionAlways synaps-request-trace/1; validated on read.
session_id: TraceId§turn_id: TraceId§request_id: TraceId§execution_events: Vec<ToolExecutionEvent>Correlated tool-execution lifecycle metadata observed while this logical request’s tool results were produced. Bounded metadata only.
attempt: u321-based try ordinal for this record: the number of tries the
transport made, i.e. outcome.retries.len() + 1.
model: QualifiedModelIdExact provider-qualified model identity (provider/model).
transport: TransportKind§endpoint: EndpointMeta§anatomy: RequestAnatomy§wire: Option<WireMeta>Exact-wire metadata — populated by transports (Task 8) from the very
bytes sent; None until then.
system_segments: Vec<SystemSegmentMeta>§messages: Vec<MessageMeta>§tools: Vec<ToolMeta>§cache: CacheMeta§translation_losses: Vec<TranslationLoss>§outcome: TransportOutcomeImplementations§
Trait Implementations§
Source§impl Clone for RequestTrace
impl Clone for RequestTrace
Source§impl Debug for RequestTrace
impl Debug for RequestTrace
Source§impl<'de> Deserialize<'de> for RequestTrace
impl<'de> Deserialize<'de> for RequestTrace
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for RequestTrace
Source§impl PartialEq for RequestTrace
impl PartialEq for RequestTrace
Source§impl Serialize for RequestTrace
impl Serialize for RequestTrace
impl StructuralPartialEq for RequestTrace
Auto Trait Implementations§
impl Freeze for RequestTrace
impl RefUnwindSafe for RequestTrace
impl Send for RequestTrace
impl Sync for RequestTrace
impl Unpin for RequestTrace
impl UnsafeUnpin for RequestTrace
impl UnwindSafe for RequestTrace
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.