pkDependencyGraph); while (sorter.hasNext()) indexedDbEntities.put(sorter.next(), new Integer(index++)); contractedDigraph); while (sorter.hasNext()) { Collection component = (Collection) sorter.next(); for (Iterator i = component.iterator(); i.hasNext();) indexedDbEntities.put(i.next(), new Integer(index++));
pkDependencyGraph); while (sorter.hasNext()) indexedDbEntities.put(sorter.next(), new Integer(index++)); contractedDigraph); while (sorter.hasNext()) { Collection component = (Collection) sorter.next(); for (Iterator i = component.iterator(); i.hasNext();) indexedDbEntities.put(i.next(), new Integer(index++));
int componentIndex = 0; while (sorter.hasNext()) { Collection component = (Collection) sorter.next(); ComponentRecord rec = new ComponentRecord(componentIndex++, component); for (Iterator i = component.iterator(); i.hasNext();) {
int componentIndex = 0; while (sorter.hasNext()) { Collection component = (Collection) sorter.next(); ComponentRecord rec = new ComponentRecord(componentIndex++, component); for (Iterator i = component.iterator(); i.hasNext();) {
private void init(Digraph digraph) { vertexRankMap = new HashMap(digraph.order()); IndegreeTopologicalSort traversal = new IndegreeTopologicalSort(digraph); while (traversal.hasNext()) { Object vertex = traversal.next(); int rank = -1; for (ArcIterator i = digraph.incomingIterator(vertex); i.hasNext(); ) { i.next(); Object predecessor = i.getOrigin(); int predRank = intValue(predecessor); if (predRank < 0) throw new ArithmeticException("Ranking failed."); rank = Math.max(rank, predRank); } rank++; assignRank(vertex, rank); } }
int sortIndex = 0; while (sorter.hasNext()) { indexMap.put(sorter.next(), new Integer(sortIndex++));
DataObject o = (DataObject) sorter.next(); if (o == null) throw new CayenneRuntimeException("Sorting objects for "
DataObject o = (DataObject) sorter.next(); if (o == null) throw new CayenneRuntimeException("Sorting objects for "