Java中的LinkedBlockingDeque removeFirst()方法

这个 removeFirst() 方法 LinkedBlockingDeque 返回并从中删除Deque容器的第一个元素。该方法抛出了一个 非接触性异常 如果Deque容器是空的。

null

语法:

public E removeFirst()

返回: 此方法返回 第一个元素是Deque容器。

例外 :函数抛出一个 非接触性异常 如果Deque是空的。

下面的程序演示了LinkedBlockingDeque的removeFirst()方法:

项目1:

// Java Program to demonstrate removeFirst()
// method of LinkedBlockingDeque
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
throws InterruptedException
{
// create object of LinkedBlockingDeque
LinkedBlockingDeque<Integer> LBD
= new LinkedBlockingDeque<Integer>();
// Add numbers to end of LinkedBlockingDeque
LBD.add( 7855642 );
LBD.add( 35658786 );
LBD.add( 5278367 );
LBD.add( 74381793 );
// print Dequee
System.out.println( "Linked Blocking Deque: " + LBD);
// removes the front element and prints it
System.out.println( "First element of Linked Blocking Deque: "
+ LBD.removeFirst());
// prints the Deque
System.out.println( "Linked Blocking Deque: " + LBD);
}
}


输出:

Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]

First element of Linked Blocking Deque: 7855642

Linked Blocking Deque: [35658786, 5278367, 74381793]

项目2:

// Java Program to demonstrate removeFirst()
// method of LinkedBlockingDeque
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
throws NoSuchElementException
{
// create object of LinkedBlockingDeque
LinkedBlockingDeque<Integer> LBD
= new LinkedBlockingDeque<Integer>();
// print Dequee
System.out.println( "Linked Blocking Deque: " + LBD);
try {
// throws an exception
LBD.removeFirst();
}
catch (Exception e) {
System.out.println( "Exception when removing "
+ "first element from this Deque: "
+ e);
}
}
}


输出:

Linked Blocking Deque: []
Exception when removing first element from this Deque: java.util.NoSuchElementException

© 版权声明
THE END
喜欢就支持一下吧
点赞13 分享