logger.info("No crawling target urls.");
            }
            return;
        }

        doCrawl(sessionId, configList);
    }

    /**
     * Performs the actual crawling operation for the provided data configurations.
     * This method manages the creation and execution of crawler threads,
     * monitors their progress, and handles cleanup operations.
     *

        NbtAddress validHost = lmhosts.getByName("VALIDHOST", mockContext);
        assertNotNull(validHost);

        // Invalid entries should not be found or may have incorrect parsing
        // Note: The actual Lmhosts parser may accept "192.168.1" and parse it differently
        // than expected, so we're not asserting null for HOST1
    }

    @Test
    void testPopulateWithLongHostname() throws Exception {

                data[SIGNATURE_OFFSET + i] = (byte) 0xFF;
            }

            digest.sign(data, 0, data.length, request, response);

            // Verify signature field contains actual signature (not all zeros)
            byte[] signature = Arrays.copyOfRange(data, SIGNATURE_OFFSET, SIGNATURE_OFFSET + SIGNATURE_LENGTH);
            boolean allZero = true;
            for (byte b : signature) {

        if (cachedFiles != null) {
            log.debug("Using cached directory listing for: {}", getPath());
            return cachedFiles.toArray(new SmbFile[0]);
        }
    }
    
    // Perform actual directory enumeration
    SmbFile[] files = performDirectoryEnumeration();
    
    // Update cache if we have a directory lease
    if (directoryLeaseManager != null && directoryLeaseKey != null) {

   * list (counter-intuitive, but mathematically consistent).
   *
   * <p><i>Performance notes:</i> while the cartesian product of lists of size {@code m, n, p} is a
   * list of size {@code m x n x p}, its actual memory consumption is much smaller. When the
   * cartesian product is constructed, the input lists are merely copied. Only as the resulting list

                logger.info("No crawling target urls.");
            }
            return;
        }

        doCrawl(sessionId, webConfigList, fileConfigList);
    }

    /**
     * Performs the actual crawling operation for the provided configurations.
     *
     * @param sessionId The session ID for this crawling operation
     * @param webConfigList List of web configurations to crawl

    //                                                                           =========
    /**
     * Verifies that the CRUD mode matches the expected mode.
     *
     * @param crudMode the actual CRUD mode
     * @param expectedMode the expected CRUD mode
     */
    protected void verifyCrudMode(final int crudMode, final int expectedMode) {
        if (crudMode != expectedMode) {

   * @throws IllegalAccessException if this {@code Constructor} object enforces Java language access
   *     control and the underlying method or constructor is inaccessible.
   * @throws IllegalArgumentException if the number of actual and formal parameters differ; if an
   *     unwrapping conversion for primitive arguments fails; or if, after possible unwrapping, a
   *     parameter value cannot be converted to the corresponding formal parameter type by a method

                messageHeader(2), data);
        InputStream in = new ByteArrayInputStream(fullData);
        SocketInputStream sis = new SocketInputStream(in);

        // Should skip zero-length message and read actual data
        assertEquals(10, sis.read());
        assertEquals(20, sis.read());

        // After all data consumed, next read fails
        assertThrows(IOException.class, () -> sis.read());
    }

  // valid result thrown by java.util.TreeSet#equals.
  private static void assertNotEqualLenient(TreeSet<?> unexpected, SortedSet<?> actual) {
    try {
      assertThat(actual).isNotEqualTo(unexpected);
    } catch (ClassCastException accepted) {
    }
  }

  public void testHeadSetInclusive() {
    String[] strings = NUMBER_NAMES.toArray(new String[0]);