In Scala
Scala
Scala
TreeSet class, the &() method is utilized to return a new TreeSet containing elements that are present in both the given TreeSets.
Method Definition: def &(that: TreeSet[A]): TreeSet[A] Return Type: It returns a new TreeSet containing elements that are present in both the given TreeSets.Example #1:
// Scala program of &()
// method
// Import TreeSet
import scala.collection.mutable._
// Creating object
object GfG
{
// Main method
def main(args:Array[String])
{
// Creating TreeSets
val t1 = TreeSet(2, 1, 3, 1, 4, 5, 6)
val t2 = TreeSet(2, 4, 6)
// Print the TreeSets
println(t1)
println(t2)
// Applying &() method
val result = t1.&(t2)
// Display output
print("TreeSet containing common elements: " + result)
}
}
Output:
Example #2:
TreeSet(1, 2, 3, 4, 5, 6) TreeSet(2, 4, 6) TreeSet containing common elements: TreeSet(2, 4, 6)
// Scala program of &()
// method
// Import TreeSet
import scala.collection.mutable._
// Creating object
object GfG
{
// Main method
def main(args:Array[String])
{
// Creating TreeSets
val t1 = TreeSet("g", "e", "e", "k", "s", "f", "o", "r")
val t2 = TreeSet("g", "e", "e", "k", "s")
// Print the TreeSets
println(t1)
println(t2)
// Applying &() method
val result = t1.&(t2)
// Display output
print("TreeSet containing common elements: " + result)
}
}
Output:
TreeSet(e, f, g, k, o, r, s) TreeSet(e, g, k, s) TreeSet containing common elements: TreeSet(e, g, k, s)