protected FlowSet<Value> newInitialFlow() { FlowSet<Value> newSet = emptySet.clone(); ((ToppedSet<Value>) newSet).setTop(true); return newSet; }
public ToppedSet<T> clone() { ToppedSet<T> newSet = new ToppedSet<T>(underlyingSet.clone()); newSet.setTop(isTop()); return newSet; }
public void intersection(FlowSet<T> o, FlowSet<T> d) { if (isTop()) { o.copy(d); return; } ToppedSet<T> other = (ToppedSet<T>) o, dest = (ToppedSet<T>) d; if (other.isTop()) { copy(dest); return; } else { underlyingSet.intersection(other.underlyingSet, dest.underlyingSet); dest.setTop(false); } }
public void union(FlowSet<T> o, FlowSet<T> d) { if (o instanceof ToppedSet && d instanceof ToppedSet) { ToppedSet<T> other = (ToppedSet<T>) o; ToppedSet<T> dest = (ToppedSet<T>) d; if (isTop()) { copy(dest); return; } if (other.isTop()) { other.copy(dest); } else { underlyingSet.union(other.underlyingSet, dest.underlyingSet); dest.setTop(false); } } else { super.union(o, d); } }
protected Object newInitialFlow() { Object newSet = emptySet.clone(); ((ToppedSet)newSet).setTop(true); return newSet; }
protected Object newInitialFlow() { Object newSet = emptySet.clone(); ((ToppedSet)newSet).setTop(true); return newSet; }
public ToppedSet clone() { ToppedSet newSet = new ToppedSet(underlyingSet.clone()); newSet.setTop(isTop()); return newSet; }
public ToppedSet clone() { ToppedSet newSet = new ToppedSet(underlyingSet.clone()); newSet.setTop(isTop()); return newSet; }
public void intersection(FlowSet o, FlowSet d) { if (isTop()) { o.copy(d); return; } ToppedSet other = (ToppedSet)o, dest = (ToppedSet)d; if (other.isTop()) { copy(dest); return; } else { underlyingSet.intersection(other.underlyingSet, dest.underlyingSet); dest.setTop(false); } }
public void intersection(FlowSet o, FlowSet d) { if (isTop()) { o.copy(d); return; } ToppedSet other = (ToppedSet)o, dest = (ToppedSet)d; if (other.isTop()) { copy(dest); return; } else { underlyingSet.intersection(other.underlyingSet, dest.underlyingSet); dest.setTop(false); } }
public void union(FlowSet o, FlowSet d) { if (o instanceof ToppedSet && d instanceof ToppedSet) { ToppedSet other = (ToppedSet)o; ToppedSet dest = (ToppedSet)d; if (isTop()) { copy(dest); return; } if (other.isTop()) other.copy(dest); else { underlyingSet.union(other.underlyingSet, dest.underlyingSet); dest.setTop(false); } } else super.union(o, d); }
public void union(FlowSet o, FlowSet d) { if (o instanceof ToppedSet && d instanceof ToppedSet) { ToppedSet other = (ToppedSet)o; ToppedSet dest = (ToppedSet)d; if (isTop()) { copy(dest); return; } if (other.isTop()) other.copy(dest); else { underlyingSet.union(other.underlyingSet, dest.underlyingSet); dest.setTop(false); } } else super.union(o, d); }