blob: 630f81c2bd13321be4a7a79877f3bd9b124a0733 (
plain) (
blame)
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
|
/**
* Copyright © 2014 Mattias Andrée (m@maandree.se)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package datastructures.linkedlists;
/**
* Value type that can be stored in linked lists
* to turn them into association lists.
*
* @param <K> The type of the key of the node
* @param <V> The type of the value associated with the key
*/
public class Association<K, V>
{
/**
* Constructor
*
* @param key The key of the node
* @param value The value associated with the key
*/
public Association(K key, V value)
{
this.key = key;
this.value = value;
}
/**
* The key of the node
*/
public K key;
/**
* The value associated with the key
*/
public V value;
/**
* {@inheritDoc}
*/
@Override
public boolean equals(Object other)
{
if ((this.key == null) || (other == null))
return (this.key == null) && (other == null);
return this.key.equals(other);
}
/**
* {@inheritDoc}
*/
@Override
public int hashCode()
{
return this.key.hashCode();
}
}
|
