t.Errorf("test %d, unexpected error: %v", i, err)
		}
		if (formats == FormatUnknown) && (err == nil) {
			t.Errorf("test %d, got nil-error, want non-nil error", i)
		}
	}
}

func Benchmark(b *testing.B) {
	type file struct {
		hdr  *Header
		body []byte
	}

	vectors := []struct {
		label string
		files []file
	}{{
		"USTAR",
		[]file{{

   * world. Figure out what sort of space-time tradeoff we're actually going to get here with the
   * *Map variants. This class is particularly hard to benchmark, because the benefit is not only in
   * less allocation, but also having the GC do less work to scan the heap because of fewer
   * references, which is particularly hard to quantify.
   */

 *
 * @author Jared Levy
 * @author Louis Wasserman
 * @since 2.0 (implements {@code NavigableSet} since 12.0)
 */
// TODO(benyu): benchmark and optimize all creation paths, which are a mess now
@GwtCompatible
@SuppressWarnings("serial") // we're overriding default serialization
public abstract class ImmutableSortedSet<E> extends ImmutableSet.CachingAsList<E>

   * world. Figure out what sort of space-time tradeoff we're actually going to get here with the
   * *Map variants. This class is particularly hard to benchmark, because the benefit is not only in
   * less allocation, but also having the GC do less work to scan the heap because of fewer
   * references, which is particularly hard to quantify.
   */

 *
 * @author Jared Levy
 * @author Louis Wasserman
 * @since 2.0 (implements {@code NavigableSet} since 12.0)
 */
// TODO(benyu): benchmark and optimize all creation paths, which are a mess now
@GwtCompatible
@SuppressWarnings("serial") // we're overriding default serialization
public abstract class ImmutableSortedSet<E> extends ImmutableSet<E>

B(&x, B, &y) q1.ScalarBaseMult(&x) q2.ScalarBaseMult(&y) check.Add(&q1, &q2) checkOnCurve(t, &p, &check, &q1, &q2) return p.Equal(&check) == 1 } if err := quick.Check(varTimeDoubleBaseMul, quickCheckConfig(32)); err != nil { t.Error(err) } } // Benchmarks. func BenchmarkScalarBaseM(b *testing.B) { var p Point for i := 0; i < b.N; i++ { p.ScalarBaseMult(dalekScalar) } } func BenchmarkScalarMult(b *testing.B) { var p Point for i := 0; i < b.N; i++ { p.ScalarMult(dalekScalar, B) } } func BenchmarkVarTimeDoub(b...

B(&x, B, &y) q1.ScalarBaseMult(&x) q2.ScalarBaseMult(&y) check.Add(&q1, &q2) checkOnCurve(t, &p, &check, &q1, &q2) return p.Equal(&check) == 1 } if err := quick.Check(varTimeDoubleBaseMul, quickCheckConfig(32)); err != nil { t.Error(err) } } // Benchmarks. func BenchmarkScalarBaseM(b *testing.B) { var p Point for i := 0; i < b.N; i++ { p.ScalarBaseMult(dalekScalar) } } func BenchmarkScalarMult(b *testing.B) { var p Point for i := 0; i < b.N; i++ { p.ScalarMult(dalekScalar, B) } } func BenchmarkVarTimeDoub(b...

* Add scheduler benchmark tests for PodAffinity and NodeAffinity. ([#69898](https://github.com/kubernetes/kubernetes/pull/69898), [@Huang-Wei](https://github.com/Huang-Wei))

pkg syscall, type SysProcAttr struct
pkg syscall, type Timespec struct
pkg syscall, type Timeval struct
pkg syscall, var ForkLock sync.RWMutex
pkg syscall, var SocketDisableIPv6 bool
pkg testing, func Benchmark(func(*B)) BenchmarkResult
pkg testing, func Main(func(string, string) (bool, error), []InternalTest, []InternalBenchmark, []InternalExample)
pkg testing, func RunBenchmarks(func(string, string) (bool, error), []InternalBenchmark)