Scala Queue exists() method with example

The exists() method is utilized to check whether a predicate holds for any of the elements of the queue.

Method Definition: def exists(p: (A) => Boolean): Boolean

Return Type: It returns true if the predicate holds true for any of the elements of the queue or else returns false.

Example #1:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Scala program of exists() 
// method 
  
// Import Queue  
import scala.collection.mutable._
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
      
        // Creating queues 
        val q1 = Queue(1, 3, 2, 7, 6, 5
          
        // Print the queue
        println(q1)
          
        // Applying exists method 
        val result = q1.exists(x => {x % 7 == 0}) 
          
        // Displays output 
        print("Element divisible by 7 exists: " + result)
    

chevron_right


Output:

Queue(1, 3, 2, 7, 6, 5)
Element divisible by 7 exists: true

Example #2:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Scala program of exists() 
// method 
  
// Import Queue  
import scala.collection.mutable._
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
      
        // Creating queues 
        val q1 = Queue(1, 3, 2, 7, 6, 5
          
        // Print the queue
        println(q1)
          
        // Applying exists method 
        val result = q1.exists(x => {x == 10}) 
          
        // Displays output 
        print("Element 10 exists: " + result)
    

chevron_right


Output:

Queue(1, 3, 2, 7, 6, 5)
Element 10 exists: false



My Personal Notes arrow_drop_up

Coder Machine Learner Social Activist Vocalist

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.