Struct rs_graph::vec::IndexItemSliceMut

source ·

pub struct IndexItemSliceMut<'a, 'b, G, T, Idx>where
    G: 'a,
    T: 'b,{ /* private fields */ }

Expand description

A mutable borrowed slice indexed by items of a graph.

Implementations

source

impl<'a, 'b, G, Idx, T> IndexItemSliceMut<'a, 'b, G, T, Idx>where
G: 'a,
Idx: NumItems<G>,

source

pub fn new(g: &'a G, data: &'b mut [T]) -> IndexItemSliceMut<'a, 'b, G, T, Idx>

source

pub fn iter_mut(&mut self) -> IterMut<'_, T>

Return a mutable iterator over all elements.

Trait Implementations

source

impl<'a, 'b, G, Idx, T> Debug for IndexItemSliceMut<'a, 'b, G, T, Idx>where
G: 'a,
T: 'b + Debug,

source

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

Formats the value using the given formatter. Read more

source

impl<'a, 'b, G, Idx, T> Deref for IndexItemSliceMut<'a, 'b, G, T, Idx>where
G: 'a,
Idx: 'b,

type Target = IndexItemSliceMut<'a, 'b, G, Idx, T>

The resulting type after dereferencing.

source

fn deref(&self) -> &Self::Target

Dereferences the value.

source

impl<'a, 'b, G, T, Idx, I> Index for IndexItemSliceMut<'a, 'b, G, T, Idx>where
Idx: Indexer<G, I>,

type Output = T

The returned type after indexing.

source

fn index(&self, u: I) -> &T

Performs the indexing (container[index]) operation. Read more

source

impl<'a, 'b, G, T, Idx, I> IndexMut for IndexItemSliceMut<'a, 'b, G, T, Idx>where
Idx: Indexer<G, I>,

source

fn index_mut(&mut self, u: I) -> &mut T

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

Auto Trait Implementations

impl<'a, 'b, G, T, Idx> RefUnwindSafe for IndexItemSliceMut<'a, 'b, G, T, Idx>where
 G: RefUnwindSafe,
 Idx: RefUnwindSafe,
 T: RefUnwindSafe,

impl<'a, 'b, G, T, Idx> Send for IndexItemSliceMut<'a, 'b, G, T, Idx>where
 G: Sync,
 Idx: Send,
 T: Send,

impl<'a, 'b, G, T, Idx> Sync for IndexItemSliceMut<'a, 'b, G, T, Idx>where
 G: Sync,
 Idx: Sync,
 T: Sync,

impl<'a, 'b, G, T, Idx> Unpin for IndexItemSliceMut<'a, 'b, G, T, Idx>where
Idx: Unpin,

impl<'a, 'b, G, T, Idx> !UnwindSafe for IndexItemSliceMut<'a, 'b, G, T, Idx>

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<'a, G, T, I> EdgeMap<'a, G, T> for Iwhere
G: Graph<'a>,
I: Index<<G as Graph<'a>>::Edge, Output = T>,

source

impl<'a, G, T, I> EdgeMapMut<'a, G, T> for Iwhere
G: Graph<'a>,
I: IndexMut<<G as Graph<'a>>::Edge, Output = T>,

source

impl<'a, G, T, I> NodeMap<'a, G, T> for Iwhere
G: Graph<'a>,
I: Index<<G as Graph<'a>>::Node, Output = T>,

source

Struct rs_graph::vec::IndexItemSliceMut

Implementations

impl<'a, 'b, G, Idx, T> IndexItemSliceMut<'a, 'b, G, T, Idx>where G: 'a, Idx: NumItems<G>,

pub fn new(g: &'a G, data: &'b mut [T]) -> IndexItemSliceMut<'a, 'b, G, T, Idx>

pub fn iter_mut(&mut self) -> IterMut<'_, T>

Trait Implementations

impl<'a, 'b, G, Idx, T> Debug for IndexItemSliceMut<'a, 'b, G, T, Idx>where G: 'a, T: 'b + Debug,

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

impl<'a, 'b, G, Idx, T> Deref for IndexItemSliceMut<'a, 'b, G, T, Idx>where G: 'a, Idx: 'b,

type Target = IndexItemSliceMut<'a, 'b, G, Idx, T>

fn deref(&self) -> &Self::Target

impl<'a, 'b, G, T, Idx, I> Index<I> for IndexItemSliceMut<'a, 'b, G, T, Idx>where Idx: Indexer<G, I>,

