ASTNode[] matchingNodes= getNodesToReplace(); ASTNode[][] matchingNodesParents= new ASTNode[matchingNodes.length][]; for (int i= 0; i < matchingNodes.length; i++) { matchingNodesParents[i]= getParents(matchingNodes[i]);
ASTNode[] matchNodes= getMatchNodes();  ASTNode[][] matchingNodesParents= new ASTNode[matchNodes.length][]; for (int i= 0; i < matchNodes.length; i++) { matchingNodesParents[i]= getParents(matchNodes[i]);
	private ASTNode[] findDeepestCommonSuperNodePathForReplacedNodes() throws JavaModelException {		ASTNode[] matchingNodes= getNodesToReplace();		ASTNode[][] matchingNodesParents= new ASTNode[matchingNodes.length][];		for (int i= 0; i < matchingNodes.length; i++) {			matchingNodesParents[i]= getParents(matchingNodes[i]);		}		List l=Arrays.asList(getLongestArrayPrefix(matchingNodesParents));		return (ASTNode[]) l.toArray(new ASTNode[l.size()]);	}