HashTestUtils.assertInvariants(Hashing.goodFastHash(256));
  }

  public void testConsistentHash_correctness() {
    long[] interestingValues = {-1, 0, 1, 2, Long.MAX_VALUE, Long.MIN_VALUE};
    for (long h : interestingValues) {
      checkConsistentHashCorrectness(h);
    }
    Random r = new Random(7);
    for (int i = 0; i < 20; i++) {
      checkConsistentHashCorrectness(r.nextLong());

LICENSE file. package mldsa import ( "math/big" "testing" ) type interestingValue struct { v uint32 m fieldElement } // q is large enough that we can't exhaustively test all q × q inputs, so when // we have two inputs we test [0, q) on one side and a set of interesting // values on the other side. func interestingValues() []interestingValue { if testing.Short() { return []interestingValue{{v: q - 1, m: minusOne}} } var values []interestingValue for _, v := range []uint32{ 0, 1, 2, 3, q - 3, q - 2, q - 1,...