c659bc6308
Bug: T231636 Depends-On: I2cd24e73726394e3200a570c45d5e86b6849bfa9 Depends-On: I4fa3e6aad872434ca397325ed7a83f94973661d0 Change-Id: Ie6233561de78457cae5e4e44e220feec2d1272d8
76 lines
2.1 KiB
PHP
76 lines
2.1 KiB
PHP
<?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
|
|
*/
|
|
|
|
/**
|
|
* @ingroup Parser
|
|
* @property PPDPart_Hash[] $parts
|
|
*/
|
|
// phpcs:ignore Squiz.Classes.ValidClassName.NotCamelCaps
|
|
class PPDStackElement_Hash extends PPDStackElement {
|
|
|
|
public function __construct( $data = [] ) {
|
|
$this->partClass = PPDPart_Hash::class;
|
|
parent::__construct( $data );
|
|
}
|
|
|
|
/**
|
|
* Get the accumulator that would result if the close is not found.
|
|
*
|
|
* @param int|bool $openingCount
|
|
* @return array
|
|
* @suppress PhanParamSignatureMismatch
|
|
*/
|
|
public function breakSyntax( $openingCount = false ) {
|
|
if ( $this->open == "\n" ) {
|
|
$accum = array_merge( [ $this->savedPrefix ], $this->parts[0]->out );
|
|
} else {
|
|
if ( $openingCount === false ) {
|
|
$openingCount = $this->count;
|
|
}
|
|
$s = substr( $this->open, 0, -1 );
|
|
$s .= str_repeat(
|
|
substr( $this->open, -1 ),
|
|
$openingCount - strlen( $s )
|
|
);
|
|
$accum = [ $this->savedPrefix . $s ];
|
|
$lastIndex = 0;
|
|
$first = true;
|
|
foreach ( $this->parts as $part ) {
|
|
if ( $first ) {
|
|
$first = false;
|
|
} elseif ( is_string( $accum[$lastIndex] ) ) {
|
|
$accum[$lastIndex] .= '|';
|
|
} else {
|
|
$accum[++$lastIndex] = '|';
|
|
}
|
|
|
|
foreach ( $part->out as $node ) {
|
|
if ( is_string( $node ) && is_string( $accum[$lastIndex] ) ) {
|
|
$accum[$lastIndex] .= $node;
|
|
} else {
|
|
$accum[++$lastIndex] = $node;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return $accum;
|
|
}
|
|
}
|