Struct RowIndexMap 

pub struct RowIndexMap { /* private fields */ }

A permutation / selection vector over base-frame row indices.

Used by arrange (sort) and slice to represent a reordering of the rows visible through a TidyView’s bitmask, without copying column data. The indices stored here are indices into the BASE DataFrame, not relative to the mask.

Implementations

impl RowIndexMap

pub fn new(indices: Vec<usize>) -> Self

Create a new row index map from explicit indices.

pub fn len(&self) -> usize

Returns the number of visible rows.

pub fn is_empty(&self) -> bool

Returns true if no rows are selected.

pub fn as_slice(&self) -> &[usize]

Borrow the underlying indices as a slice.

Trait Implementations

impl Clone for RowIndexMap

fn clone(&self) -> RowIndexMap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RowIndexMap

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

Formats the value using the given formatter.

impl PartialEq for RowIndexMap

fn eq(&self, other: &RowIndexMap) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for RowIndexMap

impl StructuralPartialEq for RowIndexMap