1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
// Copyright 2014 The Bazel Authors. All rights reserved.
//
// 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 com.google.devtools.build.lib.util;
import com.google.common.base.Function;
import java.util.Comparator;
import java.util.Objects;
import javax.annotation.Nullable;
/**
* An immutable, semantic-free ordered pair of nullable values. Avoid using it in public APIs.
*/
public final class Pair<A, B> {
/**
* Creates a new pair containing the given elements in order.
*/
public static <A, B> Pair<A, B> of(@Nullable A first, @Nullable B second) {
return new Pair<>(first, second);
}
/**
* The first element of the pair.
*/
@Nullable
public final A first;
/**
* The second element of the pair.
*/
@Nullable
public final B second;
/**
* Constructor. It is usually easier to call {@link #of}.
*/
public Pair(@Nullable A first, @Nullable B second) {
this.first = first;
this.second = second;
}
@Nullable
public A getFirst() {
return first;
}
@Nullable
public B getSecond() {
return second;
}
@Override
public String toString() {
return "(" + first + ", " + second + ")";
}
@Override
public boolean equals(Object o) {
if (this == o) {
return true;
}
if (!(o instanceof Pair)) {
return false;
}
Pair<?, ?> p = (Pair<?, ?>) o;
return Objects.equals(first, p.first) && Objects.equals(second, p.second);
}
@Override
public int hashCode() {
int hash1 = first == null ? 0 : first.hashCode();
int hash2 = second == null ? 0 : second.hashCode();
return 31 * hash1 + hash2;
}
/**
* A function that maps to the first element in a pair.
*/
public static <A, B> Function<Pair<A, B>, A> firstFunction() {
return new Function<Pair<A, B>, A>() {
@Override
public A apply(Pair<A, B> pair) {
return pair.first;
}
};
}
/**
* A function that maps to the second element in a pair.
*/
public static <A, B> Function<Pair<A, B>, B> secondFunction() {
return new Function<Pair<A, B>, B>() {
@Override
public B apply(Pair<A, B> pair) {
return pair.second;
}
};
}
/**
* A comparator that compares pairs by comparing the first element.
*/
public static <T extends Comparable<T>, B> Comparator<Pair<T, B>> compareByFirst() {
return new Comparator<Pair<T, B>>() {
@Override
public int compare(Pair<T, B> o1, Pair<T, B> o2) {
return o1.first.compareTo(o2.first);
}
};
}
}
|