Enumeration enum = nextNode.getInNodes(); return enum.nextElement() == currentNode;
Enumeration inEnum = nextNode.getInNodes(); return inEnum.nextElement() == currentNode;
  public boolean isSingleSuccessor(OPT_SortedGraphNode currentNode,                                    OPT_SortedGraphNode nextNode) {    // check that next node has only 1 predecessor    if (!nextNode.hasOneIn()) return false;    // now check that the predecessor is current node    Enumeration enum = nextNode.getInNodes();    return enum.nextElement() == currentNode;  }  /**   * This method checks to see if the second parameter has a single   * successor, which is the first parameter.   * If this condition is true, data flow analyses can reuse their   * results from the previous iteration rather than perform a meet operation   * (See OPT_LiveAnalysis.java for an example.)   *   * @param currentNode the possibly unique predecessor   * @param nextNode the node of interest   * @return if first parameter is the only succesor of the 2nd parameter   */  public boolean isSinglePredecessor(OPT_SortedGraphNode currentNode,                                      OPT_SortedGraphNode nextNode) {    // check that next node has only 1 successor    if (!nextNode.hasOneOut()) return  false;    // now check that the successor is current node    Enumeration enum = nextNode.getOutNodes();    return enum.nextElement() == currentNode;  }  /**   *  This method keeps track of nodes in the graph that are known to   * not have been visited yet even once. Advance the barrier, if needed    */  private void advanceBarrier() {    if (currentNode != null)      currentNode.setSortMarker(Integer.MIN_VALUE);    if ((currentNode == barrier) && (barrier != null))      barrier = barrier.getSortedNext(forward);  }