pub struct PagedSpeculativeCacheAccess<'a> { /* private fields */ }Implementations§
Source§impl<'a> PagedSpeculativeCacheAccess<'a>
impl<'a> PagedSpeculativeCacheAccess<'a>
Trait Implementations§
Source§impl<'a> SpeculativeCacheAccess for PagedSpeculativeCacheAccess<'a>
impl<'a> SpeculativeCacheAccess for PagedSpeculativeCacheAccess<'a>
type Guard = PagedSpeculativeCacheGuard<'a>
Source§fn begin(
&self,
seq_id: usize,
base_len: usize,
verify_len: usize,
) -> Result<Option<Self::Guard>>
fn begin( &self, seq_id: usize, base_len: usize, verify_len: usize, ) -> Result<Option<Self::Guard>>
Returns
Ok(None) when the cache cannot reserve speculative slots and
the caller should fall back to normal decoding for this step.fn guard_for_reserved( &self, seq_id: usize, base_len: usize, verify_len: usize, ) -> PagedSpeculativeCacheGuard<'a>
fn make_verify_input_metadata( &self, verify_tokens: &[u32], seq_id: usize, base_len: usize, device: &Device, mapper: &dyn DeviceMapper, ) -> Result<InputMetadata>
fn proposer_cache( &self, _sequences: &[&Sequence], ) -> Result<SpeculativeKvCache<'_>>
fn finish_verification( &self, guard: &mut Self::Guard, _seq: &mut Sequence, keep_len: usize, accepted_all: bool, ) -> Result<()>
fn finish_verification_batch( &self, guards: &mut [Option<Self::Guard>], seqs: &mut [&mut Sequence], outcomes: &[Option<SpeculativeCacheOutcome>], ) -> Result<()>
fn can_stage_proposal( &self, _sequences: &[&Sequence], _base_lens: &[usize], _proposal_len: usize, ) -> bool
Auto Trait Implementations§
impl<'a> Freeze for PagedSpeculativeCacheAccess<'a>
impl<'a> !RefUnwindSafe for PagedSpeculativeCacheAccess<'a>
impl<'a> Send for PagedSpeculativeCacheAccess<'a>
impl<'a> Sync for PagedSpeculativeCacheAccess<'a>
impl<'a> Unpin for PagedSpeculativeCacheAccess<'a>
impl<'a> UnsafeUnpin for PagedSpeculativeCacheAccess<'a>
impl<'a> !UnwindSafe for PagedSpeculativeCacheAccess<'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
Source§impl<T> Downcast for T
impl<T> Downcast for T
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<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
Source§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,
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.