JAL-2480 tidy generic initialisations, SequenceFeatures.varargToTypes

[jalview.git] / src / jalview / datamodel / features / NCList.java

diff --git a/src/jalview/datamodel/features/NCList.java b/src/jalview/datamodel/features/NCList.java
index a6a23e7..b8160d3 100644 (file)
--- a/src/jalview/datamodel/features/NCList.java
+++ b/src/jalview/datamodel/features/NCList.java
@@ -77,7 +77,7 @@ public class NCList<T extends ContiguousI>
   public NCList(T entry)
   {
     this();
-    subranges.add(new NCNode<T>(entry));
+    subranges.add(new NCNode<>(entry));
     size = 1;
   }
 
@@ -95,7 +95,7 @@ public class NCList<T extends ContiguousI>
    */
   protected List<Range> buildSubranges(List<T> ranges)
   {
-    List<Range> sublists = new ArrayList<Range>();
+    List<Range> sublists = new ArrayList<>();
     
     if (ranges.isEmpty())
     {
@@ -174,7 +174,7 @@ public class NCList<T extends ContiguousI>
       /*
        * all subranges precede this one - add it on the end
        */
-      subranges.add(new NCNode<T>(entry));
+      subranges.add(new NCNode<>(entry));
       return true;
     }
 
@@ -196,7 +196,7 @@ public class NCList<T extends ContiguousI>
         /*
          * new entry lies between subranges j-1 j
          */
-        subranges.add(j, new NCNode<T>(entry));
+        subranges.add(j, new NCNode<>(entry));
         return true;
       }
 
@@ -244,7 +244,7 @@ public class NCList<T extends ContiguousI>
              * entry spans two subranges but doesn't enclose any
              * so just add it 
              */
-            subranges.add(j, new NCNode<T>(entry));
+            subranges.add(j, new NCNode<>(entry));
             return true;
           }
         }
@@ -265,7 +265,7 @@ public class NCList<T extends ContiguousI>
     }
     else
     {
-      subranges.add(new NCNode<T>(entry));
+      subranges.add(new NCNode<>(entry));
     }
 
     return true;
@@ -323,9 +323,9 @@ public class NCList<T extends ContiguousI>
   protected synchronized void addEnclosingRange(T entry, final int i,
           final int j)
   {
-    NCList<T> newNCList = new NCList<T>();
+    NCList<T> newNCList = new NCList<>();
     newNCList.addNodes(subranges.subList(i, j + 1));
-    NCNode<T> newNode = new NCNode<T>(entry, newNCList);
+    NCNode<T> newNode = new NCNode<>(entry, newNCList);
     for (int k = j; k >= i; k--)
     {
       subranges.remove(k);
@@ -354,7 +354,7 @@ public class NCList<T extends ContiguousI>
    */
   public List<T> findOverlaps(long from, long to)
   {
-    List<T> result = new ArrayList<T>();
+    List<T> result = new ArrayList<>();
 
     findOverlaps(from, to, result);
     
@@ -554,7 +554,7 @@ public class NCList<T extends ContiguousI>
    */
   public List<T> getEntries()
   {
-    List<T> result = new ArrayList<T>();
+    List<T> result = new ArrayList<>();
     getEntries(result);
     return result;
   }