Struct Children 

pub struct Children<T>(/* private fields */);

A node’s children in order, each under its order key.

Implementations

impl<T> Children<T>

pub fn new() -> Self

pub fn from_vec(nodes: Vec<T>) -> Self

Children placed all at once, keys spread evenly.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> impl DoubleEndedIterator<Item = &T> + ExactSizeIterator

The children in order.

pub fn iter_mut( &mut self, ) -> impl DoubleEndedIterator<Item = &mut T> + ExactSizeIterator

pub fn entries(&self) -> impl DoubleEndedIterator<Item = (&OrderKey, &T)>

The children in order, with their keys.

pub fn get(&self, key: &OrderKey) -> Option<&T>

pub fn get_mut(&mut self, key: &OrderKey) -> Option<&mut T>

pub fn nth(&self, at: usize) -> Option<&T>

The child at places from the first, counting each one before it: for tests, and for callers that hold a place, not a key.

pub fn nth_mut(&mut self, at: usize) -> Option<&mut T>

The child at places from the first, to change.

pub fn first_key(&self) -> Option<&OrderKey>

pub fn last_key(&self) -> Option<&OrderKey>

pub fn key_after(&self, key: &OrderKey) -> Option<&OrderKey>

The key of the child after the one under key, if any.

pub fn key_before(&self, key: &OrderKey) -> Option<&OrderKey>

The key of the child before the one under key, if any.

pub fn push(&mut self, t: T) -> OrderKey

Places t last, and returns its key.

pub fn insert_after(&mut self, after: Option<&OrderKey>, t: T) -> OrderKey

Places t right after the child under after, or first when None, and returns its key.

pub fn put(&mut self, key: OrderKey, t: T)

Places t under key, which no child has: where it was taken from.

pub fn remove(&mut self, key: &OrderKey) -> Option<T>

pub fn clear(&mut self)

pub fn rank(&self, key: &OrderKey) -> usize

How many children come before the one under key: its place.

Trait Implementations

impl<T: Clone> Clone for Children<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Children<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for Children<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> FromIterator<T> for Children<T>

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

Creates a value from an iterator.

impl<T> Index<usize> for Children<T>

type Output = T

The returned type after indexing.

fn index(&self, at: usize) -> &T

Performs the indexing (container[index]) operation.

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

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Values<'a, OrderKey, T>

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 Children<T>

Two lists of children are the same when they hold the same nodes in the same order, whatever keys placed them.

fn eq(&self, other: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.