|
@@ 1404-1410 (lines=7) @@
|
| 1401 |
|
$tree = $this->parseTree; |
| 1402 |
|
} |
| 1403 |
|
|
| 1404 |
|
if (is_array($tree['left'])) { |
| 1405 |
|
$converted_tree = $this->toReversePolish($tree['left']); |
| 1406 |
|
$polish .= $converted_tree; |
| 1407 |
|
} elseif ($tree['left'] != '') { // It's a final node |
| 1408 |
|
$converted_tree = $this->convert($tree['left']); |
| 1409 |
|
$polish .= $converted_tree; |
| 1410 |
|
} |
| 1411 |
|
if (is_array($tree['right'])) { |
| 1412 |
|
$converted_tree = $this->toReversePolish($tree['right']); |
| 1413 |
|
$polish .= $converted_tree; |
|
@@ 1411-1417 (lines=7) @@
|
| 1408 |
|
$converted_tree = $this->convert($tree['left']); |
| 1409 |
|
$polish .= $converted_tree; |
| 1410 |
|
} |
| 1411 |
|
if (is_array($tree['right'])) { |
| 1412 |
|
$converted_tree = $this->toReversePolish($tree['right']); |
| 1413 |
|
$polish .= $converted_tree; |
| 1414 |
|
} elseif ($tree['right'] != '') { // It's a final node |
| 1415 |
|
$converted_tree = $this->convert($tree['right']); |
| 1416 |
|
$polish .= $converted_tree; |
| 1417 |
|
} |
| 1418 |
|
// if it's a function convert it here (so we can set it's arguments) |
| 1419 |
|
if (preg_match("/^[A-Z0-9\xc0-\xdc\.]+$/", $tree['value']) and |
| 1420 |
|
!preg_match('/^([A-Ia-i]?[A-Za-z])(\d+)$/', $tree['value']) and |
PHPOffice /
PhpSpreadsheet
