pub struct TokenBudget<C: TokenCounter = HeuristicTokenCounter> {
pub max_tokens: usize,
pub counter: C,
}Expand description
The newest messages within max_tokens, as counter counts them:
walking back from the newest, it stops before the first message that
does not fit.
Fields§
§max_tokens: usizeThe budget.
counter: CHow a message is counted.
Implementations§
Source§impl TokenBudget
impl TokenBudget
Sourcepub fn new(max_tokens: usize) -> Self
pub fn new(max_tokens: usize) -> Self
A budget of max_tokens, counted by the default
HeuristicTokenCounter.
Trait Implementations§
Source§impl<C: Clone + TokenCounter> Clone for TokenBudget<C>
impl<C: Clone + TokenCounter> Clone for TokenBudget<C>
impl<C: Copy + TokenCounter> Copy for TokenBudget<C>
Source§impl<C: Debug + TokenCounter> Debug for TokenBudget<C>
impl<C: Debug + TokenCounter> Debug for TokenBudget<C>
Auto Trait Implementations§
impl<C> Freeze for TokenBudget<C>where
C: Freeze,
impl<C> RefUnwindSafe for TokenBudget<C>where
C: RefUnwindSafe,
impl<C> Send for TokenBudget<C>
impl<C> Sync for TokenBudget<C>
impl<C> Unpin for TokenBudget<C>where
C: Unpin,
impl<C> UnsafeUnpin for TokenBudget<C>where
C: UnsafeUnpin,
impl<C> UnwindSafe for TokenBudget<C>where
C: UnwindSafe,
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