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>
30 class Preprocessor_Hash
implements Preprocessor
{
36 const CACHE_VERSION
= 1;
38 function __construct( $parser ) {
39 $this->parser
= $parser;
43 * @return PPFrame_Hash
46 return new PPFrame_Hash( $this );
51 * @return PPCustomFrame_Hash
53 function newCustomFrame( $args ) {
54 return new PPCustomFrame_Hash( $this, $args );
58 * @param array $values
59 * @return PPNode_Hash_Array
61 function newPartNodeArray( $values ) {
64 foreach ( $values as $k => $val ) {
65 $partNode = new PPNode_Hash_Tree( 'part' );
66 $nameNode = new PPNode_Hash_Tree( 'name' );
69 $nameNode->addChild( new PPNode_Hash_Attr( 'index', $k ) );
70 $partNode->addChild( $nameNode );
72 $nameNode->addChild( new PPNode_Hash_Text( $k ) );
73 $partNode->addChild( $nameNode );
74 $partNode->addChild( new PPNode_Hash_Text( '=' ) );
77 $valueNode = new PPNode_Hash_Tree( 'value' );
78 $valueNode->addChild( new PPNode_Hash_Text( $val ) );
79 $partNode->addChild( $valueNode );
84 $node = new PPNode_Hash_Array( $list );
89 * Preprocess some wikitext and return the document tree.
90 * This is the ghost of Parser::replace_variables().
92 * @param string $text The text to parse
93 * @param int $flags Bitwise combination of:
94 * Parser::PTD_FOR_INCLUSION Handle "<noinclude>" and "<includeonly>" as if the text is being
95 * included. Default is to assume a direct page view.
97 * The generated DOM tree must depend only on the input text and the flags.
98 * The DOM tree must be the same in OT_HTML and OT_WIKI mode, to avoid a regression of bug 4899.
100 * Any flag added to the $flags parameter here, or any other parameter liable to cause a
101 * change in the DOM tree for a given text, must be passed through the section identifier
102 * in the section edit link and thus back to extractSections().
104 * The output of this function is currently only cached in process memory, but a persistent
105 * cache may be implemented at a later date which takes further advantage of these strict
106 * dependency requirements.
108 * @throws MWException
109 * @return PPNode_Hash_Tree
111 function preprocessToObj( $text, $flags = 0 ) {
112 wfProfileIn( __METHOD__
);
115 global $wgMemc, $wgPreprocessorCacheThreshold;
117 $cacheable = $wgPreprocessorCacheThreshold !== false
118 && strlen( $text ) > $wgPreprocessorCacheThreshold;
121 wfProfileIn( __METHOD__
. '-cacheable' );
123 $cacheKey = wfMemcKey( 'preprocess-hash', md5( $text ), $flags );
124 $cacheValue = $wgMemc->get( $cacheKey );
126 $version = substr( $cacheValue, 0, 8 );
127 if ( intval( $version ) == self
::CACHE_VERSION
) {
128 $hash = unserialize( substr( $cacheValue, 8 ) );
130 wfDebugLog( "Preprocessor",
131 "Loaded preprocessor hash from memcached (key $cacheKey)" );
132 wfProfileOut( __METHOD__
. '-cacheable' );
133 wfProfileOut( __METHOD__
);
137 wfProfileIn( __METHOD__
. '-cache-miss' );
152 'names' => array( 2 => null ),
158 $forInclusion = $flags & Parser
::PTD_FOR_INCLUSION
;
160 $xmlishElements = $this->parser
->getStripList();
161 $enableOnlyinclude = false;
162 if ( $forInclusion ) {
163 $ignoredTags = array( 'includeonly', '/includeonly' );
164 $ignoredElements = array( 'noinclude' );
165 $xmlishElements[] = 'noinclude';
166 if ( strpos( $text, '<onlyinclude>' ) !== false
167 && strpos( $text, '</onlyinclude>' ) !== false
169 $enableOnlyinclude = true;
172 $ignoredTags = array( 'noinclude', '/noinclude', 'onlyinclude', '/onlyinclude' );
173 $ignoredElements = array( 'includeonly' );
174 $xmlishElements[] = 'includeonly';
176 $xmlishRegex = implode( '|', array_merge( $xmlishElements, $ignoredTags ) );
178 // Use "A" modifier (anchored) instead of "^", because ^ doesn't work with an offset
179 $elementsRegex = "~($xmlishRegex)(?:\s|\/>|>)|(!--)~iA";
181 $stack = new PPDStack_Hash
;
183 $searchBase = "[{<\n";
184 // For fast reverse searches
185 $revText = strrev( $text );
186 $lengthText = strlen( $text );
188 // Input pointer, starts out pointing to a pseudo-newline before the start
190 // Current accumulator
191 $accum =& $stack->getAccum();
192 // True to find equals signs in arguments
194 // True to take notice of pipe characters
197 // True if $i is inside a possible heading
199 // True if there are no more greater-than (>) signs right of $i
201 // True to ignore all input up to the next <onlyinclude>
202 $findOnlyinclude = $enableOnlyinclude;
203 // Do a line-start run without outputting an LF character
204 $fakeLineStart = true;
209 if ( $findOnlyinclude ) {
210 // Ignore all input up to the next <onlyinclude>
211 $startPos = strpos( $text, '<onlyinclude>', $i );
212 if ( $startPos === false ) {
213 // Ignored section runs to the end
214 $accum->addNodeWithText( 'ignore', substr( $text, $i ) );
217 $tagEndPos = $startPos +
strlen( '<onlyinclude>' ); // past-the-end
218 $accum->addNodeWithText( 'ignore', substr( $text, $i, $tagEndPos - $i ) );
220 $findOnlyinclude = false;
223 if ( $fakeLineStart ) {
224 $found = 'line-start';
227 # Find next opening brace, closing brace or pipe
228 $search = $searchBase;
229 if ( $stack->top
=== false ) {
230 $currentClosing = '';
232 $currentClosing = $stack->top
->close
;
233 $search .= $currentClosing;
239 // First equals will be for the template
243 # Output literal section, advance input counter
244 $literalLength = strcspn( $text, $search, $i );
245 if ( $literalLength > 0 ) {
246 $accum->addLiteral( substr( $text, $i, $literalLength ) );
247 $i +
= $literalLength;
249 if ( $i >= $lengthText ) {
250 if ( $currentClosing == "\n" ) {
251 // Do a past-the-end run to finish off the heading
259 $curChar = $text[$i];
260 if ( $curChar == '|' ) {
262 } elseif ( $curChar == '=' ) {
264 } elseif ( $curChar == '<' ) {
266 } elseif ( $curChar == "\n" ) {
270 $found = 'line-start';
272 } elseif ( $curChar == $currentClosing ) {
274 } elseif ( isset( $rules[$curChar] ) ) {
276 $rule = $rules[$curChar];
278 # Some versions of PHP have a strcspn which stops on null characters
279 # Ignore and continue
286 if ( $found == 'angle' ) {
288 // Handle </onlyinclude>
289 if ( $enableOnlyinclude
290 && substr( $text, $i, strlen( '</onlyinclude>' ) ) == '</onlyinclude>'
292 $findOnlyinclude = true;
296 // Determine element name
297 if ( !preg_match( $elementsRegex, $text, $matches, 0, $i +
1 ) ) {
298 // Element name missing or not listed
299 $accum->addLiteral( '<' );
304 if ( isset( $matches[2] ) && $matches[2] == '!--' ) {
306 // To avoid leaving blank lines, when a sequence of
307 // space-separated comments is both preceded and followed by
308 // a newline (ignoring spaces), then
309 // trim leading and trailing spaces and the trailing newline.
312 $endPos = strpos( $text, '-->', $i +
4 );
313 if ( $endPos === false ) {
314 // Unclosed comment in input, runs to end
315 $inner = substr( $text, $i );
316 $accum->addNodeWithText( 'comment', $inner );
319 // Search backwards for leading whitespace
320 $wsStart = $i ?
( $i - strspn( $revText, " \t", $lengthText - $i ) ) : 0;
322 // Search forwards for trailing whitespace
323 // $wsEnd will be the position of the last space (or the '>' if there's none)
324 $wsEnd = $endPos +
2 +
strspn( $text, " \t", $endPos +
3 );
326 // Keep looking forward as long as we're finding more
328 $comments = array( array( $wsStart, $wsEnd ) );
329 while ( substr( $text, $wsEnd +
1, 4 ) == '<!--' ) {
330 $c = strpos( $text, '-->', $wsEnd +
4 );
331 if ( $c === false ) {
334 $c = $c +
2 +
strspn( $text, " \t", $c +
3 );
335 $comments[] = array( $wsEnd +
1, $c );
339 // Eat the line if possible
340 // TODO: This could theoretically be done if $wsStart == 0, i.e. for comments at
341 // the overall start. That's not how Sanitizer::removeHTMLcomments() did it, but
342 // it's a possible beneficial b/c break.
343 if ( $wsStart > 0 && substr( $text, $wsStart - 1, 1 ) == "\n"
344 && substr( $text, $wsEnd +
1, 1 ) == "\n"
346 // Remove leading whitespace from the end of the accumulator
347 // Sanity check first though
348 $wsLength = $i - $wsStart;
350 && $accum->lastNode
instanceof PPNode_Hash_Text
351 && strspn( $accum->lastNode
->value
, " \t", -$wsLength ) === $wsLength
353 $accum->lastNode
->value
= substr( $accum->lastNode
->value
, 0, -$wsLength );
356 // Dump all but the last comment to the accumulator
357 foreach ( $comments as $j => $com ) {
359 $endPos = $com[1] +
1;
360 if ( $j == ( count( $comments ) - 1 ) ) {
363 $inner = substr( $text, $startPos, $endPos - $startPos );
364 $accum->addNodeWithText( 'comment', $inner );
367 // Do a line-start run next time to look for headings after the comment
368 $fakeLineStart = true;
370 // No line to eat, just take the comment itself
376 $part = $stack->top
->getCurrentPart();
377 if ( !( isset( $part->commentEnd
) && $part->commentEnd
== $wsStart - 1 ) ) {
378 $part->visualEnd
= $wsStart;
380 // Else comments abutting, no change in visual end
381 $part->commentEnd
= $endPos;
384 $inner = substr( $text, $startPos, $endPos - $startPos +
1 );
385 $accum->addNodeWithText( 'comment', $inner );
390 $lowerName = strtolower( $name );
391 $attrStart = $i +
strlen( $name ) +
1;
394 $tagEndPos = $noMoreGT ?
false : strpos( $text, '>', $attrStart );
395 if ( $tagEndPos === false ) {
396 // Infinite backtrack
397 // Disable tag search to prevent worst-case O(N^2) performance
399 $accum->addLiteral( '<' );
404 // Handle ignored tags
405 if ( in_array( $lowerName, $ignoredTags ) ) {
406 $accum->addNodeWithText( 'ignore', substr( $text, $i, $tagEndPos - $i +
1 ) );
412 if ( $text[$tagEndPos - 1] == '/' ) {
414 $attrEnd = $tagEndPos - 1;
419 $attrEnd = $tagEndPos;
421 if ( preg_match( "/<\/" . preg_quote( $name, '/' ) . "\s*>/i",
422 $text, $matches, PREG_OFFSET_CAPTURE
, $tagEndPos +
1 )
424 $inner = substr( $text, $tagEndPos +
1, $matches[0][1] - $tagEndPos - 1 );
425 $i = $matches[0][1] +
strlen( $matches[0][0] );
426 $close = $matches[0][0];
428 // No end tag -- let it run out to the end of the text.
429 $inner = substr( $text, $tagEndPos +
1 );
434 // <includeonly> and <noinclude> just become <ignore> tags
435 if ( in_array( $lowerName, $ignoredElements ) ) {
436 $accum->addNodeWithText( 'ignore', substr( $text, $tagStartPos, $i - $tagStartPos ) );
440 if ( $attrEnd <= $attrStart ) {
443 // Note that the attr element contains the whitespace between name and attribute,
444 // this is necessary for precise reconstruction during pre-save transform.
445 $attr = substr( $text, $attrStart, $attrEnd - $attrStart );
448 $extNode = new PPNode_Hash_Tree( 'ext' );
449 $extNode->addChild( PPNode_Hash_Tree
::newWithText( 'name', $name ) );
450 $extNode->addChild( PPNode_Hash_Tree
::newWithText( 'attr', $attr ) );
451 if ( $inner !== null ) {
452 $extNode->addChild( PPNode_Hash_Tree
::newWithText( 'inner', $inner ) );
454 if ( $close !== null ) {
455 $extNode->addChild( PPNode_Hash_Tree
::newWithText( 'close', $close ) );
457 $accum->addNode( $extNode );
458 } elseif ( $found == 'line-start' ) {
459 // Is this the start of a heading?
460 // Line break belongs before the heading element in any case
461 if ( $fakeLineStart ) {
462 $fakeLineStart = false;
464 $accum->addLiteral( $curChar );
468 $count = strspn( $text, '=', $i, 6 );
469 if ( $count == 1 && $findEquals ) {
470 // DWIM: This looks kind of like a name/value separator.
471 // Let's let the equals handler have it and break the potential
472 // heading. This is heuristic, but AFAICT the methods for
473 // completely correct disambiguation are very complex.
474 } elseif ( $count > 0 ) {
478 'parts' => array( new PPDPart_Hash( str_repeat( '=', $count ) ) ),
481 $stack->push( $piece );
482 $accum =& $stack->getAccum();
483 extract( $stack->getFlags() );
486 } elseif ( $found == 'line-end' ) {
487 $piece = $stack->top
;
488 // A heading must be open, otherwise \n wouldn't have been in the search list
489 assert( '$piece->open == "\n"' );
490 $part = $piece->getCurrentPart();
491 // Search back through the input to see if it has a proper close.
492 // Do this using the reversed string since the other solutions
493 // (end anchor, etc.) are inefficient.
494 $wsLength = strspn( $revText, " \t", $lengthText - $i );
495 $searchStart = $i - $wsLength;
496 if ( isset( $part->commentEnd
) && $searchStart - 1 == $part->commentEnd
) {
497 // Comment found at line end
498 // Search for equals signs before the comment
499 $searchStart = $part->visualEnd
;
500 $searchStart -= strspn( $revText, " \t", $lengthText - $searchStart );
502 $count = $piece->count
;
503 $equalsLength = strspn( $revText, '=', $lengthText - $searchStart );
504 if ( $equalsLength > 0 ) {
505 if ( $searchStart - $equalsLength == $piece->startPos
) {
506 // This is just a single string of equals signs on its own line
507 // Replicate the doHeadings behavior /={count}(.+)={count}/
508 // First find out how many equals signs there really are (don't stop at 6)
509 $count = $equalsLength;
513 $count = min( 6, intval( ( $count - 1 ) / 2 ) );
516 $count = min( $equalsLength, $count );
519 // Normal match, output <h>
520 $element = new PPNode_Hash_Tree( 'possible-h' );
521 $element->addChild( new PPNode_Hash_Attr( 'level', $count ) );
522 $element->addChild( new PPNode_Hash_Attr( 'i', $headingIndex++
) );
523 $element->lastChild
->nextSibling
= $accum->firstNode
;
524 $element->lastChild
= $accum->lastNode
;
526 // Single equals sign on its own line, count=0
530 // No match, no <h>, just pass down the inner text
535 $accum =& $stack->getAccum();
536 extract( $stack->getFlags() );
538 // Append the result to the enclosing accumulator
539 if ( $element instanceof PPNode
) {
540 $accum->addNode( $element );
542 $accum->addAccum( $element );
544 // Note that we do NOT increment the input pointer.
545 // This is because the closing linebreak could be the opening linebreak of
546 // another heading. Infinite loops are avoided because the next iteration MUST
547 // hit the heading open case above, which unconditionally increments the
549 } elseif ( $found == 'open' ) {
550 # count opening brace characters
551 $count = strspn( $text, $curChar, $i );
553 # we need to add to stack only if opening brace count is enough for one of the rules
554 if ( $count >= $rule['min'] ) {
555 # Add it to the stack
558 'close' => $rule['end'],
560 'lineStart' => ( $i > 0 && $text[$i - 1] == "\n" ),
563 $stack->push( $piece );
564 $accum =& $stack->getAccum();
565 extract( $stack->getFlags() );
567 # Add literal brace(s)
568 $accum->addLiteral( str_repeat( $curChar, $count ) );
571 } elseif ( $found == 'close' ) {
572 $piece = $stack->top
;
573 # lets check if there are enough characters for closing brace
574 $maxCount = $piece->count
;
575 $count = strspn( $text, $curChar, $i, $maxCount );
577 # check for maximum matching characters (if there are 5 closing
578 # characters, we will probably need only 3 - depending on the rules)
579 $rule = $rules[$piece->open
];
580 if ( $count > $rule['max'] ) {
581 # The specified maximum exists in the callback array, unless the caller
583 $matchingCount = $rule['max'];
585 # Count is less than the maximum
586 # Skip any gaps in the callback array to find the true largest match
587 # Need to use array_key_exists not isset because the callback can be null
588 $matchingCount = $count;
589 while ( $matchingCount > 0 && !array_key_exists( $matchingCount, $rule['names'] ) ) {
594 if ( $matchingCount <= 0 ) {
595 # No matching element found in callback array
596 # Output a literal closing brace and continue
597 $accum->addLiteral( str_repeat( $curChar, $count ) );
601 $name = $rule['names'][$matchingCount];
602 if ( $name === null ) {
603 // No element, just literal text
604 $element = $piece->breakSyntax( $matchingCount );
605 $element->addLiteral( str_repeat( $rule['end'], $matchingCount ) );
608 # Note: $parts is already XML, does not need to be encoded further
609 $parts = $piece->parts
;
610 $titleAccum = $parts[0]->out
;
613 $element = new PPNode_Hash_Tree( $name );
615 # The invocation is at the start of the line if lineStart is set in
616 # the stack, and all opening brackets are used up.
617 if ( $maxCount == $matchingCount && !empty( $piece->lineStart
) ) {
618 $element->addChild( new PPNode_Hash_Attr( 'lineStart', 1 ) );
620 $titleNode = new PPNode_Hash_Tree( 'title' );
621 $titleNode->firstChild
= $titleAccum->firstNode
;
622 $titleNode->lastChild
= $titleAccum->lastNode
;
623 $element->addChild( $titleNode );
625 foreach ( $parts as $part ) {
626 if ( isset( $part->eqpos
) ) {
629 for ( $node = $part->out
->firstNode
; $node; $node = $node->nextSibling
) {
630 if ( $node === $part->eqpos
) {
637 wfProfileOut( __METHOD__
. '-cache-miss' );
638 wfProfileOut( __METHOD__
. '-cacheable' );
640 wfProfileOut( __METHOD__
);
641 throw new MWException( __METHOD__
. ': eqpos not found' );
643 if ( $node->name
!== 'equals' ) {
645 wfProfileOut( __METHOD__
. '-cache-miss' );
646 wfProfileOut( __METHOD__
. '-cacheable' );
648 wfProfileOut( __METHOD__
);
649 throw new MWException( __METHOD__
. ': eqpos is not equals' );
653 // Construct name node
654 $nameNode = new PPNode_Hash_Tree( 'name' );
655 if ( $lastNode !== false ) {
656 $lastNode->nextSibling
= false;
657 $nameNode->firstChild
= $part->out
->firstNode
;
658 $nameNode->lastChild
= $lastNode;
661 // Construct value node
662 $valueNode = new PPNode_Hash_Tree( 'value' );
663 if ( $equalsNode->nextSibling
!== false ) {
664 $valueNode->firstChild
= $equalsNode->nextSibling
;
665 $valueNode->lastChild
= $part->out
->lastNode
;
667 $partNode = new PPNode_Hash_Tree( 'part' );
668 $partNode->addChild( $nameNode );
669 $partNode->addChild( $equalsNode->firstChild
);
670 $partNode->addChild( $valueNode );
671 $element->addChild( $partNode );
673 $partNode = new PPNode_Hash_Tree( 'part' );
674 $nameNode = new PPNode_Hash_Tree( 'name' );
675 $nameNode->addChild( new PPNode_Hash_Attr( 'index', $argIndex++
) );
676 $valueNode = new PPNode_Hash_Tree( 'value' );
677 $valueNode->firstChild
= $part->out
->firstNode
;
678 $valueNode->lastChild
= $part->out
->lastNode
;
679 $partNode->addChild( $nameNode );
680 $partNode->addChild( $valueNode );
681 $element->addChild( $partNode );
686 # Advance input pointer
687 $i +
= $matchingCount;
691 $accum =& $stack->getAccum();
693 # Re-add the old stack element if it still has unmatched opening characters remaining
694 if ( $matchingCount < $piece->count
) {
695 $piece->parts
= array( new PPDPart_Hash
);
696 $piece->count
-= $matchingCount;
697 # do we still qualify for any callback with remaining count?
698 $min = $rules[$piece->open
]['min'];
699 if ( $piece->count
>= $min ) {
700 $stack->push( $piece );
701 $accum =& $stack->getAccum();
703 $accum->addLiteral( str_repeat( $piece->open
, $piece->count
) );
707 extract( $stack->getFlags() );
709 # Add XML element to the enclosing accumulator
710 if ( $element instanceof PPNode
) {
711 $accum->addNode( $element );
713 $accum->addAccum( $element );
715 } elseif ( $found == 'pipe' ) {
716 $findEquals = true; // shortcut for getFlags()
718 $accum =& $stack->getAccum();
720 } elseif ( $found == 'equals' ) {
721 $findEquals = false; // shortcut for getFlags()
722 $accum->addNodeWithText( 'equals', '=' );
723 $stack->getCurrentPart()->eqpos
= $accum->lastNode
;
728 # Output any remaining unclosed brackets
729 foreach ( $stack->stack
as $piece ) {
730 $stack->rootAccum
->addAccum( $piece->breakSyntax() );
733 # Enable top-level headings
734 for ( $node = $stack->rootAccum
->firstNode
; $node; $node = $node->nextSibling
) {
735 if ( isset( $node->name
) && $node->name
=== 'possible-h' ) {
740 $rootNode = new PPNode_Hash_Tree( 'root' );
741 $rootNode->firstChild
= $stack->rootAccum
->firstNode
;
742 $rootNode->lastChild
= $stack->rootAccum
->lastNode
;
746 $cacheValue = sprintf( "%08d", self
::CACHE_VERSION
) . serialize( $rootNode );
747 $wgMemc->set( $cacheKey, $cacheValue, 86400 );
748 wfProfileOut( __METHOD__
. '-cache-miss' );
749 wfProfileOut( __METHOD__
. '-cacheable' );
750 wfDebugLog( "Preprocessor", "Saved preprocessor Hash to memcached (key $cacheKey)" );
753 wfProfileOut( __METHOD__
);
759 * Stack class to help Preprocessor::preprocessToObj()
762 class PPDStack_Hash
extends PPDStack
{
763 function __construct() {
764 $this->elementClass
= 'PPDStackElement_Hash';
765 parent
::__construct();
766 $this->rootAccum
= new PPDAccum_Hash
;
773 class PPDStackElement_Hash
extends PPDStackElement
{
774 function __construct( $data = array() ) {
775 $this->partClass
= 'PPDPart_Hash';
776 parent
::__construct( $data );
780 * Get the accumulator that would result if the close is not found.
782 * @param int|bool $openingCount
783 * @return PPDAccum_Hash
785 function breakSyntax( $openingCount = false ) {
786 if ( $this->open
== "\n" ) {
787 $accum = $this->parts
[0]->out
;
789 if ( $openingCount === false ) {
790 $openingCount = $this->count
;
792 $accum = new PPDAccum_Hash
;
793 $accum->addLiteral( str_repeat( $this->open
, $openingCount ) );
795 foreach ( $this->parts
as $part ) {
799 $accum->addLiteral( '|' );
801 $accum->addAccum( $part->out
);
811 class PPDPart_Hash
extends PPDPart
{
812 function __construct( $out = '' ) {
813 $accum = new PPDAccum_Hash
;
815 $accum->addLiteral( $out );
817 parent
::__construct( $accum );
824 class PPDAccum_Hash
{
825 var $firstNode, $lastNode;
827 function __construct() {
828 $this->firstNode
= $this->lastNode
= false;
832 * Append a string literal
835 function addLiteral( $s ) {
836 if ( $this->lastNode
=== false ) {
837 $this->firstNode
= $this->lastNode
= new PPNode_Hash_Text( $s );
838 } elseif ( $this->lastNode
instanceof PPNode_Hash_Text
) {
839 $this->lastNode
->value
.= $s;
841 $this->lastNode
->nextSibling
= new PPNode_Hash_Text( $s );
842 $this->lastNode
= $this->lastNode
->nextSibling
;
848 * @param PPNode $node
850 function addNode( PPNode
$node ) {
851 if ( $this->lastNode
=== false ) {
852 $this->firstNode
= $this->lastNode
= $node;
854 $this->lastNode
->nextSibling
= $node;
855 $this->lastNode
= $node;
860 * Append a tree node with text contents
861 * @param string $name
862 * @param string $value
864 function addNodeWithText( $name, $value ) {
865 $node = PPNode_Hash_Tree
::newWithText( $name, $value );
866 $this->addNode( $node );
870 * Append a PPDAccum_Hash
871 * Takes over ownership of the nodes in the source argument. These nodes may
872 * subsequently be modified, especially nextSibling.
873 * @param PPDAccum_Hash $accum
875 function addAccum( $accum ) {
876 if ( $accum->lastNode
=== false ) {
878 } elseif ( $this->lastNode
=== false ) {
879 $this->firstNode
= $accum->firstNode
;
880 $this->lastNode
= $accum->lastNode
;
882 $this->lastNode
->nextSibling
= $accum->firstNode
;
883 $this->lastNode
= $accum->lastNode
;
889 * An expansion frame, used as a context to expand the result of preprocessToObj()
892 class PPFrame_Hash
implements PPFrame
{
911 * Hashtable listing templates which are disallowed for expansion in this frame,
912 * having been encountered previously in parent frames.
917 * Recursion depth of this frame, top = 0
918 * Note that this is NOT the same as expansion depth in expand()
925 protected $childExpansionCache;
928 * Construct a new preprocessor frame.
929 * @param Preprocessor $preprocessor The parent preprocessor
931 function __construct( $preprocessor ) {
932 $this->preprocessor
= $preprocessor;
933 $this->parser
= $preprocessor->parser
;
934 $this->title
= $this->parser
->mTitle
;
935 $this->titleCache
= array( $this->title ?
$this->title
->getPrefixedDBkey() : false );
936 $this->loopCheckHash
= array();
938 $this->childExpansionCache
= array();
942 * Create a new child frame
943 * $args is optionally a multi-root PPNode or array containing the template arguments
945 * @param array|bool|PPNode_Hash_Array $args
946 * @param Title|bool $title
947 * @param int $indexOffset
948 * @throws MWException
949 * @return PPTemplateFrame_Hash
951 function newChild( $args = false, $title = false, $indexOffset = 0 ) {
952 $namedArgs = array();
953 $numberedArgs = array();
954 if ( $title === false ) {
955 $title = $this->title
;
957 if ( $args !== false ) {
958 if ( $args instanceof PPNode_Hash_Array
) {
959 $args = $args->value
;
960 } elseif ( !is_array( $args ) ) {
961 throw new MWException( __METHOD__
. ': $args must be array or PPNode_Hash_Array' );
963 foreach ( $args as $arg ) {
964 $bits = $arg->splitArg();
965 if ( $bits['index'] !== '' ) {
966 // Numbered parameter
967 $index = $bits['index'] - $indexOffset;
968 $numberedArgs[$index] = $bits['value'];
969 unset( $namedArgs[$index] );
972 $name = trim( $this->expand( $bits['name'], PPFrame
::STRIP_COMMENTS
) );
973 $namedArgs[$name] = $bits['value'];
974 unset( $numberedArgs[$name] );
978 return new PPTemplateFrame_Hash( $this->preprocessor
, $this, $numberedArgs, $namedArgs, $title );
982 * @throws MWException
983 * @param string|int $key
984 * @param string|PPNode_Hash|DOMDocument $root
988 function cachedExpand( $key, $root, $flags = 0 ) {
989 // we don't have a parent, so we don't have a cache
990 return $this->expand( $root, $flags );
994 * @throws MWException
995 * @param string|PPNode$root
999 function expand( $root, $flags = 0 ) {
1000 static $expansionDepth = 0;
1001 if ( is_string( $root ) ) {
1005 if ( ++
$this->parser
->mPPNodeCount
> $this->parser
->mOptions
->getMaxPPNodeCount() ) {
1006 $this->parser
->limitationWarn( 'node-count-exceeded',
1007 $this->parser
->mPPNodeCount
,
1008 $this->parser
->mOptions
->getMaxPPNodeCount()
1010 return '<span class="error">Node-count limit exceeded</span>';
1012 if ( $expansionDepth > $this->parser
->mOptions
->getMaxPPExpandDepth() ) {
1013 $this->parser
->limitationWarn( 'expansion-depth-exceeded',
1015 $this->parser
->mOptions
->getMaxPPExpandDepth()
1017 return '<span class="error">Expansion depth limit exceeded</span>';
1020 if ( $expansionDepth > $this->parser
->mHighestExpansionDepth
) {
1021 $this->parser
->mHighestExpansionDepth
= $expansionDepth;
1024 $outStack = array( '', '' );
1025 $iteratorStack = array( false, $root );
1026 $indexStack = array( 0, 0 );
1028 while ( count( $iteratorStack ) > 1 ) {
1029 $level = count( $outStack ) - 1;
1030 $iteratorNode =& $iteratorStack[$level];
1031 $out =& $outStack[$level];
1032 $index =& $indexStack[$level];
1034 if ( is_array( $iteratorNode ) ) {
1035 if ( $index >= count( $iteratorNode ) ) {
1036 // All done with this iterator
1037 $iteratorStack[$level] = false;
1038 $contextNode = false;
1040 $contextNode = $iteratorNode[$index];
1043 } elseif ( $iteratorNode instanceof PPNode_Hash_Array
) {
1044 if ( $index >= $iteratorNode->getLength() ) {
1045 // All done with this iterator
1046 $iteratorStack[$level] = false;
1047 $contextNode = false;
1049 $contextNode = $iteratorNode->item( $index );
1053 // Copy to $contextNode and then delete from iterator stack,
1054 // because this is not an iterator but we do have to execute it once
1055 $contextNode = $iteratorStack[$level];
1056 $iteratorStack[$level] = false;
1059 $newIterator = false;
1061 if ( $contextNode === false ) {
1063 } elseif ( is_string( $contextNode ) ) {
1064 $out .= $contextNode;
1065 } elseif ( is_array( $contextNode ) ||
$contextNode instanceof PPNode_Hash_Array
) {
1066 $newIterator = $contextNode;
1067 } elseif ( $contextNode instanceof PPNode_Hash_Attr
) {
1069 } elseif ( $contextNode instanceof PPNode_Hash_Text
) {
1070 $out .= $contextNode->value
;
1071 } elseif ( $contextNode instanceof PPNode_Hash_Tree
) {
1072 if ( $contextNode->name
== 'template' ) {
1073 # Double-brace expansion
1074 $bits = $contextNode->splitTemplate();
1075 if ( $flags & PPFrame
::NO_TEMPLATES
) {
1076 $newIterator = $this->virtualBracketedImplode(
1082 $ret = $this->parser
->braceSubstitution( $bits, $this );
1083 if ( isset( $ret['object'] ) ) {
1084 $newIterator = $ret['object'];
1086 $out .= $ret['text'];
1089 } elseif ( $contextNode->name
== 'tplarg' ) {
1090 # Triple-brace expansion
1091 $bits = $contextNode->splitTemplate();
1092 if ( $flags & PPFrame
::NO_ARGS
) {
1093 $newIterator = $this->virtualBracketedImplode(
1099 $ret = $this->parser
->argSubstitution( $bits, $this );
1100 if ( isset( $ret['object'] ) ) {
1101 $newIterator = $ret['object'];
1103 $out .= $ret['text'];
1106 } elseif ( $contextNode->name
== 'comment' ) {
1107 # HTML-style comment
1108 # Remove it in HTML, pre+remove and STRIP_COMMENTS modes
1109 if ( $this->parser
->ot
['html']
1110 ||
( $this->parser
->ot
['pre'] && $this->parser
->mOptions
->getRemoveComments() )
1111 ||
( $flags & PPFrame
::STRIP_COMMENTS
)
1114 } elseif ( $this->parser
->ot
['wiki'] && !( $flags & PPFrame
::RECOVER_COMMENTS
) ) {
1115 # Add a strip marker in PST mode so that pstPass2() can
1116 # run some old-fashioned regexes on the result.
1117 # Not in RECOVER_COMMENTS mode (extractSections) though.
1118 $out .= $this->parser
->insertStripItem( $contextNode->firstChild
->value
);
1120 # Recover the literal comment in RECOVER_COMMENTS and pre+no-remove
1121 $out .= $contextNode->firstChild
->value
;
1123 } elseif ( $contextNode->name
== 'ignore' ) {
1124 # Output suppression used by <includeonly> etc.
1125 # OT_WIKI will only respect <ignore> in substed templates.
1126 # The other output types respect it unless NO_IGNORE is set.
1127 # extractSections() sets NO_IGNORE and so never respects it.
1128 if ( ( !isset( $this->parent
) && $this->parser
->ot
['wiki'] )
1129 ||
( $flags & PPFrame
::NO_IGNORE
)
1131 $out .= $contextNode->firstChild
->value
;
1135 } elseif ( $contextNode->name
== 'ext' ) {
1137 $bits = $contextNode->splitExt() +
array( 'attr' => null, 'inner' => null, 'close' => null );
1138 $out .= $this->parser
->extensionSubstitution( $bits, $this );
1139 } elseif ( $contextNode->name
== 'h' ) {
1141 if ( $this->parser
->ot
['html'] ) {
1142 # Expand immediately and insert heading index marker
1144 for ( $node = $contextNode->firstChild
; $node; $node = $node->nextSibling
) {
1145 $s .= $this->expand( $node, $flags );
1148 $bits = $contextNode->splitHeading();
1149 $titleText = $this->title
->getPrefixedDBkey();
1150 $this->parser
->mHeadings
[] = array( $titleText, $bits['i'] );
1151 $serial = count( $this->parser
->mHeadings
) - 1;
1152 $marker = "{$this->parser->mUniqPrefix}-h-$serial-" . Parser
::MARKER_SUFFIX
;
1153 $s = substr( $s, 0, $bits['level'] ) . $marker . substr( $s, $bits['level'] );
1154 $this->parser
->mStripState
->addGeneral( $marker, '' );
1157 # Expand in virtual stack
1158 $newIterator = $contextNode->getChildren();
1161 # Generic recursive expansion
1162 $newIterator = $contextNode->getChildren();
1165 throw new MWException( __METHOD__
. ': Invalid parameter type' );
1168 if ( $newIterator !== false ) {
1170 $iteratorStack[] = $newIterator;
1172 } elseif ( $iteratorStack[$level] === false ) {
1173 // Return accumulated value to parent
1174 // With tail recursion
1175 while ( $iteratorStack[$level] === false && $level > 0 ) {
1176 $outStack[$level - 1] .= $out;
1177 array_pop( $outStack );
1178 array_pop( $iteratorStack );
1179 array_pop( $indexStack );
1185 return $outStack[0];
1189 * @param string $sep
1193 function implodeWithFlags( $sep, $flags /*, ... */ ) {
1194 $args = array_slice( func_get_args(), 2 );
1198 foreach ( $args as $root ) {
1199 if ( $root instanceof PPNode_Hash_Array
) {
1200 $root = $root->value
;
1202 if ( !is_array( $root ) ) {
1203 $root = array( $root );
1205 foreach ( $root as $node ) {
1211 $s .= $this->expand( $node, $flags );
1218 * Implode with no flags specified
1219 * This previously called implodeWithFlags but has now been inlined to reduce stack depth
1220 * @param string $sep
1223 function implode( $sep /*, ... */ ) {
1224 $args = array_slice( func_get_args(), 1 );
1228 foreach ( $args as $root ) {
1229 if ( $root instanceof PPNode_Hash_Array
) {
1230 $root = $root->value
;
1232 if ( !is_array( $root ) ) {
1233 $root = array( $root );
1235 foreach ( $root as $node ) {
1241 $s .= $this->expand( $node );
1248 * Makes an object that, when expand()ed, will be the same as one obtained
1251 * @param string $sep
1252 * @return PPNode_Hash_Array
1254 function virtualImplode( $sep /*, ... */ ) {
1255 $args = array_slice( func_get_args(), 1 );
1259 foreach ( $args as $root ) {
1260 if ( $root instanceof PPNode_Hash_Array
) {
1261 $root = $root->value
;
1263 if ( !is_array( $root ) ) {
1264 $root = array( $root );
1266 foreach ( $root as $node ) {
1275 return new PPNode_Hash_Array( $out );
1279 * Virtual implode with brackets
1281 * @param string $start
1282 * @param string $sep
1283 * @param string $end
1284 * @return PPNode_Hash_Array
1286 function virtualBracketedImplode( $start, $sep, $end /*, ... */ ) {
1287 $args = array_slice( func_get_args(), 3 );
1288 $out = array( $start );
1291 foreach ( $args as $root ) {
1292 if ( $root instanceof PPNode_Hash_Array
) {
1293 $root = $root->value
;
1295 if ( !is_array( $root ) ) {
1296 $root = array( $root );
1298 foreach ( $root as $node ) {
1308 return new PPNode_Hash_Array( $out );
1311 function __toString() {
1316 * @param bool $level
1317 * @return array|bool|string
1319 function getPDBK( $level = false ) {
1320 if ( $level === false ) {
1321 return $this->title
->getPrefixedDBkey();
1323 return isset( $this->titleCache
[$level] ) ?
$this->titleCache
[$level] : false;
1330 function getArguments() {
1337 function getNumberedArguments() {
1344 function getNamedArguments() {
1349 * Returns true if there are no arguments in this frame
1353 function isEmpty() {
1358 * @param string $name
1361 function getArgument( $name ) {
1366 * Returns true if the infinite loop check is OK, false if a loop is detected
1368 * @param Title $title
1372 function loopCheck( $title ) {
1373 return !isset( $this->loopCheckHash
[$title->getPrefixedDBkey()] );
1377 * Return true if the frame is a template frame
1381 function isTemplate() {
1386 * Get a title of frame
1390 function getTitle() {
1391 return $this->title
;
1396 * Expansion frame with template arguments
1399 class PPTemplateFrame_Hash
extends PPFrame_Hash
{
1400 var $numberedArgs, $namedArgs, $parent;
1401 var $numberedExpansionCache, $namedExpansionCache;
1404 * @param Preprocessor $preprocessor
1405 * @param bool|PPFrame $parent
1406 * @param array $numberedArgs
1407 * @param array $namedArgs
1408 * @param bool|Title $title
1410 function __construct( $preprocessor, $parent = false, $numberedArgs = array(),
1411 $namedArgs = array(), $title = false
1413 parent
::__construct( $preprocessor );
1415 $this->parent
= $parent;
1416 $this->numberedArgs
= $numberedArgs;
1417 $this->namedArgs
= $namedArgs;
1418 $this->title
= $title;
1419 $pdbk = $title ?
$title->getPrefixedDBkey() : false;
1420 $this->titleCache
= $parent->titleCache
;
1421 $this->titleCache
[] = $pdbk;
1422 $this->loopCheckHash
= /*clone*/ $parent->loopCheckHash
;
1423 if ( $pdbk !== false ) {
1424 $this->loopCheckHash
[$pdbk] = true;
1426 $this->depth
= $parent->depth +
1;
1427 $this->numberedExpansionCache
= $this->namedExpansionCache
= array();
1430 function __toString() {
1433 $args = $this->numberedArgs +
$this->namedArgs
;
1434 foreach ( $args as $name => $value ) {
1440 $s .= "\"$name\":\"" .
1441 str_replace( '"', '\\"', $value->__toString() ) . '"';
1448 * @throws MWException
1449 * @param string|int $key
1450 * @param string|PPNode_Hash|DOMDocument $root
1454 function cachedExpand( $key, $root, $flags = 0 ) {
1455 if ( !isset( $this->parent
->childExpansionCache
[$key] ) ) {
1456 $this->parent
->childExpansionCache
[$key] = $this->expand( $root, $flags );
1458 return $this->parent
->childExpansionCache
[$key];
1462 * Returns true if there are no arguments in this frame
1466 function isEmpty() {
1467 return !count( $this->numberedArgs
) && !count( $this->namedArgs
);
1473 function getArguments() {
1474 $arguments = array();
1475 foreach ( array_merge(
1476 array_keys( $this->numberedArgs
),
1477 array_keys( $this->namedArgs
) ) as $key ) {
1478 $arguments[$key] = $this->getArgument( $key );
1486 function getNumberedArguments() {
1487 $arguments = array();
1488 foreach ( array_keys( $this->numberedArgs
) as $key ) {
1489 $arguments[$key] = $this->getArgument( $key );
1497 function getNamedArguments() {
1498 $arguments = array();
1499 foreach ( array_keys( $this->namedArgs
) as $key ) {
1500 $arguments[$key] = $this->getArgument( $key );
1507 * @return array|bool
1509 function getNumberedArgument( $index ) {
1510 if ( !isset( $this->numberedArgs
[$index] ) ) {
1513 if ( !isset( $this->numberedExpansionCache
[$index] ) ) {
1514 # No trimming for unnamed arguments
1515 $this->numberedExpansionCache
[$index] = $this->parent
->expand(
1516 $this->numberedArgs
[$index],
1517 PPFrame
::STRIP_COMMENTS
1520 return $this->numberedExpansionCache
[$index];
1524 * @param string $name
1527 function getNamedArgument( $name ) {
1528 if ( !isset( $this->namedArgs
[$name] ) ) {
1531 if ( !isset( $this->namedExpansionCache
[$name] ) ) {
1532 # Trim named arguments post-expand, for backwards compatibility
1533 $this->namedExpansionCache
[$name] = trim(
1534 $this->parent
->expand( $this->namedArgs
[$name], PPFrame
::STRIP_COMMENTS
) );
1536 return $this->namedExpansionCache
[$name];
1540 * @param string $name
1541 * @return array|bool
1543 function getArgument( $name ) {
1544 $text = $this->getNumberedArgument( $name );
1545 if ( $text === false ) {
1546 $text = $this->getNamedArgument( $name );
1552 * Return true if the frame is a template frame
1556 function isTemplate() {
1562 * Expansion frame with custom arguments
1565 class PPCustomFrame_Hash
extends PPFrame_Hash
{
1568 function __construct( $preprocessor, $args ) {
1569 parent
::__construct( $preprocessor );
1570 $this->args
= $args;
1573 function __toString() {
1576 foreach ( $this->args
as $name => $value ) {
1582 $s .= "\"$name\":\"" .
1583 str_replace( '"', '\\"', $value->__toString() ) . '"';
1592 function isEmpty() {
1593 return !count( $this->args
);
1600 function getArgument( $index ) {
1601 if ( !isset( $this->args
[$index] ) ) {
1604 return $this->args
[$index];
1607 function getArguments() {
1615 class PPNode_Hash_Tree
implements PPNode
{
1616 var $name, $firstChild, $lastChild, $nextSibling;
1618 function __construct( $name ) {
1619 $this->name
= $name;
1620 $this->firstChild
= $this->lastChild
= $this->nextSibling
= false;
1623 function __toString() {
1626 for ( $node = $this->firstChild
; $node; $node = $node->nextSibling
) {
1627 if ( $node instanceof PPNode_Hash_Attr
) {
1628 $attribs .= ' ' . $node->name
. '="' . htmlspecialchars( $node->value
) . '"';
1630 $inner .= $node->__toString();
1633 if ( $inner === '' ) {
1634 return "<{$this->name}$attribs/>";
1636 return "<{$this->name}$attribs>$inner</{$this->name}>";
1641 * @param string $name
1642 * @param string $text
1643 * @return PPNode_Hash_Tree
1645 static function newWithText( $name, $text ) {
1646 $obj = new self( $name );
1647 $obj->addChild( new PPNode_Hash_Text( $text ) );
1651 function addChild( $node ) {
1652 if ( $this->lastChild
=== false ) {
1653 $this->firstChild
= $this->lastChild
= $node;
1655 $this->lastChild
->nextSibling
= $node;
1656 $this->lastChild
= $node;
1661 * @return PPNode_Hash_Array
1663 function getChildren() {
1664 $children = array();
1665 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1666 $children[] = $child;
1668 return new PPNode_Hash_Array( $children );
1671 function getFirstChild() {
1672 return $this->firstChild
;
1675 function getNextSibling() {
1676 return $this->nextSibling
;
1679 function getChildrenOfType( $name ) {
1680 $children = array();
1681 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1682 if ( isset( $child->name
) && $child->name
=== $name ) {
1683 $children[] = $child;
1692 function getLength() {
1700 function item( $i ) {
1707 function getName() {
1712 * Split a "<part>" node into an associative array containing:
1713 * - name PPNode name
1714 * - index String index
1715 * - value PPNode value
1717 * @throws MWException
1720 function splitArg() {
1722 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1723 if ( !isset( $child->name
) ) {
1726 if ( $child->name
=== 'name' ) {
1727 $bits['name'] = $child;
1728 if ( $child->firstChild
instanceof PPNode_Hash_Attr
1729 && $child->firstChild
->name
=== 'index'
1731 $bits['index'] = $child->firstChild
->value
;
1733 } elseif ( $child->name
=== 'value' ) {
1734 $bits['value'] = $child;
1738 if ( !isset( $bits['name'] ) ) {
1739 throw new MWException( 'Invalid brace node passed to ' . __METHOD__
);
1741 if ( !isset( $bits['index'] ) ) {
1742 $bits['index'] = '';
1748 * Split an "<ext>" node into an associative array containing name, attr, inner and close
1749 * All values in the resulting array are PPNodes. Inner and close are optional.
1751 * @throws MWException
1754 function splitExt() {
1756 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1757 if ( !isset( $child->name
) ) {
1760 if ( $child->name
== 'name' ) {
1761 $bits['name'] = $child;
1762 } elseif ( $child->name
== 'attr' ) {
1763 $bits['attr'] = $child;
1764 } elseif ( $child->name
== 'inner' ) {
1765 $bits['inner'] = $child;
1766 } elseif ( $child->name
== 'close' ) {
1767 $bits['close'] = $child;
1770 if ( !isset( $bits['name'] ) ) {
1771 throw new MWException( 'Invalid ext node passed to ' . __METHOD__
);
1777 * Split an "<h>" node
1779 * @throws MWException
1782 function splitHeading() {
1783 if ( $this->name
!== 'h' ) {
1784 throw new MWException( 'Invalid h node passed to ' . __METHOD__
);
1787 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1788 if ( !isset( $child->name
) ) {
1791 if ( $child->name
== 'i' ) {
1792 $bits['i'] = $child->value
;
1793 } elseif ( $child->name
== 'level' ) {
1794 $bits['level'] = $child->value
;
1797 if ( !isset( $bits['i'] ) ) {
1798 throw new MWException( 'Invalid h node passed to ' . __METHOD__
);
1804 * Split a "<template>" or "<tplarg>" node
1806 * @throws MWException
1809 function splitTemplate() {
1811 $bits = array( 'lineStart' => '' );
1812 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1813 if ( !isset( $child->name
) ) {
1816 if ( $child->name
== 'title' ) {
1817 $bits['title'] = $child;
1819 if ( $child->name
== 'part' ) {
1822 if ( $child->name
== 'lineStart' ) {
1823 $bits['lineStart'] = '1';
1826 if ( !isset( $bits['title'] ) ) {
1827 throw new MWException( 'Invalid node passed to ' . __METHOD__
);
1829 $bits['parts'] = new PPNode_Hash_Array( $parts );
1837 class PPNode_Hash_Text
implements PPNode
{
1838 var $value, $nextSibling;
1840 function __construct( $value ) {
1841 if ( is_object( $value ) ) {
1842 throw new MWException( __CLASS__
. ' given object instead of string' );
1844 $this->value
= $value;
1847 function __toString() {
1848 return htmlspecialchars( $this->value
);
1851 function getNextSibling() {
1852 return $this->nextSibling
;
1855 function getChildren() {
1859 function getFirstChild() {
1863 function getChildrenOfType( $name ) {
1867 function getLength() {
1871 function item( $i ) {
1875 function getName() {
1879 function splitArg() {
1880 throw new MWException( __METHOD__
. ': not supported' );
1883 function splitExt() {
1884 throw new MWException( __METHOD__
. ': not supported' );
1887 function splitHeading() {
1888 throw new MWException( __METHOD__
. ': not supported' );
1895 class PPNode_Hash_Array
implements PPNode
{
1896 var $value, $nextSibling;
1898 function __construct( $value ) {
1899 $this->value
= $value;
1902 function __toString() {
1903 return var_export( $this, true );
1906 function getLength() {
1907 return count( $this->value
);
1910 function item( $i ) {
1911 return $this->value
[$i];
1914 function getName() {
1918 function getNextSibling() {
1919 return $this->nextSibling
;
1922 function getChildren() {
1926 function getFirstChild() {
1930 function getChildrenOfType( $name ) {
1934 function splitArg() {
1935 throw new MWException( __METHOD__
. ': not supported' );
1938 function splitExt() {
1939 throw new MWException( __METHOD__
. ': not supported' );
1942 function splitHeading() {
1943 throw new MWException( __METHOD__
. ': not supported' );
1950 class PPNode_Hash_Attr
implements PPNode
{
1951 var $name, $value, $nextSibling;
1953 function __construct( $name, $value ) {
1954 $this->name
= $name;
1955 $this->value
= $value;
1958 function __toString() {
1959 return "<@{$this->name}>" . htmlspecialchars( $this->value
) . "</@{$this->name}>";
1962 function getName() {
1966 function getNextSibling() {
1967 return $this->nextSibling
;
1970 function getChildren() {
1974 function getFirstChild() {
1978 function getChildrenOfType( $name ) {
1982 function getLength() {
1986 function item( $i ) {
1990 function splitArg() {
1991 throw new MWException( __METHOD__
. ': not supported' );
1994 function splitExt() {
1995 throw new MWException( __METHOD__
. ': not supported' );
1998 function splitHeading() {
1999 throw new MWException( __METHOD__
. ': not supported' );