import org.aspectj.bridge.MessageUtil;
public class Lint {
- private Map kinds = new HashMap();
- private World world;
+ /* private */ Map kinds = new HashMap();
+ /* private */ World world;
public final Kind invalidAbsoluteTypeName =
new Kind("invalidAbsoluteTypeName", "no match for this type name: {0}");
public static class Kind extends TypeSafeEnum {
- private Kind(String name, int key) {
+ /* private */ Kind(String name, int key) {
super(name, key);
}
}
- private static boolean hasClassExtension(String name) {
+ /* private */ static boolean hasClassExtension(String name) {
return name.toLowerCase().endsWith((".class"));
}
}
private final String[] declaredExceptions;
private final InstructionList body; // leaving null for abstracts
private final Attribute[] attributes;
- private final LazyClassGen enclosingClass;
+ /* private */ final LazyClassGen enclosingClass;
private final BcelMethod memberView;
private int maxLocals;
// we implement this with a LinkedList. We could possibly implement this with a java.util.SortedSet,
// but I don't trust the only implementation, TreeSet, to do the right thing.
- private static void insertHandler(ExceptionRange fresh, LinkedList l) {
+ /* private */ static void insertHandler(ExceptionRange fresh, LinkedList l) {
// for (ListIterator iter = l.listIterator(); iter.hasNext();) {
// ExceptionRange r = (ExceptionRange) iter.next();
// if (fresh.getPriority() >= r.getPriority()) {
- private static boolean unchanged(byte[] b1, byte[] b2) {
+ /* private */ static boolean unchanged(byte[] b1, byte[] b2) {
int len = b1.length;
if (b2.length != len) return false;
for (int i=0; i < len; i++) {
weaveTest("HelloWorld", "ArgsBeforeAfterHelloWorld", addLexicalOrder(l));
}
- private InstructionList getArgsAdviceTag(BcelShadow shadow, String where) {
+ /* private */ InstructionList getArgsAdviceTag(BcelShadow shadow, String where) {
String methodName =
"ajc_" + where + "_" + shadow.getKind().toLegalJavaIdentifier();
InstructionFactory fact = shadow.getFactory();