CoordinateSet.java

package umontreal.ssj.mcqmctools.anova;
 
import umontreal.ssj.stat.Tally;
 
import java.util.*;

public abstract class CoordinateSet {
 
   public abstract List<Integer> asList();

   public abstract int maxCoordinate();

   public abstract List<CoordinateSet> subsets(boolean includeEmptySet, int maxOrder);
 
   @Override
   public boolean equals(Object o) {
      if (o instanceof CoordinateSet)
         return ((CoordinateSet) o).containsAll(this) && this.containsAll((CoordinateSet) o);
      else
         return false;
   }

   public boolean contains(int coord) {
      return asList().contains(coord);
   }

   public boolean containsAll(CoordinateSet cs) {
      return asList().containsAll(cs.asList());
   }

   public int cardinality() {
      return asList().size();
   }

   public boolean isSubset(CoordinateSet cs) {
      return cs.containsAll(this);
   }

   public List<CoordinateSet> subsets() {
      return subsets(true, Integer.MAX_VALUE);
   }

   public List<CoordinateSet> subsetsNotEmpty() {
      return subsets(false, Integer.MAX_VALUE);
   }

   public List<CoordinateSet> subsets(int maxOrder) {
      return subsets(true, maxOrder);
   }

   public List<CoordinateSet> subsetsNotEmpty(int maxOrder) {
      return subsets(false, maxOrder);
   }
 
   @Override
   public String toString() {
 
      return "{" + toStringNoBraces() + "}";
   }

   public String toStringNoBraces() {
      String s = "";
      for (Integer coord : asList()) {
         if (s.length() > 0)
            s += ",";
         s += (coord + 1);
      }
      return s;
   }
}