String s = policy.substring(UPDATE_POLICY_INTERVAL.length() + 1);
            return Integer.parseInt(s);
        } else {
            return Integer.MAX_VALUE;
        }
    }

         * is interested in, i.e. all phases up to and including the specified phase.
         */

        Map<String, Map<Integer, List<MojoExecution>>> mappings = new LinkedHashMap<>();

        for (String phase : lifecycle.getPhases()) {
            Map<Integer, List<MojoExecution>> phaseBindings = new TreeMap<>();

            mappings.put(phase, phaseBindings);

            if (phase.equals(lifecyclePhase)) {

        addZeroTokens(valueTokens, 3);
        addZeroTokens(rangeValueTokens, 3);

        for (int i = 0; i < 3; i++) {
            int x = Integer.parseInt(valueTokens.get(i));
            int y = Integer.parseInt(rangeValueTokens.get(i));
            if (x < y) {
                return -1;
            } else if (x > y) {
                return 1;
            }
        }

 */
// TODO Kristian wonders if this class really is necessary and if it overlaps other concepts.
public final class ProjectIndex {

    private final Map<String, MavenProject> projects;

    private final Map<String, Integer> indices;

    public ProjectIndex(List<MavenProject> projects) {
        this.projects = new HashMap<>(projects.size() * 2);
        this.indices = new HashMap<>(projects.size() * 2);

     *
     * @param target the target location
     * @param source the source location
     * @param indices the list of integers for the indices
     * @return the merged location
     */
    public static InputLocation merge(InputLocation target, InputLocation source, Collection<Integer> indices) {
        if (source == null) {
            return target;
        } else if (target == null) {
            return source;

 */
public class DefaultProjectDependencyGraph implements ProjectDependencyGraph {

    private final ProjectSorter sorter;

    private final List<MavenProject> allProjects;

    private final Map<MavenProject, Integer> order;

    private final Map<String, MavenProject> projects;

    /**
     * Creates a new project dependency graph based on the specified projects.
     *

public String cycleToString(); public String getMessage(); } org/codehaus/plexus/util/dag/CycleDetector.class package org.codehaus.plexus.util.dag; public synchronized class CycleDetector { private static final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void CycleDetector(); public static java.util.List hasCycle(DAG); public static java.util.List introducesCycle(Vertex, java.util.Map); public static java.util.List introducesCycle(Vertex); private...

        public static final IntItem ZERO = new IntItem();

        private IntItem() {
            this.value = 0;
        }

        IntItem(String str) {
            this.value = Integer.parseInt(str);
        }

        @Override
        public int getType() {
            return INT_ITEM;
        }

        @Override
        public boolean isNull() {

        problem = new DefaultProblem(null, null, null, Integer.MAX_VALUE, -1, null);
        assertEquals(Integer.MAX_VALUE, problem.getLineNumber());

        // this case is not specified, might also return -1
        problem = new DefaultProblem(null, null, null, Integer.MIN_VALUE, -1, null);
        assertEquals(Integer.MIN_VALUE, problem.getLineNumber());
    }

    @Test
    void testGetColumnNumber() {

private final void debug(String); private void runSweep(); } org/codehaus/plexus/util/dag/CycleDetector.class package org.codehaus.plexus.util.dag; public synchronized class CycleDetector { private static final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void CycleDetector(); public static java.util.List hasCycle(DAG); public static java.util.List introducesCycle(Vertex, java.util.Map); public static java.util.List introducesCycle(Vertex); private...