class chainedTableEntry extends tableEntry {
  public chainedTableEntry next;

  /* Konstruktor */
  chainedTableEntry (Object key, Object item) {
    super (key, item);
    this.next = null;
  }

  public void print () {
    System.out.print(key.hashCode ());
  }

}

class chainedHashTable extends hashTable {

  /* Konstruktor */
  chainedHashTable (int capacity) { }

  /* Tabelleneintrag an Position k */
  private chainedTableEntry getEntry (int k) {
    return (chainedTableEntry) hashEntry[k];
  }

  /* die Hashfunktion */
  public int h (Object key) {
    return key.hashCode () % capacity;
  }

  /* fuege ein Element mit Schluessel key ein (falls nicht vorhanden) */
  public void insert (Object key, Object item) { }

  /* entferne das Element mit Schluessel key (falls vorhanden) */
  public void delete (Object key) { }
  
  /* suche ein Element in der Hashtabelle */
  public Object search (Object key) { }
  
  public void printTable () {
    for (int i = 0; i <= capacity - 1; i++) {
      chainedTableEntry element = getEntry (i);
      while (element != null) {
	element.print ();
	System.out.print(" ");
	element = element.next;
      }
      System.out.println ();
    }
  }
    
} // class hashTable

  
/*
 *  Programm zum Testen von Hashverfahren
 */
public class hashRahmen {
   public static void main(String args[]){
      int vec[] = {12, 53, 5, 15, 2, 19, 43}; // "Standard"-Array 
      if (args.length != 0) {
	 vec = new int [args.length];
	 for (int j = 0 ; j < args.length ; j++){
	    vec [j] = Integer.valueOf(args[j]).intValue();
	 }
      }

      Integer [] t = new Integer[vec.length];
      for (int i = 0; i <= vec.length - 1; i++) {
	t[i] = new Integer(vec[i]);
	System.out.print(vec[i] + " ");
      }
      System.out.println();

      chainedHashTable h = new chainedHashTable (7);
      for (int i = 0; i <= t.length - 1; i++) {
	h.insert(t[i], null);
      }

      h.printTable ();
   }
}