}
        }
      if (!acquired) continue

      // Confirm the connection is healthy and return it.
      if (connection.isHealthy(doExtensiveHealthChecks)) return connection

      // In the second synchronized block, release the unhealthy acquired connection. We're also on
      // the hook to close this connection if it's no longer in use.
      val noNewExchangesEvent: Boolean
      val toClose: Socket? =

        FileNotifyInformation info1 = notifications.get(0);
        assertEquals(FileNotifyInformation.FILE_ACTION_ADDED, info1.getAction());
        assertEquals("test1.txt", info1.getFileName());

        // Verify second notification
        FileNotifyInformation info2 = notifications.get(1);
        assertEquals(FileNotifyInformation.FILE_ACTION_MODIFIED, info2.getAction());
        assertEquals("test2.txt", info2.getFileName());
    }

        dataMap1.put("url", "http://example.com/test1");
        indexUpdateCallback.store(paramMap, dataMap1);
        assertEquals(1, indexingHelper.sendDocumentsCalled);

        // Add second document - should trigger indexing again
        Map<String, Object> dataMap2 = new HashMap<>();
        dataMap2.put("url", "http://example.com/test2");
        indexUpdateCallback.store(paramMap, dataMap2);

    addEdge(N1, N2, E12);
    assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12);
    // Passed nodes should be in the correct edge direction, first is the
    // source node and the second is the target node
    assertThat(network.edgesConnecting(N2, N1)).isEmpty();
  }

  @Test
  public void inEdges_oneEdge() {
    addEdge(N1, N2, E12);
    assertThat(network.inEdges(N2)).containsExactly(E12);

    addEdge(N1, N2, E12);
    assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12);
    // Passed nodes should be in the correct edge direction, first is the
    // source node and the second is the target node
    assertThat(network.edgesConnecting(N2, N1)).isEmpty();
  }

  @Test
  public void inEdges_oneEdge() {
    addEdge(N1, N2, E12);
    assertThat(network.inEdges(N2)).containsExactly(E12);

        smbInfoAllocation.decode(buffer1, 0, buffer1.length);

        long firstCapacity = smbInfoAllocation.getCapacity();
        long firstFree = smbInfoAllocation.getFree();

        // Second decode with different values
        byte[] buffer2 = new byte[22];
        offset = 0;
        SMBUtil.writeInt4(0, buffer2, offset); // idFileSystem
        offset += 4;

			go mc.setErr(err.Error())
			cancel()
		}
	}()

	defer cancel()
	// Save continuous updates
	go func() {
		var err error
		ticker := time.NewTicker(10 * time.Second)
		defer ticker.Stop()
		var exit bool
		for !exit {
			select {
			case <-ticker.C:
			case <-ctx.Done():
				exit = true
			}
			metaMu.Lock()
			meta := *mc.meta

// Read reads from the current file in the tar archive.
// It returns (0, io.EOF) when it reaches the end of that file,
// until [Next] is called to advance to the next file.
//
// If the current file is sparse, then the regions marked as a hole
// are read back as NUL-bytes.
//
// Calling Read on special types like [TypeLink], [TypeSymlink], [TypeChar],
// [TypeBlock], [TypeDir], and [TypeFifo] returns (0, [io.EOF]) regardless of what

     *
     * @param zos the ZIP output stream to write to
     * @param id the diagnostic ID for organizing files in the ZIP
     * @param v1 the first part of the API path (e.g., "cluster", "nodes")
     * @param v2 the second part of the API path (e.g., "health", "stats")
     */
    protected void writeElastisearchJsonApi(final ZipOutputStream zos, final String id, final String v1, final String v2) {

        updateItem2.setNewInputs(new String[] { "p", "q" });
        updateItem2.setNewOutput("r");

        // First update should succeed
        charMappingFile.update(updateItem1);

        // Second update should fail due to mismatch
        try {
            charMappingFile.update(updateItem2);
            fail("Should throw DictionaryException");
        } catch (DictionaryException e) {