Follow Fabric guidelines

1 files changed, 128 insertions, 128 deletions

diff --git a/src/main/java/cuchaz/enigma/convert/ClassMatching.java b/src/main/java/cuchaz/enigma/convert/ClassMatching.java
index b05df87..f302f13 100644
--- a/src/main/java/cuchaz/enigma/convert/ClassMatching.java
+++ b/src/main/java/cuchaz/enigma/convert/ClassMatching.java
@@ -8,12 +8,14 @@
  * Contributors:
  * Jeff Martin - initial API and implementation
  ******************************************************************************/
+
 package cuchaz.enigma.convert;
 
 import com.google.common.collect.BiMap;
 import com.google.common.collect.HashBiMap;
 import com.google.common.collect.Lists;
 import com.google.common.collect.Sets;
+import cuchaz.enigma.mapping.ClassEntry;
 
 import java.util.ArrayList;
 import java.util.Collection;
@@ -21,134 +23,132 @@ import java.util.List;
 import java.util.Map.Entry;
 import java.util.Set;
 
-import cuchaz.enigma.mapping.ClassEntry;
-
 public class ClassMatching {
 
-    private ClassForest                   sourceClasses;
-    private ClassForest                   destClasses;
-    private BiMap<ClassEntry, ClassEntry> knownMatches;
-
-    public ClassMatching(ClassIdentifier sourceIdentifier, ClassIdentifier destIdentifier) {
-        sourceClasses = new ClassForest(sourceIdentifier);
-        destClasses = new ClassForest(destIdentifier);
-        knownMatches = HashBiMap.create();
-    }
-
-    public void addKnownMatches(BiMap<ClassEntry, ClassEntry> knownMatches) {
-        this.knownMatches.putAll(knownMatches);
-    }
-
-    public void match(Iterable<ClassEntry> sourceClasses, Iterable<ClassEntry> destClasses) {
-        for (ClassEntry sourceClass : sourceClasses) {
-            if (!knownMatches.containsKey(sourceClass)) {
-                this.sourceClasses.add(sourceClass);
-            }
-        }
-        for (ClassEntry destClass : destClasses) {
-            if (!knownMatches.containsValue(destClass)) {
-                this.destClasses.add(destClass);
-            }
-        }
-    }
-
-    public Collection<ClassMatch> matches() {
-        List<ClassMatch> matches = Lists.newArrayList();
-        for (Entry<ClassEntry, ClassEntry> entry : knownMatches.entrySet()) {
-            matches.add(new ClassMatch(
-                    entry.getKey(),
-                    entry.getValue()
-            ));
-        }
-        for (ClassIdentity identity : sourceClasses.identities()) {
-            matches.add(new ClassMatch(
-                    sourceClasses.getClasses(identity),
-                    destClasses.getClasses(identity)
-            ));
-        }
-        for (ClassIdentity identity : destClasses.identities()) {
-            if (!sourceClasses.containsIdentity(identity)) {
-                matches.add(new ClassMatch(
-                        new ArrayList<>(),
-                        destClasses.getClasses(identity)
-                ));
-            }
-        }
-        return matches;
-    }
-
-    public Collection<ClassEntry> sourceClasses() {
-        Set<ClassEntry> classes = Sets.newHashSet();
-        for (ClassMatch match : matches()) {
-            classes.addAll(match.sourceClasses);
-        }
-        return classes;
-    }
-
-    public Collection<ClassEntry> destClasses() {
-        Set<ClassEntry> classes = Sets.newHashSet();
-        for (ClassMatch match : matches()) {
-            classes.addAll(match.destClasses);
-        }
-        return classes;
-    }
-
-    public BiMap<ClassEntry, ClassEntry> uniqueMatches() {
-        BiMap<ClassEntry, ClassEntry> uniqueMatches = HashBiMap.create();
-        for (ClassMatch match : matches()) {
-            if (match.isMatched() && !match.isAmbiguous()) {
-                uniqueMatches.put(match.getUniqueSource(), match.getUniqueDest());
-            }
-        }
-        return uniqueMatches;
-    }
-
-    public Collection<ClassMatch> ambiguousMatches() {
-        List<ClassMatch> ambiguousMatches = Lists.newArrayList();
-        for (ClassMatch match : matches()) {
-            if (match.isMatched() && match.isAmbiguous()) {
-                ambiguousMatches.add(match);
-            }
-        }
-        return ambiguousMatches;
-    }
-
-    public Collection<ClassEntry> unmatchedSourceClasses() {
-        List<ClassEntry> classes = Lists.newArrayList();
-        for (ClassMatch match : matches()) {
-            if (!match.isMatched() && !match.sourceClasses.isEmpty()) {
-                classes.addAll(match.sourceClasses);
-            }
-        }
-        return classes;
-    }
-
-    public Collection<ClassEntry> unmatchedDestClasses() {
-        List<ClassEntry> classes = Lists.newArrayList();
-        for (ClassMatch match : matches()) {
-            if (!match.isMatched() && !match.destClasses.isEmpty()) {
-                classes.addAll(match.destClasses);
-            }
-        }
-        return classes;
-    }
-
-    @Override
-    public String toString() {
-
-        // count the ambiguous classes
-        int numAmbiguousSource = 0;
-        int numAmbiguousDest = 0;
-        for (ClassMatch match : ambiguousMatches()) {
-            numAmbiguousSource += match.sourceClasses.size();
-            numAmbiguousDest += match.destClasses.size();
-        }
-
-        String buf = String.format("%20s%8s%8s\n", "", "Source", "Dest") + String
-                .format("%20s%8d%8d\n", "Classes", sourceClasses().size(), destClasses().size()) + String
-                .format("%20s%8d%8d\n", "Uniquely matched", uniqueMatches().size(), uniqueMatches().size()) + String
-                .format("%20s%8d%8d\n", "Ambiguously matched", numAmbiguousSource, numAmbiguousDest) + String
-                .format("%20s%8d%8d\n", "Unmatched", unmatchedSourceClasses().size(), unmatchedDestClasses().size());
-        return buf;
-    }
+        private ClassForest sourceClasses;
+        private ClassForest destClasses;
+        private BiMap<ClassEntry, ClassEntry> knownMatches;
+
+        public ClassMatching(ClassIdentifier sourceIdentifier, ClassIdentifier destIdentifier) {
+                sourceClasses = new ClassForest(sourceIdentifier);
+                destClasses = new ClassForest(destIdentifier);
+                knownMatches = HashBiMap.create();
+        }
+
+        public void addKnownMatches(BiMap<ClassEntry, ClassEntry> knownMatches) {
+                this.knownMatches.putAll(knownMatches);
+        }
+
+        public void match(Iterable<ClassEntry> sourceClasses, Iterable<ClassEntry> destClasses) {
+                for (ClassEntry sourceClass : sourceClasses) {
+                        if (!knownMatches.containsKey(sourceClass)) {
+                                this.sourceClasses.add(sourceClass);
+                        }
+                }
+                for (ClassEntry destClass : destClasses) {
+                        if (!knownMatches.containsValue(destClass)) {
+                                this.destClasses.add(destClass);
+                        }
+                }
+        }
+
+        public Collection<ClassMatch> matches() {
+                List<ClassMatch> matches = Lists.newArrayList();
+                for (Entry<ClassEntry, ClassEntry> entry : knownMatches.entrySet()) {
+                        matches.add(new ClassMatch(
+                                entry.getKey(),
+                                entry.getValue()
+                        ));
+                }
+                for (ClassIdentity identity : sourceClasses.identities()) {
+                        matches.add(new ClassMatch(
+                                sourceClasses.getClasses(identity),
+                                destClasses.getClasses(identity)
+                        ));
+                }
+                for (ClassIdentity identity : destClasses.identities()) {
+                        if (!sourceClasses.containsIdentity(identity)) {
+                                matches.add(new ClassMatch(
+                                        new ArrayList<>(),
+                                        destClasses.getClasses(identity)
+                                ));
+                        }
+                }
+                return matches;
+        }
+
+        public Collection<ClassEntry> sourceClasses() {
+                Set<ClassEntry> classes = Sets.newHashSet();
+                for (ClassMatch match : matches()) {
+                        classes.addAll(match.sourceClasses);
+                }
+                return classes;
+        }
+
+        public Collection<ClassEntry> destClasses() {
+                Set<ClassEntry> classes = Sets.newHashSet();
+                for (ClassMatch match : matches()) {
+                        classes.addAll(match.destClasses);
+                }
+                return classes;
+        }
+
+        public BiMap<ClassEntry, ClassEntry> uniqueMatches() {
+                BiMap<ClassEntry, ClassEntry> uniqueMatches = HashBiMap.create();
+                for (ClassMatch match : matches()) {
+                        if (match.isMatched() && !match.isAmbiguous()) {
+                                uniqueMatches.put(match.getUniqueSource(), match.getUniqueDest());
+                        }
+                }
+                return uniqueMatches;
+        }
+
+        public Collection<ClassMatch> ambiguousMatches() {
+                List<ClassMatch> ambiguousMatches = Lists.newArrayList();
+                for (ClassMatch match : matches()) {
+                        if (match.isMatched() && match.isAmbiguous()) {
+                                ambiguousMatches.add(match);
+                        }
+                }
+                return ambiguousMatches;
+        }
+
+        public Collection<ClassEntry> unmatchedSourceClasses() {
+                List<ClassEntry> classes = Lists.newArrayList();
+                for (ClassMatch match : matches()) {
+                        if (!match.isMatched() && !match.sourceClasses.isEmpty()) {
+                                classes.addAll(match.sourceClasses);
+                        }
+                }
+                return classes;
+        }
+
+        public Collection<ClassEntry> unmatchedDestClasses() {
+                List<ClassEntry> classes = Lists.newArrayList();
+                for (ClassMatch match : matches()) {
+                        if (!match.isMatched() && !match.destClasses.isEmpty()) {
+                                classes.addAll(match.destClasses);
+                        }
+                }
+                return classes;
+        }
+
+        @Override
+        public String toString() {
+
+                // count the ambiguous classes
+                int numAmbiguousSource = 0;
+                int numAmbiguousDest = 0;
+                for (ClassMatch match : ambiguousMatches()) {
+                        numAmbiguousSource += match.sourceClasses.size();
+                        numAmbiguousDest += match.destClasses.size();
+                }
+
+                String buf = String.format("%20s%8s%8s\n", "", "Source", "Dest") + String
+                        .format("%20s%8d%8d\n", "Classes", sourceClasses().size(), destClasses().size()) + String
+                        .format("%20s%8d%8d\n", "Uniquely matched", uniqueMatches().size(), uniqueMatches().size()) + String
+                        .format("%20s%8d%8d\n", "Ambiguously matched", numAmbiguousSource, numAmbiguousDest) + String
+                        .format("%20s%8d%8d\n", "Unmatched", unmatchedSourceClasses().size(), unmatchedDestClasses().size());
+                return buf;
+        }
 }