private static int secondaryHash(int h) {
    // Doug Lea's supplemental hash function
    h ^= (h >>> 20) ^ (h >>> 12);
    return h ^ (h >>> 7) ^ (h >>> 4);
  }
Applies a supplemental hash function to a given hashCode, which defends
against poor quality hash functions. This is critical because HashMap
uses power-of-two length hash tables, that otherwise encounter collisions
for hashCodes that do not differ in lower or upper bits.
lottie/src/main/java/com/airbnb/lottie/parser/moshi/LinkedHashTreeMap.java