Struct GraphComputeIncomplete 

pub struct GraphComputeIncomplete {
    pub reason: GraphComputeIncompleteReason,
    pub algorithm: String,
    pub elapsed_ms: u64,
    pub iterations: u64,
    pub work_charged: u64,
    pub work_budget: u64,
}

Diagnostics describing a GraphCompute invocation that stopped early.

Returned (boxed) inside UniError::GraphComputeIncomplete when an invocation exceeds its native-work budget, iteration cap, or wall-clock deadline. The counters let a caller tell “too slow” apart from “did not converge” apart from “did too much work”, and size a retry accordingly.

Examples

use uni_common::{GraphComputeIncomplete, GraphComputeIncompleteReason};

let detail = GraphComputeIncomplete {
    reason: GraphComputeIncompleteReason::Exhausted,
    algorithm: "guest.ppr".into(),
    elapsed_ms: 120,
    iterations: 7,
    work_charged: 1_000_000_000,
    work_budget: 1_000_000_000,
};
assert!(detail.to_string().contains("exhausted"));

Fields

reason: GraphComputeIncompleteReason

Why the invocation stopped.

algorithm: String

Qualified name of the algorithm being run, for the diagnostic message.

elapsed_ms: u64

Wall-clock time elapsed when the invocation was cut short, in milliseconds.

iterations: u64

Number of guest control-loop iterations completed before the cutoff.

work_charged: u64

Native work units charged when the invocation stopped (0 if untracked).

work_budget: u64

The configured native-work budget in the same units as work_charged.

Implementations

impl GraphComputeIncomplete

pub fn to_tagged_message(&self) -> String

Serializes this diagnostic behind GRAPH_COMPUTE_INCOMPLETE_TAG.

The provider boundary returns the result as a DataFusionError message; the query API recovers the struct with from_tagged_message. Serialization cannot fail for this plain-data struct, so a marshalling error degrades to the bare tag rather than panicking.

pub fn from_tagged_message(msg: &str) -> Option<Self>

Recovers a GraphComputeIncomplete from a tagged error message.

Locates GRAPH_COMPUTE_INCOMPLETE_TAG anywhere in msg (upstream layers prepend context such as Algorithm 'x': ) and deserializes the single JSON object that follows, ignoring any trailing text a later error-wrapping layer may append. Returns None when the tag is absent or the payload does not parse.

Trait Implementations

impl Clone for GraphComputeIncomplete

fn clone(&self) -> GraphComputeIncomplete

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphComputeIncomplete

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphComputeIncomplete

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for GraphComputeIncomplete

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

Formats the value using the given formatter.

impl Eq for GraphComputeIncomplete

impl PartialEq for GraphComputeIncomplete

fn eq(&self, other: &GraphComputeIncomplete) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for GraphComputeIncomplete

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 GraphComputeIncomplete