Module linked_lists_rs::queue

Queue implementation A [Queue] is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO).

This means the element least recently added is removed first.

This [Queue] implementation uses the linked list concept. This implementation uses raw pointers and the unsafe keyword this is so to preserve performance and aims to be a 100% safe abstraction

Structs

IntoIter

IntoIter struct for Queue consumed iteration Iterate from front to end

Iter

Iter struct for Queue referenced iteration Iterate from front to end

IterMut

IterMut struct for Queue mutable referenced iteration Iterate from front to end

Queue

Queue Struct