All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.indoqa.cycle.plugin.Path Maven / Gradle / Ivy

There is a newer version: 3.0.0
Show newest version
/*
 * Licensed to the Indoqa Software Design und Beratung GmbH (Indoqa) under
 * one or more contributor license agreements. See the NOTICE file distributed
 * with this work for additional information regarding copyright ownership.
 * Indoqa licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.indoqa.cycle.plugin;

import java.util.*;

public class Path implements Iterable {

    public static final Comparator> LENGTH_COMPARATOR = new Comparator>() {

        @Override
        public int compare(Path o1, Path o2) {
            return o1.size() - o2.size();
        }
    };

    private List elements = new ArrayList();

    public Path(T element) {
        this.elements.add(element);
    }

    private Path(List elements) {
        this.elements.addAll(elements);
    }

    private Path(Path dependencyChain, T element) {
        this.elements.addAll(dependencyChain.getElements());
        this.elements.add(element);
    }

    public boolean beginsWith(Path other) {
        if (this.size() < other.size()) {
            return false;
        }

        return this.elements.subList(0, other.size()).equals(other.elements);
    }

    public boolean containsCycle() {
        for (int i = 0; i < this.elements.size() - 1; i++) {
            T eachElement = this.elements.get(i);

            for (int j = i + 1; j < this.elements.size(); j++) {
                if (eachElement.equals(this.elements.get(j))) {
                    return true;
                }
            }
        }

        return false;
    }

    public Path createChild(T element) {
        return new Path(this, element);
    }

    public List getElements() {
        return this.elements;
    }

    public T getLastElement() {
        return this.elements.get(this.elements.size() - 1);
    }

    @Override
    public Iterator iterator() {
        if (this.elements == null) {
            return Collections. emptyList().iterator();
        }

        return this.elements.iterator();
    }

    public void setElements(List elements) {
        this.elements = elements;
    }

    public int size() {
        return this.elements.size();
    }

    public Path subPath(int startIndex) {
        return this.subPath(startIndex, this.elements.size());
    }

    public Path subPath(int startIndex, int endIndex) {
        return new Path(this.elements.subList(startIndex, endIndex));
    }

    @Override
    public String toString() {
        StringBuilder stringBuilder = new StringBuilder();

        for (T eachElement : this.elements) {
            stringBuilder.append(eachElement);
            stringBuilder.append(", ");
        }

        return stringBuilder.toString();
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy