blob: bb3e4f430d28143a04f9f095f40afdb0a022ecbd (
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
77
78
79
80
81
82
83
|
/*******************************************************************************
* Copyright (c) 2015 Jeff Martin.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the GNU Lesser General Public
* License v3.0 which accompanies this distribution, and is available at
* http://www.gnu.org/licenses/lgpl.html
* <p>
* Contributors:
* Jeff Martin - initial API and implementation
******************************************************************************/
package cuchaz.enigma.convert;
import com.google.common.collect.Sets;
import cuchaz.enigma.mapping.ClassEntry;
import cuchaz.enigma.utils.Utils;
import java.util.Collection;
import java.util.Set;
public class ClassMatch {
public Set<ClassEntry> sourceClasses;
public Set<ClassEntry> destClasses;
public ClassMatch(Collection<ClassEntry> sourceClasses, Collection<ClassEntry> destClasses) {
this.sourceClasses = Sets.newHashSet(sourceClasses);
this.destClasses = Sets.newHashSet(destClasses);
}
public ClassMatch(ClassEntry sourceClass, ClassEntry destClass) {
sourceClasses = Sets.newHashSet();
if (sourceClass != null) {
sourceClasses.add(sourceClass);
}
destClasses = Sets.newHashSet();
if (destClass != null) {
destClasses.add(destClass);
}
}
public boolean isMatched() {
return !sourceClasses.isEmpty() && !destClasses.isEmpty();
}
public boolean isAmbiguous() {
return sourceClasses.size() > 1 || destClasses.size() > 1;
}
public ClassEntry getUniqueSource() {
if (sourceClasses.size() != 1) {
throw new IllegalStateException("Match has ambiguous source!");
}
return sourceClasses.iterator().next();
}
public ClassEntry getUniqueDest() {
if (destClasses.size() != 1) {
throw new IllegalStateException("Match has ambiguous source!");
}
return destClasses.iterator().next();
}
public Set<ClassEntry> intersectSourceClasses(Set<ClassEntry> classes) {
Set<ClassEntry> intersection = Sets.newHashSet(sourceClasses);
intersection.retainAll(classes);
return intersection;
}
@Override
public int hashCode() {
return Utils.combineHashesOrdered(sourceClasses, destClasses);
}
@Override
public boolean equals(Object other) {
return other instanceof ClassMatch && equals((ClassMatch) other);
}
public boolean equals(ClassMatch other) {
return this.sourceClasses.equals(other.sourceClasses) && this.destClasses.equals(other.destClasses);
}
}
|
