Scala TreeSet forall() method with example

In Scala TreeSet class, the forall() method is utilized to check if a predicate holds true for all the elements of the TreeSet.

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

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



Example #1:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Scala program of forall() 
// method 
  
// Import TreeSet
import scala.collection.mutable._
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
      
        // Creating TreeSet
        val t1 = TreeSet(2, 4, 6, 7, 8, 9
          
        // Print the TreeSet
        println(t1
          
        // Applying forall() method  
        val result = t1.forall(x => {x % 7 == 0})
          
        // Displays output 
        println("All the elements are divisible by 7: " + result)
          
    

chevron_right


Output:

TreeSet(2, 4, 6, 7, 8, 9)
All the elements are divisible by 7: false

Example #2:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Scala program of forall() 
// method 
  
// Import TreeSet
import scala.collection.mutable._
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
      
        // Creating TreeSet
        val t1 = TreeSet(2, 4, 6, 8
          
        // Print the TreeSet
        println(t1
          
        // Applying forall() method  
        val result = t1.forall(x => {x % 2 == 0})
          
        // Displays output 
        println("All the elements are even: " + result)
          
    

chevron_right


Output:

TreeSet(2, 4, 6, 8)
All the elements are even: true


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.