src/share/classes/javax/imageio/spi/PartiallyOrderedSet.java

Print this page

        

*** 168,178 **** public PartialOrderIterator(Iterator<DigraphNode<E>> iter) { // Initialize scratch in-degree values, zero list while (iter.hasNext()) { DigraphNode<E> node = iter.next(); int inDegree = node.getInDegree(); ! inDegrees.put(node, new Integer(inDegree)); // Add nodes with zero in-degree to the zero list if (inDegree == 0) { zeroList.add(node); } --- 168,178 ---- public PartialOrderIterator(Iterator<DigraphNode<E>> iter) { // Initialize scratch in-degree values, zero list while (iter.hasNext()) { DigraphNode<E> node = iter.next(); int inDegree = node.getInDegree(); ! inDegrees.put(node, inDegree); // Add nodes with zero in-degree to the zero list if (inDegree == 0) { zeroList.add(node); }
*** 189,199 **** // For each out node of the output node, decrement its in-degree Iterator<DigraphNode<E>> outNodes = first.getOutNodes(); while (outNodes.hasNext()) { DigraphNode<E> node = outNodes.next(); int inDegree = inDegrees.get(node).intValue() - 1; ! inDegrees.put(node, new Integer(inDegree)); // If the in-degree has fallen to 0, place the node on the list if (inDegree == 0) { zeroList.add(node); } --- 189,199 ---- // For each out node of the output node, decrement its in-degree Iterator<DigraphNode<E>> outNodes = first.getOutNodes(); while (outNodes.hasNext()) { DigraphNode<E> node = outNodes.next(); int inDegree = inDegrees.get(node).intValue() - 1; ! inDegrees.put(node, inDegree); // If the in-degree has fallen to 0, place the node on the list if (inDegree == 0) { zeroList.add(node); }