在 Scala TreeSet class
,則forall()方法用於檢查謂詞是否對TreeSet的所有元素成立。
函數定義: def forall(p: (A) => Boolean): Boolean
返回類型: It returns true if the predicate holds true for all the elements of the TreeSet or else returns false.
範例1:
// Scala program of forall()
// method
// Import TreeSet
import scala.collection.mutable._
// Creating object
object GfG
{
// Main method
def main(args:Array[String])
{
// Creating TreeSet
val t1 = TreeSet(2, 4, 6, 7, 8, 9)
// Print the TreeSet
println(t1)
// Applying forall() method
val result = t1.forall(x => {x % 7 == 0})
// Displays output
println("All the elements are divisible by 7: " + result)
}
}
輸出:
TreeSet(2, 4, 6, 7, 8, 9) All the elements are divisible by 7: false
範例2:
// Scala program of forall()
// method
// Import TreeSet
import scala.collection.mutable._
// Creating object
object GfG
{
// Main method
def main(args:Array[String])
{
// Creating TreeSet
val t1 = TreeSet(2, 4, 6, 8)
// Print the TreeSet
println(t1)
// Applying forall() method
val result = t1.forall(x => {x % 2 == 0})
// Displays output
println("All the elements are even: " + result)
}
}
輸出:
TreeSet(2, 4, 6, 8) All the elements are even: true
相關用法
- Scala Set forall()用法及代碼示例
- Scala List forall()用法及代碼示例
- Scala Iterator forall()用法及代碼示例
- Scala Stack forall()用法及代碼示例
- Scala SortedSet forall()用法及代碼示例
- Scala Queue forall()用法及代碼示例
- Scala TreeSet take()用法及代碼示例
- Scala TreeSet map()用法及代碼示例
- Scala TreeSet min()用法及代碼示例
- Scala TreeSet max()用法及代碼示例
- Scala TreeSet last()用法及代碼示例
- Scala TreeSet sum()用法及代碼示例
- Scala TreeSet +()用法及代碼示例
- Scala TreeSet &()用法及代碼示例
- Scala TreeSet -()用法及代碼示例
注:本文由純淨天空篩選整理自rupesh_rao大神的英文原創作品 Scala TreeSet forall() method with example。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。