In Scala TreeSet class
, the find() method is utilized to return an element that satisfies a given predicate in the TreeSet.
Method Definition: def find(p: (A) => Boolean): Option[A]
Return Type: It returns the first element that satisfies a given predicate if present or else it returns None.
Example #1:
// Scala program of find() // method // Import TreeSet import scala.collection.mutable. _
// Creating object object GfG
{ // Main method
def main(args : Array[String])
{
// Creating TreeSet
val t 1 = TreeSet( 2 , 4 , 6 , 7 , 8 , 9 )
// Print the TreeSet
println(t 1 )
// Applying find() method
val result = t 1 .find(x => {x % 7 == 0 })
// Displays output
println( "Element divisible by 7: " + result)
}
} |
Output:
TreeSet(2, 4, 6, 7, 8, 9) Element divisible by 7: Some(7)
Example #2:
// Scala program of find() // method // Import TreeSet import scala.collection.mutable. _
// Creating object object GfG
{ // Main method
def main(args : Array[String])
{
// Creating TreeSet
val t 1 = TreeSet( 2 , 4 , 6 , 7 , 8 , 9 )
// Print the TreeSet
println(t 1 )
// Applying find() method
val result = t 1 .find(x => {x % 10 == 0 })
// Displays output
println( "Element divisible by 10: " + result)
}
} |
Output:
TreeSet(2, 4, 6, 7, 8, 9) Element divisible by 10: None