我在我的系统上运行了你的代码:它们之间几乎没有区别。两者的时钟都在大约 30 毫秒。我的测试是在 OpenJDK 7 上进行的。
为了确认我也通过 Caliper 运行它,并使用更大的数组来强调实际的复制性能:
public class Performance extends SimpleBenchmark {
final int[] source = new int[1000];
public int timeClone(int reps) {
int sum = 0;
for (int i = reps; i > 0; i--)
sum += source.clone().length;
return sum;
}
public int timeCopyOf(int reps) {
int sum = 0;
for (int i = reps; i > 0; i--)
sum += Arrays.copyOf(source,source.length).length;
return sum;
}
public static void main(String... args) {
Runner.main(Performance.class, args);
}
}
结果:
0% Scenario{vm=java, trial=0, benchmark=Clone} 2141.70 ns; σ=5416.80 ns @ 10 trials
50% Scenario{vm=java, trial=0, benchmark=CopyOf} 2168.38 ns; σ=1545.85 ns @ 10 trials
benchmark us linear runtime
Clone 2.14 =============================
CopyOf 2.17 ==============================
vm: java
trial: 0
根据请求,这里的数组大小为 10:
0% Scenario{vm=java, trial=0, benchmark=Clone} 30.07 ns; σ=2.12 ns @ 10 trials
50% Scenario{vm=java, trial=0, benchmark=CopyOf} 29.34 ns; σ=161.38 ns @ 10 trials
benchmark ns linear runtime
Clone 30.1 ==============================
CopyOf 29.3 =============================