* @param divisor the divisor (denominator)
   * @throws ArithmeticException if divisor is 0
   * @since 11.0
   */
  public static long remainder(long dividend, long divisor) {
    if (divisor < 0) { // i.e., divisor >= 2^63:
      if (compare(dividend, divisor) < 0) {
        return dividend; // dividend < divisor
      } else {
        return dividend - divisor; // dividend >= divisor
      }
    }

                                scenario.scenario
                        }
                    }.firstOrNull()
                    // Fallback for new performance tests (don't use 0 to avoid division by zero)
                    ?: PerformanceTestDuration(scenario.scenario, 1)
            })
            .entries
            .map { TestProjectDuration(it.key, it.value) }
            .sortedBy { -it.totalTime }

   * Returns the result of dividing {@code p} by {@code q}, rounding using the specified {@code
   * RoundingMode}. If the {@code RoundingMode} is {@link RoundingMode#DOWN}, then this method is
   * equivalent to regular Java division, {@code p / q}; and if it is {@link RoundingMode#FLOOR},
   * then this method is equivalent to {@link Math#floorDiv(int,int) Math.floorDiv}{@code (p, q)}.
   *

            bb.putShort((short) 0);
            bb.putShort((short) 0);

            buffer.decode(testBuffer, 0, testBuffer.length);

            assertEquals(7, buffer.getPathConsumed()); // 15 / 2 = 7 (integer division)
        }
    }

      checkArgument(dataset.length > 0, "Cannot calculate quantiles of an empty dataset");
      if (containsNaN(dataset)) {
        return NaN;
      }

      // Calculate the quotient and remainder in the integer division x = k * (N-1) / q, i.e.
      // index * (dataset.length - 1) / scale. If there is no remainder, we can just find the value
      // whose index in the sorted dataset equals the quotient; if there is a remainder, we

        final FessConfig fessConfig = ComponentUtil.getFessConfig();
        final int rankConstant = fessConfig.getRankFusionRankConstantAsInteger();
        // Guard against division by zero (should not happen due to caller checks, but defensive)
        if (searchers.length == 0) {
            logger.warn("searchWithMultipleSearchers called with empty searcher array");

   * Returns the result of dividing {@code p} by {@code q}, rounding using the specified {@code
   * RoundingMode}. If the {@code RoundingMode} is {@link RoundingMode#DOWN}, then this method is
   * equivalent to regular Java division, {@code p / q}; and if it is {@link RoundingMode#FLOOR},
   * then this method is equivalent to {@link Math#floorDiv(long,long) Math.floorDiv}{@code (p, q)}.
   *

     * Test that runtime exceptions in scripts return null
     */
    @Test
    public void test_evaluate_runtimeExceptionReturnsNull() {
        final Map<String, Object> params = new HashMap<>();
        // Division by zero
        assertNull(groovyEngine.evaluate("return 1 / 0", params));
    }

    // ===== Script Execution Tests =====

    /**
     * Test that simple arithmetic works
     */
    @Test

Thus <code>-2</code> is not the integer value minus two,
but the unsigned 64-bit integer with the same bit pattern.
The distinction rarely matters but
to avoid ambiguity, division or right shift where the right operand's
high bit is set is rejected.
</p>

<h3 id="symbols">Symbols</h3>

<p>
Some symbols, such as <code>R1</code> or <code>LR</code>,

				p.errorf("divide of value with high bit set")
			}
			divisor := p.factor()
			if divisor == 0 {
				p.errorf("division by zero")
			} else {
				value /= divisor
			}
		case '%':
			p.next()
			divisor := p.factor()
			if int64(value) < 0 {
				p.errorf("modulo of value with high bit set")
			}
			if divisor == 0 {
				p.errorf("modulo by zero")
			} else {