std::queue ​

Structs ​

struct Queue[T]

FIFO data structure which is commonly called as queue.

Deallocates itself when destroyed.

Queues aren't use shared allocation between themselves. Allocates new space and copies (not deep copy) items into space.

Methods:

static fn New(cap: int): Queue[T]
Returns new queue instance with capacity.

fn Fit(mut self)
Set capacity to length. Removes additional capacity that waiting to use. Allocates new memory to cut additional capacity.

fn Len(self): int
Returns length of queue. Another meaning is count of elements.

fn Cap(self): int
Returns capacity of queue. Another meaning is additional redy-to-use allocation size.

fn Empty(self): bool
Reports whether queue is empty.

fn Clear(mut self)
Removes all elements. Does not deallocates buffer, keeps capacity.

fn Push(mut self, mut t: T)
Pushes element to rear of the queue.

fn Pop(mut self): T
Returns element front of the queue, then removes front element. Panics if queue is empty.

fn Front(mut self): T
Returns front element of the queue. Panics if queue is empty.

fn Slice(mut self): []T
Returns slice that contains elements of queue. Slice is not mutable reference to internal buffer, but can effect internal buffer if T is mutable type. Appends elements in front-to-rear order.