Struct Row

pub struct Row<T> { /* private fields */ }

A row in the grid.

Implementations

impl<T: Default> Row<T>

pub fn new(columns: usize) -> Row<T>

Create a new terminal row.

Ideally the template should be Copy in all performance sensitive scenarios.

pub fn grow(&mut self, columns: usize)

Increase the number of columns in the row.

pub fn shrink(&mut self, columns: usize) -> Option<Vec<T>>

where T: GridCell,

Reduce the number of columns in the row.

This will return all non-empty cells that were removed.

pub fn reset<D>(&mut self, template: &T)

where T: ResetDiscriminant<D> + GridCell, D: PartialEq,

Reset all cells in the row to the template cell.

impl<T> Row<T>

pub fn from_vec(vec: Vec<T>, occ: usize) -> Row<T>

pub fn len(&self) -> usize

pub fn last(&self) -> Option<&T>

pub fn last_mut(&mut self) -> Option<&mut T>

pub fn append(&mut self, vec: &mut Vec<T>)

where T: GridCell,

pub fn append_front(&mut self, vec: Vec<T>)

pub fn is_clear(&self) -> bool

where T: GridCell,

Check if all cells in the row are empty.

pub fn front_split_off(&mut self, at: usize) -> Vec<T>

Trait Implementations

impl<T: Clone> Clone for Row<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Row<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for Row<T>

fn default() -> Row<T>

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for Row<T>

where T: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Index<Column> for Row<T>

type Output = T

The returned type after indexing.

fn index(&self, index: Column) -> &T

Performs the indexing (container[index]) operation.

impl<T> Index<Range<Column>> for Row<T>

type Output = [T]

The returned type after indexing.

fn index(&self, index: Range<Column>) -> &[T]

Performs the indexing (container[index]) operation.

impl<T> Index<RangeFrom<Column>> for Row<T>

type Output = [T]

The returned type after indexing.

fn index(&self, index: RangeFrom<Column>) -> &[T]

Performs the indexing (container[index]) operation.

impl<T> Index<RangeFull> for Row<T>

type Output = [T]

The returned type after indexing.

fn index(&self, _: RangeFull) -> &[T]

Performs the indexing (container[index]) operation.

impl<T> Index<RangeTo<Column>> for Row<T>

type Output = [T]

The returned type after indexing.

fn index(&self, index: RangeTo<Column>) -> &[T]

Performs the indexing (container[index]) operation.

impl<T> Index<RangeToInclusive<Column>> for Row<T>

type Output = [T]

The returned type after indexing.

fn index(&self, index: RangeToInclusive<Column>) -> &[T]

Performs the indexing (container[index]) operation.

impl<T> IndexMut<Column> for Row<T>

fn index_mut(&mut self, index: Column) -> &mut T

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

impl<T> IndexMut<Range<Column>> for Row<T>

fn index_mut(&mut self, index: Range<Column>) -> &mut [T]

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

impl<T> IndexMut<RangeFrom<Column>> for Row<T>

fn index_mut(&mut self, index: RangeFrom<Column>) -> &mut [T]

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

impl<T> IndexMut<RangeFull> for Row<T>

fn index_mut(&mut self, _: RangeFull) -> &mut [T]

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

impl<T> IndexMut<RangeTo<Column>> for Row<T>

fn index_mut(&mut self, index: RangeTo<Column>) -> &mut [T]

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

impl<T> IndexMut<RangeToInclusive<Column>> for Row<T>

fn index_mut(&mut self, index: RangeToInclusive<Column>) -> &mut [T]

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

impl<'a, T> IntoIterator for &'a Row<T>

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

type Item = &'a T

The type of the elements being iterated over.

fn into_iter(self) -> Iter<'a, T>

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut Row<T>

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?

type Item = &'a mut T

The type of the elements being iterated over.

fn into_iter(self) -> IterMut<'a, T>

Creates an iterator from a value.

impl LineLength for Row<Cell>

fn line_length(&self) -> Column

Calculate the occupied line length.

impl<T: PartialEq> PartialEq for Row<T>

fn eq(&self, other: &Self) -> 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> Serialize for Row<T>

where T: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.