Q:

Scala program to demonstrate the map() method of Queue class

belongs to collection: Scala Queue Programs

0

Here, we will create a queue using the Queue collection class and then we will apply some logic to queue elements. After that, we printed the result on the console screen.

The Queue is a linear data structure, It follows the First In First Out (FIFO) property. We can insert and remove the item in the queue from different ends of the queue.

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

Program/Source Code:

The source code to demonstrate the map() method of the Queue class is given below. The given program is compiled and executed on the ubuntu 18.04 operating system successfully.

// Scala program to demonstrate the
// map() method of Queue class

import scala.collection.mutable._

object Sample {
  // Main method
  def main(args: Array[String]) {
    var queue = Queue(60, 25, 23, 40, 50);

    var result = queue.map(v => v + 2);

    println(result);
  }
}

Output:

Queue(62, 27, 25, 42, 52)

Explanation:

Here, we used an object-oriented approach to create the program. And, we imported Collection classes using the below statement,

import scala.collection.mutable._

And, we also created a singleton object Sample and defined the main() function. The main() function is the entry point for the program.

In the main() function, we created a queue queue using the Queue collection class. Then we added 2 in each item of the queue using the map() method and printed the result on the console screen.

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

<< Scala program to get the first N item from the que...