Struct SortBackwardPlan 

pub struct SortBackwardPlan<T: Element> { /* private fields */ }

sort_backward plan.

Adjoint of crate::SortPlan: scatters d_values[b, p] to d_input[b, indices[b, p]]. Pure index-routed permutation — each input position receives exactly one gradient, so no atomics needed.

When to use: BW for SortPlan. Consumes the FW’s saved indices verbatim.

Dtypes: {f32, f64, i32, i64} (matches FW).

Shape limits: rank-2 [batch, row_len]; row_len ≤ 1024.

Workspace: none.

Precision guarantee: deterministic, bit-stable.

Implementations

impl<T: Element> SortBackwardPlan<T>

pub fn select( _stream: &Stream, desc: &SortBackwardDescriptor, _pref: PlanPreference, ) -> Result<Self>

Pick a kernel for desc.

pub fn can_implement(&self, args: &SortBackwardArgs<'_, T>) -> Result<()>

Validate args.

pub fn workspace_size(&self) -> usize

Workspace size in bytes.

pub fn sku(&self) -> KernelSku

Identity of the kernel this plan picked.

pub fn precision_guarantee(&self) -> PrecisionGuarantee

Numerical guarantees for this plan’s kernel.

pub fn run( &self, stream: &Stream, _workspace: Workspace<'_>, args: SortBackwardArgs<'_, T>, ) -> Result<()>

Launch.