}
  }

  /**
   * Returns the set of all subsets of {@code set} of size {@code size}. For example, {@code
   * combinations(ImmutableSet.of(1, 2, 3), 2)} returns the set {@code {{1, 2}, {1, 3}, {2, 3}}}.
   *
   * <p>Elements appear in these subsets in the same iteration order as they appeared in the input
   * set. The order in which these subsets appear in the outer set is undefined.
   *

* uint64(fieldFromMontgomery(b))) % q) if got != exp { t.Fatalf("%d * %d = %d, expected %d", a, b, got, exp) } } } } func TestFieldToMontgomer(t *testing.T) { // fieldToMontgomery should reject inputs ≥ q. inputs := []uint32{ q, q + 1, q + 2, 1<<23 - 1, 1 << 23, q + 1<<23, q + 1<<31, ^uint32(0), } for _, in := range inputs { if _, err := fieldToMontgomery(in); err == nil { t.Fatalf("fieldToMontgomery(%d) did not return an error", in) } } } func TestFieldMulSub(t *testing.T) { for _, a := range interestingValues()...