class MemoryEfficientRasUnion extends Union {

  HashSet<PointsToSet> subsets;

  @Override
  public boolean isEmpty() {
    if (subsets != null) {
      for (PointsToSet subset : subsets) {
        if (!subset.isEmpty()) {
          return false;
        }
      }
    }
    return true;
  }

  @Override
  public boolean hasNonEmptyIntersection(PointsToSet other) {<FILL_FUNCTION_BODY>}

  @Override
  public boolean addAll(PointsToSet s) {
    if (subsets == null) {
      subsets = new HashSet<PointsToSet>();
    }

    if (s instanceof MemoryEfficientRasUnion) {
      MemoryEfficientRasUnion meru = (MemoryEfficientRasUnion) s;
      if (meru.subsets == null || this.subsets.containsAll(meru.subsets)) {
        return false;
      }
      return this.subsets.addAll(meru.subsets);
    } else {
      return this.subsets.add(s);
    }

  }

  @Override
  public Object clone() {
    MemoryEfficientRasUnion ret = new MemoryEfficientRasUnion();
    ret.addAll(this);
    return ret;
  }

  @Override
  public Set<Type> possibleTypes() {
    if (subsets == null) {
      return Collections.emptySet();
    } else {
      HashSet<Type> ret = new HashSet<Type>();
      for (PointsToSet subset : subsets) {
        ret.addAll(subset.possibleTypes());
      }
      return ret;
    }
  }

  /**
   * {@inheritDoc}
   */
  @Override
  public int hashCode() {
    final int PRIME = 31;
    int result = 1;
    result = PRIME * result + ((subsets == null) ? 0 : subsets.hashCode());
    return result;
  }

  /**
   * {@inheritDoc}
   */
  @Override
  public boolean equals(Object obj) {
    if (this == obj) {
      return true;
    }
    if (obj == null || this.getClass() != obj.getClass()) {
      return false;
    }
    final MemoryEfficientRasUnion other = (MemoryEfficientRasUnion) obj;
    if (this.subsets == null) {
      if (other.subsets != null) {
        return false;
      }
    } else if (!this.subsets.equals(other.subsets)) {
      return false;
    }
    return true;
  }

  /**
   * {@inheritDoc}
   */
  @Override
  public String toString() {
    return (subsets == null) ? "[]" : subsets.toString();
  }
}

    if (subsets == null) {
      return true;
    }
    for (PointsToSet subset : subsets) {
      if (other instanceof Union) {
        if (other.hasNonEmptyIntersection(subset)) {
          return true;
        }
      } else {
        if (subset.hasNonEmptyIntersection(other)) {
          return true;
        }
      }
    }
    return false;
  
<methods>public non-sealed void <init>() ,public abstract boolean addAll(soot.PointsToSet) ,public static boolean hasNonEmptyIntersection(soot.PointsToSet, soot.PointsToSet) ,public Set<soot.jimple.ClassConstant> possibleClassConstants() ,public Set<java.lang.String> possibleStringConstants() <variables>