这个 拿() 方法 LinkedBlockingDeque 返回并移除Deque容器的头部。该方法抛出了一个 中断异常 如果在等待时被打断。
null
语法:
public E take()
返回: 此方法返回Deque容器的头部。
例外 :函数抛出一个 中断异常 如果在等待时被打断。
下面的程序演示了LinkedBlockingDeque的take()方法:
项目1:
// Java Program to demonstrate take() // 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 Dequeue System.out.println( "Linked Blocking Deque: " + LBD); // removes the front element and prints it System.out.println( "Head of Linked Blocking Deque: " + LBD.take()); // prints the Deque System.out.println( "Linked Blocking Deque: " + LBD); } } |
输出:
Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793] Head of Linked Blocking Deque: 7855642 Linked Blocking Deque: [35658786, 5278367, 74381793]
项目2: 演示中断异常
// Java Program to demonstrate take() // 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>(); // print Dequeue // the Deque is empty System.out.println( "Linked Blocking Deque: " + LBD); try { // throws error as the list is empty // and it is interrupted while waiting System.out.println( "Head of Linked Blocking Deque: " + LBD.take()); } catch (Exception e) { System.out.println( "Exception: " + e); } } } |
运行时异常:
Max real time limit exceeded due to either by heavy load on server or by using sleep function.
参考: https://docs.oracle.com/javase/8/docs/api/java/util/concurrent/LinkedBlockingDeque.html#take–
© 版权声明
文章版权归作者所有,未经允许请勿转载。
THE END