class queue (shared-side)

Available since version: 0.1.0

This class represents FIFO queue.

Properties

No properties.

---

Methods

len

This method will get size of the queue.

int len()

Returns int:

the size of the queue.

---

front

This method will get the oldest element from the queue.

any front()

Returns any:

the element that is placed on front of the queue.

---

back

This method will get the newest element from the queue.

any back()

Returns any:

the element that is placed on back of the queue.

---

push

This method will insert element at the begining of the queue. The added element, can be acces by queue.back method.

void push()

---

pop

This method will pop oldest element from the queue and returns it.

any pop()

Returns any:

the element that was at the front of the queue.

---

clear

Available since version: 0.1.10

This method will remove all elements from the queue.

void clear()

---