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

org.gradle.internal.Pair Maven / Gradle / Ivy

There is a newer version: 8.6
Show newest version
/*
 * Copyright 2014 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.internal;

import com.google.common.base.Function;

import javax.annotation.Nullable;

public final class Pair {

    @Nullable
    public final L left;

    @Nullable
    public final R right;

    private Pair(@Nullable L left, @Nullable R right) {
        this.left = left;
        this.right = right;
    }

    @Nullable
    public L getLeft() {
        return left;
    }

    @Nullable
    public R getRight() {
        return right;
    }

    @Nullable
    public L left() {
        return left;
    }

    @Nullable
    public R right() {
        return right;
    }

    public static  Pair of(@Nullable L left, @Nullable R right) {
        return new Pair(left, right);
    }

    public  Pair> pushLeft(T t) {
        return of(t, this);
    }

    public  Pair, T> pushRight(T t) {
        return of(this, t);
    }

    public  Pair, R> nestLeft(T t) {
        return of(of(t, left), right);
    }

    public  Pair> nestRight(T t) {
        return of(left, of(t, right));
    }

    public  Pair mapLeft(Function function) throws Exception {
        return of(function.apply(left), right);
    }

    public  Pair mapRight(Function function) throws Exception {
        return of(left, function.apply(right));
    }

    @Nullable
    public  T map(Function, ? extends T> function) throws Exception {
        return function.apply(this);
    }

    public static > Function unpackLeft() {
        return new Function() {
            @Override
            public L apply(T tuple) {
                return tuple.left;
            }
        };
    }

    public static > Function unpackRight() {
        return new Function() {
            @Override
            public R apply(T tuple) {
                return tuple.right;
            }
        };
    }

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

        Pair pair = (Pair) o;

        return !(left != null ? !left.equals(pair.left) : pair.left != null) && !(right != null ? !right.equals(pair.right) : pair.right != null);
    }

    @Override
    public int hashCode() {
        int result = left != null ? left.hashCode() : 0;
        result = 31 * result + (right != null ? right.hashCode() : 0);
        return result;
    }

    @Override
    public String toString() {
        return "Pair[" + left + "," + right + ']';
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy