Struct MyCircularQueue

pub struct MyCircularQueue { /* private fields */ }

Implementations

impl MyCircularQueue

pub fn new(k: i32) -> Self

Initialize your data structure here. Set the size of the queue to be k.

pub fn en_queue(&mut self, value: i32) -> bool

Insert an element into the circular queue. Return true if the operation is successful.

pub fn de_queue(&mut self) -> bool

Delete an element from the circular queue. Return true if the operation is successful.

pub fn front(&self) -> i32

Get the front item from the queue.

pub fn rear(&self) -> i32

Get the last item from the queue.

pub fn is_empty(&self) -> bool

Checks whether the circular queue is empty or not.

pub fn is_full(&self) -> bool

Checks whether the circular queue is full or not.

Trait Implementations

impl Clone for MyCircularQueue

fn clone(&self) -> MyCircularQueue

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for MyCircularQueue

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

Formats the value using the given formatter.