charqueue.java

SRI international 发布的OAA框架软件

package antlr_oaa;

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/RIGHTS.html
 *
 * $Id: CharQueue.java,v 1.1 2002/11/08 17:38:16 agno Exp $
 */

/** A circular buffer object used by CharBuffer */
public class CharQueue {
	// Physical circular buffer of characters
	protected char[] buffer;
	// buffer.length-1 for quick modulous
	protected int sizeLessOne;
	// physical index of front token
	protected int offset;
	// number of characters in the queue
	protected int nbrEntries;


	public CharQueue(int minSize) {
		// Find first power of 2 >= to requested size
		int size;
		for (size = 2; size < minSize; size *= 2) {;}
		init(size);
	}

  public int getNbrEntries() 
  {
    return nbrEntries;
  }

  public void reset() 
  {
    init(2);
  }

  public void reset(int minSize) 
  {
    int size;
    for (size = 2; size < minSize; size *= 2) {;}
    init(size);
  }

	/** Add token to end of the queue
	 * @param tok The token to add
	 */
	public final void append(char tok)
	{
		if (nbrEntries == buffer.length)
		{
			expand();
		}
		buffer[(offset + nbrEntries) & sizeLessOne] = tok;
		nbrEntries++;
	}
	/** Fetch a token from the queue by index
	 * @param idx The index of the token to fetch, where zero is the token at the front of the queue
	 */
	public final char elementAt(int idx) { 
		return buffer[(offset + idx) & sizeLessOne];
	}
	/** Expand the token buffer by doubling its capacity */
	private final void expand()
	{
          int newLen = buffer.length * 2;
		char[] newBuffer = new char[newLen];
		// Copy the contents to the new buffer
		// Note that this will store the first logical item in the 
		// first physical array element.
                System.arraycopy(buffer, offset, newBuffer, 0, buffer.length - offset);
                System.arraycopy(buffer, 0, newBuffer, buffer.length - offset, offset);
                /*
		for (int i = 0; i < buffer.length; i++)
		{
			newBuffer[i] = elementAt(i);
		}
                */
		// Re-initialize with new contents, keep old nbrEntries
		buffer = newBuffer;
		sizeLessOne = newLen - 1;
		offset = 0;
	}
	/** Initialize the queue.
	 * @param size The initial size of the queue
	 */
	private final void init(int size) {
		// Allocate buffer
		buffer = new char[size];
		// Other initialization
		sizeLessOne = size - 1;
		offset = 0;
		nbrEntries = 0;
	}
	/** Remove char from front of queue */
	public final void removeFirst() { 
		offset = (offset+1) & sizeLessOne;
		nbrEntries--;
	}
}