CommonTreeNodeStream Methods |
The CommonTreeNodeStream type exposes the following members.
Name | Description | |
---|---|---|
![]() | Clear | (Inherited from FastQueueT.) |
![]() | Consume | Make sure we have at least one element to remove, even if EOF (Inherited from LookaheadStreamT.) |
![]() | Dequeue | (Overrides LookaheadStreamTDequeue.) |
![]() | 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 (Inherited from LookaheadStreamT.) |
![]() | 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.) |
![]() | GetKnownPositionElement | |
![]() | GetType | Gets the Type of the current instance. (Inherited from Object.) |
![]() | HasPositionInformation | |
![]() | IsEndOfFile | (Overrides LookaheadStreamTIsEndOfFile(T).) |
![]() | LA | |
![]() | LB | (Inherited from LookaheadStreamT.) |
![]() | LT | (Inherited from LookaheadStreamT.) |
![]() | Mark | (Inherited from LookaheadStreamT.) |
![]() | MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) |
![]() | NextElement | (Overrides LookaheadStreamTNextElement.) |
![]() | Peek | (Inherited from FastQueueT.) |
![]() | Pop | |
![]() | Push | |
![]() | Release | (Inherited from LookaheadStreamT.) |
![]() | ReplaceChildren | |
![]() | Reset | (Overrides LookaheadStreamTReset.) |
![]() | Rewind | (Inherited from LookaheadStreamT.) |
![]() | Rewind(Int32) | (Inherited from LookaheadStreamT.) |
![]() | Seek |
Seek to a 0-indexed absolute token index. Normally used to seek backwards
in the buffer. Does not force loading of nodes.
(Inherited from LookaheadStreamT.) |
![]() | 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().
(Inherited from LookaheadStreamT.) |
![]() | ToString | Return string of current buffer contents; non-destructive (Inherited from FastQueueT.) |
![]() | ToString(Object, Object) | |
![]() | ToTokenTypeString | For debugging; destructive: moves tree iterator to end. |