How to resolve the algorithm Queue/Definition step by step in the Fantom programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Queue/Definition step by step in the Fantom programming language

Table of Contents

Problem Statement

Implement a FIFO queue. Elements are added at one side and popped from the other in the order of insertion.

Operations:

Errors:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Queue/Definition step by step in the Fantom programming language

Source code in the fantom programming language

class Queue
{
  List queue := [,]

  public Void push (Obj obj)
  {
    queue.add (obj)  // add to right of list
  }

  public Obj pop ()
  {
    if (queue.isEmpty)
      throw (Err("queue is empty"))
    else
    {
      return queue.removeAt(0) // removes left-most item 
    }
  }

  public Bool isEmpty ()
  {
    queue.isEmpty
  }
}

  

You may also check:How to resolve the algorithm Loops/Break step by step in the F# programming language
You may also check:How to resolve the algorithm Terminal control/Clear the screen step by step in the Tcl programming language
You may also check:How to resolve the algorithm Sort three variables step by step in the jq programming language
You may also check:How to resolve the algorithm Ethiopian multiplication step by step in the BCPL programming language
You may also check:How to resolve the algorithm Determine if a string is numeric step by step in the 8th programming language