guru.nidi.codeassert.dependency.Dependencies Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of code-assert-core Show documentation
There is a newer version: 0.9.15
/*
 * Copyright © 2015 Stefan Niederhauser ([email protected])
 *
 * Licensed 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 guru.nidi.codeassert.dependency;

import guru.nidi.codeassert.config.LocationMatcher;

import java.util.*;
import java.util.function.Function;
import java.util.stream.StreamSupport;

import static java.util.stream.Collectors.toList;

public class Dependencies {
    final DependencyMap allowed;
    final DependencyMap missing;
    final DependencyMap denied;
    final Set notExisting;
    final Set undefined;
    final Set cycles;

    public Dependencies() {
        this(new DependencyMap(), new DependencyMap(), new DependencyMap(),
                new TreeSet<>(), new TreeSet<>(), new HashSet<>());
    }

    public Dependencies(DependencyMap allowed, DependencyMap missing, DependencyMap denied,
                        Set notExisting, Set undefined, Set cycles) {
        this.allowed = allowed;
        this.missing = missing;
        this.denied = denied;
        this.notExisting = notExisting;
        this.undefined = undefined;
        this.cycles = cycles;
    }

    public void merge(Dependencies cr) {
        allowed.merge(cr.allowed);
        missing.merge(cr.missing);
        denied.merge(cr.denied);
        notExisting.addAll(cr.notExisting);
        undefined.addAll(cr.undefined);
        cycles.addAll(cr.cycles);
    }

    // an explicitly allowed dependency is stronger than any denial
    public void normalize() {
        denied.without(allowed);
        allowed.clear();
    }

    public DependencyMap getAllowed() {
        return allowed;
    }

    public DependencyMap getMissing() {
        return missing;
    }

    public  List getMissing(String from, Iterable to, Function toPack) {
        return missing.getDependencies(from).keySet().stream().filter(miss ->
                StreamSupport.stream(to.spliterator(), false).noneMatch(p -> toPack.apply(p).equals(miss))
        ).collect(toList());
    }

    public DependencyMap getDenied() {
        return denied;
    }

    public Set getNotExisting() {
        return notExisting;
    }

    public Set getUndefined() {
        return undefined;
    }

    public Set getCycles() {
        return cycles;
    }

    public boolean isDenied(String from, String to) {
        return denied.getDependency(from, to) != null;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) {
            return true;
        }
        if (o == null || getClass() != o.getClass()) {
            return false;
        }

        final Dependencies that = (Dependencies) o;

        if (!allowed.equals(that.allowed)) {
            return false;
        }
        if (!missing.equals(that.missing)) {
            return false;
        }
        if (!denied.equals(that.denied)) {
            return false;
        }
        if (!notExisting.equals(that.notExisting)) {
            return false;
        }
        if (!undefined.equals(that.undefined)) {
            return false;
        }
        return cycles.equals(that.cycles);
    }

    @Override
    public int hashCode() {
        int result = allowed.hashCode();
        result = 31 * result + missing.hashCode();
        result = 31 * result + denied.hashCode();
        result = 31 * result + notExisting.hashCode();
        result = 31 * result + undefined.hashCode();
        result = 31 * result + cycles.hashCode();
        return result;
    }

    @Override
    public String toString() {
        return "RuleResult{"
                + "allowed=" + allowed
                + ", missing=" + missing
                + ", denied=" + denied
                + ", notExisting=" + notExisting
                + ", undefined=" + undefined
                + ", cycles=" + cycles
                + '}';
    }
}