diff options
| author | 2017-03-08 08:17:04 +0100 | |
|---|---|---|
| committer | 2017-03-08 08:17:04 +0100 | |
| commit | 6e464ea251cab63c776ece0b2a356f1498ffa294 (patch) | |
| tree | 5ed30c03f5ac4cd2d6877874f5ede576049954f7 /src/main/java/cuchaz/enigma/analysis/ClassInheritanceTreeNode.java | |
| parent | Drop unix case style and implement hashCode when equals is overrided (diff) | |
| download | enigma-fork-6e464ea251cab63c776ece0b2a356f1498ffa294.tar.gz enigma-fork-6e464ea251cab63c776ece0b2a356f1498ffa294.tar.xz enigma-fork-6e464ea251cab63c776ece0b2a356f1498ffa294.zip | |
Follow Fabric guidelines
Diffstat (limited to 'src/main/java/cuchaz/enigma/analysis/ClassInheritanceTreeNode.java')
| -rw-r--r-- | src/main/java/cuchaz/enigma/analysis/ClassInheritanceTreeNode.java | 105 |
1 files changed, 52 insertions, 53 deletions
diff --git a/src/main/java/cuchaz/enigma/analysis/ClassInheritanceTreeNode.java b/src/main/java/cuchaz/enigma/analysis/ClassInheritanceTreeNode.java index 8a60fc7..24e7cb0 100644 --- a/src/main/java/cuchaz/enigma/analysis/ClassInheritanceTreeNode.java +++ b/src/main/java/cuchaz/enigma/analysis/ClassInheritanceTreeNode.java | |||
| @@ -8,74 +8,73 @@ | |||
| 8 | * Contributors: | 8 | * Contributors: |
| 9 | * Jeff Martin - initial API and implementation | 9 | * Jeff Martin - initial API and implementation |
| 10 | ******************************************************************************/ | 10 | ******************************************************************************/ |
| 11 | |||
| 11 | package cuchaz.enigma.analysis; | 12 | package cuchaz.enigma.analysis; |
| 12 | 13 | ||
| 13 | import com.google.common.collect.Lists; | 14 | import com.google.common.collect.Lists; |
| 14 | |||
| 15 | import java.util.List; | ||
| 16 | |||
| 17 | import javax.swing.tree.DefaultMutableTreeNode; | ||
| 18 | |||
| 19 | import cuchaz.enigma.mapping.ClassEntry; | 15 | import cuchaz.enigma.mapping.ClassEntry; |
| 20 | import cuchaz.enigma.mapping.Translator; | 16 | import cuchaz.enigma.mapping.Translator; |
| 21 | 17 | ||
| 18 | import javax.swing.tree.DefaultMutableTreeNode; | ||
| 19 | import java.util.List; | ||
| 20 | |||
| 22 | public class ClassInheritanceTreeNode extends DefaultMutableTreeNode { | 21 | public class ClassInheritanceTreeNode extends DefaultMutableTreeNode { |
| 23 | 22 | ||
| 24 | private Translator deobfuscatingTranslator; | 23 | private Translator deobfuscatingTranslator; |
| 25 | private String obfClassName; | 24 | private String obfClassName; |
| 26 | 25 | ||
| 27 | public ClassInheritanceTreeNode(Translator deobfuscatingTranslator, String obfClassName) { | 26 | public ClassInheritanceTreeNode(Translator deobfuscatingTranslator, String obfClassName) { |
| 28 | this.deobfuscatingTranslator = deobfuscatingTranslator; | 27 | this.deobfuscatingTranslator = deobfuscatingTranslator; |
| 29 | this.obfClassName = obfClassName; | 28 | this.obfClassName = obfClassName; |
| 30 | } | 29 | } |
| 31 | 30 | ||
| 32 | public String getObfClassName() { | 31 | public static ClassInheritanceTreeNode findNode(ClassInheritanceTreeNode node, ClassEntry entry) { |
| 33 | return this.obfClassName; | 32 | // is this the node? |
| 34 | } | 33 | if (node.getObfClassName().equals(entry.getName())) { |
| 34 | return node; | ||
| 35 | } | ||
| 35 | 36 | ||
| 36 | public String getDeobfClassName() { | 37 | // recurse |
| 37 | return this.deobfuscatingTranslator.translateClass(this.obfClassName); | 38 | for (int i = 0; i < node.getChildCount(); i++) { |
| 38 | } | 39 | ClassInheritanceTreeNode foundNode = findNode((ClassInheritanceTreeNode) node.getChildAt(i), entry); |
| 40 | if (foundNode != null) { | ||
| 41 | return foundNode; | ||
| 42 | } | ||
| 43 | } | ||
| 44 | return null; | ||
| 45 | } | ||
| 39 | 46 | ||
| 40 | @Override | 47 | public String getObfClassName() { |
| 41 | public String toString() { | 48 | return this.obfClassName; |
| 42 | String deobfClassName = getDeobfClassName(); | 49 | } |
| 43 | if (deobfClassName != null) { | ||
| 44 | return deobfClassName; | ||
| 45 | } | ||
| 46 | return this.obfClassName; | ||
| 47 | } | ||
| 48 | 50 | ||
| 49 | public void load(TranslationIndex ancestries, boolean recurse) { | 51 | public String getDeobfClassName() { |
| 50 | // get all the child nodes | 52 | return this.deobfuscatingTranslator.translateClass(this.obfClassName); |
| 51 | List<ClassInheritanceTreeNode> nodes = Lists.newArrayList(); | 53 | } |
| 52 | for (ClassEntry subclassEntry : ancestries.getSubclass(new ClassEntry(this.obfClassName))) { | ||
| 53 | nodes.add(new ClassInheritanceTreeNode(this.deobfuscatingTranslator, subclassEntry.getName())); | ||
| 54 | } | ||
| 55 | 54 | ||
| 56 | // add them to this node | 55 | @Override |
| 57 | nodes.forEach(this::add); | 56 | public String toString() { |
| 57 | String deobfClassName = getDeobfClassName(); | ||
| 58 | if (deobfClassName != null) { | ||
| 59 | return deobfClassName; | ||
| 60 | } | ||
| 61 | return this.obfClassName; | ||
| 62 | } | ||
| 58 | 63 | ||
| 59 | if (recurse) { | 64 | public void load(TranslationIndex ancestries, boolean recurse) { |
| 60 | for (ClassInheritanceTreeNode node : nodes) { | 65 | // get all the child nodes |
| 61 | node.load(ancestries, true); | 66 | List<ClassInheritanceTreeNode> nodes = Lists.newArrayList(); |
| 62 | } | 67 | for (ClassEntry subclassEntry : ancestries.getSubclass(new ClassEntry(this.obfClassName))) { |
| 63 | } | 68 | nodes.add(new ClassInheritanceTreeNode(this.deobfuscatingTranslator, subclassEntry.getName())); |
| 64 | } | 69 | } |
| 65 | 70 | ||
| 66 | public static ClassInheritanceTreeNode findNode(ClassInheritanceTreeNode node, ClassEntry entry) { | 71 | // add them to this node |
| 67 | // is this the node? | 72 | nodes.forEach(this::add); |
| 68 | if (node.getObfClassName().equals(entry.getName())) { | ||
| 69 | return node; | ||
| 70 | } | ||
| 71 | 73 | ||
| 72 | // recurse | 74 | if (recurse) { |
| 73 | for (int i = 0; i < node.getChildCount(); i++) { | 75 | for (ClassInheritanceTreeNode node : nodes) { |
| 74 | ClassInheritanceTreeNode foundNode = findNode((ClassInheritanceTreeNode) node.getChildAt(i), entry); | 76 | node.load(ancestries, true); |
| 75 | if (foundNode != null) { | 77 | } |
| 76 | return foundNode; | 78 | } |
| 77 | } | 79 | } |
| 78 | } | ||
| 79 | return null; | ||
| 80 | } | ||
| 81 | } | 80 | } |