- public void add(Topology<T> t) { rt.add(t); }
- public void add(T t) { rt.add(t); }
- public void remove(Topology<T> t) { rt.remove(t); }
- public void remove(T t) { rt.remove(t); }
- public Topology<T> dup() { return rt.dup(); }
- public boolean contains(T v) { return rt.contains(v); }
- public Topology<T> fresh() { return rt.fresh(); }
- public Topology<T> intersect(Topology<T> t) { return rt.intersect(t); }
- public Topology<T> minus(Topology<T> t) { return rt.minus(t); }
- public Topology<T> union(Topology<T> t) { return rt.union(t); }
- public Topology<T> complement() { return rt.complement(); }
- public boolean disjoint(Topology<T> t) { return rt.disjoint(t); }
- public boolean containsAll(Topology<T> t) { return rt.containsAll(t); }
+ public Topology<T> unwrap() { return top().unwrap(); }
+ public Topology<T> empty() { return top().empty(); }
+ public boolean contains(T v) { return top().contains(v); }
+ public Topology<T> intersect(Topology<T> t) { return top().intersect(t); }
+ public Topology<T> minus(Topology<T> t) { return top().minus(t); }
+ public Topology<T> union(Topology<T> t) { return top().union(t); }
+ public Topology<T> complement() { return top().complement(); }
+ public boolean disjoint(Topology<T> t) { return top().disjoint(t); }
+ public boolean containsAll(Topology<T> t) { return top().containsAll(t); }
+ public int hashCode() { return top().hashCode(); }
+ public boolean equals(Object o) { return o != null && o instanceof Atom && ((Atom)o).top().equals(top()); }
+
+ // Subclasses //////////////////////////////////////////////////////////////////////////////
+
+ /** an atom which tracks the possible tokenset of some element, provided that element can only match single-token sequences */
+ public static class Infer<T extends Input> extends Atom<T> {
+ private final Element e;
+ public Infer(Element e) { this.e = e; }
+ public Topology<T> top() { return (Topology<T>)toAtom(e); }
+ public String toString() { return e.toString(); }
+ }