Lines Matching refs:Index
276 /// Get the token start index for this subtree; return -1 if no such index
281 /// Get the token stop index for this subtree; return -1 if no such index
310 /// What index is this node in the child list? Range: 0..n-1
317 procedure SetChildIdex(const T: IANTLRInterface; const Index: Integer);
320 /// Replace from start to stop child index of parent with t, which might
342 /// <summary>Get a tree node at an absolute index i; 0..n-1.</summary>
354 /// Return null for LT(0) and any index that results in an absolute address
375 /// Replace from start to stop child index of parent with t, which might
458 /// <summary>Set (or reset) the parent and child index values for all children</summary>
494 // Tree tracks parent and child index now > 3.0
497 /// <summary>This node is what child index? 0..n-1</summary>
516 /// What is the smallest token index (indexing from 0) for this node
522 /// What is the largest token index (indexing from 0) for this node
590 /// What is the smallest token index (indexing from 0) for this node
596 /// What is the largest token index (indexing from 0) for this node
607 /// that computing parent and child index is very difficult and cumbersome.
739 procedure Push(const Index: Integer);
742 /// Seek back to previous index saved during last Push() call.
743 /// Return top of stack (return index).
920 /// This class can build a token type -> node index for repeated use or for
933 /// Compute a Map<String, Integer> that is an inverted index of
951 /// TODO: save this index so that find and visit are faster
953 function Index(const T: IANTLRInterface): IDictionary<Integer, IList<IANTLRInterface>>;
1210 /// <summary>What index is this node in the child list? Range: 0..n-1</summary>
1302 procedure SetChildIdex(const T: IANTLRInterface; const Index: Integer); virtual; abstract;
1331 procedure SetChildIdex(const T: IANTLRInterface; const Index: Integer); override;
1353 /// The complete mapping from stream index to tree node. This buffer
1378 /// The index into the nodes list of the current node (next node
1400 function Index: Integer; virtual;
1404 procedure Seek(const Index: Integer); virtual;
1427 procedure Push(const Index: Integer);
1446 /// Returns the stream index for the spcified node in the range 0..n-1 or,
1670 /// <summary>Index into input string</summary>
1803 function Index(const T: IANTLRInterface): IDictionary<Integer, IList<IANTLRInterface>>;
1823 /// <summary>Do the work for index</summary>
1954 /// a child, push current node and current index.
1959 /// Track which child index you are visiting for each node we push.
1977 /// What node index did we just consume? i=0..n-1 for n node trees.
2000 /// The marker is an index into this stack. This is a List<TreeWalkState>.
2001 /// Indexed from 1..markDepth. A null is kept at index 0. It is created
2030 function Index: Integer; virtual;
2034 procedure Seek(const Index: Integer); virtual;
2309 J := 0; // index into new children
2329 // delete same index, shifting everybody down each time
2346 // replacedSoFar has correct index for children to add
2773 // ensure new subtree root has parent/child index set
2854 // whoever invokes rule will set parent and child index
2987 const Index: Integer);
2989 (T as ITree).ChildIndex := Index;
3161 function TCommonTreeNodeStream.Index: Integer;
3207 FLastMarker := Index;
3217 procedure TCommonTreeNodeStream.Push(const Index: Integer);
3221 FCalls.Push(FP); // save current index
3222 Seek(Index);
3255 procedure TCommonTreeNodeStream.Seek(const Index: Integer);
3259 FP := Index;
3315 // if it's a tree, use start/stop index from start node
4085 function TTreeWizard.Index(
4647 function TUnBufferedTreeNodeStream.Index: Integer;
4753 // index is in the child list?
4807 // drop node and index stacks back to old size
4825 procedure TUnBufferedTreeNodeStream.Seek(const Index: Integer);
4827 if (Index < Self.Index) then
4830 // seek forward, consume until we hit index
4831 while (Self.Index < Index) do
4946 // and ask for it's token index.
