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

org.gradle.api.specs.AndSpec Maven / Gradle / Ivy

/*
 * Copyright 2010 the original author or authors.
 *
 * 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 org.gradle.api.specs;

import groovy.lang.Closure;
import org.gradle.api.specs.internal.ClosureSpec;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * A {@link org.gradle.api.specs.CompositeSpec} which requires all its specs to be true in order to evaluate to true.
 * Uses lazy evaluation.
 *
 * @param  The target type for this Spec
 */
public class AndSpec extends CompositeSpec {
    public AndSpec(Spec... specs) {
        super(specs);
    }

    public AndSpec(Iterable> specs) {
        super(specs);
    }

    public boolean isSatisfiedBy(T object) {
        Spec[] specs = getSpecsArray();
        for (Spec spec : specs) {
            if (!spec.isSatisfiedBy(object)) {
                return false;
            }
        }
        return true;
    }

    public AndSpec and(Spec... specs) {
        List> specs1 = getSpecs();
        List> specs2 = Arrays.asList(specs);
        List> combined = new ArrayList>(specs1.size() + specs2.size());
        combined.addAll(specs1);
        combined.addAll(specs2);
        return new AndSpec(combined);
    }

    public AndSpec and(Closure spec) {
        return and(new ClosureSpec(spec));
    }

    @Override
    public int hashCode() {
        return 7 * super.hashCode();
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy