diff options
author | Victor Morales <victor.morales@intel.com> | 2017-06-01 15:08:03 -0500 |
---|---|---|
committer | Victor Morales <victor.morales@intel.com> | 2017-06-01 15:11:50 -0500 |
commit | ad72159ff9556df771c00a97e401038047246a8b (patch) | |
tree | 46daac5216da0915ad98d966297b9014f42ac7c2 | |
parent | f094010f347658776e6b1ffc827b1a1838018b2d (diff) |
Remove warning for java 1.8 syntaxis
Change-Id: Ib1c04d97b07f832fd2b161bc4e0753a6de0b1da0
Signed-off-by: Victor Morales <victor.morales@intel.com>
-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. |