graph = ValueGraphBuilder.directed().build();
    IllegalArgumentException e =
        assertThrows(
            IllegalArgumentException.class,
            () -> graph.putEdgeValue(EndpointPair.unordered(1, 2), "irrelevant"));
    assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH);
  }

  @Test
  public void putEdgeValue_undirected_orderMismatch() {
    graph = ValueGraphBuilder.undirected().build();

    graph = ValueGraphBuilder.directed().build();
    IllegalArgumentException e =
        assertThrows(
            IllegalArgumentException.class,
            () -> graph.putEdgeValue(EndpointPair.unordered(1, 2), "irrelevant"));
    assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH);
  }

  @Test
  public void putEdgeValue_undirected_orderMismatch() {
    graph = ValueGraphBuilder.undirected().build();

   * doesn't. Additionally, the order in which nodes or edges are added to the graph, and the order
   * in which they are iterated over, are irrelevant.
   *
   * <p>A reference implementation of this is provided by {@link AbstractValueGraph#equals(Object)}.
   */
  @Override
  boolean equals(@Nullable Object object);

  /**

   * doesn't. Additionally, the order in which nodes or edges are added to the graph, and the order
   * in which they are iterated over, are irrelevant.
   *
   * <p>A reference implementation of this is provided by {@link AbstractGraph#equals(Object)}.
   */
  @Override
  boolean equals(@Nullable Object object);

  /**

   * other doesn't. Additionally, the order in which nodes or edges are added to the network, and
   * the order in which they are iterated over, are irrelevant.
   *
   * <p>A reference implementation of this is provided by {@link AbstractNetwork#equals(Object)}.
   */
  @Override
  boolean equals(@Nullable Object object);

  /**

				attrSize := int(fieldBuf.uint16())
				if len(fieldBuf) < attrSize {
					continue parseExtras
				}
				attrBuf := fieldBuf.sub(attrSize)
				if attrTag != 1 || attrSize != 24 {
					continue // Ignore irrelevant attributes
				}

				const ticksPerSecond = 1e7    // Windows timestamp resolution
				ts := int64(attrBuf.uint64()) // ModTime since Windows epoch
				secs := ts / ticksPerSecond

    be used to make canonical URLs for the cache that omit insignificant query parameters or other
    irrelevant data.

    This feature may be used with `POST` requests to cache their responses. In such cases the
    request body is not used to determine the cache key, so you must manually add cache-relevant
    data to the override URL. For example, you could add a `request-body-sha256` query parameter so

	d++
	return d
}
</pre>

<p>
the initialization order is <code>d</code>, <code>b</code>, <code>c</code>, <code>a</code>.
Note that the order of subexpressions in initialization expressions is irrelevant:
<code>a = c + b</code> and <code>a = b + c</code> result in the same initialization
order in this example.
</p>

<p>
Dependency analysis is performed per package; only references referring

    }

    /**
     * Returns whether relevant results were found.
     *
     * @return true if relevant results exist
     */
    public boolean isHasRelevantResults() {
        return hasRelevantResults;
    }

    /**
     * Creates a result with relevant documents found.
     *
     * @param relevantDocIds list of relevant document IDs
     * @param relevantIndexes list of relevant indexes (1-based) from search results

     *
     * @param userMessage the original user message
     * @param query the search query used
     * @param searchResults the search results to evaluate
     * @return evaluation result with relevant document IDs
     */
    RelevanceEvaluationResult evaluateResults(String userMessage, String query, List<Map<String, Object>> searchResults);

    /**