Struct ResizingBag 

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

A bag (or multiset) of generic items.

It supports insertion and iterating over the items in arbitrary order.

This implementation uses an SVec. Substituting std::vec::Vec for SVec also works. ResizingBag is similar to algs4 Java version ResizingArrayBag. See crate::LinkedBag for a version that uses a linked list.

The add, is_empty, and size operations take constant time. Iteration takes time proportional to the number of items.

For additional documentation, see Section 1.3 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

Implementations

impl<T> ResizingBag<T>

pub fn new() -> Self

Initializes an empty bag.

pub fn is_empty(&self) -> bool

Returns true if this bag is empty, returns false otherwise.

pub fn len(&self) -> usize

Returns the number of items in this bag.

pub fn add(&mut self, item: T)

Adds the item to this bag.

pub fn iter(&self) -> ResizingBagIter<'_, T>

Returns an iterator that iterates over the items in this bag in arbitrary order.

Trait Implementations

impl<T: Clone> Clone for ResizingBag<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Default for ResizingBag<T>

fn default() -> Self

Returns the “default value” for a type.