/*
   * TODO(cpovirk): make "too small" and "too large" elements available for better navigation
   * testing. At that point, we may be able to eliminate the "hole" tests, which would mean that
   * ContiguousSet's tests would no longer need to suppress them.
   */
  @CollectionSize.Require(SEVERAL)
  public void testLower() {
    assertEquals(null, navigableSet.lower(a));
    assertEquals(a, navigableSet.lower(b));

        try {
            cache.getInputStream();
            fail("Expected IOException for deleted file");
        } catch (IOException e) {
            // Expected - file no longer exists
        }
    }

    @Test
    public void testFileBasedCacheCloseNonExistentFile() {
        tempFile = new File(Curl.tmpDir, "non-existent-file.tmp");
        assertFalse(tempFile.exists());

    @ValueSource(ints = { 1, 10, 100, 500, 1024 })
    void testReadDataWireFormatWithVariousSizes(int dataSize) throws SMBProtocolDecodingException {
        if (dataSize > outputBuffer.length) {
            return; // Skip sizes larger than buffer
        }

        byte[] sourceData = new byte[dataSize];
        for (int i = 0; i < dataSize; i++) {
            sourceData[i] = (byte) (i % 256);
        }

                      */

    Name() {
    }

    /**
     * Creates a NetBIOS name with the specified attributes.
     *
     * @param name the NetBIOS name (will be truncated to 15 characters if longer)
     * @param hexCode the NetBIOS name type/suffix
     * @param scope the NetBIOS scope identifier (uses default if null or empty)
     */
    public Name(String name, final int hexCode, final String scope) {

    }

    @Test
    @DisplayName("Should generate multiple unique nonces without collision")
    void testGenerateMultipleNoncesNoCollision() {
        // Given
        int count = 10000; // Test with larger number for collision detection
        Set<String> nonceSet = new HashSet<>();

        // When
        for (int i = 0; i < count; i++) {
            byte[] nonce = encryptionContext.generateNonce();

                            + ": " + sae);
                }
                if (sae.getNtStatus() == NtStatus.NT_STATUS_ACCESS_VIOLATION) {
                    /* Server challenge no longer valid for
                     * externally supplied password hashes.
                     */
                    final HttpSession ssn = req.getSession(false);
                    if (ssn != null) {

            ex0 = ex; // Defer to below where we're locked
            return;
        } finally {
            synchronized (run_thread) {
                if (run_thread != thread) {
                    /* Thread no longer the one setup for this transport --
                     * doConnect returned too late, just ignore.
                     */
                    if ((ex0 != null) && (LogStream.level >= 2)) {

  /*
   * Cache the size for efficiency. Using a long lets us avoid the need for
   * overflow checking and ensures that size() will function correctly even if
   * the multiset had once been larger than Integer.MAX_VALUE.
   */
  private transient long size;

  /** Standard constructor. */
  protected AbstractMapBasedMultiset(Map<E, Count> backingMap) {
    checkArgument(backingMap.isEmpty());

    String unitString = unit.toString().toLowerCase(Locale.ROOT);
    String message = "Waited " + timeout + " " + unit.toString().toLowerCase(Locale.ROOT);
    // Only report scheduling delay if larger than our spin threshold - otherwise it's just noise
    if (remainingNanos + SPIN_THRESHOLD_NANOS < 0) {
      // We over-waited for our timeout.
      message += " (plus ";
      long overWaitNanos = -remainingNanos;

    // TODO(kevinb): check more preconditions (as bufferSize >= chunkSize) if this is ever public
    checkArgument(bufferSize % chunkSize == 0);

    // TODO(user): benchmark performance difference with longer buffer
    // always space for a single primitive
    this.buffer = ByteBuffer.allocate(bufferSize + 7).order(ByteOrder.LITTLE_ENDIAN);
    this.bufferSize = bufferSize;
    this.chunkSize = chunkSize;
  }