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 && hashingStrategy.equals((K)k, ek))))
                        return e;
                } while ((e = e.next) != null);
            }
            return null;
        }
Node<K,V> find(int h, Object k)