package EDU.neu.ccs.demeter.tools.apstudio.graphedit;
import java.awt.*;
import java.io.*;
import java.util.*;
import EDU.neu.ccs.demeter.*;
import EDU.neu.ccs.demeter.common.tg.*;


import EDU.neu.ccs.demeter.*;
class UEdge_List implements java.util.Enumeration, Cloneable {
  protected Nonempty_UEdge_List first;
  public Nonempty_UEdge_List get_first() { return first; }
  public void set_first(Nonempty_UEdge_List new_first)
    { first = new_first; }
  UEdge_List() { super(); }
  public UEdge_List(Nonempty_UEdge_List first) {
    super();
    set_first(first);
  }
  public static UEdge_List parse(java.io.InputStream in) throws ParseException
    { return new Parser(in)._UEdge_List(); }
  public static UEdge_List parse(String s) {
    try { return parse(new java.io.ByteArrayInputStream(s.getBytes())); }
    catch (ParseException e) { throw new RuntimeException(e.toString()); }
  }
  void universal_trv0_bef(UniversalVisitor _v_) {
    _v_.before(this);
  }
  void universal_trv0_aft(UniversalVisitor _v_) {
    _v_.after(this);
  }
  void universal_trv0(UniversalVisitor _v_) {
    universal_trv0_bef(_v_);
    _v_.before_first(this, first);
    first.universal_trv0(_v_);
    _v_.after_first(this, first);
    universal_trv0_aft(_v_);
  }
  void toVertEdge_UGraph_trv_bef(superInitVisitor v) {  }
  void toVertEdge_UGraph_trv_aft(superInitVisitor v) {  }
  void toVertEdge_UGraph_trv(superInitVisitor v) {
    toVertEdge_UGraph_trv_bef(v);
    first.toVertEdge_UGraph_trv(v);
    toVertEdge_UGraph_trv_aft(v);
  }
  void saveGraph_UGraph_trv_bef(SaveGraphVisitor sgv) {
    sgv.before(this);
  }
  void saveGraph_UGraph_trv_aft(SaveGraphVisitor sgv) {  }
  void saveGraph_UGraph_trv(SaveGraphVisitor sgv) {
    saveGraph_UGraph_trv_bef(sgv);
    first.saveGraph_UGraph_trv(sgv);
    saveGraph_UGraph_trv_aft(sgv);
  }
  void saveMarkedGraph_UGraph_trv_bef(SelectMarkedVisitor v) {  }
  void saveMarkedGraph_UGraph_trv_aft(SelectMarkedVisitor v) {  }
  void saveMarkedGraph_UGraph_trv_aro_UEdge_List(SelectMarkedVisitor v) {
    first.saveMarkedGraph_UGraph_trv(v);
  }
  static java.lang.reflect.Method saveMarkedGraph_UGraph_trv_aro_UEdge_List;
  static {
    try {
      saveMarkedGraph_UGraph_trv_aro_UEdge_List =
        UEdge_List.class.getDeclaredMethod("saveMarkedGraph_UGraph_trv_aro_UEdge_List",
          new Class[] { SelectMarkedVisitor.class });
    } catch (NoSuchMethodException e) {
      throw new RuntimeException(e.toString());
    }
  }
  void saveMarkedGraph_UGraph_trv(SelectMarkedVisitor v) {
    saveMarkedGraph_UGraph_trv_bef(v);
    v.around(new __Subtraversal(saveMarkedGraph_UGraph_trv_aro_UEdge_List, this, new Object[] { v }), this);
    saveMarkedGraph_UGraph_trv_aft(v);
  }
  void ReadAllEdges_UGraph_trv_bef(ReadEdgeVisitor rev) {  }
  void ReadAllEdges_UGraph_trv_aft(ReadEdgeVisitor rev) {  }
  void ReadAllEdges_UGraph_trv(ReadEdgeVisitor rev) {
    ReadAllEdges_UGraph_trv_bef(rev);
    first.ReadAllEdges_UGraph_trv(rev);
    ReadAllEdges_UGraph_trv_aft(rev);
  }
  void toUEdgeVertex_UGraph_trv_bef(TGCreateVisitor tg) {  }
  void toUEdgeVertex_UGraph_trv_aft(TGCreateVisitor tg) {  }
  void toUEdgeVertex_UGraph_trv(TGCreateVisitor tg) {
    toUEdgeVertex_UGraph_trv_bef(tg);
    first.toUEdgeVertex_UGraph_trv(tg);
    toUEdgeVertex_UGraph_trv_aft(tg);
  }
  void toAllEnds_PlacementVisitor_trv_bef(superInitVisitor siv) {  }
  void toAllEnds_PlacementVisitor_trv_aft(superInitVisitor siv) {  }
  void toAllEnds_PlacementVisitor_trv(superInitVisitor siv) {
    toAllEnds_PlacementVisitor_trv_bef(siv);
    first.toAllEnds_PlacementVisitor_trv(siv);
    toAllEnds_PlacementVisitor_trv_aft(siv);
  }

  private Nonempty_UEdge_List tail;
  public void addElement(UEdge e) { 
    checktail(); 
    if (tail == null) {
      first = new Nonempty_UEdge_List(e,null); tail = first;
    } else {
	tail.set_next(new Nonempty_UEdge_List(e,null)); tail = tail.get_next();
    }
  }

  public void push(UEdge e) { first = new Nonempty_UEdge_List(e,first); }

  public java.util.Enumeration elements() { return new UEdge_List(first); } 

  public int size() {
    int i= 0;
    for (java.util.Enumeration e=elements(); e.hasMoreElements(); i++)
	e.nextElement();
    return i;
  }
  public boolean isEmpty() { return (first == null); }

  public boolean hasMoreElements() { return (first != null); }

  public Object nextElement() {
    UEdge car = first.get_it();
    first = first.get_next();
    return (Object) car;
  }

  private void checktail() {
    if (tail == null && first != null) {
	tail = first;
	while (tail.get_next() != null) tail = tail.get_next();
    }
  }
  public boolean contains(UEdge e) {
    java.util.Enumeration en = this.elements();
    while (en.hasMoreElements())
	if (e.equals((UEdge) en.nextElement())) return true;
    return false;
  }
}