Click or drag to resize

CommonTreeNodeStream Methods

The CommonTreeNodeStream type exposes the following members.

Methods
  NameDescription
Public methodClear (Inherited from FastQueueT.)
Public methodConsume
Make sure we have at least one element to remove, even if EOF
(Inherited from LookaheadStreamT.)
Public methodDequeue (Overrides LookaheadStreamTDequeue.)
Public methodEnqueue (Inherited from FastQueueT.)
Public methodEquals
Determines whether the specified object is equal to the current object.
(Inherited from Object.)
Public methodFill
add n elements to buffer
(Inherited from LookaheadStreamT.)
Protected methodFinalize
Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.
(Inherited from Object.)
Public methodGetHashCode
Serves as the default hash function.
(Inherited from Object.)
Public methodGetKnownPositionElement
Public methodGetType
Gets the Type of the current instance.
(Inherited from Object.)
Public methodHasPositionInformation
Public methodIsEndOfFile (Overrides LookaheadStreamTIsEndOfFile(T).)
Public methodLA
Protected methodLB (Inherited from LookaheadStreamT.)
Public methodLT (Inherited from LookaheadStreamT.)
Public methodMark (Inherited from LookaheadStreamT.)
Protected methodMemberwiseClone
Creates a shallow copy of the current Object.
(Inherited from Object.)
Public methodNextElement (Overrides LookaheadStreamTNextElement.)
Public methodPeek (Inherited from FastQueueT.)
Public methodPop
Public methodPush
Public methodRelease (Inherited from LookaheadStreamT.)
Public methodReplaceChildren
Public methodReset (Overrides LookaheadStreamTReset.)
Public methodRewind (Inherited from LookaheadStreamT.)
Public methodRewind(Int32) (Inherited from LookaheadStreamT.)
Public methodSeek
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.)
Protected methodSyncAhead
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.)
Public methodToString
Return string of current buffer contents; non-destructive
(Inherited from FastQueueT.)
Public methodToString(Object, Object)
Public methodToTokenTypeString
For debugging; destructive: moves tree iterator to end.
Top
See Also