diff options
| author |   Manisha Aggarwal <ma9181@att.com> | 2017-06-06 14:45:52 +0000 |
|---|---|---|
| committer |   Gerrit Code Review <gerrit@onap.org> | 2017-06-06 14:45:52 +0000 |
| commit | ef8823de263dd7c599ea7d8c5c6f0a56252b02ed (patch) | |
| tree | 21d9c69beda02d220a5cb0690073f06bcd577da5 | |
| parent | fb2eb3e99edfc76cbcda61c602a4734b6f21138c (diff) | |
| parent | ad72159ff9556df771c00a97e401038047246a8b (diff) | |
Merge "Remove warning for java 1.8 syntaxis"
| -rw-r--r-- | aai-traversal/src/main/java/org/openecomp/aai/dbgraphgen/DbMeth.java | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/aai-traversal/src/main/java/org/openecomp/aai/dbgraphgen/DbMeth.java b/aai-traversal/src/main/java/org/openecomp/aai/dbgraphgen/DbMeth.java index 5951a10..bbcee63 100644 --- a/aai-traversal/src/main/java/org/openecomp/aai/dbgraphgen/DbMeth.java +++ b/aai-traversal/src/main/java/org/openecomp/aai/dbgraphgen/DbMeth.java @@ -2050,7 +2050,7 @@ public class DbMeth{ nodeTypeFilter = true; } - ArrayList <String> excludeVidList = new <String> ArrayList (); + ArrayList <String> excludeVidList = new ArrayList <String> (); if( DbEdgeRules.CanBeRecursiveNT.containsKey(startNodeNT) && excludeRecurComingIn ){ // If we're starting on a nodeType that supports recursion, then find any connected // nodes that are coming from IN edges so we can exclude them later. |