Lines Matching refs:MUST
11 1. Redistributions of source code MUST RETAIN the above copyright
13 2. Redistributions in binary form MUST REPRODUCE the above copyright
96 /// <para>You must specify the input stream so that the erroneous text can
154 /// simple node or nil root with a single child node--it must be a root
290 /// <summary>Set ith child (0..n-1) to t; t must be non-null and non-nil node</summary>
324 /// If parent is null, don't do anything; must be at root of overall tree.
383 /// If parent is null, don't do anything; must be at root of overall tree.
470 /// <summary>Set ith child (0..n-1) to t; t must be non-null and non-nil node</summary>
529 /// A generic tree implementation with no payload. You must subclass to
857 /// must dup the type node, but ID has been added.
912 /// Build and navigate trees with this object. Must know about the names
995 /// If a node specifies a text arg in pattern, then that must match
1069 /// For tree rewriting during tree parsing, this must also be able
1507 /// Once a node or subtree has been used in a stream, it must be dup'd
1509 /// can be reused in future subrules. So, reset must set a dirty bit.
1544 /// Ensure stream emits trees; tokens must be converted to AST nodes.
1599 /// around it. For trees, you must call the adaptor.dupTree()
1600 /// unless the element is for a tree root; then it must be a node dup
1704 /// When using %label:TOKENNAME in a tree for parse(), we must track the label.
1952 /// As we walk down the nodes, we must track parent nodes so we know
2061 /// use a single return value for that. We must add these tokens to
2079 /// If you tail+1 == head, then we must create a bigger buffer
2149 if Assigned(FChildren) then // must copy, this has children already
3635 // must have more than one in list, pull from elements
3805 // must count nesting level to get right UP
