pub struct Queue<T> {
    /// The underlying vector that stored the elements of the `Queue`.
    vec: Vec<T>,
}
Expand description

The Queue type corresponds to the same called data structure.

Additional Information

A Queue is defined as a linear data structure that is open at both ends and the operations are performed in First In First Out order.
Meaning additions to the list are made at one end, and all deletions from the list are made at the other end.

Fields

vec: Vec

The underlying vector that stored the elements of the Queue.