X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FAtom.java;h=a9e89814225a8de049de9e2f062ddad58f09f13b;hp=8c702a14c99f6a302f4c60f279ba88a220e65574;hb=HEAD;hpb=d3a56050406bda802d0dc4b3c24f83cbb0c06620 diff --git a/src/edu/berkeley/sbp/Atom.java b/src/edu/berkeley/sbp/Atom.java index 8c702a1..a9e8981 100644 --- a/src/edu/berkeley/sbp/Atom.java +++ b/src/edu/berkeley/sbp/Atom.java @@ -1,47 +1,29 @@ +// (C) 2006-2007 all rights reserved; see LICENSE file for BSD-style license + package edu.berkeley.sbp; -import java.io.*; -import java.util.*; -import java.lang.reflect.*; -import java.lang.ref.*; import edu.berkeley.sbp.util.*; -import edu.berkeley.sbp.*; -import edu.berkeley.sbp.*; - -/** an element which matches exactly one input token */ -public abstract class Atom extends Element implements Topology { - - private final Topology rt; - - public Atom(Topology rt) { this.rt = rt; } - - Topology top() { return rt; } - void reachable(HashSet h) { /* do-nothing */ } +/** + * + * 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> { + + /** the set (topology) of tokens that can match this element */ + public abstract Topology getTokenTopology(); + + StringBuffer toString(StringBuffer sb) { sb.append(this); return sb; } - /** equality is based on the underlying Topology */ - public int hashCode() { return rt.hashCode(); } - - /** equality is based on the underlying Topology */ - public boolean equals(Object o) { return o != null && o instanceof Atom && ((Atom)o).rt.equals(rt); } - - /** declared abstract to force subclasses to override it in a useful manner */ - public abstract String toString(); - - // Topology Thunks ////////////////////////////////////////////////////////////////////////////// - - public void add(Topology t) { rt.add(t); } - public void add(T t) { rt.add(t); } - public void remove(Topology t) { rt.remove(t); } - public void remove(T t) { rt.remove(t); } - public Topology dup() { return rt.dup(); } - public boolean contains(T v) { return rt.contains(v); } - public Topology fresh() { return rt.fresh(); } - public Topology intersect(Topology t) { return rt.intersect(t); } - public Topology minus(Topology t) { return rt.minus(t); } - public Topology union(Topology t) { return rt.union(t); } - public Topology complement() { return rt.complement(); } - public boolean disjoint(Topology t) { return rt.disjoint(t); } - public boolean containsAll(Topology t) { return rt.containsAll(t); } - } +