Follow Fabric guidelines

1 files changed, 53 insertions, 53 deletions

diff --git a/src/main/java/cuchaz/enigma/convert/ClassMatch.java b/src/main/java/cuchaz/enigma/convert/ClassMatch.java
index 9fa35f0..bb3e4f4 100644
--- a/src/main/java/cuchaz/enigma/convert/ClassMatch.java
+++ b/src/main/java/cuchaz/enigma/convert/ClassMatch.java
@@ -8,76 +8,76 @@
  * 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;
 
-import cuchaz.enigma.mapping.ClassEntry;
-import cuchaz.enigma.utils.Utils;
-
 public class ClassMatch {
 
-    public Set<ClassEntry> sourceClasses;
-    public Set<ClassEntry> destClasses;
+        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(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 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.size() > 0 && destClasses.size() > 0;
-    }
+        public boolean isMatched() {
+                return !sourceClasses.isEmpty() && !destClasses.isEmpty();
+        }
 
-    public boolean isAmbiguous() {
-        return sourceClasses.size() > 1 || destClasses.size() > 1;
-    }
+        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 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 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;
-    }
+        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 int hashCode() {
+                return Utils.combineHashesOrdered(sourceClasses, destClasses);
+        }
 
-    @Override
-    public boolean equals(Object other) {
-        return other instanceof ClassMatch && equals((ClassMatch) other);
-    }
+        @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);
-    }
+        public boolean equals(ClassMatch other) {
+                return this.sourceClasses.equals(other.sourceClasses) && this.destClasses.equals(other.destClasses);
+        }
 }