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<Integer> LBD
= new LinkedBlockingDeque<Integer>(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<String> LBD
= new LinkedBlockingDeque<String>(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]
參考: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingDeque.html#offer(E)
相關用法
- Java Queue offer()用法及代碼示例
- Java ConcurrentLinkedQueue offer()用法及代碼示例
- Java PriorityQueue offer()用法及代碼示例
- Java LinkedTransferQueue offer()用法及代碼示例
- Java ArrayBlockingQueue offer()用法及代碼示例
- Java Deque offer()用法及代碼示例
- Java ArrayDeque offer()用法及代碼示例
- Java PriorityBlockingQueue offer()用法及代碼示例
- Java DelayQueue offer()用法及代碼示例
- Java BlockingQueue offer()用法及代碼示例
- Java ConcurrentLinkedDeque offer()用法及代碼示例
- Java LinkedBlockingDeque put()用法及代碼示例
- Java LinkedBlockingDeque pop()用法及代碼示例
- Java LinkedBlockingDeque add()用法及代碼示例
注:本文由純淨天空篩選整理自gopaldave大神的英文原創作品 LinkedBlockingDeque offer() method in Java。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。