@Override
    Node<K> find(int h, Object k) {
      Node<K> e;
      int n;
      Node<K>[] tab = nextTable;
      if (k != null && tab != null && (n = tab.length) > 0
          && (e = tabAt(tab, (n - 1) & h)) != null) {
        do {
          int eh;
          K ek;
          if ((eh = e.hash) == h && ((ek = e.key) == k || (ek != null && k.equals(ek)))) {
            return e;
          }
          if (eh < 0) {
            return e.find(h, k);
          }
        } while ((e = e.next) != null);
      }
      return null;
    }
A node inserted at head of bins during transfer operations.
geode-core/src/main/java/org/apache/geode/internal/concurrent/CompactConcurrentHashSet2.java