1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
<?php
/**
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
* http://www.gnu.org/copyleft/gpl.html
*
* @file
* @ingroup Parser
*/
namespace MediaWiki\Parser;
use RuntimeException;
/**
* Stack class to help Preprocessor::preprocessToObj()
* @ingroup Parser
*/
// phpcs:ignore Squiz.Classes.ValidClassName.NotCamelCaps
class PPDStack_Hash {
/** @var PPDStackElement_Hash[] */
public $stack;
/** @var string[] */
public $rootAccum;
/** @var string[] */
public $accum;
/**
* @var PPDStackElement_Hash|false
*/
public $top;
/** @var string|null */
public $out;
/** @var string */
public $elementClass = PPDStackElement_Hash::class;
public function __construct() {
$this->stack = [];
$this->top = false;
$this->rootAccum = [];
$this->accum =& $this->rootAccum;
}
/**
* @return int
*/
public function count() {
return count( $this->stack );
}
public function &getAccum() {
return $this->accum;
}
/**
* @return false|PPDPart_Hash
*/
public function getCurrentPart() {
if ( $this->top === false ) {
return false;
} else {
return $this->top->getCurrentPart();
}
}
public function push( $data ) {
if ( $data instanceof $this->elementClass ) {
$this->stack[] = $data;
} else {
$class = $this->elementClass;
$this->stack[] = new $class( $data );
}
$this->top = $this->stack[count( $this->stack ) - 1];
$this->accum =& $this->top->getAccum();
}
public function pop() {
if ( $this->stack === [] ) {
throw new RuntimeException( __METHOD__ . ': no elements remaining' );
}
$temp = array_pop( $this->stack );
if ( count( $this->stack ) ) {
$this->top = $this->stack[count( $this->stack ) - 1];
$this->accum =& $this->top->getAccum();
} else {
$this->top = false;
$this->accum =& $this->rootAccum;
}
return $temp;
}
public function addPart( $s = '' ) {
$this->top->addPart( $s );
$this->accum =& $this->top->getAccum();
}
/**
* @return array
*/
public function getFlags() {
if ( $this->stack === [] ) {
return [
'findEquals' => false,
'findPipe' => false,
'inHeading' => false,
];
} else {
return $this->top->getFlags();
}
}
}
/** @deprecated class alias since 1.43 */
class_alias( PPDStack_Hash::class, 'PPDStack_Hash' );
|
