|
14 | 14 |
|
15 | 15 | import javax.swing.*; |
16 | 16 | import java.awt.*; |
| 17 | +import java.util.Arrays; |
17 | 18 | import java.util.List; |
18 | 19 |
|
19 | 20 | /*************************************************************************** |
@@ -67,11 +68,13 @@ public void search(final ResourceContainer container, final String resourceWorki |
67 | 68 |
|
68 | 69 | if (srchText.isEmpty()) return; |
69 | 70 |
|
70 | | - node.fields.stream().filter(fn -> hasAnnotation(srchText, fn.invisibleAnnotations, fn.visibleAnnotations)).forEach(fn -> BytecodeViewer.viewer.searchBoxPane.treeRoot.add(new LDCSearchTreeNodeResult(container, resourceWorkingName, node, null, fn, fn.name + " " + fn.desc, ""))); |
71 | | - node.methods.stream().filter(mn -> hasAnnotation(srchText, mn.invisibleAnnotations, mn.visibleAnnotations)).forEach(mn -> BytecodeViewer.viewer.searchBoxPane.treeRoot.add(new LDCSearchTreeNodeResult(container, resourceWorkingName, node, mn, null, mn.name + mn.desc, ""))); |
| 71 | + node.fields.stream().filter(fn -> hasAnnotation(srchText, Arrays.asList(fn.invisibleAnnotations, fn.visibleAnnotations))) |
| 72 | + .forEach(fn -> BytecodeViewer.viewer.searchBoxPane.treeRoot.add(new LDCSearchTreeNodeResult(container, resourceWorkingName, node, null, fn, fn.name + " " + fn.desc, ""))); |
| 73 | + node.methods.stream().filter(mn -> hasAnnotation(srchText, Arrays.asList(mn.invisibleAnnotations, mn.visibleAnnotations))) |
| 74 | + .forEach(mn -> BytecodeViewer.viewer.searchBoxPane.treeRoot.add(new LDCSearchTreeNodeResult(container, resourceWorkingName, node, mn, null, mn.name + mn.desc, ""))); |
72 | 75 | } |
73 | 76 |
|
74 | | - public static boolean hasAnnotation(String annotation, List<AnnotationNode>... annoLists) { |
| 77 | + public static boolean hasAnnotation(String annotation, List<List<AnnotationNode>> annoLists) { |
75 | 78 | if (annoLists == null) return false; |
76 | 79 | for (List<AnnotationNode> annos : annoLists) { |
77 | 80 | if (annos == null) continue; |
|
0 commit comments