Cleanup: NotNull/Nullable
GitOrigin-RevId: b8e892f32ea84c2115973155dba7127b892cc36e
This commit is contained in:
committed by
intellij-monorepo-bot
parent
89e9a42b63
commit
20d0e0f1e5
@@ -745,7 +745,7 @@ public class ControlFlowGraph implements CodeConstants {
|
|||||||
return res;
|
return res;
|
||||||
}
|
}
|
||||||
|
|
||||||
private static void addToReversePostOrderListIterative(BasicBlock root, List<? super BasicBlock> lst) {
|
private static void addToReversePostOrderListIterative(BasicBlock root, List<BasicBlock> lst) {
|
||||||
|
|
||||||
LinkedList<BasicBlock> stackNode = new LinkedList<>();
|
LinkedList<BasicBlock> stackNode = new LinkedList<>();
|
||||||
LinkedList<Integer> stackIndex = new LinkedList<>();
|
LinkedList<Integer> stackIndex = new LinkedList<>();
|
||||||
|
|||||||
@@ -74,7 +74,7 @@ public class ClassReference14Processor {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
private static void processClassRec(ClassNode node, Map<ClassWrapper, MethodWrapper> mapClassMeths, Set<? super ClassWrapper> setFound) {
|
private static void processClassRec(ClassNode node, Map<ClassWrapper, MethodWrapper> mapClassMeths, Set<ClassWrapper> setFound) {
|
||||||
ClassWrapper wrapper = node.getWrapper();
|
ClassWrapper wrapper = node.getWrapper();
|
||||||
|
|
||||||
// search code
|
// search code
|
||||||
|
|||||||
@@ -32,7 +32,7 @@ public class Fernflower implements IDecompiledData {
|
|||||||
String level = (String)properties.get(IFernflowerPreferences.LOG_LEVEL);
|
String level = (String)properties.get(IFernflowerPreferences.LOG_LEVEL);
|
||||||
if (level != null) {
|
if (level != null) {
|
||||||
try {
|
try {
|
||||||
logger.setSeverity(IFernflowerLogger.Severity.valueOf(level.toUpperCase(Locale.ENGLISH)));
|
logger.setSeverity(IFernflowerLogger.Severity.valueOf(level.toUpperCase(Locale.US)));
|
||||||
}
|
}
|
||||||
catch (IllegalArgumentException ignore) { }
|
catch (IllegalArgumentException ignore) { }
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -83,7 +83,7 @@ public class ConsoleDecompiler implements IBytecodeProvider, IResultSaver {
|
|||||||
}
|
}
|
||||||
|
|
||||||
@SuppressWarnings("UseOfSystemOutOrSystemErr")
|
@SuppressWarnings("UseOfSystemOutOrSystemErr")
|
||||||
private static void addPath(List<? super File> list, String path) {
|
private static void addPath(List<File> list, String path) {
|
||||||
File file = new File(path);
|
File file = new File(path);
|
||||||
if (file.exists()) {
|
if (file.exists()) {
|
||||||
list.add(file);
|
list.add(file);
|
||||||
|
|||||||
@@ -798,7 +798,7 @@ public class NestedClassProcessor {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
private static Statement getDefStatement(Statement stat, VarType classType, Set<? super Statement> setStats) {
|
private static Statement getDefStatement(Statement stat, VarType classType, Set<Statement> setStats) {
|
||||||
List<Exprent> lst = new ArrayList<>();
|
List<Exprent> lst = new ArrayList<>();
|
||||||
Statement retStat = null;
|
Statement retStat = null;
|
||||||
|
|
||||||
|
|||||||
@@ -525,7 +525,7 @@ public class StackVarsProcessor {
|
|||||||
return new Object[]{null, changed, false};
|
return new Object[]{null, changed, false};
|
||||||
}
|
}
|
||||||
|
|
||||||
private static boolean getUsedVersions(SSAUConstructorSparseEx ssa, VarVersionPair var, List<? super VarVersionNode> res) {
|
private static boolean getUsedVersions(SSAUConstructorSparseEx ssa, VarVersionPair var, List<VarVersionNode> res) {
|
||||||
VarVersionsGraph ssuversions = ssa.getSsuversions();
|
VarVersionsGraph ssuversions = ssa.getSsuversions();
|
||||||
VarVersionNode varnode = ssuversions.nodes.getWithKey(var);
|
VarVersionNode varnode = ssuversions.nodes.getWithKey(var);
|
||||||
|
|
||||||
|
|||||||
@@ -39,7 +39,7 @@ public class DirectGraph {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
private static void addToReversePostOrderListIterative(DirectNode root, List<? super DirectNode> lst) {
|
private static void addToReversePostOrderListIterative(DirectNode root, List<DirectNode> lst) {
|
||||||
|
|
||||||
LinkedList<DirectNode> stackNode = new LinkedList<>();
|
LinkedList<DirectNode> stackNode = new LinkedList<>();
|
||||||
LinkedList<Integer> stackIndex = new LinkedList<>();
|
LinkedList<Integer> stackIndex = new LinkedList<>();
|
||||||
|
|||||||
@@ -546,7 +546,7 @@ public class Statement implements IMatchable {
|
|||||||
// private methods
|
// private methods
|
||||||
// *****************************************************************************
|
// *****************************************************************************
|
||||||
|
|
||||||
private static void addToReversePostOrderListIterative(Statement root, List<? super Statement> lst) {
|
private static void addToReversePostOrderListIterative(Statement root, List<Statement> lst) {
|
||||||
|
|
||||||
LinkedList<Statement> stackNode = new LinkedList<>();
|
LinkedList<Statement> stackNode = new LinkedList<>();
|
||||||
LinkedList<Integer> stackIndex = new LinkedList<>();
|
LinkedList<Integer> stackIndex = new LinkedList<>();
|
||||||
@@ -589,7 +589,7 @@ public class Statement implements IMatchable {
|
|||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
private static void addToPostReversePostOrderList(Statement stat, List<? super Statement> lst, HashSet<? super Statement> setVisited) {
|
private static void addToPostReversePostOrderList(Statement stat, List<Statement> lst, HashSet<Statement> setVisited) {
|
||||||
|
|
||||||
if (setVisited.contains(stat)) { // because of not considered exception edges, s. isExitComponent. Should be rewritten, if possible.
|
if (setVisited.contains(stat)) { // because of not considered exception edges, s. isExitComponent. Should be rewritten, if possible.
|
||||||
return;
|
return;
|
||||||
|
|||||||
@@ -99,7 +99,7 @@ public class VarVersionsGraph {
|
|||||||
return lst;
|
return lst;
|
||||||
}
|
}
|
||||||
|
|
||||||
private static void addToReversePostOrderListIterative(VarVersionNode root, List<? super VarVersionNode> lst, Set<? super VarVersionNode> setVisited) {
|
private static void addToReversePostOrderListIterative(VarVersionNode root, List<VarVersionNode> lst, Set<VarVersionNode> setVisited) {
|
||||||
Map<VarVersionNode, List<VarVersionEdge>> mapNodeSuccs = new HashMap<>();
|
Map<VarVersionNode, List<VarVersionEdge>> mapNodeSuccs = new HashMap<>();
|
||||||
LinkedList<VarVersionNode> stackNode = new LinkedList<>();
|
LinkedList<VarVersionNode> stackNode = new LinkedList<>();
|
||||||
LinkedList<Integer> stackIndex = new LinkedList<>();
|
LinkedList<Integer> stackIndex = new LinkedList<>();
|
||||||
|
|||||||
@@ -33,7 +33,7 @@ public class ConverterHelper implements IIdentifierRenamer {
|
|||||||
!isValidIdentifier(elementType == Type.ELEMENT_METHOD, value) ||
|
!isValidIdentifier(elementType == Type.ELEMENT_METHOD, value) ||
|
||||||
KEYWORDS.contains(value) ||
|
KEYWORDS.contains(value) ||
|
||||||
elementType == Type.ELEMENT_CLASS && (
|
elementType == Type.ELEMENT_CLASS && (
|
||||||
RESERVED_WINDOWS_NAMESPACE.contains(value.toLowerCase(Locale.ENGLISH)) ||
|
RESERVED_WINDOWS_NAMESPACE.contains(value.toLowerCase(Locale.US)) ||
|
||||||
value.length() > 255 - ".class".length());
|
value.length() > 255 - ".class".length());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -95,7 +95,7 @@ public class GenericMain {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
private static String parseFormalParameters(String signature, List<? super String> parameters, List<? super List<GenericType>> bounds) {
|
private static String parseFormalParameters(String signature, List<String> parameters, List<List<GenericType>> bounds) {
|
||||||
if (signature.charAt(0) != '<') {
|
if (signature.charAt(0) != '<') {
|
||||||
return signature;
|
return signature;
|
||||||
}
|
}
|
||||||
|
|||||||
Reference in New Issue
Block a user