core:
import edu.neu.ccs.demeter.dj.*;
import java.util.*;

import edu.neu.ccs.demeter.*;
add: class Adjacency_Nlist implements java.util.Enumeration, Cloneable {
  protected Nonempty_Adjacency_Nlist first;
  public Nonempty_Adjacency_Nlist get_first() {{ return first; }}
  public void set_first(Nonempty_Adjacency_Nlist new_first)
    {{ first = new_first; }}
  public constructor Adjacency_Nlist() {{ super(); }}
  public constructor Adjacency_Nlist(Nonempty_Adjacency_Nlist first) {{
    super();
    set_first(first);
  }}
  public static Adjacency_Nlist parse(java.io.Reader in)
    throws ParseException
  {{ return new Parser(in)._Adjacency_Nlist(); }}
  public static Adjacency_Nlist parse(java.io.InputStream in)
    throws ParseException
  {{ return new Parser(in)._Adjacency_Nlist(); }}
  public static Adjacency_Nlist parse(String s) {{
    try { return parse(new java.io.StringReader(s)); }
    catch (ParseException e) {
      throw new RuntimeException(e.toString());
    }
  }}
{{  void universal_trv0_bef(UniversalVisitor _v_) {
    ((UniversalVisitor) _v_).before(this);
  }
}}
{{  void universal_trv0_aft(UniversalVisitor _v_) {
    ((UniversalVisitor) _v_).after(this);
  }
}}
{{  void universal_trv0(UniversalVisitor _v_) {
    universal_trv0_bef(_v_);
    ((UniversalVisitor) _v_).before_first(this, first);
    first.universal_trv0(_v_);
    ((UniversalVisitor) _v_).after_first(this, first);
    universal_trv0_aft(_v_);
  }
}}
{{  void __trav_display_Cd_graph_trv_bef(DisplayVisitor __v0) {
    ((DisplayVisitor) __v0).before(this);
  }
}}
{{  void __trav_display_Cd_graph_trv_aft(DisplayVisitor __v0) {
    ((DisplayVisitor) __v0).after(this);
  }
}}
{{  void __trav_display_Cd_graph_trv(DisplayVisitor __v0) {
    __trav_display_Cd_graph_trv_bef(__v0);
    ((DisplayVisitor) __v0).before_first(this, first);
    first.__trav_display_Cd_graph_trv(__v0);
    ((UniversalVisitor) __v0).after_first(this, first);
    __trav_display_Cd_graph_trv_aft(__v0);
  }
}}
{{
  private Nonempty_Adjacency_Nlist tail;
  public void addElement(Adjacency e) { 
    checktail(); 
    if (tail == null) {
      first = new Nonempty_Adjacency_Nlist(e,null); tail = first;
    } else {
	tail.set_next(new Nonempty_Adjacency_Nlist(e,null)); tail = tail.get_next();
    }
  }

  public void push(Adjacency e) { first = new Nonempty_Adjacency_Nlist(e,first); }

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