8200127: Replace collection.stream().forEach() with collection.forEach()

Reviewed-by: alanb
This commit is contained in:
Martin Buchholz 2018-04-05 09:34:46 -07:00
parent 184bbf01dd
commit 2fd847eb0e
3 changed files with 8 additions and 10 deletions

View file

@ -1742,7 +1742,7 @@ public class ModuleDescriptor
throw new IllegalArgumentException("Empty target set"); throw new IllegalArgumentException("Empty target set");
if (strict) { if (strict) {
requirePackageName(e.source()); requirePackageName(e.source());
targets.stream().forEach(Checks::requireModuleName); targets.forEach(Checks::requireModuleName);
} }
return exports(e); return exports(e);
} }
@ -1878,7 +1878,7 @@ public class ModuleDescriptor
throw new IllegalArgumentException("Empty target set"); throw new IllegalArgumentException("Empty target set");
if (strict) { if (strict) {
requirePackageName(opens.source()); requirePackageName(opens.source());
targets.stream().forEach(Checks::requireModuleName); targets.forEach(Checks::requireModuleName);
} }
return opens(opens); return opens(opens);
} }

View file

@ -593,8 +593,7 @@ public class Proxy implements java.io.Serializable {
module.getName(), cn, loader); module.getName(), cn, loader);
} }
if (isDebug("debug")) { if (isDebug("debug")) {
interfaces.stream() interfaces.forEach(c -> System.out.println(toDetails(c)));
.forEach(c -> System.out.println(toDetails(c)));
} }
} }

View file

@ -193,11 +193,10 @@ public class ModuleHashesBuilder {
*/ */
public Graph<T> transpose() { public Graph<T> transpose() {
Builder<T> builder = new Builder<>(); Builder<T> builder = new Builder<>();
nodes.stream().forEach(builder::addNode); nodes.forEach(builder::addNode);
// reverse edges // reverse edges
edges.keySet().forEach(u -> { edges.keySet().forEach(u -> {
edges.get(u).stream() edges.get(u).forEach(v -> builder.addEdge(v, u));
.forEach(v -> builder.addEdge(v, u));
}); });
return builder.build(); return builder.build();
} }
@ -231,8 +230,8 @@ public class ModuleHashesBuilder {
public void printGraph(PrintStream out) { public void printGraph(PrintStream out) {
out.println("graph for " + nodes); out.println("graph for " + nodes);
nodes.stream() nodes
.forEach(u -> adjacentNodes(u).stream() .forEach(u -> adjacentNodes(u)
.forEach(v -> out.format(" %s -> %s%n", u, v))); .forEach(v -> out.format(" %s -> %s%n", u, v)));
} }
@ -302,7 +301,7 @@ public class ModuleHashesBuilder {
return; return;
} }
visited.add(node); visited.add(node);
graph.edges().get(node).stream() graph.edges().get(node)
.forEach(x -> visit(x, visited, done)); .forEach(x -> visit(x, visited, done));
done.add(node); done.add(node);
result.addLast(node); result.addLast(node);