LookaheadStreamT Methods |
The LookaheadStreamT generic type exposes the following members.
Methods| Name | Description | |
|---|---|---|
 | Clear | (Inherited from FastQueueT.) |
| Consume | Make sure we have at least one element to remove, even if EOF |
| Dequeue |
Get and remove first element in queue; override
{@link FastQueue#remove()}; it's the same, just checks for backtracking.
(Overrides FastQueueTDequeue.) |
| Enqueue | (Inherited from FastQueueT.) |
| Equals | Determines whether the specified object is equal to the current object. (Inherited from Object.) |
| Fill | add n elements to buffer |
 | Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) |
| GetHashCode | Serves as the default hash function. (Inherited from Object.) |
| GetType | Gets the Type of the current instance. (Inherited from Object.) |
| IsEndOfFile | |
| LB | |
| LT | |
| Mark | |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) |
| NextElement |
Implement nextElement to supply a stream of elements to this
lookahead buffer. Return EOF upon end of the stream we're pulling from.
|
| Peek | (Inherited from FastQueueT.) |
| Release | |
| Reset | |
| Rewind | |
| Rewind(Int32) | |
| Seek |
Seek to a 0-indexed absolute token index. Normally used to seek backwards
in the buffer. Does not force loading of nodes.
|
| SyncAhead |
Make sure we have 'need' elements from current position p. Last valid
p index is data.size()-1. p+need-1 is the data index 'need' elements
ahead. If we need 1 element, (p+1-1)==p must be < data.size().
|
| ToString | Return string of current buffer contents; non-destructive (Inherited from FastQueueT.) |
See Also