top();
- public abstract String toString();
- public StringBuffer toString(StringBuffer sb) { sb.append(this); return sb; }
+/**
+ *
+ * an element which matches some set of one-token-long input strings
+ * .
+ *
+ *
+ * This class is a topology over itself (yes, this is impredicative).
+ * This means that you can call Atom.union(Atom) and get back an Atom.
+ * If you are interested in the topology of tokens which this
+ * Atom can match, use the getTokenTopology() method.
+ *
+ */
+public abstract class Atom
+ extends Element
+ implements Topology> {
- // Topology Thunks //////////////////////////////////////////////////////////////////////////////
+ /** the set (topology) of tokens that can match this element */
+ public abstract Topology getTokenTopology();
- public Topology unwrap() { return top().unwrap(); }
- public Topology empty() { return top().empty(); }
- public boolean contains(T v) { return top().contains(v); }
- public Topology intersect(Topology t) { return top().intersect(t); }
- public Topology minus(Topology t) { return top().minus(t); }
- public Topology union(Topology t) { return top().union(t); }
- public Topology complement() { return top().complement(); }
- public boolean disjoint(Topology t) { return top().disjoint(t); }
- public boolean containsAll(Topology 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()); }
+ StringBuffer toString(StringBuffer sb) { sb.append(this); return sb; }
}
+