ConcurrentLinkedDeque removeLast() method in Java
The ConcurrentLinkedDeque.removeLast() is an in-built function in Java which removes the last element in the deque. The function throws a NoSuchElementException if this deque is empty.
Syntax:
Conn_Linked_Deque.removeLast()
Parameters: The function does not accepts any parameter.
Return Values: The function returns the last element in the deque.
Exception: The function throws a NoSuchElementException if this deque is empty.
Below program illustrates the removeLast() method:
Program 1: This program involves deque with Integer elements.
import java.util.concurrent.*;
class ConcurrentLinkedDequeDemo {
public static void main(String[] args)
{
ConcurrentLinkedDeque<Integer> cld =
new ConcurrentLinkedDeque<Integer>();
cld.addFirst( 12 );
cld.addFirst( 70 );
cld.addFirst( 1009 );
cld.addFirst( 475 );
System.out.println( "Elements in"
+ "the LinkedDeque: " + cld);
System.out.println( "Element removed : "
+ cld.peekLast());
cld.removeLast();
System.out.println( "Elements in"
+ "the LinkedDeque: " + cld);
}
}
|
Output:
Elements inthe LinkedDeque: [475, 1009, 70, 12]
Element removed : 12
Elements inthe LinkedDeque: [475, 1009, 70]
Program 2: This program involves deque with String elements.
import java.util.concurrent.*;
class ConcurrentLinkedDequeDemo {
public static void main(String[] args)
{
ConcurrentLinkedDeque<String> cld =
new ConcurrentLinkedDeque<String>();
cld.addFirst( "GFG" );
cld.addFirst( "Gfg" );
cld.addFirst( "GeeksforGeeks" );
cld.addFirst( "Geeks" );
System.out.println( "Elements in"
+ "the LinkedDeque: " + cld);
System.out.println( "Element removed : "
+ cld.peekLast());
cld.removeLast();
System.out.println( "Elements in"
+ "the LinkedDeque: " + cld);
}
}
|
Output:
Elements inthe LinkedDeque: [Geeks, GeeksforGeeks, Gfg, GFG]
Element removed : GFG
Elements inthe LinkedDeque: [Geeks, GeeksforGeeks, Gfg]
Reference: https://docs.oracle.com/javase/8/docs/api/java/util/concurrent/ConcurrentLinkedDeque.html#removeLast()
Last Updated :
18 Sep, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...