uuid.time_mid = (short) 0x9ABC;
            uuid.time_hi_and_version = (short) 0xDEF0;
            uuid.clock_seq_hi_and_reserved = (byte) 0x11;
            uuid.clock_seq_low = (byte) 0x22;
            uuid.node = new byte[] { (byte) 0xAA, (byte) 0xBB, (byte) 0xCC, (byte) 0xDD, (byte) 0xEE, (byte) 0xFF };

            // Mock the derive method to return a buffer for node encoding

                final int _name_bufferi = _src.index;
                _src.advance(2 * _name_bufferl);

                if (this.name.buffer == null) {
                    if (_name_buffers < 0 || _name_buffers > 0xFFFF) {
                        throw new NdrException(NdrException.INVALID_CONFORMANCE);
                    }
                    this.name.buffer = new short[_name_buffers];
                }

                final int _name_bufferi = _src.index;
                _src.advance(2 * _name_bufferl);

                if (name.buffer == null) {
                    if (_name_buffers < 0 || _name_buffers > 0xFFFF) {
                        throw new NdrException(NdrException.INVALID_CONFORMANCE);
                    }
                    name.buffer = new short[_name_buffers];
                }

            e.type = SMBUtil.readInt2(buffer, bufferIndex);
            bufferIndex += 2;
            int off = SMBUtil.readInt4(buffer, bufferIndex);
            bufferIndex += 4;
            off = (off & 0xFFFF) - this.converter;
            off = start + off;
            e.remark = readString(buffer, off, 128, false);

            if (log.isTraceEnabled()) {
                log.trace(e.toString());
            }

     */
    int DEFAULT_SO_TIMEOUT = 35000;
    /**
     * Default receive buffer size for SMB transport.
     */
    int DEFAULT_RCV_BUF_SIZE = 0xFFFF;
    /**
     * Default send buffer size for SMB transport.
     */
    int DEFAULT_SND_BUF_SIZE = 0xFFFF;
    /**
     * Default buffer size for change notification responses.
     */
    int DEFAULT_NOTIFY_BUF_SIZE = 1024;

    /**

            bufferIndex += 16;
            e.versionMajor = buffer[bufferIndex] & 0xFF;
            bufferIndex++;
            e.versionMinor = buffer[bufferIndex++] & 0xFF;
            e.type = readInt4(buffer, bufferIndex);
            bufferIndex += 4;
            int off = readInt4(buffer, bufferIndex);
            bufferIndex += 4;
            off = (off & 0xFFFF) - converter;
            off = start + off;

    }
    return tmp;
  }

  @Benchmark
  int binomial(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & 0xffff;
      tmp += BigIntegerMath.binomial(factorials[j], binomials[j]).intValue();
    }
    return tmp;
  }

    /**
     * Unspecified file ID value (all 0xFF bytes)
     */
    public static final byte[] UNSPECIFIED_FILEID =
            { (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF,
                    (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF };

    /**
     * Unspecified tree ID value
     */

 *
 * @author Louis Wasserman
 */
@NullUnmarked
final class MathBenchmarking {
  static final int ARRAY_SIZE = 0x10000;
  static final int ARRAY_MASK = 0x0ffff;
  static final Random RANDOM_SOURCE = new Random(314159265358979L);
  static final int MAX_EXPONENT = 100;

  /*
   * Duplicated from LongMath.
   * binomial(biggestBinomials[k], k) fits in a long, but not

/**
 * Benchmark for HashMultiset.add for an already-present element.
 *
 * @author Louis Wasserman
 */
@NullUnmarked
public class HashMultisetAddPresentBenchmark {
  private static final int ARRAY_MASK = 0x0ffff;
  private static final int ARRAY_SIZE = 0x10000;
  List<Multiset<Integer>> multisets = new ArrayList<>(0x10000);
  int[] queries = new int[ARRAY_SIZE];

  @BeforeExperiment
  void setUp() {