* transformation:
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.mother(), node.father()));
 * }
 *
 * <p>Graph algorithms that need additional capabilities (accessing both predecessors and
 * successors, iterating over the edges, etc.) should declare their input to be of a type that
 * provides those capabilities, such as {@link Graph}, {@link ValueGraph}, or {@link Network}.
 *

 * transformation:
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.leftChild(), node.rightChild()));
 * }
 *
 * <p>Graph algorithms that need additional capabilities (accessing both predecessors and
 * successors, iterating over the edges, etc.) should declare their input to be of a type that
 * provides those capabilities, such as {@link Graph}, {@link ValueGraph}, or {@link Network}.
 *

 * to the provided {@code standardEquals} method.
 *
 * <p>Each of the {@code standard} methods, where appropriate, use {@link Objects#equals} to test
 * equality for both keys and values. This may not be the desired behavior for map implementations
 * that use non-standard notions of key equality, such as the entry of a {@code SortedMap} whose
 * comparator is not consistent with {@code equals}.
 *

        assertFalse(dataMap.containsKey("y.overwrite"));
        assertEquals(1, dataMap.size());
        assertEquals("Y1", dataMap.get("y"));
    }

    /** Case 4: Both baseKey and baseKey.overwrite exist → Overwrite with the value of .overwrite */
    public void test_mergeResponseData_baseAndOverwrite() {
        Map<String, Object> dataMap = new HashMap<>();

 * A {@code PathType} can identify the Java class-path, the Java module path,
 * or another kind of path for another programming language for example.
 * Path types are often exclusive. For example, a dependency should not be
 * both on the Java class path and on the Java module path.
 *
 * @see org.apache.maven.api.services.DependencyResolverResult#getDispatchedPaths()
 *
 * @since 4.0.0
 */
@Experimental
public interface PathType {
    /**

        // Query was processed successfully

        // Query was processed successfully
    }

    public void test_convertWildcardQuery_withBothWildcards() throws Exception {
        // Test with both wildcards already present
        QueryContext queryContext = new QueryContext("*test*", false);
        WildcardQuery wildcardQuery = new WildcardQuery(new Term(Constants.DEFAULT_FIELD, "*test*"));

          // yes, that's a lot of sinks!
          sinks.add(new Sink(chunkSize, bufferSize));
          // For convenience, testing only with big endianness, to match DataOutputStream.
          // I regard highly unlikely that both the little endianness tests above and this one
          // passes, and there is still a little endianness bug lurking around.
        }
      }

      Control control = new Control();

                exceptions.add(e);
            } finally {
                endLatch.countDown();
            }
        });

        // Wait for completion
        assertTrue(endLatch.await(30, TimeUnit.SECONDS), "Both threads should complete");
        executor.shutdown();

        // Then - No ConcurrentModificationException
        for (Exception e : exceptions) {

  }

  /**
   * This is an extraordinary test case. Here's what it's trying to simulate.
   * - 2 requests happen concurrently to a host that can be coalesced onto a single connection.
   * - Both request discover no existing connection. They both make a connection.
   * - The first request "wins the race".
   * - The second request discovers it "lost the race" and closes the connection it just opened.

   * @throws NullPointerException if both {@code first} and {@code second} are null
   * @since 18.0 (since 3.0 as {@code Objects.firstNonNull()}).
   */
  public static <T> T firstNonNull(@Nullable T first, @Nullable T second) {
    if (first != null) {
      return first;
    }
    if (second != null) {
      return second;
    }
    throw new NullPointerException("Both parameters are null");
  }

  /**