if (!PROCESSOR_TYPE_IDS.contains(childType)) {
                continue;
            }
            for (DependencyNode transitive : child.getChildren()) {
                if (transitive.getArtifact() == null) {
                    continue;
                }
                String transitiveType = transitive.getArtifact().getProperty(ArtifactProperties.TYPE, "");
                String derived = DERIVE_MAP.get(transitiveType);

applyAutomaticUpgradeOfCapabilities()
dependencies {
    configurations.all {
        exclude("org.slf4j", "slf4j-simple")
    }
    components {
        // Gradle distribution - minify: remove unused transitive dependencies
        applyRule<DependencyRemovalByNameRule>("com.amazonaws:aws-java-sdk-core", setOf("jackson-dataformat-cbor"))

    }

    protected DependencyManager getDependencyManager() {
        return getDependencyManager(true); // same default as in Maven4
    }

    public DependencyManager getDependencyManager(boolean transitive) {
        return transitive
                ? new TransitiveDependencyManager(getScopeManager())
                : new ClassicDependencyManager(getScopeManager());
    }

    protected DependencySelector getDependencySelector() {

    byte[] b3 = "????".getBytes(Charsets.US_ASCII);
    byte[] b4 = "ニュース".getBytes(Charsets.US_ASCII);
    byte[] b5 = "スューー".getBytes(Charsets.US_ASCII);
    // Assert they are all equal (using the transitive property)
    assertThat(b1).isEqualTo(b2);
    assertThat(b2).isEqualTo(b3);
    assertThat(b3).isEqualTo(b4);
    assertThat(b4).isEqualTo(b5);
  }

    // edges, so this traversal would require reusing the undirected AB edge.
    return false;
  }

  /**
   * Returns the transitive closure of {@code graph}. The transitive closure of a graph {@code G} is
   * a graph {@code T} that is a supergraph of {@code G}, augmented by, for each pair of nodes A and

    byte[] b3 = "????".getBytes(Charsets.US_ASCII);
    byte[] b4 = "ニュース".getBytes(Charsets.US_ASCII);
    byte[] b5 = "スューー".getBytes(Charsets.US_ASCII);
    // Assert they are all equal (using the transitive property)
    assertThat(b1).isEqualTo(b2);
    assertThat(b2).isEqualTo(b3);
    assertThat(b3).isEqualTo(b4);
    assertThat(b4).isEqualTo(b5);
  }

     */
    public static final String CONSTITUTES_BUILD_PATH = "constitutesBuildPath";

    /**
     * When an artifact is both a regular dependency and a transitive dependency
     * of a processor, this property records the derived processor type ID.
     *
     * @since 4.0.0
     */
    public static final String PROCESSOR_TYPE = "maven.processor.type";

    /**

        // Why? The second half of condition2 requires that nodeV equals other.nodeU.
        // We already know that nodeU equals other.nodeU. Combined with the earlier statement,
        // and the transitive property of equality, this implies that nodeU equals nodeV.
        // If nodeU equals nodeV, condition1 == condition2, so checking condition1 is sufficient.
        return nodeV().equals(other.nodeV());
      }

    assertThat(expected.getCause()).isEqualTo(firstException.getCause());
    // lockA should work after lockB is released.
    lockB.unlock();
    lockA.lock();
  }

  // Tests transitive deadlock detection.
  public void testDeadlock_threeLocks() {
    // Establish an ordering from lockA -> lockB.
    lockA.lock();
    lockB.lock();
    lockB.unlock();
    lockA.unlock();

    assertThat(expected.getCause()).isEqualTo(firstException.getCause());
    // lockA should work after lockB is released.
    lockB.unlock();
    lockA.lock();
  }

  // Tests transitive deadlock detection.
  public void testDeadlock_threeLocks() {
    // Establish an ordering from lockA -> lockB.
    lockA.lock();
    lockB.lock();
    lockB.unlock();
    lockA.unlock();