constraints.DecimalMax.message = {item} doit être inférieur à {value}.
constraints.DecimalMin.message = {item} doit être supérieur à {value}.
constraints.Digits.message = {item} doit être un nombre. (attendu : <nombre>.<nombre>)
constraints.Future.message = {item} doit être une valeur future.
constraints.Max.message = {item} doit être inférieur ou égal à {value}.
constraints.Min.message = {item} doit être supérieur ou égal à {value}.

constraints.AssertTrue.message = {item} 必须为 true。
constraints.DecimalMax.message = {item} 必须小于 {value}。
constraints.DecimalMin.message = {item} 必须大于 {value}。
constraints.Digits.message = {item} 必须是数字。(预期: <数字>.<数字>)
constraints.Future.message = {item} 必须是未来的值。
constraints.Max.message = {item} 必须小于或等于 {value}。
constraints.Min.message = {item} 必须大于或等于 {value}。
constraints.NotNull.message = {item} 不能为空。
constraints.Null.message = {item} 必须为 null。

        // Check p0 value for org name
        // ----------------------------------------------------------------------

        MavenProject p0 = getProject(projectFile("maven.t01", "p0"));

        assertEquals("p0-org", p0.getOrganization().getName());

        // ----------------------------------------------------------------------
        // Check p1 value for org name

  // in the short hash. We saw that a mask of 0x7f would keep the 7-bit value 0x6f from a full
  // hashcode of 0x89abcdef. The imaginary `hash` value would then be the remaining top 25 bits,
  // 0x89abcd80. To this is added (or'd) the `next` value, which is an index within `entries`
  // (and therefore within `keys` and `values`) of another entry that has the same short hash

   * Adds an edge connecting {@code nodeU} to {@code nodeV} if one is not already present, and sets
   * a value for that edge to {@code value} (overwriting the existing value, if any).
   *
   * <p>If the graph is directed, the resultant edge will be directed; otherwise, it will be
   * undirected.
   *
   * <p>Values do not have to be unique. However, values must be non-null.
   *

 * way of "cutting" a "number line" (actually of instances of type {@code C}, not necessarily
 * "numbers") into two sections; this can be done below a certain value, above a certain value,
 * below all values or above all values. With this object defined in this way, an interval can
 * always be represented by a pair of {@code Cut} instances.
 *
 * @author Kevin Bourrillion
 */

          ],
          "thresholds": {
            "mode": "absolute",
            "steps": [
              {
                "color": "green",
                "value": null
              },
              {
                "color": "red",
                "value": 80
              }
            ]
          },
          "unit": "short"
        },
        "overrides": []
      },
      "gridPos": {
        "h": 5,

    /**
     * Maximum depth for crawling (how many levels deep to follow links).
     */
    @Min(value = 0)
    @Max(value = 2147483647)
    @ValidateTypeFailure
    public Integer depth;

    /**
     * Maximum number of pages/documents to access during crawling.
     */
    @Min(value = 0)
    @Max(value = 9223372036854775807L)
    @ValidateTypeFailure
    public Long maxAccessCount;

	}
	if value := env.Get(config.EnvMinIOLogQueryURL, ""); value != "" {
		os.Setenv("CONSOLE_LOG_QUERY_URL", value)
		if value := env.Get(config.EnvMinIOLogQueryAuthToken, ""); value != "" {
			os.Setenv("CONSOLE_LOG_QUERY_AUTH_TOKEN", value)
		}
	}
	if value := env.Get(config.EnvBrowserRedirectURL, ""); value != "" {
		os.Setenv("CONSOLE_BROWSER_REDIRECT_URL", value)
	}

                ClosingFuture.from(immediateFuture("value2")),
                ClosingFuture.from(immediateFuture("value3")),
                ClosingFuture.from(immediateFuture("value4")),
                ClosingFuture.from(immediateFuture("value5")))
            .call(
                new ClosingFunction5<