* 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

		chStorageClass = true
		srcInfo.metadataOnly = false
	} // no changes in storage-class expected so its a metadataonly operation.

	var reader io.Reader = gr

	// Set the actual size to the compressed/decrypted size if encrypted.
	actualSize, err := srcInfo.GetActualSize()
	if err != nil {
		writeErrorResponse(ctx, w, toAPIError(ctx, err), r.URL)
		return
	}
	length := actualSize

        try {
            String[] languages = searchHelper.getLanguages(getMockRequest(), params);

            assertNotNull(languages);
            if (languages.length > 0) {
                // Note: The actual order might be different due to normalization
                boolean hasEn = false, hasJa = false;
                for (String lang : languages) {
                    if ("en".equals(lang))

                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());
    }

            // When
            copy.encode(buffer, startIndex);

            // Then
            // The implementation skips 4 reserved bytes without writing zeros
            // This is consistent with the actual implementation behavior
            // The reserved bytes remain as they were in the buffer
            for (int i = 0; i < 4; i++) {
                assertEquals((byte) 0xFF, buffer[startIndex + SOURCE_KEY_SIZE + 4 + i],

                logger.info("No crawling target data configs.");
            }
            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 {

 * amortized since some operations can trigger a hash table resize.
 *
 * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()},
 * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger
 * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code

  }

  /**
   * Returns a new immutable array containing the values in the specified range.
   *
   * <p><b>Performance note:</b> The returned array has the same full memory footprint as this one
   * does (no actual copying is performed). To reduce memory usage, use {@code subArray(start,
   * end).trimmed()}.
   */
  public ImmutableLongArray subArray(int startIndex, int endIndex) {

            // Since FLAGS2_RESOLVE_PATHS_IN_DFS is 0x1000, when cast to byte it becomes 0
            // Therefore the method will always return false unless flags has all 0x00 bits set
            // This test verifies actual behavior
            testBlock.setFlags((byte) 0x00);
            assertFalse(testBlock.isResolveInDfs());

            // The correct implementation should check flags2, not flags