* so that it may be included in the list of results. IOW we do
     * not want to create a new NbtAddress object for this particular
     * address from which the query is constructed, we want to populate
     * the data of the existing address that should be one of several
     * returned by the node status.
     */

    NodeStatusResponse(final NbtAddress queryAddress) {
        this.queryAddress = queryAddress;
        recordName = new Name();

                        dependency);
            }

            Dependency existing = index.get(key);

            if (existing != null) {
                String msg;
                if (equals(existing.getVersion(), dependency.getVersion())) {
                    msg = "duplicate declaration of version " + Objects.toString(dependency.getVersion(), "(?)");

    EnumHashBiMap<Currency, Country> bimap2 = EnumHashBiMap.create(emptyBimap2);
    assertTrue(bimap2.isEmpty());
  }

  public void testEnumHashBiMapConstructor() {
    /* Test that it copies existing entries. */
    EnumHashBiMap<Currency, String> bimap1 = EnumHashBiMap.create(Currency.class);
    bimap1.put(Currency.DOLLAR, "dollar");
    EnumHashBiMap<Currency, String> bimap2 = EnumHashBiMap.create(bimap1);

     * @param zterm whether the string should be zero terminated
     */
    public UnicodeString(final boolean zterm) {
        this.zterm = zterm;
    }

    /**
     * Constructs a UnicodeString by wrapping an existing unicode_string.
     *
     * @param rus wrapped string
     * @param zterm whether the string should be zero terminated
     */
    public UnicodeString(final rpc.unicode_string rus, final boolean zterm) {

      Class<E> clazz) {
    Map<E, LockGraphNode> existing = (Map<E, LockGraphNode>) lockGraphNodesPerType.get(clazz);
    if (existing != null) {
      return existing;
    }
    Map<E, LockGraphNode> created = createNodes(clazz);
    existing = (Map<E, LockGraphNode>) lockGraphNodesPerType.putIfAbsent(clazz, created);
    return MoreObjects.firstNonNull(existing, created);
  }

  /**

        System.err.println("Error: " + throwable.getMessage());
    });
```

## Advanced Usage

### Index from Existing Documents

```java
import org.codelibs.fess.suggest.index.contents.document.ESSourceReader;

// Index suggestions from existing Elasticsearch documents
DocumentReader reader = new ESSourceReader(
    client,
    suggester.settings(),

        assertEquals("", root.childText("description"), "Should get empty description text");

        // Test getting text from non-existing element
        assertNull(root.childText("nonexistent"), "Should return null for non-existing element");
    }

    @Test
    void testAddGAVElements() throws Exception {
        String pomXml = """
            <?xml version="1.0" encoding="UTF-8"?>

        int i2 = lifecyclePhases.indexOf(p2.executionPoint().prefix() + p2.phase());
        if (i1 == -1 && i2 == -1) {
            // unknown phases, leave in existing order
            return 0;
        }
        if (i1 == -1) {
            // second one is known, so it comes first
            return 1;
        }
        if (i2 == -1) {

# configure replication config to remote bucket at http://localhost:9000
mc replicate add source/bucket --priority 1 --remote-bucket http://repluser:repluser123@localhost:9000/bucket \

      return this;
    }

    /**
     * Adds an edge connecting {@code nodeU} to {@code nodeV} if one is not already present, and
     * sets a value for that edge to {@code value} (overwriting the existing value, if any).
     *
     * <p>If the graph is directed, the resultant edge will be directed; otherwise, it will be
     * undirected.
     *