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。非經特殊聲明，原始代碼版權歸原作者所有，本譯文未經允許或授權，請勿轉載或複製。