Scala Queue contains() method with example

The contains() method is utilized to test if an element is present in the queue or not.

Method Definition: def contains[A1 >: A](elem: A1): Boolean

Return Type: It returns true if the element is present in the queue, else it returns false.



Example #1:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Scala program of contains() 
// method 
  
// Import Queue  
import scala.collection.mutable._
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
        // Creating a queue 
        val q1 = Queue(10, 11, 12, 13, 14)
          
        // Print the queue
        println(q1)
          
        // Applying contains() method 
        val result = q1.contains(12)
          
        // Display output
        print("Queue contains 12: " + result)   
          
    

chevron_right


Output:

Queue(10, 11, 12, 13, 14)
Queue contains 12: true

Example #2:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Scala program of contains() 
// method 
  
// Import Queue  
import scala.collection.mutable._
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
        // Creating a queue 
        val q1 = Queue(10, 11, 12, 13, 14)
          
        // Print the queue
        println(q1)
          
        // Applying contains() method 
        val result = q1.contains(20)
          
        // Display output
        print("Queue contains 20: " + result)   
          
    

chevron_right


Output:

Queue(10, 11, 12, 13, 14)
Queue contains 20: false



My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.