parameters: (self, ast_node, guards)
return_statement: return node
docstring: Grows the graph by adding a jump node.
  
      Jump nodes are added to the current leaf set, and the leaf set becomes
      empty. If the jump node is the last in a cond section, then it may be added
      back to the leaf set by a separate mechanism.
  
      Args:
        ast_node: ast.AST
        guards: Tuple[ast.AST, ...], the finally sections active for this node
  
      Returns:
        Node
docstring_summary: Grows the graph by adding a jump node.
docstring_tokens: Grows the graph by adding a jump node .
function: def _add_jump_node(self, ast_node, guards):
      """Grows the graph by adding a jump node.
  
      Jump nodes are added to the current leaf set, and the leaf set becomes
      empty. If the jump node is the last in a cond section, then it may be added
      back to the leaf set by a separate mechanism.
  
      Args:
        ast_node: ast.AST
        guards: Tuple[ast.AST, ...], the finally sections active for this node
  
      Returns:
        Node
      """
      node = self._add_new_node(ast_node)
      self.leaves = set()
      # The guards themselves may not yet be complete, and will be wired later.
      self.finally_sections[node] = guards
      return node
function_tokens: def _add_jump_node ( self , ast_node , guards ) : node = self . _add_new_node ( ast_node ) self . leaves = set ( ) # The guards themselves may not yet be complete, and will be wired later. self . finally_sections [ node ] = guards return node