在 Scala TreeSet class
,則dropRight()方法用於刪除TreeSet的最後一個“ n”個元素。
函數定義: def dropRight(n: Int): TreeSet[A]
返回類型: It returns a new TreeSet that consists of all the elements except the last ‘n’ elements.
範例1:
// Scala program of dropRight()
// 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 dropRight() method
val result = t1.dropRight(2)
// Displays output
println("Queue after using dropRight(2) method: " + result)
}
}
輸出:
TreeSet(2, 4, 6, 7, 8, 9) Queue after using dropRight(2) method: TreeSet(2, 4, 6, 7)
範例2:
// Scala program of dropRight()
// 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 dropRight() method
val result = t1.dropRight(4)
// Displays output
println("Queue after using dropRight(4) method: " + result)
}
}
輸出:
TreeSet(2, 4, 6, 7, 8, 9) Queue after using dropRight(4) method: TreeSet(2, 4)
相關用法
- Scala Set dropRight()用法及代碼示例
- Scala Map dropRight()用法及代碼示例
- Scala Queue dropRight()用法及代碼示例
- Scala List dropRight()用法及代碼示例
- Scala SortedSet dropRight()用法及代碼示例
- Scala Stack dropRight()用法及代碼示例
- Scala SortedMap dropRight()用法及代碼示例
- Scala TreeSet map()用法及代碼示例
- Scala TreeSet min()用法及代碼示例
- Scala TreeSet +()用法及代碼示例
- Scala TreeSet &()用法及代碼示例
- Scala TreeSet ++()用法及代碼示例
- Scala TreeSet max()用法及代碼示例
- Scala TreeSet last()用法及代碼示例
- Scala TreeSet sum()用法及代碼示例
注:本文由純淨天空篩選整理自rupesh_rao大神的英文原創作品 Scala TreeSet dropRight() method with example。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。