Struct r::object::Subsets

pub struct Subsets(pub Vec<Subset>);

Tuple Fields

0: Vec<Subset>

Implementations

impl Subsets

pub fn new() -> Self

pub fn get_index_at(&self, index: usize) -> Option<usize>

Get the raw index of a index applied to a subset

Provided a vector with multiple subsets applied, determine which original index corresponds with the index applied to the subset.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn push<T>(&mut self, subset: T)

where T: Into<Subset>,

pub fn bind_names( self, names: CowObj<HashMap<String, Vec<usize>>>, ) -> NamedSubsets

Trait Implementations

impl Clone for Subsets

fn clone(&self) -> Subsets

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Subsets

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

Formats the value using the given formatter.

impl Default for Subsets

fn default() -> Subsets

Returns the “default value” for a type.

impl<T> From<Vec<T>> for Subsets

where T: Into<Subset>,

fn from(value: Vec<T>) -> Self

Converts to this type from the input type.

impl IntoIterator for Subsets

fn into_iter(self) -> Self::IntoIter

Convert Subsets into an iterator of indices

Builds an iterator of indices from a collection of subsets. Iterators will provide the maximum number of indices, meaning that ranges and masks may be infinite.

type Item = (usize, Option<usize>)

The type of the elements being iterated over.

type IntoIter = Box<dyn Iterator<Item = <Subsets as IntoIterator>::Item>>

Which kind of iterator are we turning this into?

impl PartialEq for Subsets

fn eq(&self, other: &Subsets) -> 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 StructuralPartialEq for Subsets