,??r&ddaym,e&tsneum-hf,vres&cisab,lautriv,??ial.sppa,?s&codehtdaer,gnihtbew,nemeis-om,ppa&elbbub,revelc,?t&acdnas,ekcit,??t&e&kcubtib,n!otorp,??i&belet,gude,?netnocresuseebduolc,raedon.egats,s&etwolfbew,udgniht.&cersid.&dvreser,tsuc,?dorp.tsuc,gnitset.&dvreser,tsuc,?ved.&dvreser,tsuc,????ude?v&gib.0ku,og??w&hs,olfbew,?x&bdrym,cq,rotide,?ysrab,zzq,?b?d&ar?u&a?ts???j?r?syhp??j!.&dhp?g&ne?ro??hcs?i&a?rga??lim?m&f?oc??rep?ten?ude?v&og?t????ll&ag?o??m!.&gro?moc?ten?ude?vog??g?il?mi?orp??n!.&a&0&b-ekh...

   * hash functions. This is critical when the concurrent hash map uses power-of-two length hash
   * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper
   * bits.
   *
   * @param h hash code
   */
  static int rehash(int h) {
    // Spread bits to regularize both segment and index locations,