Struct Inv 

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

Implementations

impl<T> Inv<T>

where T: Stacksize + Eq + Clone + Ord,

pub fn new(slot_amount: usize) -> Self

pub fn auto_stack( &mut self, to_place: ItemStack<T>, ) -> Result<(), InvOverflow<T>>

Add items to the Inventory Already used slots will be filled before empty slots will

pub fn stack_at( &mut self, index: usize, to_place: ItemStack<T>, ) -> Result<Result<(), StackErr<T>>, InvAccessErr>

Add items to a specific Slot

pub fn take_stack(&mut self, index: usize) -> Result<ItemStack<T>, InvAccessErr>

Take the entire ItemStack sitting in a Slot at a given position. This means, that the ItemStack will be taken out of the slot, leaving it empty

pub fn get_slot(&self, index: usize) -> Result<&Slot<T>, InvAccessErr>

Return a Slot with at a given position

pub fn get_slot_mut( &mut self, index: usize, ) -> Result<&mut Slot<T>, InvAccessErr>

Return a Slot with at a given position mutably

pub fn find_slot(&self, item: T) -> Result<&Slot<T>, InvAccessErr>

Return a Slot with a given item

pub fn find_slot_mut(&mut self, item: T) -> Result<&mut Slot<T>, InvAccessErr>

Return a Slot with a given item mutably

pub fn sort(&mut self)

Sort the Inventory

Trait Implementations

impl<T: Clone> Clone for Inv<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Inv<T>

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

Formats the value using the given formatter.

impl<T> IntoIterator for Inv<T>

type Item = Slot<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<<Inv<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: Ord> Ord for Inv<T>

fn cmp(&self, other: &Inv<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq for Inv<T>

fn eq(&self, other: &Inv<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: PartialOrd> PartialOrd for Inv<T>

fn partial_cmp(&self, other: &Inv<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Eq> Eq for Inv<T>

impl<T> StructuralPartialEq for Inv<T>