Struct GroupsIdx

pub struct GroupsIdx { /* private fields */ }

Available on crate feature algorithm_group_by only.

Indexes of the groups, the first index is stored separately. this make sorting fast.

Implementations

impl GroupsIdx

pub fn new(first: Vec<IdxSize>, all: Vec<IdxVec>, sorted: bool) -> Self

pub fn sort(&mut self)

pub fn is_sorted_flag(&self) -> bool

pub fn iter(&self) -> Zip<Copied<Iter<'_, IdxSize>>, Iter<'_, IdxVec>>

pub fn all(&self) -> &[IdxVec]

pub fn first(&self) -> &[IdxSize]

pub fn first_mut(&mut self) -> &mut Vec<IdxSize>

Trait Implementations

impl Clone for GroupsIdx

fn clone(&self) -> GroupsIdx

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for GroupsIdx

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

Formats the value using the given formatter.

impl Default for GroupsIdx

fn default() -> GroupsIdx

Returns the “default value” for a type.

impl Drop for GroupsIdx

fn drop(&mut self)

Executes the destructor for this type.

impl From<GroupsIdx> for GroupsProxy

fn from(groups: GroupsIdx) -> Self

Converts to this type from the input type.

impl From<Vec<(u32, UnitVec<u32>)>> for GroupsIdx

fn from(v: Vec<IdxItem>) -> Self

Converts to this type from the input type.

impl From<Vec<Vec<(u32, UnitVec<u32>)>>> for GroupsIdx

fn from(v: Vec<Vec<IdxItem>>) -> Self

Converts to this type from the input type.

impl FromIterator<(u32, UnitVec<u32>)> for GroupsIdx

fn from_iter<T: IntoIterator<Item = IdxItem>>(iter: T) -> Self

Creates a value from an iterator.

impl FromParallelIterator<(u32, UnitVec<u32>)> for GroupsIdx

fn from_par_iter<I>(par_iter: I) -> Self

where I: IntoParallelIterator<Item = IdxItem>,

Creates an instance of the collection from the parallel iterator par_iter.

impl<'a> IntoIterator for &'a GroupsIdx

type Item = (u32, &'a UnitVec<u32>)

The type of the elements being iterated over.

type IntoIter = Zip<Copied<Iter<'a, u32>>, Iter<'a, UnitVec<u32>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for GroupsIdx

type Item = (u32, UnitVec<u32>)

The type of the elements being iterated over.

type IntoIter = Zip<IntoIter<u32>, IntoIter<UnitVec<u32>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a> IntoParallelIterator for &'a GroupsIdx

type Iter = Zip<Copied<Iter<'a, u32>>, Iter<'a, UnitVec<u32>>>

The parallel iterator type that will be created.

type Item = (u32, &'a UnitVec<u32>)

The type of item that the parallel iterator will produce.

fn into_par_iter(self) -> Self::Iter

Converts self into a parallel iterator.

impl IntoParallelIterator for GroupsIdx

type Iter = Zip<IntoIter<u32>, IntoIter<UnitVec<u32>>>

The parallel iterator type that will be created.

type Item = (u32, UnitVec<u32>)

The type of item that the parallel iterator will produce.

fn into_par_iter(self) -> Self::Iter

Converts self into a parallel iterator.

impl PartialEq for GroupsIdx

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

impl StructuralPartialEq for GroupsIdx