Scala Stack dropWhile() method with example

In Scala Stack class, the dropWhile() method is utilized to drop the longest prefix from the top which satisfies a given predicate in a stack.

Method Definition: def dropWhile(p: (A) => Boolean): Stack[A]

Return Type: It returns a new stack that consists of elements after dropping the longest prefix satisfying the given predicate.



Example #1:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Scala program of dropWhile() 
// method 
  
// Import Stack 
import scala.collection.mutable._
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
      
        // Creating stack  
        val s1 = Stack(6, 2, 3, 4, 5)  
            
        // Print the stack 
        println(s1)  
          
        // Applying dropWhile method  
        val result = s1.dropWhile(x => {x % 2 == 0}) 
            
        // Displays output  
        print("Stack after using dropWhile() method: " + result)
    

chevron_right


Output:

Stack(6, 2, 3, 4, 5)
Stack after using dropWhile() method: Stack(3, 4, 5)

Example #2:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Scala program of dropWhile() 
// method 
  
// Import Stack 
import scala.collection.mutable._
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
      
        // Creating stack  
        val s1 = Stack(1, 7, 2, 3, 4, 5)  
            
        // Print the stack 
        println(s1)  
          
        // Applying dropWhile method  
        val result = s1.dropWhile(x => {x % 2 != 0}) 
            
        // Displays output  
        print("Stack after using dropWhile() method: " + result)
    

chevron_right


Output:

Stack(1, 7, 2, 3, 4, 5)
Stack after using dropWhile() method: Stack(2, 3, 4, 5)


My Personal Notes arrow_drop_up

Coder Machine Learner Social Activist Vocalist

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.