| Bug |
Category |
Details |
Line |
Priority |
| it.univr.di.cstnu.graph.TNGraph.getObservers() may return null, but is declared @Nonnull |
CORRECTNESS |
NP_NONNULL_RETURN_VIOLATION |
1642 |
High |
| it.univr.di.cstnu.graph.TNGraph.getPropositions() may return null, but is declared @Nonnull |
CORRECTNESS |
NP_NONNULL_RETURN_VIOLATION |
1705 |
High |
| it.univr.di.cstnu.graph.TNGraph.getVertices() may return null, but is declared @Nonnull |
CORRECTNESS |
NP_NONNULL_RETURN_VIOLATION |
1804 |
High |
| Redundant nullcheck of edgeNodeList, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getInEdgesAndNodes(LabeledNode) |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1417 |
High |
| Redundant nullcheck of it.univr.di.cstnu.graph.TNGraph.proposition2Observer, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getObservedAndObserver() |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1562 |
High |
| Redundant nullcheck of it.univr.di.cstnu.graph.TNGraph.observer2Z, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getObserver2ZEdges() |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1593 |
High |
| Redundant nullcheck of edgeNodeList, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getOutEdgesAndNodes(LabeledNode) |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1612 |
High |
| Redundant nullcheck of differentEdges, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.differentEdgesOf(TNGraph) |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1124 |
Medium |
| Redundant nullcheck of coll, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getEdges() |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1321 |
Medium |
| Redundant nullcheck of edgeNodeList, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getEdgesAndNodes() |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1346 |
Medium |
| Redundant nullcheck of inEdges, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getInEdges(LabeledNode) |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1398 |
Medium |
| Redundant nullcheck of edgeNodeList, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getInEdgesAndNodes(LabeledNode) |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1428 |
Medium |
| Redundant nullcheck of coll, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getIncidentEdges(LabeledNode) |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1440 |
Medium |
| Redundant nullcheck of it.univr.di.cstnu.graph.TNGraph.lowerCaseEdges, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getLowerLabeledEdges() |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1479 |
Medium |
| Redundant nullcheck of outEdges, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getOutEdges(LabeledNode) |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1664 |
Medium |
| Redundant nullcheck of edgeNodeList, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getOutEdgesAndNodes(LabeledNode) |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1623 |
Medium |
| Redundant nullcheck of predecessor, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getPredecessors(LabeledNode) |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1691 |
Medium |
| Redundant nullcheck of successors, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.getSuccessors(LabeledNode) |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
1743 |
Medium |
| Redundant nullcheck of map, which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.newProposition2NodeInstance() |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
359 |
Medium |
| Redundant nullcheck of StringBuilder.toString(), which is known to be non-null in it.univr.di.cstnu.graph.TNGraph.toString() |
STYLE |
RCN_REDUNDANT_NULLCHECK_OF_NONNULL_VALUE |
2281 |
Medium |
