[groovy] 02/02: Trivial refactoring: Simplify code with `Map.computeIfAbsent`

[su...@apache.org]

This is an automated email from the ASF dual-hosted git repository.

sunlan pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/groovy.git

commit a4bffdc7818e1606ce8c8d550984e1a3c0bdfab8
Author: Daniel Sun <su...@apache.org>
AuthorDate: Fri Aug 23 18:34:46 2019 +0800

    Trivial refactoring: Simplify code with `Map.computeIfAbsent`
---
 .../org/codehaus/groovy/transform/ASTTransformationVisitor.java     | 6 +-----
 1 file changed, 1 insertion(+), 5 deletions(-)

diff --git a/src/main/java/org/codehaus/groovy/transform/ASTTransformationVisitor.java b/src/main/java/org/codehaus/groovy/transform/ASTTransformationVisitor.java
index 8d0a6bc..abcd593 100644
--- a/src/main/java/org/codehaus/groovy/transform/ASTTransformationVisitor.java
+++ b/src/main/java/org/codehaus/groovy/transform/ASTTransformationVisitor.java
@@ -126,11 +126,7 @@ public final class ASTTransformationVisitor extends ClassCodeVisitorSupport {
             transforms = new HashMap<ASTNode, List<ASTTransformation>>();
             for (Map.Entry<Class<? extends ASTTransformation>, Set<ASTNode>> entry : baseTransforms.entrySet()) {
                 for (ASTNode node : entry.getValue()) {
-                    List<ASTTransformation> list = transforms.get(node);
-                    if (list == null)  {
-                        list = new ArrayList<ASTTransformation>();
-                        transforms.put(node, list);
-                    }
+                    List<ASTTransformation> list = transforms.computeIfAbsent(node, k -> new ArrayList<>());
                     list.add(transformInstances.get(entry.getKey()));
                 }
             }