aboutsummaryrefslogtreecommitdiff
path: root/src/main/java/bartworks/util/Pair.java
blob: 32c55da91cf1691e2ec42c06cada9ae6b89875d1 (plain)
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
/*
 * Copyright (c) 2018-2019 bartimaeusnek Permission is hereby granted, free of charge, to any person obtaining a copy of
 * this software and associated documentation files (the "Software"), to deal in the Software without restriction,
 * including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
 * conditions: The above copyright notice and this permission notice shall be included in all copies or substantial
 * portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
 * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 */

package bartworks.util;

import java.nio.ByteBuffer;
import java.util.Arrays;
import java.util.Map;

@SuppressWarnings("unchecked")
public class Pair<A, B> implements Map.Entry<A, B> {

    Object[] pair = new Object[2];

    public Pair(Object[] pair) {
        this.pair = pair;
    }

    public Pair(A k, B v) {
        this.pair[0] = k;
        this.pair[1] = v;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (!(o instanceof Pair<?, ?>pair1)) return false;

        // Probably incorrect - comparing Object[] arrays with Arrays.equals
        return Arrays.equals(this.pair, pair1.pair);
    }

    @Override
    public int hashCode() {
        return MurmurHash3.murmurhash3_x86_32(
            ByteBuffer.allocate(8)
                .putInt(this.pair[0].hashCode())
                .putInt(this.pair[1].hashCode())
                .array(),
            0,
            8,
            31);
    }

    @Override
    public A getKey() {
        return (A) this.pair[0];
    }

    @Override
    public B getValue() {
        return (B) this.pair[1];
    }

    @Override
    public B setValue(Object value) {
        this.pair[1] = value;
        return (B) this.pair[1];
    }

    public Pair<A, B> copyWithNewValue(B value) {
        return new Pair<>((A) this.pair[0], value);
    }

    public Pair<A, B> replaceValue(B value) {
        this.setValue(value);
        return this;
    }
}