return SCOPE_OFFSET + writeScopeWireFormat(dst, dstIndex + SCOPE_OFFSET);
    }

    int readWireFormat(final byte[] src, final int srcIndex) {

        final byte tmp[] = new byte[SCOPE_OFFSET];
        int length = 15;
        for (int i = 0; i < 15; i++) {
            tmp[i] = (byte) ((src[srcIndex + 2 * i + 1] & 0xFF) - 0x41 << 4);

  val alpnProtocols: List<String>,
  val ellipticCurves: List<Int>,
  val handshakeFormat: String,
  val hexHandshakeBytes: String,
  val highestProtocol: Int,
  val id: Int,
  val isGrade0: Boolean,
  val lowestProtocol: Int,
  val maxDhBits: Int,
  val maxRsaBits: Int,
  val minDhBits: Int,
  val minEcdsaBits: Int,
  val minRsaBits: Int,
  val name: String,
  val npnProtocols: List<String>,

    // information levels

    static final int SMB_INFO_STANDARD = 1;
    static final int SMB_INFO_QUERY_EA_SIZE = 2;
    static final int SMB_INFO_QUERY_EAS_FROM_LIST = 3;
    static final int SMB_FIND_FILE_DIRECTORY_INFO = 0x101;
    static final int SMB_FIND_FILE_FULL_DIRECTORY_INFO = 0x102;
    static final int SMB_FILE_NAMES_INFO = 0x103;
    static final int SMB_FILE_BOTH_DIRECTORY_INFO = 0x104;

    private int sid;

    }
    return tmp;
  }

  @Benchmark
  int log10(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += BigIntegerMath.log10(positive[j], mode);
    }
    return tmp;
  }

  @Benchmark
  int sqrt(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += BigIntegerMath.sqrt(positive[j], mode).intValue();

final boolean DEBUG = 0; private transient SweeperPool$Sweeper sweeper; private transient int maxSize; private transient int minSize; private int triggerSize; private java.util.ArrayList pooledObjects; private boolean shuttingDown; public void SweeperPool(int, int, int, int, int); private int saneConvert(int); public synchronized Object get(); public synchronized boolean put(Object); public synchronized int getSize(); public synchronized void dispose(); public synchronized void trim(); public void...

    private final CharsRef scratchChars = new CharsRef();

    private int longestMatchEndOffset;

    private int ch;

    private final char[] readBuffer;

    private int readBufferIndex;

    private int readBufferLen;

    StringBuilder block;

    int blkStart;

    int nextBlkStart;

    private int finalOffset;

    private final PriorityQueue<MyToken> queue;

     */
    public static final int SMB2_SHARE_CAP_SCALEOUT = 0x20;

    /**
     * Share capability indicating cluster support.
     */
    public static final int SMB2_SHARE_CAP_CLUSTER = 0x40;

    /**
     * Share capability indicating asymmetric support.
     */
    public static final int SMB2_SHARE_CAP_ASYMMETRIC = 0x80;
    private byte shareType;
    private int shareFlags;
    private int capabilities;

            _src.align(4);
            final int _netnamep = _src.dec_ndr_long();
            this.type = _src.dec_ndr_long();
            final int _remarkp = _src.dec_ndr_long();
            this.permissions = _src.dec_ndr_long();
            this.max_uses = _src.dec_ndr_long();
            this.current_uses = _src.dec_ndr_long();
            final int _pathp = _src.dec_ndr_long();
            final int _passwordp = _src.dec_ndr_long();

      return delegate.add(object);
    }
    int[] entries = requireEntries();
    @Nullable Object[] elements = requireElements();

    int newEntryIndex = this.size; // current size, and pointer to the entry to be appended
    int newSize = newEntryIndex + 1;
    int hash = smearedHash(object);
    int mask = hashTableMask();
    int tableIndex = hash & mask;
    int next = CompactHashing.tableGet(requireTable(), tableIndex);

   *     such index exists.
   */
  public static int indexOf(long[] array, long target) {
    return indexOf(array, target, 0, array.length);
  }

  // TODO(kevinb): consider making this public
  private static int indexOf(long[] array, long target, int start, int end) {
    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i;
      }
    }