verify(mockMd5, times(2)).update(any(byte[].class)); // Once in constructor with ipad, once in engineDigest with opad
            verify(mockMd5, times(1)).digest(innerDigest); // Second call for final digest
        }
    }

    @Test
    void testEngineDigestWithBuffer() throws NoSuchAlgorithmException, DigestException {
        // Test engineDigest(byte[] buf, int offset, int len)

            conn.connect();
            fail("Should throw IOException");
        } catch (IOException e) {
            assertTrue(e.getMessage().contains("GCS_PROJECT_ID is blank"));
        }

        // Second call should also fail with the same error
        try {
            conn.connect();
            fail("Should throw IOException");
        } catch (IOException e) {

        setDataCount(response, 20);

        // First read
        int bytesRead1 = response.readDataWireFormat(buffer, 0, 20);
        FileSystemInformation info1 = response.getInfo();

        // Second read with different data
        buffer = prepareAllocationInfoBuffer();
        buffer[8] = 10; // Change some data

        int bytesRead2 = response.readDataWireFormat(buffer, 0, 20);

     * correct order—in order words, that it doesn't mix up big-endian and little-endian. The first
     * array has a smaller element at one index, and then the second array has a smaller element at
     * the next.
     */
    byte[] a0 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 99, 15, 16, 17};
    byte[] b0 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 99, 14, 15, 16, 17};

    private final long retryDelay;
    
    public HandleReconnector(PersistentHandleManager manager) {
        this.handleManager = manager;
        this.maxRetries = 3;
        this.retryDelay = 1000;  // 1 second
    }
    
    public CompletableFuture<SmbFile> reconnectHandle(SmbFile file, Exception cause) {
        String path = file.getPath();
        HandleInfo info = handleManager.getHandleForReconnect(path);
        

   *
   * @since 19.0
   */
  public static HashFunction concatenating(
      HashFunction first, HashFunction second, HashFunction... rest) {
    // We can't use Lists.asList() here because there's no hash->collect dependency
    List<HashFunction> list = new ArrayList<>();
    list.add(first);
    list.add(second);
    Collections.addAll(list, rest);
    return new ConcatenatedHashFunction(list.toArray(new HashFunction[0]));
  }

            if (exitValue != 0) {
                final StringBuilder out = new StringBuilder();
                if (processTimeout) {
                    out.append("Process is terminated due to ").append(timeout).append(" second exceeded.\n");
                }
                out.append("Exit Code: ").append(exitValue).append("\nOutput:\n").append(it.getOutput());
                throw new JobProcessingException(out.toString());
            }

### Performance
- Use batch operations for indexing (100-500 items)
- Don't call `refresh()` too frequently
- Limit `maxReadingNum` to prevent memory issues
- OpenSearch auto-refreshes every 1 second by default

### Compatibility
- Designed for OpenSearch 2.x+
- All text processing uses UTF-8

            assertEquals(100L, SMBUtil.readInt8(buffer, 0));
            assertEquals(200L, SMBUtil.readInt8(buffer, 8));
            assertEquals(300, SMBUtil.readInt4(buffer, 16));

            // Verify second chunk
            assertEquals(400L, SMBUtil.readInt8(buffer, EXPECTED_SIZE));
            assertEquals(500L, SMBUtil.readInt8(buffer, EXPECTED_SIZE + 8));

      // SequentialExecutor by the time the barrier is satisfied
      barrier.await(1, SECONDS);
      executor.execute(barrierTask);
      // timeout means the second task wasn't even tried
      barrier.await(1, SECONDS);
    } finally {
      service.shutdown();
    }
  }

  public void testRejectedExecutionThrownWithMultipleCalls() throws Exception {