Node<V> find(int h,long k){
  Node<V> e=this;
  do {
    if ((e.key == k)) {
      return e;
    }
  }
 while ((e=e.next) != null);
  return null;
}

Node < V > find ( int h , long k ) { Node < V > e = this ; do { if ( ( e . key == k ) ) { return e ; } } while ( ( e = e . next ) != null ) ; return null ; }
virtualized support for map . get ( ) ; overridden in subclasses .
