(self, node: NodeType, input_state: AnalysisState)
return successors
Add the input state to all successors of the given node.

        :param node:        The node whose successors' input states will be touched.
        :param input_state: The state that will be added to successors of the node.
Add the input state to all successors of the given node.
Add the input state to all successors of the given node .
def _add_input_state(self, node: NodeType, input_state: AnalysisState) -> Set[NodeType]:
        """
        Add the input state to all successors of the given node.

        :param node:        The node whose successors' input states will be touched.
        :param input_state: The state that will be added to successors of the node.
        """

        successors = set(self._graph_visitor.successors(node))
        # successors_to_visit = set()  # a collection of successors whose input states did not reach a fixed point

        for succ in successors:
            # if a node has only one predecessor, we overwrite existing input states
            # otherwise, we add the state as a new input state
            # this is an approximation for removing input states for all nodes that `node` dominates
            if sum(1 for _ in self._graph_visitor.predecessors(succ)) == 1:
                self._input_states[self._node_key(succ)] = [ input_state ]
            else:
                self._input_states[self._node_key(succ)].append(input_state)

        return successors
def _add_input_state ( self , node : NodeType , input_state : AnalysisState ) -> Set [ NodeType ] : successors = set ( self . _graph_visitor . successors ( node ) ) # successors_to_visit = set()  # a collection of successors whose input states did not reach a fixed point for succ in successors : # if a node has only one predecessor, we overwrite existing input states # otherwise, we add the state as a new input state # this is an approximation for removing input states for all nodes that `node` dominates if sum ( 1 for _ in self . _graph_visitor . predecessors ( succ ) ) == 1 : self . _input_states [ self . _node_key ( succ ) ] = [ input_state ] else : self . _input_states [ self . _node_key ( succ ) ] . append ( input_state ) return successors