3 * Preprocessor using PHP arrays
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License along
16 * with this program; if not, write to the Free Software Foundation, Inc.,
17 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
18 * http://www.gnu.org/copyleft/gpl.html
25 * Differences from DOM schema:
26 * * attribute nodes are children
27 * * "<h>" nodes that aren't at the top are replaced with <possible-h>
29 * Nodes are stored in a recursive array data structure. A node store is an
30 * array where each element may be either a scalar (representing a text node)
31 * or a "descriptor", which is a two-element array where the first element is
32 * the node name and the second element is the node store for the children.
34 * Attributes are represented as children that have a node name starting with
35 * "@", and a single text node child.
37 * @todo: Consider replacing descriptor arrays with objects of a new class.
38 * Benchmark and measure resulting memory impact.
42 // phpcs:ignore Squiz.Classes.ValidClassName.NotCamelCaps
43 class Preprocessor_Hash
extends Preprocessor
{
50 const CACHE_PREFIX
= 'preprocess-hash';
51 const CACHE_VERSION
= 2;
53 public function __construct( $parser ) {
54 $this->parser
= $parser;
58 * @return PPFrame_Hash
60 public function newFrame() {
61 return new PPFrame_Hash( $this );
66 * @return PPCustomFrame_Hash
68 public function newCustomFrame( $args ) {
69 return new PPCustomFrame_Hash( $this, $args );
73 * @param array $values
74 * @return PPNode_Hash_Array
76 public function newPartNodeArray( $values ) {
79 foreach ( $values as $k => $val ) {
81 $store = [ [ 'part', [
82 [ 'name', [ [ '@index', [ $k ] ] ] ],
83 [ 'value', [ strval( $val ) ] ],
86 $store = [ [ 'part', [
87 [ 'name', [ strval( $k ) ] ],
89 [ 'value', [ strval( $val ) ] ],
93 $list[] = new PPNode_Hash_Tree( $store, 0 );
96 $node = new PPNode_Hash_Array( $list );
101 * Preprocess some wikitext and return the document tree.
103 * @param string $text The text to parse
104 * @param int $flags Bitwise combination of:
105 * Parser::PTD_FOR_INCLUSION Handle "<noinclude>" and "<includeonly>" as if the text is being
106 * included. Default is to assume a direct page view.
108 * The generated DOM tree must depend only on the input text and the flags.
109 * The DOM tree must be the same in OT_HTML and OT_WIKI mode, to avoid a regression of T6899.
111 * Any flag added to the $flags parameter here, or any other parameter liable to cause a
112 * change in the DOM tree for a given text, must be passed through the section identifier
113 * in the section edit link and thus back to extractSections().
115 * @throws MWException
116 * @return PPNode_Hash_Tree
118 public function preprocessToObj( $text, $flags = 0 ) {
119 global $wgDisableLangConversion;
121 $tree = $this->cacheGetTree( $text, $flags );
122 if ( $tree !== false ) {
123 $store = json_decode( $tree );
124 if ( is_array( $store ) ) {
125 return new PPNode_Hash_Tree( $store, 0 );
129 $forInclusion = $flags & Parser
::PTD_FOR_INCLUSION
;
131 $xmlishElements = $this->parser
->getStripList();
132 $xmlishAllowMissingEndTag = [ 'includeonly', 'noinclude', 'onlyinclude' ];
133 $enableOnlyinclude = false;
134 if ( $forInclusion ) {
135 $ignoredTags = [ 'includeonly', '/includeonly' ];
136 $ignoredElements = [ 'noinclude' ];
137 $xmlishElements[] = 'noinclude';
138 if ( strpos( $text, '<onlyinclude>' ) !== false
139 && strpos( $text, '</onlyinclude>' ) !== false
141 $enableOnlyinclude = true;
144 $ignoredTags = [ 'noinclude', '/noinclude', 'onlyinclude', '/onlyinclude' ];
145 $ignoredElements = [ 'includeonly' ];
146 $xmlishElements[] = 'includeonly';
148 $xmlishRegex = implode( '|', array_merge( $xmlishElements, $ignoredTags ) );
150 // Use "A" modifier (anchored) instead of "^", because ^ doesn't work with an offset
151 $elementsRegex = "~($xmlishRegex)(?:\s|\/>|>)|(!--)~iA";
153 $stack = new PPDStack_Hash
;
155 $searchBase = "[{<\n";
156 if ( !$wgDisableLangConversion ) {
160 // For fast reverse searches
161 $revText = strrev( $text );
162 $lengthText = strlen( $text );
164 // Input pointer, starts out pointing to a pseudo-newline before the start
166 // Current accumulator. See the doc comment for Preprocessor_Hash for the format.
167 $accum =& $stack->getAccum();
168 // True to find equals signs in arguments
170 // True to take notice of pipe characters
173 // True if $i is inside a possible heading
175 // True if there are no more greater-than (>) signs right of $i
177 // Map of tag name => true if there are no more closing tags of given type right of $i
178 $noMoreClosingTag = [];
179 // True to ignore all input up to the next <onlyinclude>
180 $findOnlyinclude = $enableOnlyinclude;
181 // Do a line-start run without outputting an LF character
182 $fakeLineStart = true;
185 // $this->memCheck();
187 if ( $findOnlyinclude ) {
188 // Ignore all input up to the next <onlyinclude>
189 $startPos = strpos( $text, '<onlyinclude>', $i );
190 if ( $startPos === false ) {
191 // Ignored section runs to the end
192 $accum[] = [ 'ignore', [ substr( $text, $i ) ] ];
195 $tagEndPos = $startPos +
strlen( '<onlyinclude>' ); // past-the-end
196 $accum[] = [ 'ignore', [ substr( $text, $i, $tagEndPos - $i ) ] ];
198 $findOnlyinclude = false;
201 if ( $fakeLineStart ) {
202 $found = 'line-start';
205 # Find next opening brace, closing brace or pipe
206 $search = $searchBase;
207 if ( $stack->top
=== false ) {
208 $currentClosing = '';
210 $currentClosing = $stack->top
->close
;
211 $search .= $currentClosing;
217 // First equals will be for the template
221 # Output literal section, advance input counter
222 $literalLength = strcspn( $text, $search, $i );
223 if ( $literalLength > 0 ) {
224 self
::addLiteral( $accum, substr( $text, $i, $literalLength ) );
225 $i +
= $literalLength;
227 if ( $i >= $lengthText ) {
228 if ( $currentClosing == "\n" ) {
229 // Do a past-the-end run to finish off the heading
237 $curChar = $curTwoChar = $text[$i];
238 if ( ( $i +
1 ) < $lengthText ) {
239 $curTwoChar .= $text[$i +
1];
241 if ( $curChar == '|' ) {
243 } elseif ( $curChar == '=' ) {
245 } elseif ( $curChar == '<' ) {
247 } elseif ( $curChar == "\n" ) {
251 $found = 'line-start';
253 } elseif ( $curTwoChar == $currentClosing ) {
255 $curChar = $curTwoChar;
256 } elseif ( $curChar == $currentClosing ) {
258 } elseif ( isset( $this->rules
[$curTwoChar] ) ) {
259 $curChar = $curTwoChar;
261 $rule = $this->rules
[$curChar];
262 } elseif ( isset( $this->rules
[$curChar] ) ) {
264 $rule = $this->rules
[$curChar];
266 # Some versions of PHP have a strcspn which stops on
267 # null characters; ignore these and continue.
268 # We also may get '-' and '}' characters here which
269 # don't match -{ or $currentClosing. Add these to
270 # output and continue.
271 if ( $curChar == '-' ||
$curChar == '}' ) {
272 self
::addLiteral( $accum, $curChar );
280 if ( $found == 'angle' ) {
282 // Handle </onlyinclude>
283 if ( $enableOnlyinclude
284 && substr( $text, $i, strlen( '</onlyinclude>' ) ) == '</onlyinclude>'
286 $findOnlyinclude = true;
290 // Determine element name
291 if ( !preg_match( $elementsRegex, $text, $matches, 0, $i +
1 ) ) {
292 // Element name missing or not listed
293 self
::addLiteral( $accum, '<' );
298 if ( isset( $matches[2] ) && $matches[2] == '!--' ) {
299 // To avoid leaving blank lines, when a sequence of
300 // space-separated comments is both preceded and followed by
301 // a newline (ignoring spaces), then
302 // trim leading and trailing spaces and the trailing newline.
305 $endPos = strpos( $text, '-->', $i +
4 );
306 if ( $endPos === false ) {
307 // Unclosed comment in input, runs to end
308 $inner = substr( $text, $i );
309 $accum[] = [ 'comment', [ $inner ] ];
312 // Search backwards for leading whitespace
313 $wsStart = $i ?
( $i - strspn( $revText, " \t", $lengthText - $i ) ) : 0;
315 // Search forwards for trailing whitespace
316 // $wsEnd will be the position of the last space (or the '>' if there's none)
317 $wsEnd = $endPos +
2 +
strspn( $text, " \t", $endPos +
3 );
319 // Keep looking forward as long as we're finding more
321 $comments = [ [ $wsStart, $wsEnd ] ];
322 while ( substr( $text, $wsEnd +
1, 4 ) == '<!--' ) {
323 $c = strpos( $text, '-->', $wsEnd +
4 );
324 if ( $c === false ) {
327 $c = $c +
2 +
strspn( $text, " \t", $c +
3 );
328 $comments[] = [ $wsEnd +
1, $c ];
332 // Eat the line if possible
333 // TODO: This could theoretically be done if $wsStart == 0, i.e. for comments at
334 // the overall start. That's not how Sanitizer::removeHTMLcomments() did it, but
335 // it's a possible beneficial b/c break.
336 if ( $wsStart > 0 && substr( $text, $wsStart - 1, 1 ) == "\n"
337 && substr( $text, $wsEnd +
1, 1 ) == "\n"
339 // Remove leading whitespace from the end of the accumulator
340 $wsLength = $i - $wsStart;
341 $endIndex = count( $accum ) - 1;
346 && is_string( $accum[$endIndex] )
347 && strspn( $accum[$endIndex], " \t", -$wsLength ) === $wsLength
349 $accum[$endIndex] = substr( $accum[$endIndex], 0, -$wsLength );
352 // Dump all but the last comment to the accumulator
353 foreach ( $comments as $j => $com ) {
355 $endPos = $com[1] +
1;
356 if ( $j == ( count( $comments ) - 1 ) ) {
359 $inner = substr( $text, $startPos, $endPos - $startPos );
360 $accum[] = [ 'comment', [ $inner ] ];
363 // Do a line-start run next time to look for headings after the comment
364 $fakeLineStart = true;
366 // No line to eat, just take the comment itself
372 $part = $stack->top
->getCurrentPart();
373 if ( !( isset( $part->commentEnd
) && $part->commentEnd
== $wsStart - 1 ) ) {
374 $part->visualEnd
= $wsStart;
376 // Else comments abutting, no change in visual end
377 $part->commentEnd
= $endPos;
380 $inner = substr( $text, $startPos, $endPos - $startPos +
1 );
381 $accum[] = [ 'comment', [ $inner ] ];
386 $lowerName = strtolower( $name );
387 $attrStart = $i +
strlen( $name ) +
1;
390 $tagEndPos = $noMoreGT ?
false : strpos( $text, '>', $attrStart );
391 if ( $tagEndPos === false ) {
392 // Infinite backtrack
393 // Disable tag search to prevent worst-case O(N^2) performance
395 self
::addLiteral( $accum, '<' );
400 // Handle ignored tags
401 if ( in_array( $lowerName, $ignoredTags ) ) {
402 $accum[] = [ 'ignore', [ substr( $text, $i, $tagEndPos - $i +
1 ) ] ];
408 if ( $text[$tagEndPos - 1] == '/' ) {
410 $attrEnd = $tagEndPos - 1;
415 $attrEnd = $tagEndPos;
418 !isset( $noMoreClosingTag[$name] ) &&
419 preg_match( "/<\/" . preg_quote( $name, '/' ) . "\s*>/i",
420 $text, $matches, PREG_OFFSET_CAPTURE
, $tagEndPos +
1 )
422 $inner = substr( $text, $tagEndPos +
1, $matches[0][1] - $tagEndPos - 1 );
423 $i = $matches[0][1] +
strlen( $matches[0][0] );
424 $close = $matches[0][0];
427 if ( in_array( $name, $xmlishAllowMissingEndTag ) ) {
428 // Let it run out to the end of the text.
429 $inner = substr( $text, $tagEndPos +
1 );
433 // Don't match the tag, treat opening tag as literal and resume parsing.
435 self
::addLiteral( $accum,
436 substr( $text, $tagStartPos, $tagEndPos +
1 - $tagStartPos ) );
437 // Cache results, otherwise we have O(N^2) performance for input like <foo><foo><foo>...
438 $noMoreClosingTag[$name] = true;
443 // <includeonly> and <noinclude> just become <ignore> tags
444 if ( in_array( $lowerName, $ignoredElements ) ) {
445 $accum[] = [ 'ignore', [ substr( $text, $tagStartPos, $i - $tagStartPos ) ] ];
449 if ( $attrEnd <= $attrStart ) {
452 // Note that the attr element contains the whitespace between name and attribute,
453 // this is necessary for precise reconstruction during pre-save transform.
454 $attr = substr( $text, $attrStart, $attrEnd - $attrStart );
458 [ 'name', [ $name ] ],
459 [ 'attr', [ $attr ] ] ];
460 if ( $inner !== null ) {
461 $children[] = [ 'inner', [ $inner ] ];
463 if ( $close !== null ) {
464 $children[] = [ 'close', [ $close ] ];
466 $accum[] = [ 'ext', $children ];
467 } elseif ( $found == 'line-start' ) {
468 // Is this the start of a heading?
469 // Line break belongs before the heading element in any case
470 if ( $fakeLineStart ) {
471 $fakeLineStart = false;
473 self
::addLiteral( $accum, $curChar );
477 $count = strspn( $text, '=', $i, 6 );
478 if ( $count == 1 && $findEquals ) {
479 // DWIM: This looks kind of like a name/value separator.
480 // Let's let the equals handler have it and break the potential
481 // heading. This is heuristic, but AFAICT the methods for
482 // completely correct disambiguation are very complex.
483 } elseif ( $count > 0 ) {
487 'parts' => [ new PPDPart_Hash( str_repeat( '=', $count ) ) ],
490 $stack->push( $piece );
491 $accum =& $stack->getAccum();
492 $stackFlags = $stack->getFlags();
493 if ( isset( $stackFlags['findEquals'] ) ) {
494 $findEquals = $stackFlags['findEquals'];
496 if ( isset( $stackFlags['findPipe'] ) ) {
497 $findPipe = $stackFlags['findPipe'];
499 if ( isset( $stackFlags['inHeading'] ) ) {
500 $inHeading = $stackFlags['inHeading'];
504 } elseif ( $found == 'line-end' ) {
505 $piece = $stack->top
;
506 // A heading must be open, otherwise \n wouldn't have been in the search list
507 // FIXME: Don't use assert()
508 // phpcs:ignore MediaWiki.Usage.ForbiddenFunctions.assert
509 assert( $piece->open
=== "\n" );
510 $part = $piece->getCurrentPart();
511 // Search back through the input to see if it has a proper close.
512 // Do this using the reversed string since the other solutions
513 // (end anchor, etc.) are inefficient.
514 $wsLength = strspn( $revText, " \t", $lengthText - $i );
515 $searchStart = $i - $wsLength;
516 if ( isset( $part->commentEnd
) && $searchStart - 1 == $part->commentEnd
) {
517 // Comment found at line end
518 // Search for equals signs before the comment
519 $searchStart = $part->visualEnd
;
520 $searchStart -= strspn( $revText, " \t", $lengthText - $searchStart );
522 $count = $piece->count
;
523 $equalsLength = strspn( $revText, '=', $lengthText - $searchStart );
524 if ( $equalsLength > 0 ) {
525 if ( $searchStart - $equalsLength == $piece->startPos
) {
526 // This is just a single string of equals signs on its own line
527 // Replicate the doHeadings behavior /={count}(.+)={count}/
528 // First find out how many equals signs there really are (don't stop at 6)
529 $count = $equalsLength;
533 $count = min( 6, intval( ( $count - 1 ) / 2 ) );
536 $count = min( $equalsLength, $count );
539 // Normal match, output <h>
540 $element = [ [ 'possible-h',
543 [ '@level', [ $count ] ],
544 [ '@i', [ $headingIndex++
] ]
550 // Single equals sign on its own line, count=0
554 // No match, no <h>, just pass down the inner text
559 $accum =& $stack->getAccum();
560 $stackFlags = $stack->getFlags();
561 if ( isset( $stackFlags['findEquals'] ) ) {
562 $findEquals = $stackFlags['findEquals'];
564 if ( isset( $stackFlags['findPipe'] ) ) {
565 $findPipe = $stackFlags['findPipe'];
567 if ( isset( $stackFlags['inHeading'] ) ) {
568 $inHeading = $stackFlags['inHeading'];
571 // Append the result to the enclosing accumulator
572 array_splice( $accum, count( $accum ), 0, $element );
574 // Note that we do NOT increment the input pointer.
575 // This is because the closing linebreak could be the opening linebreak of
576 // another heading. Infinite loops are avoided because the next iteration MUST
577 // hit the heading open case above, which unconditionally increments the
579 } elseif ( $found == 'open' ) {
580 # count opening brace characters
581 $curLen = strlen( $curChar );
582 $count = ( $curLen > 1 ) ?
583 # allow the final character to repeat
584 strspn( $text, $curChar[$curLen - 1], $i +
1 ) +
1 :
585 strspn( $text, $curChar, $i );
588 $lineStart = ( $i > 0 && $text[$i - 1] == "\n" );
590 if ( $curChar === "-{" && $count > $curLen ) {
591 // -{ => {{ transition because rightmost wins
596 $rule = $this->rules
[$curChar];
599 # we need to add to stack only if opening brace count is enough for one of the rules
600 if ( $count >= $rule['min'] ) {
601 # Add it to the stack
604 'close' => $rule['end'],
605 'savedPrefix' => $savedPrefix,
607 'lineStart' => $lineStart,
610 $stack->push( $piece );
611 $accum =& $stack->getAccum();
612 $stackFlags = $stack->getFlags();
613 if ( isset( $stackFlags['findEquals'] ) ) {
614 $findEquals = $stackFlags['findEquals'];
616 if ( isset( $stackFlags['findPipe'] ) ) {
617 $findPipe = $stackFlags['findPipe'];
619 if ( isset( $stackFlags['inHeading'] ) ) {
620 $inHeading = $stackFlags['inHeading'];
623 # Add literal brace(s)
624 self
::addLiteral( $accum, $savedPrefix . str_repeat( $curChar, $count ) );
627 } elseif ( $found == 'close' ) {
628 $piece = $stack->top
;
629 # lets check if there are enough characters for closing brace
630 $maxCount = $piece->count
;
631 if ( $piece->close
=== '}-' && $curChar === '}' ) {
632 $maxCount--; # don't try to match closing '-' as a '}'
634 $curLen = strlen( $curChar );
635 $count = ( $curLen > 1 ) ?
$curLen :
636 strspn( $text, $curChar, $i, $maxCount );
638 # check for maximum matching characters (if there are 5 closing
639 # characters, we will probably need only 3 - depending on the rules)
640 $rule = $this->rules
[$piece->open
];
641 if ( $count > $rule['max'] ) {
642 # The specified maximum exists in the callback array, unless the caller
644 $matchingCount = $rule['max'];
646 # Count is less than the maximum
647 # Skip any gaps in the callback array to find the true largest match
648 # Need to use array_key_exists not isset because the callback can be null
649 $matchingCount = $count;
650 while ( $matchingCount > 0 && !array_key_exists( $matchingCount, $rule['names'] ) ) {
655 if ( $matchingCount <= 0 ) {
656 # No matching element found in callback array
657 # Output a literal closing brace and continue
658 $endText = substr( $text, $i, $count );
659 self
::addLiteral( $accum, $endText );
663 $name = $rule['names'][$matchingCount];
664 if ( $name === null ) {
665 // No element, just literal text
666 $endText = substr( $text, $i, $matchingCount );
667 $element = $piece->breakSyntax( $matchingCount );
668 self
::addLiteral( $element, $endText );
671 $parts = $piece->parts
;
672 $titleAccum = $parts[0]->out
;
677 # The invocation is at the start of the line if lineStart is set in
678 # the stack, and all opening brackets are used up.
679 if ( $maxCount == $matchingCount &&
680 !empty( $piece->lineStart
) &&
681 strlen( $piece->savedPrefix
) == 0 ) {
682 $children[] = [ '@lineStart', [ 1 ] ];
684 $titleNode = [ 'title', $titleAccum ];
685 $children[] = $titleNode;
687 foreach ( $parts as $part ) {
688 if ( isset( $part->eqpos
) ) {
689 $equalsNode = $part->out
[$part->eqpos
];
690 $nameNode = [ 'name', array_slice( $part->out
, 0, $part->eqpos
) ];
691 $valueNode = [ 'value', array_slice( $part->out
, $part->eqpos +
1 ) ];
692 $partNode = [ 'part', [ $nameNode, $equalsNode, $valueNode ] ];
693 $children[] = $partNode;
695 $nameNode = [ 'name', [ [ '@index', [ $argIndex++
] ] ] ];
696 $valueNode = [ 'value', $part->out
];
697 $partNode = [ 'part', [ $nameNode, $valueNode ] ];
698 $children[] = $partNode;
701 $element = [ [ $name, $children ] ];
704 # Advance input pointer
705 $i +
= $matchingCount;
709 $accum =& $stack->getAccum();
711 # Re-add the old stack element if it still has unmatched opening characters remaining
712 if ( $matchingCount < $piece->count
) {
713 $piece->parts
= [ new PPDPart_Hash
];
714 $piece->count
-= $matchingCount;
715 # do we still qualify for any callback with remaining count?
716 $min = $this->rules
[$piece->open
]['min'];
717 if ( $piece->count
>= $min ) {
718 $stack->push( $piece );
719 $accum =& $stack->getAccum();
720 } elseif ( $piece->count
== 1 && $piece->open
=== '{' && $piece->savedPrefix
=== '-' ) {
721 $piece->savedPrefix
= '';
724 $piece->close
= $this->rules
[$piece->open
]['end'];
725 $stack->push( $piece );
726 $accum =& $stack->getAccum();
728 $s = substr( $piece->open
, 0, -1 );
730 substr( $piece->open
, -1 ),
731 $piece->count
- strlen( $s )
733 self
::addLiteral( $accum, $piece->savedPrefix
. $s );
735 } elseif ( $piece->savedPrefix
!== '' ) {
736 self
::addLiteral( $accum, $piece->savedPrefix
);
739 $stackFlags = $stack->getFlags();
740 if ( isset( $stackFlags['findEquals'] ) ) {
741 $findEquals = $stackFlags['findEquals'];
743 if ( isset( $stackFlags['findPipe'] ) ) {
744 $findPipe = $stackFlags['findPipe'];
746 if ( isset( $stackFlags['inHeading'] ) ) {
747 $inHeading = $stackFlags['inHeading'];
750 # Add XML element to the enclosing accumulator
751 array_splice( $accum, count( $accum ), 0, $element );
752 } elseif ( $found == 'pipe' ) {
753 $findEquals = true; // shortcut for getFlags()
755 $accum =& $stack->getAccum();
757 } elseif ( $found == 'equals' ) {
758 $findEquals = false; // shortcut for getFlags()
759 $accum[] = [ 'equals', [ '=' ] ];
760 $stack->getCurrentPart()->eqpos
= count( $accum ) - 1;
765 # Output any remaining unclosed brackets
766 foreach ( $stack->stack
as $piece ) {
767 array_splice( $stack->rootAccum
, count( $stack->rootAccum
), 0, $piece->breakSyntax() );
770 # Enable top-level headings
771 foreach ( $stack->rootAccum
as &$node ) {
772 if ( is_array( $node ) && $node[PPNode_Hash_Tree
::NAME
] === 'possible-h' ) {
773 $node[PPNode_Hash_Tree
::NAME
] = 'h';
777 $rootStore = [ [ 'root', $stack->rootAccum
] ];
778 $rootNode = new PPNode_Hash_Tree( $rootStore, 0 );
781 $tree = json_encode( $rootStore, JSON_UNESCAPED_SLASHES | JSON_UNESCAPED_UNICODE
);
782 if ( $tree !== false ) {
783 $this->cacheSetTree( $text, $flags, $tree );
789 private static function addLiteral( array &$accum, $text ) {
790 $n = count( $accum );
791 if ( $n && is_string( $accum[$n - 1] ) ) {
792 $accum[$n - 1] .= $text;