在 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。非经特殊声明,原始代码版权归原作者所有,本译文未经允许或授权,请勿转载或复制。