splitAt()方法用於在給定位置將給定的TreeSet拆分為TreeSet的前綴/後綴對。
函數定義: def splitAt(n: Int): (TreeSet[A], TreeSet[A])
Where, n is the position at which we need to split.返回類型: It returns a pair of TreeSet consisting of the first n elements of this TreeSet, and the other elements.
範例1:
// Scala program of splitAt()
// 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 splitAt method
val result = t1.splitAt(2)
// Displays output
print(result)
}
}
輸出:
TreeSet(1, 2, 3, 4, 5) (TreeSet(1, 2), TreeSet(3, 4, 5))
範例2:
// Scala program of splitAt()
// 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 splitAt method
val result = t1.splitAt(3)
// Displays output
print(result)
}
}
輸出:
TreeSet(1, 2, 3, 4, 5) (TreeSet(1, 2, 3), TreeSet(4, 5))
相關用法
- Scala Set splitAt()用法及代碼示例
- Scala Queue splitAt()用法及代碼示例
- Scala List splitAt()用法及代碼示例
- Scala Stack splitAt()用法及代碼示例
- Scala SortedSet splitAt()用法及代碼示例
- Scala TreeSet take()用法及代碼示例
- Scala TreeSet map()用法及代碼示例
- Scala TreeSet sum()用法及代碼示例
- Scala TreeSet max()用法及代碼示例
- Scala TreeSet min()用法及代碼示例
- Scala TreeSet last()用法及代碼示例
- Scala TreeSet +()用法及代碼示例
- Scala TreeSet &()用法及代碼示例
- Scala TreeSet -()用法及代碼示例
- Scala TreeSet &~()用法及代碼示例
注:本文由純淨天空篩選整理自rupesh_rao大神的英文原創作品 Scala TreeSet splitAt() method with example。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。