final public V get(final K key) {
    int index = computeHash(keyData(key)) % size ;
    if (index < 0) index += size ;
    if (table[index] == null)
      return null ;
    Entry <K, V> link = table[index] ;
    if (link.next == null)
      return link.value ;
    for (; link != null ; link = link.next) if (equals(link.key, key))
      return link.value ;
    return null ;
  }