private static ModifierTree getFirstBadlyOrdered(ModifiersTree modifiersTree) { int modifierIndex = -1; Modifier[] modifiers = Modifier.values(); for (ModifierTree modifier : modifiersTree) { if (modifier.is(Kind.ANNOTATION)) { if (modifierIndex >= 0) { return modifier; } } else { if (modifierIndex < 0) { modifierIndex = 0; } ModifierKeywordTree mkt = (ModifierKeywordTree) modifier; for (; modifierIndex < modifiers.length && !mkt.modifier().equals(modifiers[modifierIndex]); modifierIndex++) { // We're just interested in the final value of modifierIndex } if (modifierIndex == modifiers.length) { return modifier; } } } return null; } }
private void checkRedundantModifier(ModifiersTree modifiersTree, Modifier modifier) { if (modifiersTree.modifiers().contains(modifier)) { addIssue(modifiersTree, "\"" + modifier.toString().toLowerCase() + "\" is redundant in this context."); } }
private static boolean hasModifier(ModifiersTree tree, Modifier expectedModifier) { for (Modifier modifier : tree.modifiers()) { if (modifier.equals(expectedModifier)) { return true; } } return false; }
@CheckForNull public static ModifierKeywordTree getModifier(ModifiersTree modifiers, Modifier modifier) { for (ModifierKeywordTree modifierKeywordTree : modifiers.modifiers()) { if (modifier.equals(modifierKeywordTree.modifier())) { return modifierKeywordTree; } } return null; } }
private static ModifierTree getFirstBadlyOrdered(ModifiersTree modifiersTree) { ListIterator<ModifierTree> modifiersIterator = modifiersTree.listIterator(); skipAnnotations(modifiersIterator); Modifier[] modifiers = Modifier.values(); int modifierIndex = 0; while (modifiersIterator.hasNext()){ ModifierTree modifier = modifiersIterator.next(); if (modifier.is(Kind.ANNOTATION)) { break; } ModifierKeywordTree mkt = (ModifierKeywordTree) modifier; for (; modifierIndex < modifiers.length && !mkt.modifier().equals(modifiers[modifierIndex]); modifierIndex++) { // We're just interested in the final value of modifierIndex } if (modifierIndex == modifiers.length) { return modifier; } } return testOnlyAnnotationsAreLeft(modifiersIterator); }
public static boolean hasModifier(ModifiersTree modifiers, Modifier expectedModifier) { for (ModifierKeywordTree modifierKeywordTree : modifiers.modifiers()) { if (expectedModifier.equals(modifierKeywordTree.modifier())) { return true; } } return false; }
private void checkRedundantModifier(ModifiersTree modifiersTree, Modifier modifier) { ModifierKeywordTree foundModifier = ModifiersUtils.getModifier(modifiersTree, modifier); if (foundModifier != null) { reportIssue(foundModifier, "\"" + modifier.toString().toLowerCase(Locale.US) + "\" is redundant in this context."); } }
private static ModifierTree getFirstBadlyOrdered(ModifiersTree modifiersTree) { ListIterator<ModifierTree> modifiersIterator = modifiersTree.listIterator(); skipAnnotations(modifiersIterator); Modifier[] modifiers = Modifier.values(); int modifierIndex = 0; while (modifiersIterator.hasNext()){ ModifierTree modifier = modifiersIterator.next(); if (modifier.is(Kind.ANNOTATION)) { break; } ModifierKeywordTree mkt = (ModifierKeywordTree) modifier; for (; modifierIndex < modifiers.length && !mkt.modifier().equals(modifiers[modifierIndex]); modifierIndex++) { // We're just interested in the final value of modifierIndex } if (modifierIndex == modifiers.length) { return modifier; } } return testOnlyAnnotationsAreLeft(modifiersIterator); }
private void checkRedundantModifier(ModifiersTree modifiersTree, Modifier modifier) { ModifierKeywordTree foundModifier = ModifiersUtils.getModifier(modifiersTree, modifier); if (foundModifier != null) { reportIssue(foundModifier, "\"" + modifier.toString().toLowerCase(Locale.US) + "\" is redundant in this context."); } }