# Path: javadecompiler/Krakatau/ssa/ssa_jumps/goto.py
# class Goto(BaseJump):
#     def __init__(self, parent, target):
#         super(Goto, self).__init__(parent, [])
#         self.successors = [target]
# 
#     def replaceBlocks(self, blockDict):
#         self.successors = [blockDict[key] for key in self.successors]
# 
#     def getNormalSuccessors(self):
#         return self.successors
# 
#     def reduceSuccessors(self, pairsToRemove):
#         if (self.successors[0], False) in pairsToRemove:
#             return None
#         return self


from .base import BaseJump
from .goto import Goto
import collections

class Switch(BaseJump):
    def __init__(self, parent, default, table, arguments):
        super(Switch, self).__init__(parent, arguments)

        #get ordered successors since our map will be unordered. Default is always first successor

# Path: javadecompiler/Krakatau/ssa/ssa_jumps/goto.py
# class Goto(BaseJump):
#     def __init__(self, parent, target):
#         super(Goto, self).__init__(parent, [])
#         self.successors = [target]
# 
#     def replaceBlocks(self, blockDict):
#         self.successors = [blockDict[key] for key in self.successors]
# 
#     def getNormalSuccessors(self):
#         return self.successors
# 
#     def reduceSuccessors(self, pairsToRemove):
#         if (self.successors[0], False) in pairsToRemove:
#             return None
#         return self


# Path: javadecompiler/Krakatau/ssa/ssa_jumps/switch.py
from .base import BaseJump
from .goto import Goto
import collections


class Switch(BaseJump):
    def __init__(self, parent, default, table, arguments):
        super(Switch, self).__init__(parent, arguments)

        #get ordered successors since our map will be unordered. Default is always first successor

        if not table: