Scala SortedSet splitAt() method with example

The splitAt() method is utilized to split the given SortedSet into a prefix/suffix pair at a stated position.

Method Definition: def splitAt(n: Int): (SortedSet[A], SortedSet[A])
Where, n is the position at which we need to split.

Return Type: It returns a pair of TreeSets consisting of the first n elements of this SortedSet, and the other elements.

Example #1:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Scala program of splitAt() 
// method 
import scala.collection.immutable.SortedSet 
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
        // Creating a SortedSet 
        val s1 = SortedSet(2, 4, 11, 31
          
        // Applying splitAt method 
        val result = s1.splitAt(2)
          
        // Display output
        println(result)
    

chevron_right


Output:

(TreeSet(2, 4), TreeSet(12, 31))

Example #2:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Scala program of splitAt() 
// method 
import scala.collection.immutable.SortedSet 
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
        // Creating a SortedSet 
        val s1 = SortedSet(1, 2, 3, 4
          
        // Applying splitAt method 
        val result = s1.splitAt(2)
          
        // Display output
        println(result)
    

chevron_right


Output:

(TreeSet(1, 2), TreeSet(3, 4))



My Personal Notes arrow_drop_up

The function of education is to teach one to think intensively and to think critically

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.