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 ClassGraphEntry_DList implements java.util.Enumeration, Cloneable {
  protected Nonempty_ClassGraphEntry_DList first;
  public Nonempty_ClassGraphEntry_DList get_first() { return first; }
  public void set_first(Nonempty_ClassGraphEntry_DList new_first)
    { first = new_first; }
  ClassGraphEntry_DList() { super(); }
  public ClassGraphEntry_DList(Nonempty_ClassGraphEntry_DList first) {
    super();
    set_first(first);
  }
  public static ClassGraphEntry_DList parse(java.io.InputStream in) throws ParseException
    { return new Parser(in)._ClassGraphEntry_DList(); }
  public static ClassGraphEntry_DList 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 toAllSubclasses_Program_trv_bef(ClassNameTranspVisitor cntv, EdgeVisitor aev) {  }
  void toAllSubclasses_Program_trv_aft(ClassNameTranspVisitor cntv, EdgeVisitor aev) {  }
  void toAllSubclasses_Program_trv(ClassNameTranspVisitor cntv, EdgeVisitor aev) {
    toAllSubclasses_Program_trv_bef(cntv, aev);
    first.toAllSubclasses_Program_trv(cntv, aev);
    toAllSubclasses_Program_trv_aft(cntv, aev);
  }
  void checkParents_Program_trv_bef(DummyVisitor dv) {  }
  void checkParents_Program_trv_aft(DummyVisitor dv) {  }
  void checkParents_Program_trv(DummyVisitor dv) {
    checkParents_Program_trv_bef(dv);
    first.checkParents_Program_trv(dv);
    checkParents_Program_trv_aft(dv);
  }

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

  public void push(ClassGraphEntry e) { first = new Nonempty_ClassGraphEntry_DList(e,first); }

  public java.util.Enumeration elements() { return new ClassGraphEntry_DList(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() {
    ClassGraphEntry 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(ClassGraphEntry e) {
    java.util.Enumeration en = this.elements();
    while (en.hasMoreElements())
	if (e.equals((ClassGraphEntry) en.nextElement())) return true;
    return false;
  }
}