Package org.antlr.runtime.misc
Class FastQueue<T>
- java.lang.Object
-
- org.antlr.runtime.misc.FastQueue<T>
-
- Direct Known Subclasses:
LookaheadStream
public class FastQueue<T> extends Object
A queue that can dequeue and get(i) in O(1) and grow arbitrarily large. A linked list is fast at dequeue but slow at get(i). An array is the reverse. This is O(1) for both operations. List grows until you dequeue last element at end of buffer. Then it resets to start filling at 0 again. If adds/removes are balanced, the buffer will not grow too large. No iterator stuff as that's not how we'll use it.
-
-
Constructor Summary
Constructors Constructor Description FastQueue()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
add(T o)
void
clear()
T
get(int i)
Return element i elements ahead of current element.T
head()
T
remove()
Get and remove first element in queuevoid
reset()
int
size()
String
toString()
Return string of current buffer contents; non-destructive
-
-
-
Method Detail
-
reset
public void reset()
-
remove
public T remove()
Get and remove first element in queue
-
add
public void add(T o)
-
size
public int size()
-
head
public T head()
-
get
public T get(int i)
Return element i elements ahead of current element. i==0 gets current element. This is not an absolute index into the data list since p defines the start of the real list.
-
clear
public void clear()
-
-