Java LinkedBlockingDeque addFirst()方法

LinkedBlockingDeque 的 addFirst(E e) 方法在有空间的情况下将参数中传递的元素插入到Deque的前面。如果LinkedBlockingDeque有容量限制，并且没有空间可供插入，它将返回一个IllegalStateException。

语法

public void addFirst(E e)

参数： 该方法接受一个强制参数 e ，它是要插入到LinkedBlockingDeque前面的元素。

返回： 该方法不返回任何东西。

异常

• IllegalStateException ：如果由于容量的限制，此时不能添加元素。
• NullPointerException : 如果指定的元素是空的。

下面的程序说明了PriorityBlockingQueue的addFirst()方法。

程序1 :

// Java Program Demonstrate addFirst()
// method of LinkedBlockingDeque
  
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
  
public class GFG {
    public static void main(String[] args)
        throws IllegalStateException
    {
  
        // create object of LinkedBlockingDeque
        LinkedBlockingDeque<Integer> LBD
            = new LinkedBlockingDeque<Integer>();
  
        // Add numbers to front of LinkedBlockingDeque
        LBD.addFirst(7855642);
        LBD.addFirst(35658786);
        LBD.addFirst(5278367);
        LBD.addFirst(74381793);
  
        // before removing print queue
        System.out.println("Linked Blocking Deque: " + LBD);
    }
}

输出:

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

示例2

// Java Program Demonstrate addFirst()
// method of LinkedBlockingDeque
// when it is Full
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
  
public class GFG {
    public static void main(String[] args)
        throws IllegalStateException
    {
  
        // create object of LinkedBlockingDeque
        // size of list
        LinkedBlockingDeque<Integer> LBD
            = new LinkedBlockingDeque<Integer>(3);
  
        // Add numbers to front of LinkedBlockingDeque
        LBD.addFirst(7855642);
        LBD.addFirst(35658786);
        LBD.addFirst(5278367);
  
        // it is full
        LBD.addFirst(74381793);
  
        // before removing print queue
        System.out.println("Linked Blocking Deque: " + LBD);
    }
}

输出

Exception in thread "main" java.lang.IllegalStateException: Deque full
    at java.util.concurrent.LinkedBlockingDeque.addFirst(LinkedBlockingDeque.java:326)
    at GFG.main(GFG.java:23)

示例3

// Java Program Demonstrate addFirst()
// method of LinkedBlockingDeque
// when nill is inserted
  
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
  
public class GFG {
    public static void main(String[] args)
        throws IllegalStateException
    {
  
        // create object of LinkedBlockingDeque
        LinkedBlockingDeque<Integer> LBD
            = new LinkedBlockingDeque<Integer>();
  
        // Add numbers to front of LinkedBlockingDeque
        LBD.addFirst(7855642);
        LBD.addFirst(35658786);
        LBD.addFirst(5278367);
  
        // NULL
        LBD.addFirst(null);
  
        // before removing print queue
        System.out.println("Linked Blocking Deque: " + LBD);
    }
}

输出

Exception in thread "main" java.lang.NullPointerException
    at java.util.concurrent.LinkedBlockingDeque.offerFirst(LinkedBlockingDeque.java:342)
    at java.util.concurrent.LinkedBlockingDeque.addFirst(LinkedBlockingDeque.java:325)
    at GFG.main(GFG.java:22)

**参考资料: ** https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingDeque.html#add(E)