import org.junit.jupiter.api.Test;
import org.mockito.ArgumentCaptor;

import jcifs.dcerpc.rpc;
import jcifs.smb.SID;
import jcifs.smb.SmbException;

/**
 * Tests for the SID class.
 */
class SIDTest {

    // A well-known SID for "Administrators"
    private final String adminSidString = "S-1-5-32-544";
    private final byte[] adminSidBytes = new byte[] { 1, 2, 0, 0, 0, 0, 0, 5, 32, 0, 0, 0, 32, 2, 0, 0 };

    /**

        // Add minimal SID data
        testBuffer[offset + 8] = 0x01; // Revision
        testBuffer[offset + 9] = 0x01; // Sub-authority count
        for (int i = 0; i < 6; i++) {
            testBuffer[offset + 10 + i] = 0x00;
        }
        testBuffer[offset + 15] = 0x01;
        for (int i = 0; i < 4; i++) {
            testBuffer[offset + 16 + i] = 0x00;
        }

        // Test decode with offset

        this.url = url;
    }

    /**
     * Gets the HTTP method used for the request.
     *
     * @return the HTTP method (e.g., GET, POST)
     */
    public String getMethod() {
        return method;
    }

    /**
     * Sets the HTTP method used for the request.
     *
     * @param method the HTTP method to set (e.g., GET, POST)
     */

OkHttp IDNA Mapping Table
=========================

This module contains supporting tools for building the IDNA mapping table.

    )

  private val root = Node()

  init {
    for (i in CODE_BIT_COUNTS.indices) {
      addCode(i, CODES[i], CODE_BIT_COUNTS[i].toInt())
    }
  }

  @Throws(IOException::class)
  fun encode(
    source: ByteString,
    sink: BufferedSink,
  ) {
    var accumulator = 0L
    var accumulatorBitCount = 0

    for (i in 0 until source.size) {
      val symbol = source[i] and 0xff

 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software

 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software

//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.

package cmd

import static java.lang.Long.rotateRight;

import com.google.common.annotations.VisibleForTesting;

/**
 * Implementation of Geoff Pike's fingerprint2011 hash function. See {@link Hashing#fingerprint2011}
 * for information on the behaviour of the algorithm.
 *
 * <p>On Intel Core2 2.66, on 1000 bytes, fingerprint2011 takes 0.9 microseconds compared to
 * fingerprint at 4.0 microseconds and md5 at 4.5 microseconds.
 *

/**
 * Command class for handling term range query execution and conversion.
 * This class processes Lucene TermRangeQuery objects and converts them to OpenSearch QueryBuilder instances.
 */
public class TermRangeQueryCommand extends QueryCommand {
    private static final Logger logger = LogManager.getLogger(TermRangeQueryCommand.class);

    /**
     * Default constructor for TermRangeQueryCommand.
     */