pub enum Draw {
Ok,
Halted,
}Expand description
The outcome of drawing token spend against the ledger.
use io_harness::{Containment, Draw, Ledger, Usage};
let ledger = Ledger::new(&Containment::new(4, 2, 1, 5_000));
let usage = Usage {
prompt_tokens: 4_000,
completion_tokens: 800,
total_tokens: 4_800,
..Default::default()
};
// What the run loop does with a completion's usage: draw it, then branch. This
// is the only place the tree's ceiling is checked, so ignoring the return is
// how a tree overspends.
match ledger.draw_tokens(usage.total_tokens) {
Draw::Ok => { /* take another step */ }
Draw::Halted => unreachable!("4,800 fits under 5,000"),
}
// The next step does not fit. `Halted` stops the whole tree, not just this
// agent — and the rejected draw is not recorded, so the total never drifts
// above the ceiling even though the provider did charge for that step.
assert_eq!(ledger.draw_tokens(usage.total_tokens), Draw::Halted);
assert_eq!(ledger.spent_tokens(), 4_800);Variants§
Ok
The draw was within the ceiling; the tree may continue.
Halted
This draw crossed the aggregate ceiling. The spend is still recorded (a step already happened and its tokens were spent), but the tree must halt as a whole — no agent gets another step.
Trait Implementations§
impl Copy for Draw
impl Eq for Draw
impl StructuralPartialEq for Draw
Auto Trait Implementations§
impl Freeze for Draw
impl RefUnwindSafe for Draw
impl Send for Draw
impl Sync for Draw
impl Unpin for Draw
impl UnsafeUnpin for Draw
impl UnwindSafe for Draw
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.