在 Scala TreeSet class
,則count()方法用於計算TreeSet中滿足給定謂詞的元素數。
函數定義: def count(p: (A) => Boolean): Int
返回類型: 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.mutable._
// 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.mutable._
// 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
相關用法
- Scala TreeSet +()用法及代碼示例
- Scala TreeSet -()用法及代碼示例
- Scala TreeSet &~()用法及代碼示例
- Scala TreeSet ++()用法及代碼示例
- Scala TreeSet take()用法及代碼示例
- Scala TreeSet &()用法及代碼示例
- Scala TreeSet sum()用法及代碼示例
- Scala TreeSet contains()用法及代碼示例
- Scala TreeSet min()用法及代碼示例
- Scala TreeSet max()用法及代碼示例
- Scala TreeSet map()用法及代碼示例
- Scala TreeSet last()用法及代碼示例
- Scala TreeSet intersect()用法及代碼示例
- Scala TreeSet equals()用法及代碼示例
- Scala TreeSet exists()用法及代碼示例
注:本文由純淨天空篩選整理自rupesh_rao大神的英文原創作品 Scala TreeSet count() method with example。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。