}

  /**
   * This test creates a long random sequence of inputs, then a lot of differently configured sinks
   * process it; all should produce the same answer, the only difference should be the number of
   * process()/processRemaining() invocations, due to alignment.
   */
  @AndroidIncompatible // slow. TODO(cpovirk): Maybe just reduce iterations under Android.
  public void testExhaustive() throws Exception {

   * this method returns {@code true} if {@code iterator1} and {@code iterator2} contain the same
   * number of elements and every element of {@code iterator1} is equal to the corresponding element
   * of {@code iterator2}.
   *
   * <p>Note that this will modify the supplied iterators, since they will have been advanced some
   * number of elements forward.
   */

  }

  /**
   * Constructs an empty {@code LinkedHashMultimap} with enough capacity to hold the specified
   * numbers of keys and values without rehashing.
   *
   * @param expectedKeys the expected number of distinct keys
   * @param expectedValuesPerKey the expected average number of values per key
   * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is
   *     negative
   */

   */
  public void addAll(Iterable<? extends Number> values) {
    for (Number value : values) {
      add(value.doubleValue());
    }
  }

  /**
   * Adds the given values to the dataset.
   *
   * @param values a series of values, which will be converted to {@code double} values (this may
   *     cause loss of precision)
   */
  public void addAll(Iterator<? extends Number> values) {
    while (values.hasNext()) {

    @Size(max = 1000)
    public String updatedBy;

    /** Timestamp when this entry was last updated */
    @ValidateTypeFailure
    public Long updatedTime;

    /** Version number for optimistic locking */
    @Required
    @ValidateTypeFailure
    public Integer versionNo;

    /**
     * Default constructor for EditForm.
     */
    public EditForm() {
        super();
    }

        return 0;
    }

    /**
     * Encode this request (no-op since there's no data)
     *
     * @param dst destination buffer
     * @param dstIndex starting offset
     * @return number of bytes written (always 0)
     */
    public int encode(byte[] dst, int dstIndex) {
        // No data to encode
        return 0;
    }

   *
   * <ul>
   *   <li>You want to assign the same fraction of inputs to each bucket.
   *   <li>When you reduce the number of buckets, you can accept that the most recently added
   *       buckets will be removed first. More concretely, if you are dividing traffic among tasks,
   *       you can decrease the number of tasks from 15 and 10, killing off the final 5 tasks, and

     * @param offset the offset in the data buffer
     * @param length the number of bytes to write
     */
    public void setData(final byte[] data, final int offset, final int length) {
        this.data = data;
        this.dataOffset = offset;
        this.dataLength = length;
    }

    /**
     * Sets the number of bytes remaining to be written in a sequence of write operations.
     *

        }
        return len;
    }

    /**
     * Writes the AndX wire format to buffer
     * @param dst the destination buffer
     * @param dstIndex the starting index
     * @return the number of bytes written
     */
    protected int writeAndXWireFormat(final byte[] dst, int dstIndex) {
        final int start = dstIndex;

        return version;
    }

    /**
     * Gets the major version number.
     *
     * @return The major version number.
     */
    public int getMajorVersion() {
        return majorVersion;
    }

    /**
     * Gets the minor version number.
     *
     * @return The minor version number.
     */
    public int getMinorVersion() {
        return minorVersion;
    }