$(function() {
  var $firstInput = $('input[type="text"],select,textarea', ".login-box,section.content").first();
  var $errorInput = $(".form-group .has-error").first().next("input,select,textarea");

  if ($errorInput.length) {
    $errorInput.focus();
  } else {
    $firstInput.focus();
  }

  $("section.content input").on("keypress", function(e) {
    if (e.which === 13) {
      var $submitButton = $("input#submit, button#submit");

            // unknown phases, leave in existing order
            return 0;
        }
        if (i1 == -1) {
            // second one is known, so it comes first
            return 1;
        }
        if (i2 == -1) {
            // first one is known, so it comes first
            return -1;
        }
        int rv = Integer.compare(i1, i2);
        if (rv != 0) {
            return rv;
        }

	if err := checkDiskFatalErrs(errs); err != nil {
		return nil, nil, err
	}

	defer func() {
		if err == nil && format != nil {
			// Assign globalDeploymentID() on first run for the
			// minio server managing the first disk
			globalDeploymentIDPtr.Store(&format.ID)

			// Set the deployment ID here to avoid races.
			xhttp.SetDeploymentID(format.ID)
			xhttp.SetMinIOVersion(Version)
		}
	}()

 * weight = 1 + max(downstream_project_weights)
 *
 * <p>Projects are then sorted by weight in descending order, ensuring that
 * projects with longer dependency chains are built first. When projects have
 * the same weight, they are ordered by project ID for deterministic results.
 *
 * <p><b>Example:</b>
 * <p>Consider projects with dependencies: A → B → D, A → C → D
 * <ul>

            for (Plugin plugin : plugins) {
                Object key = plugin.getKey();
                Plugin first = normalized.get(key);
                if (first != null) {
                    merger.mergePlugin(plugin, first);
                }
                normalized.put(key, plugin);
            }

            if (plugins.size() != normalized.size()) {

    void iteratesAndFetchesMoreThenCloses() throws Exception {
        // Arrange: program send() to simulate first, next, next(NO_MORE_FILES)
        List<String[]> batches = new ArrayList<>();
        batches.add(new String[] { ".", "..", "a", "b" }); // first batch, dot entries filtered
        batches.add(new String[] { "c" }); // second batch
        batches.add(new String[] {}); // last -> NO_MORE_FILES

    return user


@app.get("/users/me")
def read_current_user(current_user: User | None = Depends(get_current_user)):
    if current_user is None:
        return {"msg": "Create an account first"}
    return current_user


client = TestClient(app)


def test_security_api_key():
    response = client.get("/users/me", headers={"key": "secret"})
    assert response.status_code == 200, response.text

   * as a false predicate is found.
   *
   * <p><b>Discouraged:</b> Prefer using {@code first.and(second)}.
   */
  public static <T extends @Nullable Object> Predicate<T> and(
      Predicate<? super T> first, Predicate<? super T> second) {
    return new AndPredicate<>(Predicates.<T>asList(checkNotNull(first), checkNotNull(second)));
  }

  /**

                firstItems);
    }

    /**
     * Checks if the first word matches.
     * @param singleWordQuery True if it is a single word query.
     * @param hiraganaQuery True if it is a hiragana query.
     * @param text The text to check.
     * @return True if the first word matches, false otherwise.
     */

        return [b[0] for b in files]

    original_read = StarletteUploadFile.read

    async def patched_read(self: StarletteUploadFile, size: int = -1) -> bytes:
        # Make the FIRST file slower *deterministically*
        if self.filename == "slow.txt":
            await anyio.sleep(0.05)
        return await original_read(self, size)

    monkeypatch.setattr(StarletteUploadFile, "read", patched_read)