当前位置: 首页>>代码示例 >>用法及示例精选 >>正文


Scala immutable TreeSet &()用法及代码示例


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

函数定义: def &(that: TreeSet[A]): TreeSet[A]

返回类型: 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)


相关用法


注:本文由纯净天空筛选整理自Shivam_k大神的英文原创作品 Scala immutable TreeSet &() method。非经特殊声明,原始代码版权归原作者所有,本译文未经允许或授权,请勿转载或复制。