public int hashCode() {
      int h = 0;
      Node<V>[] t;
      if ((t = table) != null) {
          Traverser<V> it = new Traverser<V>(t, t.length, 0, t.length);
        for (Node<V> p; (p = it.advance()) != null; ) {
          h += spread(p.key) ^ p.val.hashCode();
        }
      }
      return h;
  }
public int hashCode()