Scala SortedSet intersect() method with example
Last Updated :
03 Nov, 2019
The intersect() method is utilized to compute the intersection between two SortedSets.
Method Definition: def intersect(that: SortedSet[A]): SortedSet[A]
Return Type: It returns a SortedSet containing the elements present in both the SortedSets.
Example #1:
import scala.collection.immutable.SortedSet
object GfG
{
def main(args : Array[String])
{
val s 1 = SortedSet( 1 , 2 , 3 , 4 , 5 )
val s 2 = SortedSet( 11 , 12 , 13 , 4 , 5 )
val s 3 = s 1 .intersect(s 2 )
s 3 .foreach(x => println(x))
}
}
|
Example #2:
import scala.collection.immutable.SortedSet
object GfG
{
def main(args : Array[String])
{
val s 1 = SortedSet( 1 , 2 , 3 , 4 , 5 )
val s 2 = SortedSet( 11 , 2 , 3 , 4 , 5 )
val s 3 = s 1 .intersect(s 2 )
s 3 .foreach(x => println(x))
}
}
|
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...