在 Scala TreeSet class
,則find()方法用於返回滿足TreeSet中給定謂詞的元素。
函數定義: def find(p: (A) => Boolean): Option[A]
返回類型: It returns the first element that satisfies a given predicate if present or else it returns None.
範例1:
// Scala program of find()
// 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 find() method
val result = t1.find(x => {x % 7 == 0})
// Displays output
println("Element divisible by 7: " + result)
}
}
輸出:
TreeSet(2, 4, 6, 7, 8, 9) Element divisible by 7: Some(7)
範例2:
// Scala program of find()
// 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 find() method
val result = t1.find(x => {x % 10 == 0})
// Displays output
println("Element divisible by 10: " + result)
}
}
輸出:
TreeSet(2, 4, 6, 7, 8, 9) Element divisible by 10: None
相關用法
- Scala TreeSet &~()用法及代碼示例
- Scala TreeSet &()用法及代碼示例
- Scala TreeSet contains()用法及代碼示例
- Scala TreeSet take()用法及代碼示例
- Scala TreeSet -()用法及代碼示例
- Scala TreeSet sum()用法及代碼示例
- Scala TreeSet last()用法及代碼示例
- Scala TreeSet max()用法及代碼示例
- Scala TreeSet map()用法及代碼示例
- Scala TreeSet ++()用法及代碼示例
- Scala TreeSet min()用法及代碼示例
- Scala TreeSet +()用法及代碼示例
- Scala TreeSet forall()用法及代碼示例
- Scala TreeSet diff()用法及代碼示例
- Scala TreeSet exists()用法及代碼示例
注:本文由純淨天空篩選整理自rupesh_rao大神的英文原創作品 Scala TreeSet find() method with example。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。