Conditions | 8 |
Paths | 9 |
Total Lines | 17 |
Code Lines | 14 |
Lines | 0 |
Ratio | 0 % |
Changes | 0 |
1 | <?php |
||
123 | private function onSpecialType(&$n, &$parent, &$previous, &$emptyLines):bool |
||
124 | { |
||
125 | $deepest = $previous->getDeepestNode(); |
||
126 | switch ($n->type) { |
||
127 | case T::EMPTY: |
||
1 ignored issue
–
show
|
|||
128 | if ($previous->type === T::SCALAR) $emptyLines[] = $n->setParent($previous->getParent()); |
||
1 ignored issue
–
show
|
|||
129 | if (in_array($deepest->type, T::$LITTERALS)) $emptyLines[] = $n->setParent($deepest); |
||
1 ignored issue
–
show
|
|||
130 | return true; |
||
131 | case T::LITTERAL://fall through |
||
1 ignored issue
–
show
|
|||
132 | case T::LITTERAL_FOLDED://var_dump($deepest);exit(); |
||
1 ignored issue
–
show
|
|||
133 | if ($deepest->type === T::KEY && is_null($deepest->value)) { |
||
1 ignored issue
–
show
|
|||
134 | $deepest->add($n); |
||
135 | $previous = $n; |
||
136 | return true; |
||
137 | } |
||
1 ignored issue
–
show
|
|||
138 | default: |
||
1 ignored issue
–
show
|
|||
139 | return false; |
||
140 | } |
||
171 |