Simple Object FIFO : Lock Synchronize « Threads « Java






Simple Object FIFO

Simple Object FIFO
     
public class SimpleObjectFIFO extends Object {
  private Object[] queue;

  private int capacity;

  private int size;

  private int head;

  private int tail;

  public SimpleObjectFIFO(int cap) {
    capacity = (cap > 0) ? cap : 1; // at least 1
    queue = new Object[capacity];
    head = 0;
    tail = 0;
    size = 0;
  }

  public synchronized int getSize() {
    return size;
  }

  public synchronized boolean isFull() {
    return (size == capacity);
  }

  public synchronized void add(Object obj) throws InterruptedException {
    while (isFull()) {
      wait();
    }

    queue[head] = obj;
    head = (head + 1) % capacity;
    size++;

    notifyAll(); // let any waiting threads know about change
  }

  public synchronized Object remove() throws InterruptedException {
    while (size == 0) {
      wait();
    }

    Object obj = queue[tail];
    queue[tail] = null; // don't block GC by keeping unnecessary reference
    tail = (tail + 1) % capacity;
    size--;

    notifyAll(); // let any waiting threads know about change

    return obj;
  }

  public synchronized void printState() {
    StringBuffer sb = new StringBuffer();

    sb.append("SimpleObjectFIFO:\n");
    sb.append("       capacity=" + capacity + "\n");

    sb.append("           size=" + size);
    if (isFull()) {
      sb.append(" - FULL");
    } else if (size == 0) {
      sb.append(" - EMPTY");
    }
    sb.append("\n");

    sb.append("           head=" + head + "\n");
    sb.append("           tail=" + tail + "\n");

    for (int i = 0; i < queue.length; i++) {
      sb.append("       queue[" + i + "]=" + queue[i] + "\n");
    }

    System.out.print(sb);
  }

  public static void main(String[] args) {
    try {
      SimpleObjectFIFO fifo = new SimpleObjectFIFO(5);
      fifo.printState();

      fifo.add("S01");
      fifo.printState();

      fifo.add("S02");
      fifo.printState();

      fifo.add("S03");
      fifo.printState();

      Object obj = fifo.remove();
      System.out.println("just removed obj=" + obj);
      fifo.printState();

      fifo.add("S04");
      fifo.printState();

      fifo.add("S05");
      fifo.printState();

      fifo.add("S06");
      fifo.printState();
    } catch (InterruptedException x) {
      x.printStackTrace();
    }
  }

}


           
         
    
    
    
    
  








Related examples in the same category

1.Thread: Dining Philosophers
2.Synchronizing on another objectSynchronizing on another object
3.Operations that may seem safe are not, when threads are presentOperations that may seem safe are not, when threads are present
4.Synchronizing blocks instead of entire methodsSynchronizing blocks instead of entire methods
5.Boolean lockBoolean lock
6.Static synchronized blockStatic synchronized block
7.Thread notifyThread notify
8.Thread deadlockThread deadlock
9.Synchronize methodSynchronize method
10.Threads joinThreads join
11.Static synchronizeStatic synchronize
12.No synchronizeNo synchronize
13.Thread synchronizationThread synchronization
14.Synchronized Block demoSynchronized Block demo
15.Interruptible Synchronized Block Interruptible Synchronized Block
16.SignalingSignaling
17.Object FIFOObject FIFO
18.Byte FIFOByte FIFO
19.Daemon Lock
20.Determining If the Current Thread Is Holding a Synchronized Lock
21.Handle concurrent read/write: use synchronized to lock the data
22.Lock for read and write
23.Read Write Lock
24.Coordinates threads for multi-threaded operations
25.A reader-writer lock from "Java Threads" by Scott Oak and Henry Wong.
26.Invoke a series of runnables as closely to synchronously as possible
27.This program shows how multiple threads can safely access a data structure, using synchronized methods
28.This program shows data corruption when multiple threads access a data structure.
29.Stores a single object for the producer/consumer pattern and takes care of thread synchronization.
30.The BooleanLock class provides a useful encapsulation of a boolean variable that is easily and safely accessed from multiple theads.