element.input = unescape(parts[i++])

        val base = if (i < parts.size) parts[i++] else null
        element.base =
          when {
            base == null || base.isEmpty() -> list[list.size - 1].base
            else -> unescape(base)
          }

        while (i < parts.size) {
          val piece = parts[i]
          if (piece.startsWith("#")) {
            i++
            continue

        assertNotNull(buffer2, "Second buffer should not be null");
        assertEquals(1024, buffer1.length, "Buffer should have expected size");
        assertEquals(1024, buffer2.length, "Buffer should have expected size");
        assertNotSame(buffer1, buffer2, "Different calls should return different buffers initially");
    }

    @Test

        lastWrite.setAccessible(true);
        lastWrite.setLong(resp, 1630000000000L);
        java.lang.reflect.Field size = SmbComQueryInformationResponse.class.getDeclaredField("fileSize");
        size.setAccessible(true);
        size.setInt(resp, 2048);

        assertEquals(0xABCD, resp.getAttributes());
        assertEquals(1630000001000L, resp.getCreateTime());

  // Represents how tightly we can pack things, as a maximum.
  private static final double DESIRED_LOAD_FACTOR = 0.5;

  /**
   * Returns an array size suitable for the backing array of a hash table that uses open addressing
   * with linear probing in its implementation. The returned size is the smallest power of two that
   * can hold setSize elements with the desired load factor.
   */
  @VisibleForTesting

        .testEquals();
  }

  /** Returns a {@link Set} with a {@link Set#size()} of {@code size}. */
  private static ContiguousSet<Integer> setSize(int size) {
    checkArgument(size >= 0);
    ContiguousSet<Integer> set = ContiguousSet.closedOpen(0, size);
    checkState(set.size() == size);
    return set;
  }

  /**

    @ValidateTypeFailure
    public Integer crudMode;

    /** The input word that should be stemmed differently */
    @Required
    @Size(max = 1000)
    public String input;

    /** The desired stem output for the input word */
    @Required
    @Size(max = 1000)
    public String output;

    /**
     * Initializes the form with default values for creating a new stemmer override entry.
     */

    boolean removal = (maximumSize == LocalCache.UNSET_INT) ? false : (size() > maximumSize);
    if ((removalListener != null) && removal) {
      removalListener.onRemoval(
          RemovalNotification.create(
              ignored.getKey(), ignored.getValue().getValue(), RemovalCause.SIZE));
    }
    statsCounter.recordEviction();
    return removal;
  }

  int charSplitter(int reps) {
    int total = 0;

    for (int i = 0; i < reps; i++) {
      total += Iterables.size(CHAR_SPLITTER.split(input));
    }

    return total;
  }

  @Benchmark
  int stringSplitter(int reps) {
    int total = 0;

    for (int i = 0; i < reps; i++) {
      total += Iterables.size(STRING_SPLITTER.split(input));
    }

    return total;
  }

    @ValidateTypeFailure
    public Integer crudMode;

    /** Input terms (comma-separated) that will be mapped to the output term */
    @Required
    @Size(max = 1000)
    public String inputs;

    /** Output term that input terms will be mapped to */
    @Size(min = 1, max = 1000)
    public String output;

    /**
     * Initializes the form with default values for creating a new mapping dictionary entry.
     */

    @ValidateTypeFailure
    public Integer crudMode;

    /** The input terms that should be considered synonymous */
    @Required
    @Size(max = 1000)
    public String inputs;

    /** The output synonyms that should be matched for the input terms */
    @Required
    @Size(max = 1000)
    public String outputs;

    /**
     * Initializes the form with default values for creating a new synonym entry.
     */