src/share/classes/java/util/LinkedList.java

rev 3186 : 6880112: Project Coin: Port JDK core library code to use diamond operator

*** 120,130 ****
      /**
       * Links e as first element.
       */
      private void linkFirst(E e) {
          final Node<E> f = first;
!         final Node<E> newNode = new Node<E>(null, e, f);
          first = newNode;
          if (f == null)
              last = newNode;
          else
              f.prev = newNode;
--- 120,130 ----
      /**
       * Links e as first element.
       */
      private void linkFirst(E e) {
          final Node<E> f = first;
!         final Node<E> newNode = new Node<>(null, e, f);
          first = newNode;
          if (f == null)
              last = newNode;
          else
              f.prev = newNode;
*** 135,145 ****
      /**
       * Links e as last element.
       */
      void linkLast(E e) {
          final Node<E> l = last;
!         final Node<E> newNode = new Node<E>(l, e, null);
          last = newNode;
          if (l == null)
              first = newNode;
          else
              l.next = newNode;
--- 135,145 ----
      /**
       * Links e as last element.
       */
      void linkLast(E e) {
          final Node<E> l = last;
!         final Node<E> newNode = new Node<>(l, e, null);
          last = newNode;
          if (l == null)
              first = newNode;
          else
              l.next = newNode;
*** 151,161 ****
       * Inserts element e before non-null Node succ.
       */
      void linkBefore(E e, Node<E> succ) {
          // assert succ != null;
          final Node<E> pred = succ.prev;
!         final Node<E> newNode = new Node<E>(pred, e, succ);
          succ.prev = newNode;
          if (pred == null)
              first = newNode;
          else
              pred.next = newNode;
--- 151,161 ----
       * Inserts element e before non-null Node succ.
       */
      void linkBefore(E e, Node<E> succ) {
          // assert succ != null;
          final Node<E> pred = succ.prev;
!         final Node<E> newNode = new Node<>(pred, e, succ);
          succ.prev = newNode;
          if (pred == null)
              first = newNode;
          else
              pred.next = newNode;
*** 417,427 ****
              pred = succ.prev;
          }
  
          for (Object o : a) {
              @SuppressWarnings("unchecked") E e = (E) o;
!             Node<E> newNode = new Node<E>(pred, e, null);
              if (pred == null)
                  first = newNode;
              else
                  pred.next = newNode;
              pred = newNode;
--- 417,427 ----
              pred = succ.prev;
          }
  
          for (Object o : a) {
              @SuppressWarnings("unchecked") E e = (E) o;
!             Node<E> newNode = new Node<>(pred, e, null);
              if (pred == null)
                  first = newNode;
              else
                  pred.next = newNode;
              pred = newNode;