github-mirrors/logstash
1
0
Fork 0
mirror of https://github.com/elastic/logstash.git synced 2025-04-24 14:47:19 -04:00
Code Issues Projects Releases Packages Wiki Activity

MINOR: Remove redundant throws in PipelineIR path

Browse source 
Fixes #8212
This commit is contained in:
Armin 2017-09-12 14:35:26 +02:00 • committed by Armin Braun
parent b66562342d
commit fbeb49cf39
2 changed files with 6 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

2
logstash-core/src/main/java/org/logstash/config/ir/PipelineIR.java
View file

@ -62,7 +62,7 @@ public class PipelineIR implements Hashable {
return this.originalSource;
}
public List<Vertex> getPostQueue() throws InvalidIRException {
public List<Vertex> getPostQueue() {
return graph.getSortedVerticesAfter(queue);
}

17
logstash-core/src/main/java/org/logstash/config/ir/graph/Graph.java
View file

@ -330,14 +330,7 @@ public class Graph implements SourceComponent, Hashable {
}
public String toString() {
Stream<Edge> edgesToFormat;
try {
edgesToFormat = sortedEdges();
} catch (InvalidIRException e) {
// Even if this isn't a valid graph we still need to print it
edgesToFormat = edges.stream();
}
final Stream<Edge> edgesToFormat = sortedEdges();
String edgelessVerticesStr;
if (this.isolatedVertices().count() > 0) {
edgelessVerticesStr = "\n== Vertices Without Edges ==\n" +
@ -362,20 +355,20 @@ public class Graph implements SourceComponent, Hashable {
return this.sortedVertices;
}
public Stream<Edge> sortedEdges() throws InvalidIRException {
public Stream<Edge> sortedEdges() {
return getSortedVertices().stream().
flatMap(Vertex::outgoingEdges);
}
public List<Vertex> getSortedVerticesBefore(Vertex end) throws InvalidIRException {
public List<Vertex> getSortedVerticesBefore(Vertex end) {
return getSortedVerticesBetween(null, end);
}
public List<Vertex> getSortedVerticesAfter(Vertex start) throws InvalidIRException {
public List<Vertex> getSortedVerticesAfter(Vertex start) {
return getSortedVerticesBetween(start, null);
}
public List<Vertex> getSortedVerticesBetween(Vertex start, Vertex end) throws InvalidIRException {
public List<Vertex> getSortedVerticesBetween(Vertex start, Vertex end) {
List<Vertex> sortedVertices = getSortedVertices();
int startIndex = start == null ? 0 : sortedVertices.indexOf(start);