}

    private void checkVersionsArrayEqual(String[] array) {
        // compare against each other (including itself)
        for (int i = 0; i < array.length; ++i)
            for (int j = i; j < array.length; ++j) checkVersionsEqual(array[i], array[j]);
    }

    private void checkVersionsOrder(String v1, String v2) {
        Comparable c1 = newComparable(v1);

     */
    boolean isIncludesDependencies();

    /**
     * Types of path (class-path, module-path, …) where the dependency can be placed.
     * For most deterministic builds, the array length should be 1. In such case,
     * the dependency will be unconditionally placed on the specified type of path
     * and no heuristic rule will be involved.
     *

synchronized class Xpp3Dom { protected String name; protected String value; protected java.util.Map attributes; protected java.util.List childList; protected java.util.Map childMap; protected Xpp3Dom parent; private static final Xpp3Dom[] EMPTY_DOM_ARRAY; public static final String CHILDREN_COMBINATION_MODE_ATTRIBUTE = combine.children; public static final String CHILDREN_COMBINATION_MERGE = merge; public static final String CHILDREN_COMBINATION_APPEND = append; public static final String DEFAULT_...

.notification.RunNotifier); public org.junit.runner.Description getDescription(); } org/junit/internal/ComparisonCriteria.class package org.junit.internal; public abstract synchronized class ComparisonCriteria { private static final Object END_OF_ARRAY_SENTINEL; public void ComparisonCriteria(); public void arrayEquals(String, Object, Object) throws ArrayComparisonFailu; private void arrayEquals(String, Object, Object, boolean) throws ArrayComparisonFailu; private Object getToStringableArray(Object,...