pub struct DecodeState<'a> {
pub generated: &'a [u32],
}Expand description
The decode state a TokenConstraint reasons about when it decides which
next tokens are valid.
Deliberately a pure function of the tokens generated so far — no
wall-clock, no hidden mutable cursor. That is the same “context = f(state),
never f(wall-clock)” discipline the runtime holds everywhere (see
temp_ai_design.md §4): given the same generated prefix, a constraint
must always return the same AllowedSet, so a constrained run is
reproducible and testable.
generated is the tokens produced this decode (the completion), not the
prompt — a structural constraint cares about the shape of the output it is
steering, and the prompt is upstream of that.
Fields§
§generated: &'a [u32]Token ids emitted so far in this completion, oldest first.
Auto Trait Implementations§
impl<'a> Freeze for DecodeState<'a>
impl<'a> RefUnwindSafe for DecodeState<'a>
impl<'a> Send for DecodeState<'a>
impl<'a> Sync for DecodeState<'a>
impl<'a> Unpin for DecodeState<'a>
impl<'a> UnsafeUnpin for DecodeState<'a>
impl<'a> UnwindSafe for DecodeState<'a>
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