Java中的 LinkedBlockingDeque offerFirst() 方法

LinkedBlockingDeque的offerFirst(E e)方法将参数中传入的元素插入到 Deque 容器的最前面。如果容器的容量已超出，则它不会像 add() 和 addFirst()函数那样返回异常。

句法：

public boolean offerFirst(E e)

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

返回：如果元素已被插入，此方法返回true ，否则返回false。

下面的程序说明了 LinkedBlockingDeque 的 offerFirst() 方法：

方案一：

Java

// Java Program Demonstrate offerFirst()
// 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 LBD
            = new LinkedBlockingDeque(4);
 
        // Add numbers to end of LinkedBlockingDeque
        LBD.offerFirst(7855642);
        LBD.offerFirst(35658786);
        LBD.offerFirst(5278367);
        LBD.offerFirst(74381793);
 
        // Cannot be inserted
        LBD.offerFirst(10);
 
        // cannot be inserted hence returns false
        if (!LBD.offerFirst(10))
            System.out.println("The element 10 cannot be inserted"+
                                           " as capacity is full");
 
        // before removing print queue
        System.out.println("Linked Blocking Deque: " + LBD);
    }
}

输出：

The element 10 cannot be inserted as capacity is full
Linked Blocking Deque: [74381793, 5278367, 35658786, 7855642]

方案二：

Java

// Java Program Demonstrate offerFirst()
// 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 LBD
            = new LinkedBlockingDeque(4);
 
        // Add numbers to end of LinkedBlockingDeque
        LBD.offerFirst("abc");
        LBD.offerFirst("gopu");
        LBD.offerFirst("geeks");
        LBD.offerFirst("richik");
 
        // Cannot be inserted
        LBD.offerFirst("hii");
 
        // cannot be inserted hence returns false
        if (!LBD.offerFirst("hii"))
            System.out.println("The element 'hii' cannot be"
                           +" inserted as capacity is full");
 
        // before removing print queue
        System.out.println("Linked Blocking Deque: " + LBD);
    }
}

输出：

The element 'hii' cannot be inserted as capacity is full
Linked Blocking Deque: [richik, geeks, gopu, abc]

参考： https: Java/util/concurrent/LinkedBlockingDeque.html#offerFirst(E)