modifyHeader($node, 'remove'); case 'clearAllHeaders': return $this->modifyHeader($node, 'replace'); case 'clearRawHeaders': return $this->modifyHeader($node, 'replace'); case '...': return 5; } } } CODE_SAMPLE , <<<'CODE_SAMPLE' class SomeClass { public function run() { switch ($name) { case 'clearHeader': return $this->modifyHeader($node, 'remove'); case 'clearAllHeaders': case 'clearRawHeaders': return $this->modifyHeader($node, 'replace'); case '...': return 5; } } } CODE_SAMPLE )]); } /** * @return array> */ public function getNodeTypes() : array { return [Switch_::class]; } /** * @param Switch_ $node */ public function refactor(Node $node) : ?Node { if (\count($node->cases) < 2) { return null; } $this->hasChanged = \false; $this->removeDuplicatedCases($node); if (!$this->hasChanged) { return null; } return $node; } private function removeDuplicatedCases(Switch_ $switch) : void { $totalKeys = \count($switch->cases); $conds = []; foreach (\array_keys($switch->cases) as $key) { if (isset($switch->cases[$key - 1]) && $switch->cases[$key - 1]->stmts === []) { continue; } $nextCases = []; for ($jumpToKey = $key + 1; $jumpToKey < $totalKeys; ++$jumpToKey) { if (!isset($switch->cases[$jumpToKey])) { continue; } if (!$this->areSwitchStmtsEqualsAndWithBreak($switch->cases[$key], $switch->cases[$jumpToKey])) { continue; } $nextCase = $switch->cases[$jumpToKey]; if (isset($switch->cases[$jumpToKey - 1]) && $switch->cases[$jumpToKey - 1]->stmts === []) { $nextCases[] = $switch->cases[$jumpToKey - 1]; $conds[] = $switch->cases[$jumpToKey - 1]->cond; } unset($switch->cases[$jumpToKey]); $nextCases[] = $nextCase; $this->hasChanged = \true; } if ($nextCases === []) { continue; } \array_splice($switch->cases, $key + 1, 0, $nextCases); for ($jumpToKey = $key; $jumpToKey < $key + \count($nextCases); ++$jumpToKey) { $switch->cases[$jumpToKey]->stmts = []; } $key += \count($nextCases); } foreach ($conds as $keyCond => $cond) { foreach (\array_reverse($switch->cases, \true) as $keyCase => $case) { if ($this->nodeComparator->areNodesEqual($cond, $case->cond)) { unset($switch->cases[$keyCase]); unset($conds[$keyCond]); continue 2; } } } } private function areSwitchStmtsEqualsAndWithBreak(Case_ $currentCase, Case_ $nextCase) : bool { if (!$this->nodeComparator->areNodesEqual($currentCase->stmts, $nextCase->stmts)) { return \false; } foreach ($currentCase->stmts as $stmt) { if ($stmt instanceof Break_) { return \true; } if ($stmt instanceof Return_) { return \true; } } return \false; } }