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 $values array
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 $flags Integer: 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 && strlen( $text ) > $wgPreprocessorCacheThreshold;
119 wfProfileIn( __METHOD__
. '-cacheable' );
121 $cacheKey = wfMemcKey( 'preprocess-hash', md5( $text ), $flags );
122 $cacheValue = $wgMemc->get( $cacheKey );
124 $version = substr( $cacheValue, 0, 8 );
125 if ( intval( $version ) == self
::CACHE_VERSION
) {
126 $hash = unserialize( substr( $cacheValue, 8 ) );
128 wfDebugLog( "Preprocessor",
129 "Loaded preprocessor hash from memcached (key $cacheKey)" );
130 wfProfileOut( __METHOD__
. '-cacheable' );
131 wfProfileOut( __METHOD__
);
135 wfProfileIn( __METHOD__
. '-cache-miss' );
150 'names' => array( 2 => null ),
156 $forInclusion = $flags & Parser
::PTD_FOR_INCLUSION
;
158 $xmlishElements = $this->parser
->getStripList();
159 $enableOnlyinclude = false;
160 if ( $forInclusion ) {
161 $ignoredTags = array( 'includeonly', '/includeonly' );
162 $ignoredElements = array( 'noinclude' );
163 $xmlishElements[] = 'noinclude';
164 if ( strpos( $text, '<onlyinclude>' ) !== false && strpos( $text, '</onlyinclude>' ) !== false ) {
165 $enableOnlyinclude = true;
168 $ignoredTags = array( 'noinclude', '/noinclude', 'onlyinclude', '/onlyinclude' );
169 $ignoredElements = array( 'includeonly' );
170 $xmlishElements[] = 'includeonly';
172 $xmlishRegex = implode( '|', array_merge( $xmlishElements, $ignoredTags ) );
174 // Use "A" modifier (anchored) instead of "^", because ^ doesn't work with an offset
175 $elementsRegex = "~($xmlishRegex)(?:\s|\/>|>)|(!--)~iA";
177 $stack = new PPDStack_Hash
;
179 $searchBase = "[{<\n";
180 $revText = strrev( $text ); // For fast reverse searches
181 $lengthText = strlen( $text );
183 $i = 0; # Input pointer, starts out pointing to a pseudo-newline before the start
184 $accum =& $stack->getAccum(); # Current accumulator
185 $findEquals = false; # True to find equals signs in arguments
186 $findPipe = false; # True to take notice of pipe characters
188 $inHeading = false; # True if $i is inside a possible heading
189 $noMoreGT = false; # True if there are no more greater-than (>) signs right of $i
190 $findOnlyinclude = $enableOnlyinclude; # True to ignore all input up to the next <onlyinclude>
191 $fakeLineStart = true; # Do a line-start run without outputting an LF character
196 if ( $findOnlyinclude ) {
197 // Ignore all input up to the next <onlyinclude>
198 $startPos = strpos( $text, '<onlyinclude>', $i );
199 if ( $startPos === false ) {
200 // Ignored section runs to the end
201 $accum->addNodeWithText( 'ignore', substr( $text, $i ) );
204 $tagEndPos = $startPos +
strlen( '<onlyinclude>' ); // past-the-end
205 $accum->addNodeWithText( 'ignore', substr( $text, $i, $tagEndPos - $i ) );
207 $findOnlyinclude = false;
210 if ( $fakeLineStart ) {
211 $found = 'line-start';
214 # Find next opening brace, closing brace or pipe
215 $search = $searchBase;
216 if ( $stack->top
=== false ) {
217 $currentClosing = '';
219 $currentClosing = $stack->top
->close
;
220 $search .= $currentClosing;
226 // First equals will be for the template
230 # Output literal section, advance input counter
231 $literalLength = strcspn( $text, $search, $i );
232 if ( $literalLength > 0 ) {
233 $accum->addLiteral( substr( $text, $i, $literalLength ) );
234 $i +
= $literalLength;
236 if ( $i >= $lengthText ) {
237 if ( $currentClosing == "\n" ) {
238 // Do a past-the-end run to finish off the heading
246 $curChar = $text[$i];
247 if ( $curChar == '|' ) {
249 } elseif ( $curChar == '=' ) {
251 } elseif ( $curChar == '<' ) {
253 } elseif ( $curChar == "\n" ) {
257 $found = 'line-start';
259 } elseif ( $curChar == $currentClosing ) {
261 } elseif ( isset( $rules[$curChar] ) ) {
263 $rule = $rules[$curChar];
265 # Some versions of PHP have a strcspn which stops on null characters
266 # Ignore and continue
273 if ( $found == 'angle' ) {
275 // Handle </onlyinclude>
276 if ( $enableOnlyinclude && substr( $text, $i, strlen( '</onlyinclude>' ) ) == '</onlyinclude>' ) {
277 $findOnlyinclude = true;
281 // Determine element name
282 if ( !preg_match( $elementsRegex, $text, $matches, 0, $i +
1 ) ) {
283 // Element name missing or not listed
284 $accum->addLiteral( '<' );
289 if ( isset( $matches[2] ) && $matches[2] == '!--' ) {
291 // To avoid leaving blank lines, when a sequence of
292 // space-separated comments is both preceded and followed by
293 // a newline (ignoring spaces), then
294 // trim leading and trailing spaces and the trailing newline.
297 $endPos = strpos( $text, '-->', $i +
4 );
298 if ( $endPos === false ) {
299 // Unclosed comment in input, runs to end
300 $inner = substr( $text, $i );
301 $accum->addNodeWithText( 'comment', $inner );
304 // Search backwards for leading whitespace
305 $wsStart = $i ?
( $i - strspn( $revText, " \t", $lengthText - $i ) ) : 0;
307 // Search forwards for trailing whitespace
308 // $wsEnd will be the position of the last space (or the '>' if there's none)
309 $wsEnd = $endPos +
2 +
strspn( $text, " \t", $endPos +
3 );
311 // Keep looking forward as long as we're finding more
313 $comments = array( array( $wsStart, $wsEnd ) );
314 while ( substr( $text, $wsEnd +
1, 4 ) == '<!--' ) {
315 $c = strpos( $text, '-->', $wsEnd +
4 );
316 if ( $c === false ) {
319 $c = $c +
2 +
strspn( $text, " \t", $c +
3 );
320 $comments[] = array( $wsEnd +
1, $c );
324 // Eat the line if possible
325 // TODO: This could theoretically be done if $wsStart == 0, i.e. for comments at
326 // the overall start. That's not how Sanitizer::removeHTMLcomments() did it, but
327 // it's a possible beneficial b/c break.
328 if ( $wsStart > 0 && substr( $text, $wsStart - 1, 1 ) == "\n"
329 && substr( $text, $wsEnd +
1, 1 ) == "\n"
331 // Remove leading whitespace from the end of the accumulator
332 // Sanity check first though
333 $wsLength = $i - $wsStart;
335 && $accum->lastNode
instanceof PPNode_Hash_Text
336 && strspn( $accum->lastNode
->value
, " \t", -$wsLength ) === $wsLength
338 $accum->lastNode
->value
= substr( $accum->lastNode
->value
, 0, -$wsLength );
341 // Dump all but the last comment to the accumulator
342 foreach ( $comments as $j => $com ) {
344 $endPos = $com[1] +
1;
345 if ( $j == ( count( $comments ) - 1 ) ) {
348 $inner = substr( $text, $startPos, $endPos - $startPos );
349 $accum->addNodeWithText( 'comment', $inner );
352 // Do a line-start run next time to look for headings after the comment
353 $fakeLineStart = true;
355 // No line to eat, just take the comment itself
361 $part = $stack->top
->getCurrentPart();
362 if ( !( isset( $part->commentEnd
) && $part->commentEnd
== $wsStart - 1 ) ) {
363 $part->visualEnd
= $wsStart;
365 // Else comments abutting, no change in visual end
366 $part->commentEnd
= $endPos;
369 $inner = substr( $text, $startPos, $endPos - $startPos +
1 );
370 $accum->addNodeWithText( 'comment', $inner );
375 $lowerName = strtolower( $name );
376 $attrStart = $i +
strlen( $name ) +
1;
379 $tagEndPos = $noMoreGT ?
false : strpos( $text, '>', $attrStart );
380 if ( $tagEndPos === false ) {
381 // Infinite backtrack
382 // Disable tag search to prevent worst-case O(N^2) performance
384 $accum->addLiteral( '<' );
389 // Handle ignored tags
390 if ( in_array( $lowerName, $ignoredTags ) ) {
391 $accum->addNodeWithText( 'ignore', substr( $text, $i, $tagEndPos - $i +
1 ) );
397 if ( $text[$tagEndPos - 1] == '/' ) {
399 $attrEnd = $tagEndPos - 1;
404 $attrEnd = $tagEndPos;
406 if ( preg_match( "/<\/" . preg_quote( $name, '/' ) . "\s*>/i",
407 $text, $matches, PREG_OFFSET_CAPTURE
, $tagEndPos +
1 )
409 $inner = substr( $text, $tagEndPos +
1, $matches[0][1] - $tagEndPos - 1 );
410 $i = $matches[0][1] +
strlen( $matches[0][0] );
411 $close = $matches[0][0];
413 // No end tag -- let it run out to the end of the text.
414 $inner = substr( $text, $tagEndPos +
1 );
419 // <includeonly> and <noinclude> just become <ignore> tags
420 if ( in_array( $lowerName, $ignoredElements ) ) {
421 $accum->addNodeWithText( 'ignore', substr( $text, $tagStartPos, $i - $tagStartPos ) );
425 if ( $attrEnd <= $attrStart ) {
428 // Note that the attr element contains the whitespace between name and attribute,
429 // this is necessary for precise reconstruction during pre-save transform.
430 $attr = substr( $text, $attrStart, $attrEnd - $attrStart );
433 $extNode = new PPNode_Hash_Tree( 'ext' );
434 $extNode->addChild( PPNode_Hash_Tree
::newWithText( 'name', $name ) );
435 $extNode->addChild( PPNode_Hash_Tree
::newWithText( 'attr', $attr ) );
436 if ( $inner !== null ) {
437 $extNode->addChild( PPNode_Hash_Tree
::newWithText( 'inner', $inner ) );
439 if ( $close !== null ) {
440 $extNode->addChild( PPNode_Hash_Tree
::newWithText( 'close', $close ) );
442 $accum->addNode( $extNode );
443 } elseif ( $found == 'line-start' ) {
444 // Is this the start of a heading?
445 // Line break belongs before the heading element in any case
446 if ( $fakeLineStart ) {
447 $fakeLineStart = false;
449 $accum->addLiteral( $curChar );
453 $count = strspn( $text, '=', $i, 6 );
454 if ( $count == 1 && $findEquals ) {
455 // DWIM: This looks kind of like a name/value separator
456 // Let's let the equals handler have it and break the potential heading
457 // This is heuristic, but AFAICT the methods for completely correct disambiguation are very complex.
458 } elseif ( $count > 0 ) {
462 'parts' => array( new PPDPart_Hash( str_repeat( '=', $count ) ) ),
465 $stack->push( $piece );
466 $accum =& $stack->getAccum();
467 extract( $stack->getFlags() );
470 } elseif ( $found == 'line-end' ) {
471 $piece = $stack->top
;
472 // A heading must be open, otherwise \n wouldn't have been in the search list
473 assert( '$piece->open == "\n"' );
474 $part = $piece->getCurrentPart();
475 // Search back through the input to see if it has a proper close
476 // Do this using the reversed string since the other solutions (end anchor, etc.) are inefficient
477 $wsLength = strspn( $revText, " \t", $lengthText - $i );
478 $searchStart = $i - $wsLength;
479 if ( isset( $part->commentEnd
) && $searchStart - 1 == $part->commentEnd
) {
480 // Comment found at line end
481 // Search for equals signs before the comment
482 $searchStart = $part->visualEnd
;
483 $searchStart -= strspn( $revText, " \t", $lengthText - $searchStart );
485 $count = $piece->count
;
486 $equalsLength = strspn( $revText, '=', $lengthText - $searchStart );
487 if ( $equalsLength > 0 ) {
488 if ( $searchStart - $equalsLength == $piece->startPos
) {
489 // This is just a single string of equals signs on its own line
490 // Replicate the doHeadings behavior /={count}(.+)={count}/
491 // First find out how many equals signs there really are (don't stop at 6)
492 $count = $equalsLength;
496 $count = min( 6, intval( ( $count - 1 ) / 2 ) );
499 $count = min( $equalsLength, $count );
502 // Normal match, output <h>
503 $element = new PPNode_Hash_Tree( 'possible-h' );
504 $element->addChild( new PPNode_Hash_Attr( 'level', $count ) );
505 $element->addChild( new PPNode_Hash_Attr( 'i', $headingIndex++
) );
506 $element->lastChild
->nextSibling
= $accum->firstNode
;
507 $element->lastChild
= $accum->lastNode
;
509 // Single equals sign on its own line, count=0
513 // No match, no <h>, just pass down the inner text
518 $accum =& $stack->getAccum();
519 extract( $stack->getFlags() );
521 // Append the result to the enclosing accumulator
522 if ( $element instanceof PPNode
) {
523 $accum->addNode( $element );
525 $accum->addAccum( $element );
527 // Note that we do NOT increment the input pointer.
528 // This is because the closing linebreak could be the opening linebreak of
529 // another heading. Infinite loops are avoided because the next iteration MUST
530 // hit the heading open case above, which unconditionally increments the
532 } elseif ( $found == 'open' ) {
533 # count opening brace characters
534 $count = strspn( $text, $curChar, $i );
536 # we need to add to stack only if opening brace count is enough for one of the rules
537 if ( $count >= $rule['min'] ) {
538 # Add it to the stack
541 'close' => $rule['end'],
543 'lineStart' => ( $i > 0 && $text[$i - 1] == "\n" ),
546 $stack->push( $piece );
547 $accum =& $stack->getAccum();
548 extract( $stack->getFlags() );
550 # Add literal brace(s)
551 $accum->addLiteral( str_repeat( $curChar, $count ) );
554 } elseif ( $found == 'close' ) {
555 $piece = $stack->top
;
556 # lets check if there are enough characters for closing brace
557 $maxCount = $piece->count
;
558 $count = strspn( $text, $curChar, $i, $maxCount );
560 # check for maximum matching characters (if there are 5 closing
561 # characters, we will probably need only 3 - depending on the rules)
562 $rule = $rules[$piece->open
];
563 if ( $count > $rule['max'] ) {
564 # The specified maximum exists in the callback array, unless the caller
566 $matchingCount = $rule['max'];
568 # Count is less than the maximum
569 # Skip any gaps in the callback array to find the true largest match
570 # Need to use array_key_exists not isset because the callback can be null
571 $matchingCount = $count;
572 while ( $matchingCount > 0 && !array_key_exists( $matchingCount, $rule['names'] ) ) {
577 if ( $matchingCount <= 0 ) {
578 # No matching element found in callback array
579 # Output a literal closing brace and continue
580 $accum->addLiteral( str_repeat( $curChar, $count ) );
584 $name = $rule['names'][$matchingCount];
585 if ( $name === null ) {
586 // No element, just literal text
587 $element = $piece->breakSyntax( $matchingCount );
588 $element->addLiteral( str_repeat( $rule['end'], $matchingCount ) );
591 # Note: $parts is already XML, does not need to be encoded further
592 $parts = $piece->parts
;
593 $titleAccum = $parts[0]->out
;
596 $element = new PPNode_Hash_Tree( $name );
598 # The invocation is at the start of the line if lineStart is set in
599 # the stack, and all opening brackets are used up.
600 if ( $maxCount == $matchingCount && !empty( $piece->lineStart
) ) {
601 $element->addChild( new PPNode_Hash_Attr( 'lineStart', 1 ) );
603 $titleNode = new PPNode_Hash_Tree( 'title' );
604 $titleNode->firstChild
= $titleAccum->firstNode
;
605 $titleNode->lastChild
= $titleAccum->lastNode
;
606 $element->addChild( $titleNode );
608 foreach ( $parts as $part ) {
609 if ( isset( $part->eqpos
) ) {
612 for ( $node = $part->out
->firstNode
; $node; $node = $node->nextSibling
) {
613 if ( $node === $part->eqpos
) {
620 wfProfileOut( __METHOD__
. '-cache-miss' );
621 wfProfileOut( __METHOD__
. '-cacheable' );
623 wfProfileOut( __METHOD__
);
624 throw new MWException( __METHOD__
. ': eqpos not found' );
626 if ( $node->name
!== 'equals' ) {
628 wfProfileOut( __METHOD__
. '-cache-miss' );
629 wfProfileOut( __METHOD__
. '-cacheable' );
631 wfProfileOut( __METHOD__
);
632 throw new MWException( __METHOD__
. ': eqpos is not equals' );
636 // Construct name node
637 $nameNode = new PPNode_Hash_Tree( 'name' );
638 if ( $lastNode !== false ) {
639 $lastNode->nextSibling
= false;
640 $nameNode->firstChild
= $part->out
->firstNode
;
641 $nameNode->lastChild
= $lastNode;
644 // Construct value node
645 $valueNode = new PPNode_Hash_Tree( 'value' );
646 if ( $equalsNode->nextSibling
!== false ) {
647 $valueNode->firstChild
= $equalsNode->nextSibling
;
648 $valueNode->lastChild
= $part->out
->lastNode
;
650 $partNode = new PPNode_Hash_Tree( 'part' );
651 $partNode->addChild( $nameNode );
652 $partNode->addChild( $equalsNode->firstChild
);
653 $partNode->addChild( $valueNode );
654 $element->addChild( $partNode );
656 $partNode = new PPNode_Hash_Tree( 'part' );
657 $nameNode = new PPNode_Hash_Tree( 'name' );
658 $nameNode->addChild( new PPNode_Hash_Attr( 'index', $argIndex++
) );
659 $valueNode = new PPNode_Hash_Tree( 'value' );
660 $valueNode->firstChild
= $part->out
->firstNode
;
661 $valueNode->lastChild
= $part->out
->lastNode
;
662 $partNode->addChild( $nameNode );
663 $partNode->addChild( $valueNode );
664 $element->addChild( $partNode );
669 # Advance input pointer
670 $i +
= $matchingCount;
674 $accum =& $stack->getAccum();
676 # Re-add the old stack element if it still has unmatched opening characters remaining
677 if ( $matchingCount < $piece->count
) {
678 $piece->parts
= array( new PPDPart_Hash
);
679 $piece->count
-= $matchingCount;
680 # do we still qualify for any callback with remaining count?
681 $min = $rules[$piece->open
]['min'];
682 if ( $piece->count
>= $min ) {
683 $stack->push( $piece );
684 $accum =& $stack->getAccum();
686 $accum->addLiteral( str_repeat( $piece->open
, $piece->count
) );
690 extract( $stack->getFlags() );
692 # Add XML element to the enclosing accumulator
693 if ( $element instanceof PPNode
) {
694 $accum->addNode( $element );
696 $accum->addAccum( $element );
698 } elseif ( $found == 'pipe' ) {
699 $findEquals = true; // shortcut for getFlags()
701 $accum =& $stack->getAccum();
703 } elseif ( $found == 'equals' ) {
704 $findEquals = false; // shortcut for getFlags()
705 $accum->addNodeWithText( 'equals', '=' );
706 $stack->getCurrentPart()->eqpos
= $accum->lastNode
;
711 # Output any remaining unclosed brackets
712 foreach ( $stack->stack
as $piece ) {
713 $stack->rootAccum
->addAccum( $piece->breakSyntax() );
716 # Enable top-level headings
717 for ( $node = $stack->rootAccum
->firstNode
; $node; $node = $node->nextSibling
) {
718 if ( isset( $node->name
) && $node->name
=== 'possible-h' ) {
723 $rootNode = new PPNode_Hash_Tree( 'root' );
724 $rootNode->firstChild
= $stack->rootAccum
->firstNode
;
725 $rootNode->lastChild
= $stack->rootAccum
->lastNode
;
729 $cacheValue = sprintf( "%08d", self
::CACHE_VERSION
) . serialize( $rootNode );
730 $wgMemc->set( $cacheKey, $cacheValue, 86400 );
731 wfProfileOut( __METHOD__
. '-cache-miss' );
732 wfProfileOut( __METHOD__
. '-cacheable' );
733 wfDebugLog( "Preprocessor", "Saved preprocessor Hash to memcached (key $cacheKey)" );
736 wfProfileOut( __METHOD__
);
742 * Stack class to help Preprocessor::preprocessToObj()
745 class PPDStack_Hash
extends PPDStack
{
746 function __construct() {
747 $this->elementClass
= 'PPDStackElement_Hash';
748 parent
::__construct();
749 $this->rootAccum
= new PPDAccum_Hash
;
756 class PPDStackElement_Hash
extends PPDStackElement
{
757 function __construct( $data = array() ) {
758 $this->partClass
= 'PPDPart_Hash';
759 parent
::__construct( $data );
763 * Get the accumulator that would result if the close is not found.
765 * @return PPDAccum_Hash
767 function breakSyntax( $openingCount = false ) {
768 if ( $this->open
== "\n" ) {
769 $accum = $this->parts
[0]->out
;
771 if ( $openingCount === false ) {
772 $openingCount = $this->count
;
774 $accum = new PPDAccum_Hash
;
775 $accum->addLiteral( str_repeat( $this->open
, $openingCount ) );
777 foreach ( $this->parts
as $part ) {
781 $accum->addLiteral( '|' );
783 $accum->addAccum( $part->out
);
793 class PPDPart_Hash
extends PPDPart
{
794 function __construct( $out = '' ) {
795 $accum = new PPDAccum_Hash
;
797 $accum->addLiteral( $out );
799 parent
::__construct( $accum );
806 class PPDAccum_Hash
{
807 var $firstNode, $lastNode;
809 function __construct() {
810 $this->firstNode
= $this->lastNode
= false;
814 * Append a string literal
816 function addLiteral( $s ) {
817 if ( $this->lastNode
=== false ) {
818 $this->firstNode
= $this->lastNode
= new PPNode_Hash_Text( $s );
819 } elseif ( $this->lastNode
instanceof PPNode_Hash_Text
) {
820 $this->lastNode
->value
.= $s;
822 $this->lastNode
->nextSibling
= new PPNode_Hash_Text( $s );
823 $this->lastNode
= $this->lastNode
->nextSibling
;
830 function addNode( PPNode
$node ) {
831 if ( $this->lastNode
=== false ) {
832 $this->firstNode
= $this->lastNode
= $node;
834 $this->lastNode
->nextSibling
= $node;
835 $this->lastNode
= $node;
840 * Append a tree node with text contents
842 function addNodeWithText( $name, $value ) {
843 $node = PPNode_Hash_Tree
::newWithText( $name, $value );
844 $this->addNode( $node );
848 * Append a PPAccum_Hash
849 * Takes over ownership of the nodes in the source argument. These nodes may
850 * subsequently be modified, especially nextSibling.
852 function addAccum( $accum ) {
853 if ( $accum->lastNode
=== false ) {
855 } elseif ( $this->lastNode
=== false ) {
856 $this->firstNode
= $accum->firstNode
;
857 $this->lastNode
= $accum->lastNode
;
859 $this->lastNode
->nextSibling
= $accum->firstNode
;
860 $this->lastNode
= $accum->lastNode
;
866 * An expansion frame, used as a context to expand the result of preprocessToObj()
869 class PPFrame_Hash
implements PPFrame
{
888 * Hashtable listing templates which are disallowed for expansion in this frame,
889 * having been encountered previously in parent frames.
894 * Recursion depth of this frame, top = 0
895 * Note that this is NOT the same as expansion depth in expand()
900 * Construct a new preprocessor frame.
901 * @param $preprocessor Preprocessor: the parent preprocessor
903 function __construct( $preprocessor ) {
904 $this->preprocessor
= $preprocessor;
905 $this->parser
= $preprocessor->parser
;
906 $this->title
= $this->parser
->mTitle
;
907 $this->titleCache
= array( $this->title ?
$this->title
->getPrefixedDBkey() : false );
908 $this->loopCheckHash
= array();
913 * Create a new child frame
914 * $args is optionally a multi-root PPNode or array containing the template arguments
916 * @param array|bool|\PPNode_Hash_Array $args PPNode_Hash_Array|array
917 * @param $title Title|bool
919 * @param int $indexOffset
920 * @throws MWException
921 * @return PPTemplateFrame_Hash
923 function newChild( $args = false, $title = false, $indexOffset = 0 ) {
924 $namedArgs = array();
925 $numberedArgs = array();
926 if ( $title === false ) {
927 $title = $this->title
;
929 if ( $args !== false ) {
930 if ( $args instanceof PPNode_Hash_Array
) {
931 $args = $args->value
;
932 } elseif ( !is_array( $args ) ) {
933 throw new MWException( __METHOD__
. ': $args must be array or PPNode_Hash_Array' );
935 foreach ( $args as $arg ) {
936 $bits = $arg->splitArg();
937 if ( $bits['index'] !== '' ) {
938 // Numbered parameter
939 $index = $bits['index'] - $indexOffset;
940 $numberedArgs[$index] = $bits['value'];
941 unset( $namedArgs[$index] );
944 $name = trim( $this->expand( $bits['name'], PPFrame
::STRIP_COMMENTS
) );
945 $namedArgs[$name] = $bits['value'];
946 unset( $numberedArgs[$name] );
950 return new PPTemplateFrame_Hash( $this->preprocessor
, $this, $numberedArgs, $namedArgs, $title );
954 * @throws MWException
959 function expand( $root, $flags = 0 ) {
960 static $expansionDepth = 0;
961 if ( is_string( $root ) ) {
965 if ( ++
$this->parser
->mPPNodeCount
> $this->parser
->mOptions
->getMaxPPNodeCount() ) {
966 $this->parser
->limitationWarn( 'node-count-exceeded',
967 $this->parser
->mPPNodeCount
,
968 $this->parser
->mOptions
->getMaxPPNodeCount()
970 return '<span class="error">Node-count limit exceeded</span>';
972 if ( $expansionDepth > $this->parser
->mOptions
->getMaxPPExpandDepth() ) {
973 $this->parser
->limitationWarn( 'expansion-depth-exceeded',
975 $this->parser
->mOptions
->getMaxPPExpandDepth()
977 return '<span class="error">Expansion depth limit exceeded</span>';
980 if ( $expansionDepth > $this->parser
->mHighestExpansionDepth
) {
981 $this->parser
->mHighestExpansionDepth
= $expansionDepth;
984 $outStack = array( '', '' );
985 $iteratorStack = array( false, $root );
986 $indexStack = array( 0, 0 );
988 while ( count( $iteratorStack ) > 1 ) {
989 $level = count( $outStack ) - 1;
990 $iteratorNode =& $iteratorStack[$level];
991 $out =& $outStack[$level];
992 $index =& $indexStack[$level];
994 if ( is_array( $iteratorNode ) ) {
995 if ( $index >= count( $iteratorNode ) ) {
996 // All done with this iterator
997 $iteratorStack[$level] = false;
998 $contextNode = false;
1000 $contextNode = $iteratorNode[$index];
1003 } elseif ( $iteratorNode instanceof PPNode_Hash_Array
) {
1004 if ( $index >= $iteratorNode->getLength() ) {
1005 // All done with this iterator
1006 $iteratorStack[$level] = false;
1007 $contextNode = false;
1009 $contextNode = $iteratorNode->item( $index );
1013 // Copy to $contextNode and then delete from iterator stack,
1014 // because this is not an iterator but we do have to execute it once
1015 $contextNode = $iteratorStack[$level];
1016 $iteratorStack[$level] = false;
1019 $newIterator = false;
1021 if ( $contextNode === false ) {
1023 } elseif ( is_string( $contextNode ) ) {
1024 $out .= $contextNode;
1025 } elseif ( is_array( $contextNode ) ||
$contextNode instanceof PPNode_Hash_Array
) {
1026 $newIterator = $contextNode;
1027 } elseif ( $contextNode instanceof PPNode_Hash_Attr
) {
1029 } elseif ( $contextNode instanceof PPNode_Hash_Text
) {
1030 $out .= $contextNode->value
;
1031 } elseif ( $contextNode instanceof PPNode_Hash_Tree
) {
1032 if ( $contextNode->name
== 'template' ) {
1033 # Double-brace expansion
1034 $bits = $contextNode->splitTemplate();
1035 if ( $flags & PPFrame
::NO_TEMPLATES
) {
1036 $newIterator = $this->virtualBracketedImplode( '{{', '|', '}}', $bits['title'], $bits['parts'] );
1038 $ret = $this->parser
->braceSubstitution( $bits, $this );
1039 if ( isset( $ret['object'] ) ) {
1040 $newIterator = $ret['object'];
1042 $out .= $ret['text'];
1045 } elseif ( $contextNode->name
== 'tplarg' ) {
1046 # Triple-brace expansion
1047 $bits = $contextNode->splitTemplate();
1048 if ( $flags & PPFrame
::NO_ARGS
) {
1049 $newIterator = $this->virtualBracketedImplode( '{{{', '|', '}}}', $bits['title'], $bits['parts'] );
1051 $ret = $this->parser
->argSubstitution( $bits, $this );
1052 if ( isset( $ret['object'] ) ) {
1053 $newIterator = $ret['object'];
1055 $out .= $ret['text'];
1058 } elseif ( $contextNode->name
== 'comment' ) {
1059 # HTML-style comment
1060 # Remove it in HTML, pre+remove and STRIP_COMMENTS modes
1061 if ( $this->parser
->ot
['html']
1062 ||
( $this->parser
->ot
['pre'] && $this->parser
->mOptions
->getRemoveComments() )
1063 ||
( $flags & PPFrame
::STRIP_COMMENTS
)
1066 } elseif ( $this->parser
->ot
['wiki'] && !( $flags & PPFrame
::RECOVER_COMMENTS
) ) {
1067 # Add a strip marker in PST mode so that pstPass2() can run some old-fashioned regexes on the result
1068 # Not in RECOVER_COMMENTS mode (extractSections) though
1069 $out .= $this->parser
->insertStripItem( $contextNode->firstChild
->value
);
1071 # Recover the literal comment in RECOVER_COMMENTS and pre+no-remove
1072 $out .= $contextNode->firstChild
->value
;
1074 } elseif ( $contextNode->name
== 'ignore' ) {
1075 # Output suppression used by <includeonly> etc.
1076 # OT_WIKI will only respect <ignore> in substed templates.
1077 # The other output types respect it unless NO_IGNORE is set.
1078 # extractSections() sets NO_IGNORE and so never respects it.
1079 if ( ( !isset( $this->parent
) && $this->parser
->ot
['wiki'] ) ||
( $flags & PPFrame
::NO_IGNORE
) ) {
1080 $out .= $contextNode->firstChild
->value
;
1084 } elseif ( $contextNode->name
== 'ext' ) {
1086 $bits = $contextNode->splitExt() +
array( 'attr' => null, 'inner' => null, 'close' => null );
1087 $out .= $this->parser
->extensionSubstitution( $bits, $this );
1088 } elseif ( $contextNode->name
== 'h' ) {
1090 if ( $this->parser
->ot
['html'] ) {
1091 # Expand immediately and insert heading index marker
1093 for ( $node = $contextNode->firstChild
; $node; $node = $node->nextSibling
) {
1094 $s .= $this->expand( $node, $flags );
1097 $bits = $contextNode->splitHeading();
1098 $titleText = $this->title
->getPrefixedDBkey();
1099 $this->parser
->mHeadings
[] = array( $titleText, $bits['i'] );
1100 $serial = count( $this->parser
->mHeadings
) - 1;
1101 $marker = "{$this->parser->mUniqPrefix}-h-$serial-" . Parser
::MARKER_SUFFIX
;
1102 $s = substr( $s, 0, $bits['level'] ) . $marker . substr( $s, $bits['level'] );
1103 $this->parser
->mStripState
->addGeneral( $marker, '' );
1106 # Expand in virtual stack
1107 $newIterator = $contextNode->getChildren();
1110 # Generic recursive expansion
1111 $newIterator = $contextNode->getChildren();
1114 throw new MWException( __METHOD__
. ': Invalid parameter type' );
1117 if ( $newIterator !== false ) {
1119 $iteratorStack[] = $newIterator;
1121 } elseif ( $iteratorStack[$level] === false ) {
1122 // Return accumulated value to parent
1123 // With tail recursion
1124 while ( $iteratorStack[$level] === false && $level > 0 ) {
1125 $outStack[$level - 1] .= $out;
1126 array_pop( $outStack );
1127 array_pop( $iteratorStack );
1128 array_pop( $indexStack );
1134 return $outStack[0];
1142 function implodeWithFlags( $sep, $flags /*, ... */ ) {
1143 $args = array_slice( func_get_args(), 2 );
1147 foreach ( $args as $root ) {
1148 if ( $root instanceof PPNode_Hash_Array
) {
1149 $root = $root->value
;
1151 if ( !is_array( $root ) ) {
1152 $root = array( $root );
1154 foreach ( $root as $node ) {
1160 $s .= $this->expand( $node, $flags );
1167 * Implode with no flags specified
1168 * This previously called implodeWithFlags but has now been inlined to reduce stack depth
1171 function implode( $sep /*, ... */ ) {
1172 $args = array_slice( func_get_args(), 1 );
1176 foreach ( $args as $root ) {
1177 if ( $root instanceof PPNode_Hash_Array
) {
1178 $root = $root->value
;
1180 if ( !is_array( $root ) ) {
1181 $root = array( $root );
1183 foreach ( $root as $node ) {
1189 $s .= $this->expand( $node );
1196 * Makes an object that, when expand()ed, will be the same as one obtained
1199 * @return PPNode_Hash_Array
1201 function virtualImplode( $sep /*, ... */ ) {
1202 $args = array_slice( func_get_args(), 1 );
1206 foreach ( $args as $root ) {
1207 if ( $root instanceof PPNode_Hash_Array
) {
1208 $root = $root->value
;
1210 if ( !is_array( $root ) ) {
1211 $root = array( $root );
1213 foreach ( $root as $node ) {
1222 return new PPNode_Hash_Array( $out );
1226 * Virtual implode with brackets
1228 * @return PPNode_Hash_Array
1230 function virtualBracketedImplode( $start, $sep, $end /*, ... */ ) {
1231 $args = array_slice( func_get_args(), 3 );
1232 $out = array( $start );
1235 foreach ( $args as $root ) {
1236 if ( $root instanceof PPNode_Hash_Array
) {
1237 $root = $root->value
;
1239 if ( !is_array( $root ) ) {
1240 $root = array( $root );
1242 foreach ( $root as $node ) {
1252 return new PPNode_Hash_Array( $out );
1255 function __toString() {
1260 * @param $level bool
1261 * @return array|bool|String
1263 function getPDBK( $level = false ) {
1264 if ( $level === false ) {
1265 return $this->title
->getPrefixedDBkey();
1267 return isset( $this->titleCache
[$level] ) ?
$this->titleCache
[$level] : false;
1274 function getArguments() {
1281 function getNumberedArguments() {
1288 function getNamedArguments() {
1293 * Returns true if there are no arguments in this frame
1297 function isEmpty() {
1305 function getArgument( $name ) {
1310 * Returns true if the infinite loop check is OK, false if a loop is detected
1312 * @param $title Title
1316 function loopCheck( $title ) {
1317 return !isset( $this->loopCheckHash
[$title->getPrefixedDBkey()] );
1321 * Return true if the frame is a template frame
1325 function isTemplate() {
1330 * Get a title of frame
1334 function getTitle() {
1335 return $this->title
;
1340 * Expansion frame with template arguments
1343 class PPTemplateFrame_Hash
extends PPFrame_Hash
{
1344 var $numberedArgs, $namedArgs, $parent;
1345 var $numberedExpansionCache, $namedExpansionCache;
1348 * @param $preprocessor
1350 * @param $numberedArgs array
1351 * @param $namedArgs array
1352 * @param $title Title
1354 function __construct( $preprocessor, $parent = false, $numberedArgs = array(), $namedArgs = array(), $title = false ) {
1355 parent
::__construct( $preprocessor );
1357 $this->parent
= $parent;
1358 $this->numberedArgs
= $numberedArgs;
1359 $this->namedArgs
= $namedArgs;
1360 $this->title
= $title;
1361 $pdbk = $title ?
$title->getPrefixedDBkey() : false;
1362 $this->titleCache
= $parent->titleCache
;
1363 $this->titleCache
[] = $pdbk;
1364 $this->loopCheckHash
= /*clone*/ $parent->loopCheckHash
;
1365 if ( $pdbk !== false ) {
1366 $this->loopCheckHash
[$pdbk] = true;
1368 $this->depth
= $parent->depth +
1;
1369 $this->numberedExpansionCache
= $this->namedExpansionCache
= array();
1372 function __toString() {
1375 $args = $this->numberedArgs +
$this->namedArgs
;
1376 foreach ( $args as $name => $value ) {
1382 $s .= "\"$name\":\"" .
1383 str_replace( '"', '\\"', $value->__toString() ) . '"';
1390 * Returns true if there are no arguments in this frame
1394 function isEmpty() {
1395 return !count( $this->numberedArgs
) && !count( $this->namedArgs
);
1401 function getArguments() {
1402 $arguments = array();
1403 foreach ( array_merge(
1404 array_keys( $this->numberedArgs
),
1405 array_keys( $this->namedArgs
) ) as $key ) {
1406 $arguments[$key] = $this->getArgument( $key );
1414 function getNumberedArguments() {
1415 $arguments = array();
1416 foreach ( array_keys( $this->numberedArgs
) as $key ) {
1417 $arguments[$key] = $this->getArgument( $key );
1425 function getNamedArguments() {
1426 $arguments = array();
1427 foreach ( array_keys( $this->namedArgs
) as $key ) {
1428 $arguments[$key] = $this->getArgument( $key );
1435 * @return array|bool
1437 function getNumberedArgument( $index ) {
1438 if ( !isset( $this->numberedArgs
[$index] ) ) {
1441 if ( !isset( $this->numberedExpansionCache
[$index] ) ) {
1442 # No trimming for unnamed arguments
1443 $this->numberedExpansionCache
[$index] = $this->parent
->expand( $this->numberedArgs
[$index], PPFrame
::STRIP_COMMENTS
);
1445 return $this->numberedExpansionCache
[$index];
1452 function getNamedArgument( $name ) {
1453 if ( !isset( $this->namedArgs
[$name] ) ) {
1456 if ( !isset( $this->namedExpansionCache
[$name] ) ) {
1457 # Trim named arguments post-expand, for backwards compatibility
1458 $this->namedExpansionCache
[$name] = trim(
1459 $this->parent
->expand( $this->namedArgs
[$name], PPFrame
::STRIP_COMMENTS
) );
1461 return $this->namedExpansionCache
[$name];
1466 * @return array|bool
1468 function getArgument( $name ) {
1469 $text = $this->getNumberedArgument( $name );
1470 if ( $text === false ) {
1471 $text = $this->getNamedArgument( $name );
1477 * Return true if the frame is a template frame
1481 function isTemplate() {
1487 * Expansion frame with custom arguments
1490 class PPCustomFrame_Hash
extends PPFrame_Hash
{
1493 function __construct( $preprocessor, $args ) {
1494 parent
::__construct( $preprocessor );
1495 $this->args
= $args;
1498 function __toString() {
1501 foreach ( $this->args
as $name => $value ) {
1507 $s .= "\"$name\":\"" .
1508 str_replace( '"', '\\"', $value->__toString() ) . '"';
1517 function isEmpty() {
1518 return !count( $this->args
);
1525 function getArgument( $index ) {
1526 if ( !isset( $this->args
[$index] ) ) {
1529 return $this->args
[$index];
1532 function getArguments() {
1540 class PPNode_Hash_Tree
implements PPNode
{
1541 var $name, $firstChild, $lastChild, $nextSibling;
1543 function __construct( $name ) {
1544 $this->name
= $name;
1545 $this->firstChild
= $this->lastChild
= $this->nextSibling
= false;
1548 function __toString() {
1551 for ( $node = $this->firstChild
; $node; $node = $node->nextSibling
) {
1552 if ( $node instanceof PPNode_Hash_Attr
) {
1553 $attribs .= ' ' . $node->name
. '="' . htmlspecialchars( $node->value
) . '"';
1555 $inner .= $node->__toString();
1558 if ( $inner === '' ) {
1559 return "<{$this->name}$attribs/>";
1561 return "<{$this->name}$attribs>$inner</{$this->name}>";
1568 * @return PPNode_Hash_Tree
1570 static function newWithText( $name, $text ) {
1571 $obj = new self( $name );
1572 $obj->addChild( new PPNode_Hash_Text( $text ) );
1576 function addChild( $node ) {
1577 if ( $this->lastChild
=== false ) {
1578 $this->firstChild
= $this->lastChild
= $node;
1580 $this->lastChild
->nextSibling
= $node;
1581 $this->lastChild
= $node;
1586 * @return PPNode_Hash_Array
1588 function getChildren() {
1589 $children = array();
1590 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1591 $children[] = $child;
1593 return new PPNode_Hash_Array( $children );
1596 function getFirstChild() {
1597 return $this->firstChild
;
1600 function getNextSibling() {
1601 return $this->nextSibling
;
1604 function getChildrenOfType( $name ) {
1605 $children = array();
1606 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1607 if ( isset( $child->name
) && $child->name
=== $name ) {
1608 $children[] = $child;
1617 function getLength() {
1625 function item( $i ) {
1632 function getName() {
1637 * Split a "<part>" node into an associative array containing:
1638 * - name PPNode name
1639 * - index String index
1640 * - value PPNode value
1642 * @throws MWException
1645 function splitArg() {
1647 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1648 if ( !isset( $child->name
) ) {
1651 if ( $child->name
=== 'name' ) {
1652 $bits['name'] = $child;
1653 if ( $child->firstChild
instanceof PPNode_Hash_Attr
1654 && $child->firstChild
->name
=== 'index'
1656 $bits['index'] = $child->firstChild
->value
;
1658 } elseif ( $child->name
=== 'value' ) {
1659 $bits['value'] = $child;
1663 if ( !isset( $bits['name'] ) ) {
1664 throw new MWException( 'Invalid brace node passed to ' . __METHOD__
);
1666 if ( !isset( $bits['index'] ) ) {
1667 $bits['index'] = '';
1673 * Split an "<ext>" node into an associative array containing name, attr, inner and close
1674 * All values in the resulting array are PPNodes. Inner and close are optional.
1676 * @throws MWException
1679 function splitExt() {
1681 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1682 if ( !isset( $child->name
) ) {
1685 if ( $child->name
== 'name' ) {
1686 $bits['name'] = $child;
1687 } elseif ( $child->name
== 'attr' ) {
1688 $bits['attr'] = $child;
1689 } elseif ( $child->name
== 'inner' ) {
1690 $bits['inner'] = $child;
1691 } elseif ( $child->name
== 'close' ) {
1692 $bits['close'] = $child;
1695 if ( !isset( $bits['name'] ) ) {
1696 throw new MWException( 'Invalid ext node passed to ' . __METHOD__
);
1702 * Split an "<h>" node
1704 * @throws MWException
1707 function splitHeading() {
1708 if ( $this->name
!== 'h' ) {
1709 throw new MWException( 'Invalid h node passed to ' . __METHOD__
);
1712 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1713 if ( !isset( $child->name
) ) {
1716 if ( $child->name
== 'i' ) {
1717 $bits['i'] = $child->value
;
1718 } elseif ( $child->name
== 'level' ) {
1719 $bits['level'] = $child->value
;
1722 if ( !isset( $bits['i'] ) ) {
1723 throw new MWException( 'Invalid h node passed to ' . __METHOD__
);
1729 * Split a "<template>" or "<tplarg>" node
1731 * @throws MWException
1734 function splitTemplate() {
1736 $bits = array( 'lineStart' => '' );
1737 for ( $child = $this->firstChild
; $child; $child = $child->nextSibling
) {
1738 if ( !isset( $child->name
) ) {
1741 if ( $child->name
== 'title' ) {
1742 $bits['title'] = $child;
1744 if ( $child->name
== 'part' ) {
1747 if ( $child->name
== 'lineStart' ) {
1748 $bits['lineStart'] = '1';
1751 if ( !isset( $bits['title'] ) ) {
1752 throw new MWException( 'Invalid node passed to ' . __METHOD__
);
1754 $bits['parts'] = new PPNode_Hash_Array( $parts );
1762 class PPNode_Hash_Text
implements PPNode
{
1763 var $value, $nextSibling;
1765 function __construct( $value ) {
1766 if ( is_object( $value ) ) {
1767 throw new MWException( __CLASS__
. ' given object instead of string' );
1769 $this->value
= $value;
1772 function __toString() {
1773 return htmlspecialchars( $this->value
);
1776 function getNextSibling() {
1777 return $this->nextSibling
;
1780 function getChildren() { return false; }
1781 function getFirstChild() { return false; }
1782 function getChildrenOfType( $name ) { return false; }
1783 function getLength() { return false; }
1784 function item( $i ) { return false; }
1785 function getName() { return '#text'; }
1786 function splitArg() { throw new MWException( __METHOD__
. ': not supported' ); }
1787 function splitExt() { throw new MWException( __METHOD__
. ': not supported' ); }
1788 function splitHeading() { throw new MWException( __METHOD__
. ': not supported' ); }
1794 class PPNode_Hash_Array
implements PPNode
{
1795 var $value, $nextSibling;
1797 function __construct( $value ) {
1798 $this->value
= $value;
1801 function __toString() {
1802 return var_export( $this, true );
1805 function getLength() {
1806 return count( $this->value
);
1809 function item( $i ) {
1810 return $this->value
[$i];
1813 function getName() { return '#nodelist'; }
1815 function getNextSibling() {
1816 return $this->nextSibling
;
1819 function getChildren() { return false; }
1820 function getFirstChild() { return false; }
1821 function getChildrenOfType( $name ) { return false; }
1822 function splitArg() { throw new MWException( __METHOD__
. ': not supported' ); }
1823 function splitExt() { throw new MWException( __METHOD__
. ': not supported' ); }
1824 function splitHeading() { throw new MWException( __METHOD__
. ': not supported' ); }
1830 class PPNode_Hash_Attr
implements PPNode
{
1831 var $name, $value, $nextSibling;
1833 function __construct( $name, $value ) {
1834 $this->name
= $name;
1835 $this->value
= $value;
1838 function __toString() {
1839 return "<@{$this->name}>" . htmlspecialchars( $this->value
) . "</@{$this->name}>";
1842 function getName() {
1846 function getNextSibling() {
1847 return $this->nextSibling
;
1850 function getChildren() { return false; }
1851 function getFirstChild() { return false; }
1852 function getChildrenOfType( $name ) { return false; }
1853 function getLength() { return false; }
1854 function item( $i ) { return false; }
1855 function splitArg() { throw new MWException( __METHOD__
. ': not supported' ); }
1856 function splitExt() { throw new MWException( __METHOD__
. ': not supported' ); }
1857 function splitHeading() { throw new MWException( __METHOD__
. ': not supported' ); }