int approxSize = IntMath.divide(n * IntMath.log2(n, CEILING), Long.SIZE, CEILING);
    ArrayList<BigInteger> bignums = new ArrayList<>(approxSize);

    // Start from the pre-computed maximum long factorial.
    int startingNumber = LongMath.factorials.length;
    long product = LongMath.factorials[startingNumber - 1];
    // Strip off 2s from this value.
    int shift = Long.numberOfTrailingZeros(product);
    product >>= shift;

      doubles[i] = randomDouble(Long.SIZE);
      factorials[i] = RANDOM_SOURCE.nextInt(100);
    }
  }

  @Benchmark
  long log2(int reps) {
    long tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += Double.doubleToRawLongBits(DoubleMath.log2(positiveDoubles[j]));
    }
    return tmp;
  }

  @Benchmark
  long factorial(int reps) {
    long tmp = 0;

			[in,out,switch_is(*level)] ShareCtr *info,
			[in] unsigned long prefmaxlen,
			[out] unsigned long *totalentries,
			[in,out] unsigned long *resume_handle);

	[op(0x10)]
	int ShareGetInfo([in,string,unique] wchar_t *servername,
			[in,string] wchar_t *sharename,
			[in] int level,
			[out,switch_is(level)] ShareInfo *info);

	typedef struct {
		unsigned long platform_id;
		[string] wchar_t *name;
	} ServerInfo100;

   */
  var constructed: Boolean,
  /** Length of the message in bytes, or -1L if its length is unknown at the time of encoding. */
  var length: Long,
) {
  val isEndOfData: Boolean
    get() = tagClass == TAG_CLASS_UNIVERSAL && tag == TAG_END_OF_CONTENTS

  // Avoid Long.hashCode(long) which isn't available on Android 5.
  override fun hashCode(): Int {
    var result = 0
    result = 31 * result + tagClass

        // Test that the constructor correctly initializes the value
        long expectedValue = 123456789012345L;
        NdrHyper ndrHyper = new NdrHyper(expectedValue);
        assertEquals(expectedValue, ndrHyper.value, "Constructor should set the correct value.");
    }

    @Test
    void testEncode() throws NdrException {
        // Test the encode method
        long testValue = 987654321098765L;

   */
  public abstract ComparisonChain compare(int left, int right);

  /**
   * Compares two {@code long} values as specified by {@link Long#compare}, <i>if</i> the result of
   * this comparison chain has not already been determined.
   */
  public abstract ComparisonChain compare(long left, long right);

  /**
   * Compares two {@code float} values as specified by {@link Float#compare}, <i>if</i> the result

     * @throws SmbException if an I/O error occurs
     */
    public long getFilePointer() throws SmbException {
        return fp;
    }

    /**
     * Sets the file pointer to the specified position.
     *
     * @param pos the new file pointer position
     * @throws SmbException if an I/O error occurs
     */
    public void seek(final long pos) throws SmbException {
        fp = pos;
    }

    /**

      "sortOrder": {
        "type": "integer"
      },
      "createdBy": {
        "type": "keyword"
      },
      "createdTime": {
        "type": "long"
      },
      "updatedBy": {
        "type": "keyword"
      },
      "updatedTime": {
        "type": "long"
      }
    }

    private static final long serialVersionUID = 1L;

    public String getId() {
        return asDocMeta().id();
    }

    public void setId(final String id) {
        asDocMeta().id(id);
    }

    public Long getVersionNo() {
        return asDocMeta().version();
    }

    public void setVersionNo(final Long version) {
        asDocMeta().version(version);
    }

                    int safeShift = Math.min(MAX_BACKOFF_SHIFT, Math.max(0, retryCount - 1));
                    long multiplier = 1L << safeShift;
                    // Check for potential overflow before multiplication
                    long delay = (retryDelayMs > Long.MAX_VALUE / multiplier) ? MAX_RETRY_DELAY
                            : Math.min(MAX_RETRY_DELAY, retryDelayMs * multiplier);