src/share/classes/java/util/TimSort.java

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

*** 194,204 ****
          /**
           * March over the array once, left to right, finding natural runs,
           * extending short natural runs to minRun elements, and merging runs
           * to maintain stack invariant.
           */
!         TimSort<T> ts = new TimSort<T>(a, c);
          int minRun = minRunLength(nRemaining);
          do {
              // Identify next run
              int runLen = countRunAndMakeAscending(a, lo, hi, c);
  
--- 194,204 ----
          /**
           * March over the array once, left to right, finding natural runs,
           * extending short natural runs to minRun elements, and merging runs
           * to maintain stack invariant.
           */
!         TimSort<T> ts = new TimSort<>(a, c);
          int minRun = minRunLength(nRemaining);
          do {
              // Identify next run
              int runLen = countRunAndMakeAscending(a, lo, hi, c);