question: Node < K , V > find ( int h , Object k ) { Node < K , V > e = this ; if ( k != null ) { do { K ek ; if ( e . hash == h && ( ( ek = e . key ) == k || ( ek != null && k . equals ( ek ) ) ) ) return e ; } while ( ( e = e . next ) != null ) ; } return null ; }
target:  Virtualized support for map.get(); overridden in subclasses.