type Output = T

fn index(&self, u: I) -> &T

impl<'a, 'b, G, T, Idx, I> IndexMut<I> for IndexItemSliceMut<'a, 'b, G, T, Idx>where Idx: Indexer<G, I>,

fn index_mut(&mut self, u: I) -> &mut T

Auto Trait Implementations

impl<'a, 'b, G, T, Idx> RefUnwindSafe for IndexItemSliceMut<'a, 'b, G, T, Idx>where G: RefUnwindSafe, Idx: RefUnwindSafe, T: RefUnwindSafe,

impl<'a, 'b, G, T, Idx> Send for IndexItemSliceMut<'a, 'b, G, T, Idx>where G: Sync, Idx: Send, T: Send,

impl<'a, 'b, G, T, Idx> Sync for IndexItemSliceMut<'a, 'b, G, T, Idx>where G: Sync, Idx: Sync, T: Sync,

impl<'a, 'b, G, T, Idx> Unpin for IndexItemSliceMut<'a, 'b, G, T, Idx>where Idx: Unpin,

impl<'a, 'b, G, T, Idx> !UnwindSafe for IndexItemSliceMut<'a, 'b, G, T, Idx>

Blanket Implementations

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<'a, G, T, I> EdgeMap<'a, G, T> for Iwhere G: Graph<'a>, I: Index<<G as Graph<'a>>::Edge, Output = T>,

impl<'a, G, T, I> EdgeMapMut<'a, G, T> for Iwhere G: Graph<'a>, I: IndexMut<<G as Graph<'a>>::Edge, Output = T>,

impl<'a, G, T, I> NodeMap<'a, G, T> for Iwhere G: Graph<'a>, I: Index<<G as Graph<'a>>::Node, Output = T>,

impl<'a, G, T, I> NodeMapMut<'a, G, T> for Iwhere G: Graph<'a>, I: IndexMut<<G as Graph<'a>>::Node, Output = T>,

impl<'a, 'b, G, Idx, T> IndexItemSliceMut<'a, 'b, G, T, Idx>where
G: 'a,
Idx: NumItems<G>,

impl<'a, 'b, G, Idx, T> Debug for IndexItemSliceMut<'a, 'b, G, T, Idx>where
G: 'a,
T: 'b + Debug,

impl<'a, 'b, G, Idx, T> Deref for IndexItemSliceMut<'a, 'b, G, T, Idx>where
G: 'a,
Idx: 'b,

impl<'a, 'b, G, T, Idx, I> Index<I> for IndexItemSliceMut<'a, 'b, G, T, Idx>where
Idx: Indexer<G, I>,

impl<'a, 'b, G, T, Idx, I> IndexMut<I> for IndexItemSliceMut<'a, 'b, G, T, Idx>where
Idx: Indexer<G, I>,

impl<'a, 'b, G, T, Idx> RefUnwindSafe for IndexItemSliceMut<'a, 'b, G, T, Idx>where
G: RefUnwindSafe,
Idx: RefUnwindSafe,
T: RefUnwindSafe,

impl<'a, 'b, G, T, Idx> Send for IndexItemSliceMut<'a, 'b, G, T, Idx>where
G: Sync,
Idx: Send,
T: Send,

impl<'a, 'b, G, T, Idx> Sync for IndexItemSliceMut<'a, 'b, G, T, Idx>where
G: Sync,
Idx: Sync,
T: Sync,

impl<'a, 'b, G, T, Idx> Unpin for IndexItemSliceMut<'a, 'b, G, T, Idx>where
Idx: Unpin,

impl<T> Any for Twhere
T: 'static + ?Sized,

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

impl<T, U> Into<U> for Twhere
U: From<T>,

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,

impl<'a, G, T, I> EdgeMap<'a, G, T> for Iwhere
G: Graph<'a>,
I: Index<<G as Graph<'a>>::Edge, Output = T>,

impl<'a, G, T, I> EdgeMapMut<'a, G, T> for Iwhere
G: Graph<'a>,
I: IndexMut<<G as Graph<'a>>::Edge, Output = T>,

impl<'a, G, T, I> NodeMap<'a, G, T> for Iwhere
G: Graph<'a>,
I: Index<<G as Graph<'a>>::Node, Output = T>,

impl<'a, G, T, I> NodeMapMut<'a, G, T> for Iwhere
G: Graph<'a>,
I: IndexMut<<G as Graph<'a>>::Node, Output = T>,