Implementing a Queue in Rust.

A queue is a very common data structure with many applications. It belongs to a collection that adheres to the so called FIFO principle, that is, First In First Out. Most basic implementations offer the following methods:

  • add : to add an item to the queue
  • remove: to remove the item that is longest in the queue
  • is_empty: to verify if the queue is empty

--

--

--

I am a mathematician and software developer who likes writing advanced code and to do research in applied and pure mathematics.

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

【C#】Behavioral Patterns Strategy Mode

Quick Tips: Power Apps & Azure Search

Image of an early version of the Power App that uses Azure Cognitive Search to deliver the data

【C#】Structural Patterns Composite Mode

Capture Image and Convert into PDF in Python

How to install Joomla on IBM Cloud

A Jenkins Pipeline to Launch Personal EC2 Instances on AWS and Bootstrap using CHEF

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
applied.math.coding

applied.math.coding

I am a mathematician and software developer who likes writing advanced code and to do research in applied and pure mathematics.

More from Medium

Implementing a basic Thread Pool in Rust.

Enhancing the Security of Rust

Rusty Shorts — FnMut & FnOnce Closures

Cubic Bézier Curve Implementation In Rust