En Scala immutable TreeSet class, el método intersect() se utiliza para devolver un nuevo TreeSet que consta de elementos que están presentes en ambos TreeSet dados.
Definición del método: def intersect[B >: A](that: collection.Seq[B]): TreeSet[A]
Tipo de devolución: devuelve un nuevo TreeSet que consta de elementos que están presentes en ambos TreeSet dados.
Ejemplo 1:
// Scala program of intersect()
// method
// Import TreeSet
import scala.collection.immutable._
// Creating object
object GfG
{
// Main method
def main(args:Array[String])
{
// Creating TreeSets
val t1 = TreeSet(1, 3, 2, 7, 6, 5)
val t2 = TreeSet(11, 3, 12, 7, 16, 5)
// Print the TreeSets
println("t1: " + t1)
println("t2: " + t2)
// Applying intersect() method
val result = t1.intersect(t2)
// Displays output
println("TreeSet with common elements: " + result)
}
}
Producción:
t1: TreeSet(1, 2, 3, 5, 6, 7) t2: TreeSet(3, 5, 7, 11, 12, 16) TreeSet with common elements: TreeSet(3, 5, 7)
Ejemplo #2:
// Scala program of intersect()
// method
// Import TreeSet
import scala.collection.immutable._
// Creating object
object GfG
{
// Main method
def main(args:Array[String])
{
// Creating TreeSets
val t1 = TreeSet(1, 3, 2, 7, 6, 5)
val t2 = TreeSet(1, 13, 2, 17, 16, 5)
// Print the TreeSets
println("t1: " + t1)
println("t2: " + t2)
// Applying intersect() method
val result = t1.intersect(t2)
// Displays output
println("TreeSet with common elements: " + result)
}
}
Producción:
t1: TreeSet(1, 2, 3, 5, 6, 7) t2: TreeSet(1, 2, 5, 13, 16, 17) TreeSet with common elements: TreeSet(1, 2, 5)