LinkedBlockingDeque的offer(E e)方法将参数中传递的元素插入到Deque的末尾。如果超出了容器的容量,则不会像add()和addFirst()函数一样返回异常。
用法:
public boolean offer(E e)
参数:此方法接受强制参数e,该参数是要在LinkedBlockingDeque末尾插入的元素。
返回值:如果已插入元素,则此方法返回true,否则返回false。
以下示例程序旨在说明LinkedBlockingDeque的offer()方法:
示例1:
// Java Program Demonstrate offer()
// 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.offer(7855642);
LBD.offer(35658786);
LBD.offer(5278367);
LBD.offer(74381793);
// Cannot be inserted
LBD.offer(10);
// cannot be inserted hence returns false
if (!LBD.offer(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: [7855642, 35658786, 5278367, 74381793]
示例2:
// Java Program Demonstrate offer()
// 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.offer("abc");
LBD.offer("gopu");
LBD.offer("geeks");
LBD.offer("richik");
// Cannot be inserted
LBD.offer("hii");
// cannot be inserted hence returns false
if (!LBD.offer("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: [abc, gopu, geeks, richik]