Scala TreeSet intersect()用法及代碼示例

在 Scala TreeSet class，則使用intersect()方法返回一個新的TreeSet，該樹集由兩個給定TreeSet中都存在的元素組成。

函數定義: def intersect[B >: A](that: collection.Seq[B]): TreeSet[A]

返回類型: It returns a new TreeSet that consists of elements that are present in both the given TreeSet.

範例1：

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

輸出：

t1: TreeSet(1, 2, 3, 5, 6, 7)
t2: TreeSet(3, 5, 7, 11, 12, 16)
TreeSet with common elements: TreeSet(3, 5, 7)

範例2：

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

輸出：

t1: TreeSet(1, 2, 3, 5, 6, 7)
t2: TreeSet(1, 2, 5, 13, 16, 17)
TreeSet with common elements: TreeSet(1, 2, 5)

相關用法

注：本文由純淨天空篩選整理自rupesh_rao大神的英文原創作品 Scala TreeSet intersect() method with example。非經特殊聲明，原始代碼版權歸原作者所有，本譯文未經允許或授權，請勿轉載或複製。