private void removeExistingPredicates(IntOpenHashSet[] sets, List<PBInstance> list) { for (PBInstance inst : list) { for (IntOpenHashSet set : sets) set.remove(inst.predId); } }
public void pushBack(int id) { s_reduce.remove(id); }
public void pushBack(int id) { s_reduce.remove(id); }
public void pushBack(int id) { s_reduce.remove(id); }
public void pushBack(int id) { s_reduce.remove(id); }
private boolean clearPreviousDependents(DEPNode head) { boolean found = false; DEPNode node; int i; for (i=head.id-1; i>0; i--) { node = d_tree.get(i); if (node.isDependentOf(head)) { node.clearHead(); s_reduce.remove(node.id); found = true; } } return found; } }
set.remove(max.i1); if (set.isEmpty()) remove.add(cur.value);
set.remove(max.i1); if (set.isEmpty()) remove.add(cur.value);
set.remove(max.i1); if (set.isEmpty()) remove.add(cur.value);