@ValidateTypeFailure
    public Long updatedTime;

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

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

			}
		default:
			bts, err = msgp.Skip(bts)
			if err != nil {
				err = msgp.WrapError(err)
				return
			}
		}
	}
	o = bts
	return
}

// Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message
func (z *BucketReplicationResyncStatus) Msgsize() (s int) {
	s = 1 + 2 + msgp.IntSize + 4 + msgp.MapHeaderSize
	if z.TargetsMap != nil {

     * cl/592273615 and cl/592273683.)
     */
    public Builder(Comparator<? super E> comparator) {
      this(comparator, ImmutableCollection.Builder.DEFAULT_INITIAL_CAPACITY);
    }

    /** Creates a new builder with an expected size. */
    @SuppressWarnings("unchecked")
    Builder(Comparator<? super E> comparator, int expectedSize) {
      super(true); // don't construct guts of hash-based set builder

  }

  /**
   * Creates an empty {@code HashBasedTable} with the specified map sizes.
   *
   * @param expectedRows the expected number of distinct row keys
   * @param expectedCellsPerRow the expected number of column key / value mappings in each row
   * @throws IllegalArgumentException if {@code expectedRows} or {@code expectedCellsPerRow} is
   *     negative
   */

  }

  /**
   * Creates an empty {@code HashBasedTable} with the specified map sizes.
   *
   * @param expectedRows the expected number of distinct row keys
   * @param expectedCellsPerRow the expected number of column key / value mappings in each row
   * @throws IllegalArgumentException if {@code expectedRows} or {@code expectedCellsPerRow} is
   *     negative
   */

    }

    /**
     * Sets the minimum number of bytes that must be read for the operation to succeed
     *
     * @param minimumCount
     *            the minimumCount to set
     */
    public void setMinimumCount(final int minimumCount) {
        this.minimumCount = minimumCount;
    }

    /**
     * Sets the number of bytes remaining to be read after this request
     *

  public void testNewArrayType_upperBoundedWildcard() {
    Type wildcard = Types.subtypeOf(Number.class);
    assertEquals(Types.subtypeOf(Number[].class), Types.newArrayType(wildcard));
  }

  public void testNewArrayType_lowerBoundedWildcard() {
    Type wildcard = Types.supertypeOf(Number.class);
    assertEquals(Types.supertypeOf(Number[].class), Types.newArrayType(wildcard));
  }

  public void testNewArrayType_serializable() {

   * its first position but with its final value. The {@code duplicates} map is modified.
   *
   * @param entries the original array of entries including duplicates
   * @param n the number of valid entries in {@code entries}
   * @param newN the expected number of entries once duplicates are removed
   * @param duplicates a map of canonical {@link Entry} objects for each duplicate key. This map

     * Creates a new EditForm instance.
     */
    public EditForm() {
        super();
    }

    /**
     * The unique identifier of the scheduler being edited.
     * This is a required field for identifying which scheduler to update.
     */
    @Required
    @Size(max = 1000)
    public String id;

    /**
     * The version number of the scheduler for optimistic locking.

      this.inputList = ImmutableList.sortedCopyOf(comparator, input);
      this.comparator = comparator;
      this.size = calculateSize(inputList, comparator);
    }

    /**
     * The number of permutations with repeated elements is calculated as follows:
     *
     * <ul>
     *   <li>For an empty list, it is 1 (base case).