feat: LinkedBlockingQueue 使用

README/Java并发容器使用.md

@@ -42,3 +42,31 @@ System.out.println(poll1);
 String peek = queue.peek();
 System.out.println(peek);
 ```
+
+## PriorityBlockingQueue使用
+
+```java
+// 无边界队列，可以定义初始容量并不是最大容量
+PriorityBlockingQueue<Integer> queue = new PriorityBlockingQueue<>(2);
+System.out.println(queue);
+
+// 队列的添加方法都等于offer方法
+queue.offer(1);
+queue.offer(10);
+queue.offer(3);
+System.out.println(queue);
+```
+
+## LinkedBlockingQueue使用
+
+```java
+// 属于可选边界
+LinkedBlockingQueue<Integer> integers = new LinkedBlockingQueue<>(10);
+boolean b = integers.remainingCapacity() == 10;
+System.out.println(b);
+
+// 等于定义的
+LinkedBlockingQueue<Integer> integers1 = new LinkedBlockingQueue<>();
+boolean b1 = integers1.remainingCapacity() == Integer.MAX_VALUE;
+System.out.println(b1);
+```

multithreading1/src/main/java/cn/bunny/atomic/AtomicExample07.java

@@ -1,4 +1,17 @@
 package cn.bunny.atomic;
 
+import java.util.concurrent.LinkedBlockingQueue;
+
 public class AtomicExample07 {
+    public static void main(String[] args) {
+        // 属于可选边界
+        LinkedBlockingQueue<Integer> integers = new LinkedBlockingQueue<>(10);
+        boolean b = integers.remainingCapacity() == 10;
+        System.out.println(b);
+
+        // 等于定义的
+        LinkedBlockingQueue<Integer> integers1 = new LinkedBlockingQueue<>();
+        boolean b1 = integers1.remainingCapacity() == Integer.MAX_VALUE;
+        System.out.println(b1);
+    }
 }