Searched refs:disjointSets (Results 1 – 1 of 1) sorted by relevance
1247 OrderedHashSet<IntervalSet> disjointSets = new OrderedHashSet<IntervalSet>(); in makeEdgeSetsDisjoint() local1252 if ( disjointSets.contains(t) ) { // exact set present in makeEdgeSetsDisjoint()1258 int numDisjointElements = disjointSets.size(); in makeEdgeSetsDisjoint()1260 IntervalSet s_i = (IntervalSet)disjointSets.get(i); in makeEdgeSetsDisjoint()1273 disjointSets.set(i, intersection); in makeEdgeSetsDisjoint()1281 disjointSets.add(existingMinusNewElements); in makeEdgeSetsDisjoint()1293 disjointSets.add(remainder); in makeEdgeSetsDisjoint()1296 return disjointSets.elements(); in makeEdgeSetsDisjoint()