The takeLast() method of LinkedBlockingDeque returns and removes the tail of the Deque container from it. The method throws an InterruptedException if it is interrupted while waiting.
Syntax:
public E takeLast()
Returns: This method returns the tail(last element) of the Deque container.
Exception: The function throws an InterruptedException if it is interrupted while waiting.
Below programs illustrate takeLast() method of LinkedBlockingDeque:
Program 1:
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
throws InterruptedException
{
LinkedBlockingDeque<Integer> LBD
= new LinkedBlockingDeque<Integer>();
LBD.add( 7855642 );
LBD.add( 35658786 );
LBD.add( 5278367 );
LBD.add( 74381793 );
System.out.println( "Linked Blocking Deque: " + LBD);
System.out.println( "Head of Linked Blocking Deque: "
+ LBD.takeLast());
System.out.println( "Linked Blocking Deque: " + LBD);
}
}
|
Output:
Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]
Head of Linked Blocking Deque: 74381793
Linked Blocking Deque: [7855642, 35658786, 5278367]
Program 2:
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
throws InterruptedException
{
LinkedBlockingDeque<Integer> LBD
= new LinkedBlockingDeque<Integer>();
LBD.add( 7855642 );
LBD.add( 35658786 );
LBD.add( 5278367 );
LBD.add( 74381793 );
System.out.println( "Linked Blocking Deque: " + LBD);
LBD.clear();
System.out.println( "Head of Linked Blocking Deque: "
+ LBD.takeLast());
}
}
|
Runtime Errors:
Max real time limit exceeded due to either by heavy load on server or by using sleep function
Reference: https://docs.oracle.com/javase/8/docs/api/java/util/concurrent/LinkedBlockingDeque.html#takeLast–
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!
Last Updated :
26 Nov, 2018
Like Article
Save Article