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


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


在Scala中一成不变TreeSet class,则count()方法用于对TreeSet中满足给定谓词的元素的数量进行计数。

Method Definition: def count(p:(A) => Boolean):Int

Return Type: It returns the count the number of elements in the TreeSet that satisfies a given predicate.

范例1:

// Scala program of count()  
// method  
  
// Import TreeSet 
import scala.collection.immutable._
  
// Creating object  
object GfG  
{  
  
    // Main method  
    def main(args:Array[String])  
    {  
      
        // Creating TreeSet 
        val t1 = TreeSet(2, 1, 3, 4, 5)  
          
        // Print the TreeSet 
        println(t1)  
          
        // Applying count() method   
        val result = t1.count(x => {x % 2 == 0}) 
          
        // Display output  
        print("Number of even element in the TreeSet:" + result)  
           
    }  
} 
输出:
TreeSet(1, 2, 3, 4, 5)
Number of even element in the TreeSet:2

范例2:

// Scala program of count()  
// method  
  
// Import TreeSet 
import scala.collection.immutable._
  
// Creating object  
object GfG  
{  
  
    // Main method  
    def main(args:Array[String])  
    {  
      
        // Creating TreeSet 
        val t1 = TreeSet(2, 1, 3, 4, 5)  
          
        // Print the TreeSet 
        println(t1)  
          
        // Applying count() method   
        val result = t1.count(x => {x % 2 != 0}) 
          
        // Display output  
        print("Number of odd element in the TreeSet:" + result)  
           
    }  
} 
输出:
TreeSet(1, 2, 3, 4, 5)
Number of odd element in the TreeSet:3



相关用法


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