public static MultimapBuilderWithKeys<@Nullable Object> hashKeys() {
    return hashKeys(DEFAULT_EXPECTED_KEYS);
  }

  /**
   * Uses a hash table to map keys to value collections, initialized to expect the specified number
   * of keys.
   *
   * @throws IllegalArgumentException if {@code expectedKeys < 0}
   */
  public static MultimapBuilderWithKeys<@Nullable Object> hashKeys(int expectedKeys) {

  public static MultimapBuilderWithKeys<@Nullable Object> hashKeys() {
    return hashKeys(DEFAULT_EXPECTED_KEYS);
  }

  /**
   * Uses a hash table to map keys to value collections, initialized to expect the specified number
   * of keys.
   *
   * @throws IllegalArgumentException if {@code expectedKeys < 0}
   */
  public static MultimapBuilderWithKeys<@Nullable Object> hashKeys(int expectedKeys) {

     * @return The converted {@link Boolean}
     */
    public static Boolean toBoolean(final Object o) {
        return switch (o) {
        case null -> null;
        case Boolean b -> b;
        case Number n -> n.intValue() != 0;
        case String s -> switch (s.toLowerCase()) {
        case "true" -> Boolean.TRUE;
        case "false", "0" -> Boolean.FALSE;
        default -> Boolean.TRUE;
        };

        if (removed != null) {
            log.debug("Mock unregistered witness: {}", registrationId);
            return true;
        }
        return false;
    }

    /**
     * Get the number of active registrations
     *
     * @return the registration count
     */
    public int getRegistrationCount() {
        return registrations.size();
    }

    /**

        assertEquals(incremental, artifactVersion.getIncrementalVersion(), parsed + "check incremental version");
        assertEquals(buildnumber, artifactVersion.getBuildNumber(), parsed + "check build number");
        assertEquals(qualifier, artifactVersion.getQualifier(), parsed + "check qualifier");
        assertEquals(version, artifactVersion.toString(), "check " + version + " string value");
    }

    @Test

constraints.Required.message = {item} é obrigatório.
constraints.TypeInteger.message = {item} deve ser um número.
constraints.TypeLong.message = {item} deve ser um número.
constraints.TypeFloat.message = {item} deve ser um número.
constraints.TypeDouble.message = {item} deve ser um número.
constraints.TypeAny.message = {item} não pode ser convertido para {propertyType}.

   * allocated, the value of {@code metadata} combines the number of bits in the "short hash", in
   * its bottom {@value CompactHashing#HASH_TABLE_BITS_MAX_BITS} bits, with a modification count in
   * the remaining bits that is used to detect concurrent modification during iteration.
   */
  private transient int metadata;

  /** The number of elements contained in the set. */
  private transient int size;

		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 ActiveWorkerStat) Msgsize() (s int) {
	s = 1 + 5 + msgp.IntSize + 4 + msgp.Float32Size + 4 + msgp.IntSize
	return
}

// DecodeMsg implements msgp.Decodable

		if err != nil {
			err = msgp.WrapError(err)
			return
		}
		(*z) = rebalSaveOpts(zb0001)
	}
	o = bts
	return
}

// Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message
func (z rebalSaveOpts) Msgsize() (s int) {
	s = msgp.Uint8Size
	return
}

// DecodeMsg implements msgp.Decodable

	d, err := Open(dirPath)
	if err != nil {
		if osErrToFileErr(err) == errFileNotFound {
			return nil
		}
		return osErrToFileErr(err)
	}
	defer d.Close()

	maxEntries := 1000
	for {
		// Read up to max number of entries.
		fis, err := d.Readdir(maxEntries)
		if err != nil {
			if err == io.EOF {
				break
			}
			err = osErrToFileErr(err)
			if err == errFileNotFound {
				return nil
			}
			return err
		}