if ep == "" {
		return dID, fmt.Errorf("no deployment id found for endpoint %s", ep)
	}
	c.RLock()
	defer c.RUnlock()
	if !c.enabled {
		return dID, errSRNotEnabled
	}
	for _, peer := range c.state.Peers {
		if ep == peer.Endpoint {
			return peer.DeploymentID, nil
		}
	}
	return dID, fmt.Errorf("no deployment id found for endpoint %s", ep)
}

        }

        /**
         * Commits the changes to the dictionary file.
         * If there is a pending new item, it is written to the file.
         *
         * @return The committed item, or null if no item was committed.
         * @throws DictionaryException if an I/O error occurs.
         */
        public StopwordsItem commit() {
            isCommit = true;
            if (item != null && item.isUpdated()) {

        QueryContext context = new QueryContext("test", false);
        QueryBuilder result = booleanQueryCommand.convertBooleanQuery(context, booleanQuery, 1.0f);

        // Should return null when no clauses are added
        assertNull(result);
    }

    // Test convertBooleanQuery with nested BooleanQuery
    public void test_convertBooleanQuery_withNestedBooleanQuery() {
        // Create inner BooleanQuery

            return true;
        }
    }

    private static class MockSearchEngineClient extends SearchEngineClient {
        // Mock implementation - no admin client needed for tests
    }

    private static class MockSearchLogBhv extends SearchLogBhv {
        public void selectBulk(Consumer<Object> entityLambda, Consumer<List<SearchLog>> entityListLambda) {

  }

  @Test
  public void removeEdge_antiparallelEdges() {
    assume().that(graphIsMutable()).isTrue();

    putEdge(N1, N2);
    putEdge(N2, N1); // no-op

    assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue();
    assertThat(graph.adjacentNodes(N1)).isEmpty();
    assertThat(graph.edges()).isEmpty();

  /**
   * Returns an array containing all of the elements in the specified collection. This method
   * returns the elements in the order they are returned by the collection's iterator. The returned
   * array is "safe" in that no references to it are maintained by the collection. The caller is
   * thus free to modify the returned array.
   *
   * <p>This method assumes that the collection size doesn't change while the method is running.
   *

    @DisplayName("readSetupWireFormat with various parameters should return 0")
    void testReadSetupWireFormatVariousParams() {
        // Test with different buffer sizes and offsets
        int[][] testCases = { { 0, 50 }, // No offset, 50 bytes
                { 10, 90 }, // 10 byte offset, 90 bytes
                { 50, 50 }, // 50 byte offset, 50 bytes
                { 0, 0 }, // Empty buffer
                { 100, 100 } // Large values

        // Verify totalentries is initialized
        assertNotNull(dfsRootEnum.totalentries);
    }

    @Test
    @DisplayName("getEntries should return empty array when no DFS roots exist")
    void testGetEntries_emptyArray() throws Exception {
        // Create empty DfsEnumArray200
        netdfs.DfsEnumArray200 emptyArray = new netdfs.DfsEnumArray200();
        emptyArray.count = 0;

Create a file named `openssl.conf` with the content below. Set `IP.1` and/or `DNS.1` to point to the correct IP/DNS addresses:

```sh
[req]
distinguished_name = req_distinguished_name
x509_extensions = v3_req
prompt = no

[req_distinguished_name]
C = US
ST = VA
L = Somewhere
O = MyOrg
OU = MyOU
CN = MyServerName

[v3_req]
subjectAltName = @alt_names

[alt_names]
IP.1 = 127.0.0.1

      this.node = node;
    }
  }

  /**
   * Determines whether an edge has already been used during traversal. In the directed case a cycle
   * is always detected before reusing an edge, so no special logic is required. In the undirected
   * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going
   * from B to A).
   */
  private static boolean canTraverseWithoutReusingEdge(