Lines Matching refs:summary
50 /// <summary>
59 /// </summary>
66 /// <summary>
69 /// </summary>
75 /// <summary>Duplicate a single tree node </summary>
79 /// <summary>Duplicate tree recursively, using DupNode() for each node </summary>
82 /// <summary>
86 /// </summary>
89 /// <summary>
94 /// </summary>
108 /// <summary>
110 /// </summary>
113 /// <summary>
116 /// </summary>
133 /// <summary>
136 /// </summary>
164 /// <summary>
177 /// </summary>
180 /// <summary>
183 /// </summary>
202 /// <summary>
208 /// </summary>
211 /// <summary>Create a new node derived from a token, with a new token type.
216 /// </summary>
219 /// <summary>Same as Create(tokenType,fromToken) except set the text too.
224 /// </summary>
228 /// <summary>Create a new node derived from a token, with a new token type.
233 /// </summary>
238 /// <summary>For tree parsing, I need to know the token type of a node </summary>
241 /// <summary>Node constructors can set the type of a node </summary>
246 /// <summary>Node constructors can set the text of a node </summary>
249 /// <summary>
251 /// </summary>
262 /// <summary>
265 /// </summary>
275 /// <summary>
277 /// </summary>
280 /// <summary>
282 /// </summary>
287 /// <summary>Get a child 0..n-1 node </summary>
290 /// <summary>Set ith child (0..n-1) to t; t must be non-null and non-nil node</summary>
293 /// <summary>Remove ith child and shift children down from right.</summary>
296 /// <summary>How many children? If 0, then this is a leaf node </summary>
299 /// <summary>
301 /// </summary>
309 /// <summary>
311 /// </summary>
319 /// <summary>
322 /// </summary>
331 /// <summary>A stream of tree nodes, accessing nodes from a tree of some kind </summary>
342 /// <summary>Get a tree node at an absolute index i; 0..n-1.</summary>
349 /// <summary>
360 /// </summary>
363 /// <summary>Return the text of all nodes from start to stop, inclusive.
368 /// </summary>
374 /// <summary>
377 /// </summary>
391 /// <summary>
396 /// </summary>
399 /// <summary>
402 /// </summary>
411 /// <summary>
414 /// </summary>
417 /// <summary>
423 /// </summary>
427 /// <summary>
437 /// </summary>
458 /// <summary>Set (or reset) the parent and child index values for all children</summary>
463 /// <summary>
466 /// </summary>
470 /// <summary>Set ith child (0..n-1) to t; t must be non-null and non-nil node</summary>
475 /// <summary>
480 /// </summary>
497 /// <summary>This node is what child index? 0..n-1</summary>
500 /// <summary>
503 /// </summary>
506 /// <summary>Return a token type; needed for tree parsing </summary>
511 /// <summary>In case we don't have a token payload, what is the line for errors? </summary>
515 /// <summary>
518 /// </summary>
521 /// <summary>
524 /// </summary>
528 /// <summary>
534 /// </summary>
552 /// <summary>
554 /// </summary>
565 /// <summary>
567 /// </summary>
574 /// <summary>
577 /// </summary>
580 /// <summary>BaseTree doesn't track child indexes.</summary>
583 /// <summary>BaseTree doesn't track parent pointers.</summary>
586 /// <summary>Return a token type; needed for tree parsing </summary>
589 /// <summary>
592 /// </summary>
595 /// <summary>
598 /// </summary>
604 /// <summary>A tree node that is wrapper for a Token object. </summary>
631 /// <summary>
633 /// </summary>
636 /// <summary>
640 /// </summary>
644 /// <summary>
652 /// </summary>
655 /// <summary>
669 /// </summary>
673 /// <summary>
682 /// </summary>
687 /// <summary>
689 /// </summary>
720 /// <summary>
723 /// </summary>
730 /// <summary>
732 /// </summary>
735 /// <summary>
738 /// </summary>
741 /// <summary>
744 /// </summary>
757 /// <summary>
760 /// </summary>
769 /// <summary>
774 /// </summary>
790 /// <summary>
803 /// </summary>
812 /// <summary>
815 /// </summary>
824 /// <summary>
826 /// </summary>
836 /// <summary>
839 /// </summary>
850 /// <summary>
852 /// </summary>
867 /// <summary>
869 /// </summary>
878 /// <summary>
882 /// </summary>
911 /// <summary>
916 /// </summary>
932 /// <summary>
935 /// </summary>
938 /// <summary>
940 /// </summary>
943 /// <summary>
945 /// </summary>
955 /// <summary>Return a List of tree nodes with token type ttype</summary>
958 /// <summary>Return a List of subtrees matching pattern</summary>
964 /// <summary>
966 /// </summary>
976 /// <summary>
978 /// </summary>
987 /// <summary>
993 /// </summary>
1004 /// <summary>
1010 /// </summary>
1022 /// <summary>
1025 /// </summary>
1028 /// <summary>
1032 /// </summary>
1051 /// <summary>
1056 /// </summary>
1061 /// <summary>
1063 /// </summary>
1096 /// <summary>Base class for all exceptions thrown during AST rewrite construction.</summary>
1110 /// <summary>
1112 /// </summary>
1117 /// <summary>
1119 /// </summary>
1172 /// <summary>Override in a subclass to change the impl of children list </summary>
1178 /// <summary>Create a new node from an existing node does nothing for BaseTree
1181 /// </summary>
1189 /// <summary>A single token is the payload </summary>
1192 /// <summary>
1195 /// </summary>
1199 /// <summary>Who is the parent node of this node; if null, implies node is root</summary>
1210 /// <summary>What index is this node in the child list? Range: 0..n-1</summary>
1263 /// <summary>A map of tree node to unique IDs.</summary>
1266 /// <summary>Next available unique ID.</summary>
1352 /// <summary>
1360 /// </summary>
1363 /// <summary>Pull nodes from which tree? </summary>
1366 /// <summary>IF this tree (root) was created from a token stream, track it</summary>
1369 /// <summary>What tree adaptor was used to build these trees</summary>
1372 /// <summary>
1374 /// </summary>
1377 /// <summary>
1380 /// </summary>
1383 /// <summary>
1385 /// </summary>
1388 /// <summary>
1390 /// </summary>
1432 /// <summary>
1435 /// </summary>
1438 /// <summary>
1442 /// </summary>
1445 /// <summary>
1448 /// </summary>
1487 /// <summary>
1490 /// </summary>
1493 /// <summary>
1495 /// </summary>
1498 /// <summary>
1500 /// </summary>
1503 /// <summary>
1505 /// </summary>
1514 /// <summary>
1518 /// </summary>
1532 /// <summary>
1535 /// </summary>
1543 /// <summary>
1546 /// </summary>
1552 /// <summary>
1554 /// </summary>
1558 /// <summary>
1560 /// </summary>
1575 /// <summary>
1577 /// </summary>
1581 /// <summary>
1584 /// </summary>
1590 /// <summary>
1592 /// </summary>
1596 /// <summary>
1601 /// </summary>
1667 /// <summary>The tree pattern to lex like "(A B C)"</summary>
1670 /// <summary>Index into input string</summary>
1673 /// <summary>Current char</summary>
1676 /// <summary>How long is the pattern in char?</summary>
1679 /// <summary>
1681 /// </summary>
1703 /// <summary>
1705 /// </summary>
1750 /// <summary>
1752 /// </summary>
1823 /// <summary>Do the work for index</summary>
1827 /// <summary>Do the recursive work for visit</summary>
1860 /// <summary>First node or root node of tree matched for this rule.</summary>
1874 /// <summary>
1879 /// </summary>
1903 ///<summary>Record state of the nodeStack</summary>
1905 ///<summary>Record state of the indexStack</summary>
1916 ///<summary>Record state of the nodeStack</summary>
1918 ///<summary>Record state of the indexStack</summary>
1939 /// <summary>Reuse same DOWN, UP navigation nodes unless this is true</summary>
1942 /// <summary>Pull nodes from which tree? </summary>
1945 /// <summary>IF this tree (root) was created from a token stream, track it.</summary>
1948 /// <summary>What tree adaptor was used to build these trees</summary>
1951 /// <summary>
1955 /// </summary>
1958 /// <summary>
1961 /// </summary>
1964 /// <summary>Which node are we currently visiting? </summary>
1967 /// <summary>Which node did we visit last? Used for LT(-1) calls. </summary>
1970 /// <summary>
1973 /// </summary>
1976 /// <summary>
1979 /// </summary>
1982 /// <summary>
1986 /// </summary>
1989 /// <summary>lookahead[head] is the first symbol of lookahead, LT(1). </summary>
1992 /// <summary>
1995 /// </summary>
1998 /// <summary>
2003 /// </summary>
2006 ///<summary>
2008 /// </summary>
2011 ///<summary>
2013 /// </summary>
2056 /// <summary>
2070 /// </summary>
2073 /// <summary>Make sure we have at least k symbols in lookahead buffer </summary>
2077 /// <summary>
2082 /// </summary>
2091 /// <summary>
2093 /// </summary>
2096 /// <summary>
2100 /// </summary>
