@Benchmark int traversal(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { for (BinaryNode node : view) { tmp += node.x; } } return tmp; } }
@Benchmark int iteration(int reps) { int x = 0; for (int i = 0; i < reps; i++) { for (Element y : setToTest) { x ^= System.identityHashCode(y); } } return x; } }
@Benchmark int hashString_3(int reps) { int dummy = 0; for (int i = 0; i < reps; i++) { dummy += Objects.hashCode(S0, S1, S2); } return dummy; }
@Benchmark void postStrings(int reps) { for (int i = 0; i < reps; i++) { eventBus.post("hello there"); } }
@Benchmark int arrayListForWithHolder(int reps) { int[] sumHolder = {0}; for (int i = 0; i < reps; i++) { for (Object value : arrayList) { sumHolder[0] += value.hashCode(); } } return sumHolder[0]; }
@Benchmark int linkedListFor(int reps) { int sum = 0; for (int i = 0; i < reps; i++) { for (Object value : linkedList) { sum += value.hashCode(); } } return sum; }
@Benchmark long manual(int reps) { long total = 0; for (int i = 0; i < reps; i++) { long start = System.nanoTime(); // here is where you would do something total += (System.nanoTime() - start); } return total; } }
@Benchmark int builderAdd(int reps) { int size = this.size; int dummy = 0; for (int rep = 0; rep < reps; rep++) { ImmutableList.Builder<Object> builder = ImmutableList.builder(); for (int i = 0; i < size; i++) { builder.add(OBJECT); } dummy += builder.build().size(); } return dummy; }
@Benchmark int preSizedBuilderAdd(int reps) { int size = this.size; int dummy = 0; for (int rep = 0; rep < reps; rep++) { ImmutableList.Builder<Object> builder = new ImmutableList.Builder<>(size); for (int i = 0; i < size; i++) { builder.add(OBJECT); } dummy += builder.build().size(); } return dummy; }
@Benchmark long factorial(int reps) { long tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += Double.doubleToRawLongBits(DoubleMath.factorial(factorials[j])); } return tmp; }
@Benchmark int isMathematicalInteger(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; if (DoubleMath.isMathematicalInteger(doubles[j])) { tmp++; } } return tmp; }
@Benchmark long factorialDouble(int reps) { long tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += Double.doubleToRawLongBits(impl.factorialDouble(factorials[j])); } return tmp; }
@Benchmark long binomialCoefficient(int reps) { long tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += impl.binomialCoefficient(binomials[j][0], binomials[j][1]); } return tmp; }
@Benchmark void martinRepeat(int reps) { for (int i = 0; i < reps; i++) { String x = martinRepeat(originalString, count); if (x.length() != (originalString.length() * count)) { throw new RuntimeException("Wrong length: "+x); } } }
@Benchmark public int encodingStream(int reps) throws IOException { int tmp = 0; for (int i = 0; i < reps; i++) { StringWriter target = new StringWriter(2 * n); OutputStream encodingStream = encoding.encoding.encodingStream(target); encodingStream.write(encodingInputs[i & INPUTS_MASK]); encodingStream.close(); tmp += target.getBuffer().length(); } return tmp; }
@Benchmark int time(int reps) { int dummy = 0; for (int i = 0; i < reps; i++) { segment.removeEntryFromChain(chain, head); dummy += segment.count; } return dummy; } }
@Benchmark int divide(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += BigIntegerMath.divide(nonzero1[j], nonzero2[j], mode).intValue(); } return tmp; } }
@Benchmark int arraysSortOrderingNatural(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { Integer[] copy = inputArrays[i & 0xFF].clone(); Arrays.sort(copy, Ordering.natural()); tmp += copy[0]; } return tmp; }
@Benchmark int creation(int reps) { int x = 0; for (int i = 0; i < reps; i++) { x ^= System.identityHashCode(impl.create(sampleData.getValuesInSet())); } return x; } }
@Benchmark int strongInterner(int reps) { Interner<String> interner = Interners.newStrongInterner(); for (int i = 0; i < reps; i++) { interner.intern(Double.toHexString(Math.random())); } return reps; }