public static boolean hasModifier(ModifiersTree modifiers, Modifier expectedModifier) { return findModifier(modifiers, expectedModifier).isPresent(); }
public static boolean hasModifier(ModifiersTree modifiers, Modifier expectedModifier) { return findModifier(modifiers, expectedModifier).isPresent(); }
@CheckForNull public static ModifierKeywordTree getModifier(ModifiersTree modifiers, Modifier expectedModifier) { return findModifier(modifiers, expectedModifier).orElse(null); }
@CheckForNull public static ModifierKeywordTree getModifier(ModifiersTree modifiers, Modifier expectedModifier) { return findModifier(modifiers, expectedModifier).orElse(null); }
@Override public void visitNode(Tree tree) { if (!hasSemantic()) { return; } if (tree.is(METHOD, CONSTRUCTOR)) { MethodTree methodTree = (MethodTree) tree; int initialCounter = findModifier(methodTree.modifiers(), SYNCHRONIZED).map(m -> 1).orElse(0); synchronizedStack.push(new Counter(initialCounter)); findWaitInvocation(methodTree); } }
@Override public void visitNode(Tree tree) { if (!hasSemantic()) { return; } if (tree.is(METHOD, CONSTRUCTOR)) { MethodTree methodTree = (MethodTree) tree; int initialCounter = findModifier(methodTree.modifiers(), SYNCHRONIZED).map(m -> 1).orElse(0); synchronizedStack.push(new Counter(initialCounter)); findWaitInvocation(methodTree); } }
@Override public void visitMethod(MethodTree tree) { findModifier(tree.modifiers(), SYNCHRONIZED) .ifPresent(s -> synchronizedKeywords.add(s.keyword())); super.visitMethod(tree); }
@Override public void visitMethod(MethodTree tree) { findModifier(tree.modifiers(), SYNCHRONIZED) .ifPresent(s -> synchronizedKeywords.add(s.keyword())); super.visitMethod(tree); }