pub struct GdnState {
pub h: DevicePtr,
pub conv: DevicePtr,
pub h_steps: [DevicePtr; 3],
pub conv_steps: [DevicePtr; 3],
}Expand description
2026-09-28: One sequence’s recurrent state in one GatedDeltaNet layer.
Fields§
§h: DevicePtr2026-09-28: The h state (FP32).
conv: DevicePtr2026-09-28: The conv1d window.
h_steps: [DevicePtr; 3]2026-09-29: The h state after verify row t (SsmLayerState::h_state_intermediates);
NULL where the sequence has none. Only a verify reads them.
conv_steps: [DevicePtr; 3]2026-09-29: The conv window after verify row t, indexed like h_steps.
Trait Implementations§
impl Copy for GdnState
impl Eq for GdnState
impl StructuralPartialEq for GdnState
Auto Trait Implementations§
impl Freeze for GdnState
impl RefUnwindSafe for GdnState
impl Send for GdnState
impl Sync for GdnState
impl Unpin for GdnState
impl UnwindSafe for GdnState
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.