if (dividend >= 0) {
      return dividend / divisor;
    }

    /*
     * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is
     * guaranteed to be either exact or one less than the correct value. This follows from fact that
     * floor(floor(x)/i) == floor(x/i) for any real x and integer i != 0. The proof is not quite
     * trivial.
     */

   * multiset itself).
   *
   * <p>Despite the method name, this method attempts to avoid actually copying the data when it is
   * safe to do so. The exact circumstances under which a copy will or will not be performed are
   * undocumented and subject to change.
   *
   * <p>This method is not type-safe, as it may be called on elements that are not mutually
   * comparable.

            }

            @Override
            public void store(CrawlingInfo entity) {
                assertEquals("Test Crawl", entity.getName());
                // Don't check exact expiration time, just verify it's reasonable
                assertNotNull(entity.getExpiredTime());
                assertTrue("Expiration time should be in the future", entity.getExpiredTime().longValue() > currentTime);

        return allRecordCount;
    }

    /**
     * Gets the relation type indicating how the record count should be interpreted.
     *
     * @return The record count relation (e.g., "eq" for exact, "gte" for greater than or equal)
     */
    public String getAllRecordCountRelation() {
        return allRecordCountRelation;
    }

    /**
     * Gets the time taken to execute the search query.
     *

   *
   * <p><b>Performance note:</b> When feasible, {@code initialCapacity} should be the exact number
   * of values that will be added, if that knowledge is readily available. It is better to guess a
   * value slightly too high than slightly too low. If the value is not exact, the {@link
   * ImmutableLongArray} that is built will very likely occupy more memory than strictly necessary;

   *
   * <p><b>Performance note:</b> When feasible, {@code initialCapacity} should be the exact number
   * of values that will be added, if that knowledge is readily available. It is better to guess a
   * value slightly too high than slightly too low. If the value is not exact, the {@link
   * ImmutableIntArray} that is built will very likely occupy more memory than strictly necessary;

    public void test_convertFuzzyQuery_withMaxEdits() {
        QueryContext context = new QueryContext("test", false);

        // Test with max edits = 0
        Term term0 = new Term("title", "exact");
        FuzzyQuery fuzzyQuery0 = new FuzzyQuery(term0, 0);
        QueryBuilder result0 = fuzzyQueryCommand.convertFuzzyQuery(context, fuzzyQuery0, 1.0f);
        assertNotNull(result0);

   * containing one element (the given set itself).
   *
   * <p>Despite the method name, this method attempts to avoid actually copying the data when it is
   * safe to do so. The exact circumstances under which a copy will or will not be performed are
   * undocumented and subject to change.
   *
   * <p>This method is not type-safe, as it may be called on elements that are not mutually
   * comparable.

      }
      if (component[toAndFromUri!!] != codePointString) {
        fail("Encoding $component $codePoint using $encoding")
      }
      return
    }

    // Check that the URI and HttpURL have the exact same escaping.
    if (toAndFromUri != httpUrl) {
      fail("Encoding $component $codePoint using $encoding")
    }
    if (uri.toString() != httpUrl.toString()) {

     *
     * <p>Description matching supports:</p>
     * <ul>
     *   <li>Wildcard matching (if starts or ends with *)</li>
     *   <li>Prefix matching (if ends with *)</li>
     *   <li>Exact phrase matching (otherwise)</li>
     * </ul>
     *
     * @param cb the condition bean to configure
     * @param dataConfigPager the pager containing search criteria
     */