takeRight()方法用於返回由TreeSet的最後“ n”個元素組成的TreeSet。
函數定義: def takeRight(n: Int):TreeSet[A]
返回類型: It returns a TreeSet consisting of the last ‘n’ elements of the TreeSet.
範例1:
// Scala program of takeRight()
// method
// Import TreeSet
import scala.collection.mutable._
// Creating object
object GfG
{
// Main method
def main(args:Array[String])
{
// Creating TreeSet
val t1 = TreeSet(3, 1, 5, 2, 4)
// Print the TreeSet
println(t1)
// Applying takeRight method
val result = t1.takeRight(2)
// Displays output
print("TreeSet containing last two elements: " + result)
}
}
輸出:
TreeSet(1, 2, 3, 4, 5) TreeSet containing last two elements: TreeSet(4, 5)
範例2:
// Scala program of takeRight()
// method
// Import TreeSet
import scala.collection.mutable._
// Creating object
object GfG
{
// Main method
def main(args:Array[String])
{
// Creating TreeSet
val t1 = TreeSet(3, 1, 5, 2, 4)
// Print the TreeSet
println(t1)
// Applying takeRight method
val result = t1.takeRight(3)
// Displays output
print("TreeSet containing last three elements: " + result)
}
}
輸出:
TreeSet(1, 2, 3, 4, 5) TreeSet containing last three elements: TreeSet(3, 4, 5)
相關用法
- Scala Map takeRight()用法及代碼示例
- Scala Set takeRight()用法及代碼示例
- Scala SortedSet takeRight()用法及代碼示例
- Scala Stream takeRight()用法及代碼示例
- Scala Queue takeRight()用法及代碼示例
- Scala List takeRight()用法及代碼示例
- Scala SortedMap takeRight()用法及代碼示例
- Scala Stack takeRight()用法及代碼示例
- Scala TreeSet sum()用法及代碼示例
- Scala TreeSet last()用法及代碼示例
- Scala TreeSet take()用法及代碼示例
- Scala TreeSet max()用法及代碼示例
- Scala TreeSet map()用法及代碼示例
- Scala TreeSet -()用法及代碼示例
- Scala TreeSet ++()用法及代碼示例
注:本文由純淨天空篩選整理自rupesh_rao大神的英文原創作品 Scala TreeSet takeRight() method with example。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。