Struct NegIdxVec 

pub struct NegIdxVec<T> {
    pub data: Vec<T>,
    /* private fields */
}

A vector that can be indexed with a negative index, like with Python.

use libdiffsitter::neg_idx_vec::NegIdxVec;
let v = NegIdxVec::from(vec![1, 2, 3]);
let last_negative = v[-1];
let last = v[(v.len() - 1).try_into().unwrap()];

A negative index corresponds to an offset from the end of the vector.

Fields

data: Vec<T>

The underlying vector for the negative index vector

Implementations

impl<T> NegIdxVec<T>

pub fn new<F>(len: usize, f: F) -> Self

where F: FnMut() -> T,

Create a negative index vector with a given size.

This will create an internal vector and all offsets will be pegged relative to the size of this vector.

use libdiffsitter::neg_idx_vec::NegIdxVec;
let v: NegIdxVec<usize> = NegIdxVec::new(1, Default::default);

pub fn reserve(&mut self, additional: usize)

Reserve capacity for a number of additional elements.

pub fn reserve_exact(&mut self, additional: usize)

Reserve space for exactly additional elements.

This will not over-allocate.

pub fn capacity(&self) -> usize

Return the total number of elements the vector can hold without requiring another allocation.

pub fn len(&self) -> usize

Get the length of the vector

pub fn is_empty(&self) -> bool

Returns whether the vector is empty.

Trait Implementations

impl<T: Clone> Clone for NegIdxVec<T>

fn clone(&self) -> NegIdxVec<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for NegIdxVec<T>

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

Formats the value using the given formatter.

impl<T> Default for NegIdxVec<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Clone> From<&[T]> for NegIdxVec<T>

fn from(value: &[T]) -> Self

Converts to this type from the input type.

impl<T> From<Vec<T>> for NegIdxVec<T>

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

Converts to this type from the input type.

impl<T> FromIterator<T> for NegIdxVec<T>

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

Creates a value from an iterator.

impl<T> Index<i32> for NegIdxVec<T>

type Output = T

The returned type after indexing.

fn index(&self, idx: i32) -> &<Self as Index<i32>>::Output

Performs the indexing (container[index]) operation.

impl<T> IndexMut<i32> for NegIdxVec<T>

fn index_mut(&mut self, idx: i32) -> &mut <Self as Index<i32>>::Output

Performs the mutable indexing (container[index]) operation.

impl<T> IntoIterator for NegIdxVec<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<<NegIdxVec<T> as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for NegIdxVec<T>

fn eq(&self, other: &NegIdxVec<T>) -> 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<T: Eq> Eq for NegIdxVec<T>

impl<T> StructuralPartialEq for NegIdxVec<T>