*
 * @author ******@****.*** (Kyle Maddison)
 */
@NullUnmarked
public class Fingerprint2011Test extends TestCase {

  // Length of the sample string to produce
  private static final int MAX_BYTES = 1000;

  // Map from sample string lengths to the fingerprint
  private static final ImmutableSortedMap<Integer, Long> LENGTH_FINGERPRINTS =
      new ImmutableSortedMap.Builder<Integer, Long>(Ordering.natural())

	x := []byte{'x'}
	y := []byte{'y'}
	tmp := make([]byte, 72)
	for _, growLen := range []int{0, 100, 1000, 10000, 100000} {
		for _, startLen := range []int{0, 100, 1000, 10000, 100000} {
			xBytes := Repeat(x, startLen)

			buf := NewBuffer(xBytes)
			// If we read, this affects buf.off, which is good to test.
			readBytes, _ := buf.Read(tmp)
			yBytes := Repeat(y, growLen)
			allocs := testing.AllocsPerRun(100, func() {

success", i) continue } if expected := natFromBytes(tt.b).ExpandFor(m); got.Equal(expected) != yes { t.Errorf("%d: got %v, expected %v", i, got, expected) } } f := func(xBytes []byte) bool { m := maxModulus(uint(len(xBytes)*8/_W + 1)) got, err := NewNat().SetBytes(xBytes, m) if err != nil { return false } return got.Equal(natFromBytes(xBytes).ExpandFor(m)) == yes } err := quick.Check(f, &quick.Config{}) if err != nil { t.Error(err) } } func TestExpand(t *testing.T) { sliced := []uint{1, 2, 3, 4} examples...