Scala 不可变 TreeSet &() 方法

Scala 不可变 TreeSet &() 方法

在 Scala 不可变TreeSet class中， &()方法用于返回一个新的 TreeSet，其中包含两个给定 TreeSet 中都存在的元素。

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.

示例 #1：

// Scala program of &() 
// method 
  
// Import TreeSet
import scala.collection.immutable._
  
// 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) 
           
    } 
} 

输出：

TreeSet(1, 2, 3, 4, 5, 6)
TreeSet(2, 4, 6)
TreeSet containing common elements: TreeSet(2, 4, 6)

示例 #2：

// Scala program of &() 
// method 
  
// Import TreeSet
import scala.collection.immutable._
  
// 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) 
           
    } 
} 

输出：

TreeSet(e, f, g, k, o, r, s)
TreeSet(e, g, k, s)
TreeSet containing common elements: TreeSet(e, g, k, s)