Gareeva_S_A_queue

src/main/java/hse/java/lectures/lecture6/tasks/queue/BoundedBlockingQueue.java

@@ -1,25 +1,45 @@
 package hse.java.lectures.lecture6.tasks.queue;
 
+import java.util.LinkedList;
+
 public class BoundedBlockingQueue<T> {
 
+    private final LinkedList<T> queue;
+    private final int capacity;
 
     public BoundedBlockingQueue(int capacity) {
-
+        if (capacity <= 0) {
+            throw new IllegalArgumentException();
+        }
+        this.capacity = capacity;
+        this.queue = new LinkedList<>();
     }
 
-    public void put(T item) throws InterruptedException {
-
+    public synchronized void put(T item) throws InterruptedException {
+        if (item == null) {
+            throw new IllegalArgumentException();
+        }
+        while (queue.size() == capacity) {
+            wait();
+        }
+        queue.addLast(item);
+        notifyAll();
     }
 
-    public T take() throws InterruptedException {
-        return null;
+    public synchronized T take() throws InterruptedException {
+        while (queue.isEmpty()) {
+            wait();
+        }
+        T elem = queue.removeFirst();
+        notifyAll();
+        return elem;
     }
 
-    public int size() {
-        return 0;
+    public synchronized int size() {
+        return queue.size();
     }
 
-    public int capacity() {
-        return 0;
+    public synchronized int capacity() {
+        return capacity;
     }
 }