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
  int copyArrayList(int reps) {
    int size = this.size;
    int dummy = 0;
    for (int rep = 0; rep < reps; rep++) {
      List<Object> builder = new ArrayList<>();

 *
 * @author Louis Wasserman
 */
@NullUnmarked
public class DoubleMathRoundingBenchmark {
  private static final double[] doubleInIntRange = new double[ARRAY_SIZE];
  private static final double[] doubleInLongRange = new double[ARRAY_SIZE];
  private static final double[] positiveDoubles = new double[ARRAY_SIZE];

  @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"})
  RoundingMode mode;

  @BeforeExperiment

    @Override
    public String toString() {
        final int len = this.length / 2 - (this.zterm ? 1 : 0);
        final char[] ca = new char[len];
        for (int i = 0; i < len; i++) {
            ca[i] = (char) this.buffer[i];
        }
        return new String(ca, 0, len);
    }

            if (throwOnEncode) {
                throw new NdrException("Failed to encode");
            }
            // Simulate some encoding activity on the buffer
            dst.enc_ndr_long(123);
        }

        @Override
        public void decode(NdrBuffer src) throws NdrException {
            if (throwOnDecode) {
                throw new NdrException("Failed to decode");
            }

        List<Artifact> list = new ArrayList<>();
        list.add(newArtifact("b"));
        list.add(newArtifact("a"));
        list.add(newArtifact("c"));
        list.add(newArtifact("e"));
        list.add(newArtifact("d"));

        Map<String, Artifact> map = ArtifactUtils.artifactMapByVersionlessId(list);
        assertNotNull(map);
        assertEquals(list, new ArrayList<>(map.values()));
    }

        final SearchHit[] hits = searchResponse.getHits().getHits();
        final List<String> words = new ArrayList<>();
        final List<String> firstWords = new ArrayList<>();
        final List<String> secondWords = new ArrayList<>();
        final List<SuggestItem> firstItems = new ArrayList<>();
        final List<SuggestItem> secondItems = new ArrayList<>();

        final String index;
        if (hits.length > 0) {

     * .
     */
    @Test
    public void testSUnsupportedOperationExceptionStringThrowable() {
        final ClUnsupportedOperationException clUnsupportedOperationException =
                new ClUnsupportedOperationException("hoge", new NullPointerException());
        assertThat(clUnsupportedOperationException.getMessage(), is("hoge"));
        assertThat(clUnsupportedOperationException.getCause(), instanceOf(NullPointerException.class));
    }

    void testReadWriteMethodsReturnValues() {
        SmbComClose close = new SmbComClose(10, 5000L);
        assertEquals(0, close.readParameterWordsWireFormat(new byte[10], 0));
        assertEquals(0, close.readBytesWireFormat(new byte[10], 0));
        assertEquals(0, close.writeBytesWireFormat(new byte[10], 0));
        assertEquals(6, close.writeParameterWordsWireFormat(new byte[10], 0));
    }

    /**

   */
  @SuppressWarnings("rawtypes") // https://github.com/google/guava/issues/989
  public static <E extends Comparable> TreeMultiset<E> create() {
    return new TreeMultiset<>(Ordering.natural());
  }

  /**
   * Creates a new, empty multiset, sorted according to the specified comparator. All elements
   * inserted into the multiset must be <i>mutually comparable</i> by the specified comparator:

        final int threadCount = 10;
        final Thread[] threads = new Thread[threadCount];
        final InvertibleCryptographer[] invertibles = new InvertibleCryptographer[threadCount];
        final OneWayCryptographer[] oneWays = new OneWayCryptographer[threadCount];

        for (int i = 0; i < threadCount; i++) {
            final int index = i;
            threads[i] = new Thread(() -> {