Struct LayerSchedule 

pub struct LayerSchedule<P> { /* private fields */ }

Validated, ordered policy for every decoder layer.

Implementations

impl<P> LayerSchedule<P>

pub fn new( layer_count: usize, layers: Vec<P>, ) -> Result<Self, LayerScheduleError>

Validates an exact ordered policy list against the decoder layer count.

pub const fn len(&self) -> usize

Returns the number of decoder layers represented by the schedule.

pub const fn is_empty(&self) -> bool

Returns whether the schedule contains no layers.

pub fn get(&self, layer: usize) -> Option<&P>

Returns one layer policy, with out-of-range indices reported as None.

pub fn iter(&self) -> impl ExactSizeIterator<Item = &P> + '_

Iterates over policies in architecture layer order.

impl LayerSchedule<AttentionPolicy>

pub fn all_full(layer_count: usize) -> Result<Self, LayerScheduleError>

Creates an all-full attention schedule.

pub fn all_sliding( layer_count: usize, window: u32, ) -> Result<Self, LayerScheduleError>

Creates an all-sliding attention schedule.

pub fn from_sliding_pattern( layer_count: usize, pattern: &[bool], window: Option<u32>, ) -> Result<Self, LayerScheduleError>

Creates a schedule from a Boolean pattern where true means sliding.

pub fn full_layer_count(&self) -> usize

Returns the number of full-attention layers.

pub fn sliding_layer_count(&self) -> usize

Returns the number of sliding-attention layers.

pub fn sliding_windows(&self) -> BTreeMap<NonZeroU32, usize>

Counts sliding layers by exact window.

pub fn fingerprint_component(&self) -> String

Returns a stable representation suitable for fingerprints.

Trait Implementations

impl<P: Clone> Clone for LayerSchedule<P>

fn clone(&self) -> LayerSchedule<P>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P: Debug> Debug for LayerSchedule<P>

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

Formats the value using the given formatter.

impl<'de, P> Deserialize<'de> for LayerSchedule<P>

where P: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<P: Eq> Eq for LayerSchedule<P>

impl<P: Hash> Hash for LayerSchedule<P>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<P: PartialEq> PartialEq for LayerSchedule<P>

fn eq(&self, other: &LayerSchedule<P>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<P> Serialize for LayerSchedule<P>

where P: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<P: PartialEq> StructuralPartialEq for LayerSchedule<P>