Searched refs:disjointSets (Results 1 – 1 of 1) sorted by relevance
1288 OrderedHashSet<IntervalSet> disjointSets = new OrderedHashSet<IntervalSet>(); in makeEdgeSetsDisjoint() local1293 if ( disjointSets.contains(t) ) { // exact set present in makeEdgeSetsDisjoint()1299 int numDisjointElements = disjointSets.size(); in makeEdgeSetsDisjoint()1301 IntervalSet s_i = disjointSets.get(i); in makeEdgeSetsDisjoint()1314 disjointSets.set(i, intersection); in makeEdgeSetsDisjoint()1322 disjointSets.add(existingMinusNewElements); in makeEdgeSetsDisjoint()1334 disjointSets.add(remainder); in makeEdgeSetsDisjoint()1337 return disjointSets.elements(); in makeEdgeSetsDisjoint()