* @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
      }
    }

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

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

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

                                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(long,long) Math.floorDiv}{@code (p, q)}.
   *

      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

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 {

        buffer[offset + 20] = 0x02; // revision
        buffer[offset + 21] = 0x00; // padding
        SMBUtil.writeInt2(0, buffer, offset + 22); // size
        SMBUtil.writeInt4(4097, buffer, offset + 24); // ACE count > 4096
    }

    private void prepareSimpleSid(byte[] buffer, int offset) {
        buffer[offset] = 0x01; // revision
        buffer[offset + 1] = 0x01; // sub-authority count

                return sid.revision == this.revision;
            }
        }
        return false;
    }

    /**
     * Return the numeric representation of this sid such as
     * {@code S-1-5-21-1496946806-2192648263-3843101252-1029}.
     */
    @Override
    public String toString() {
        StringBuilder ret = new StringBuilder("S-").append(this.revision & 0xFF).append("-");

            verify(mockNdrBuffer, times(8)).dec_ndr_small(); // revision + sub_authority_count + 6 identifier_authority bytes
            verify(mockNdrBuffer).advance(6); // identifier_authority advance
            verify(mockNdrBuffer).advance(8); // sub_authority advance (4 * 2)
            verify(mockNdrBuffer, times(2)).derive(anyInt());

            assertEquals((byte) 1, sid.revision);
            assertEquals((byte) 2, sid.sub_authority_count);