--- old/src/demo/share/jfc/TableExample/TableSorter.java	2018-10-03 16:39:29.281008000 +0700
+++ new/src/demo/share/jfc/TableExample/TableSorter.java	2018-10-03 16:39:28.837008000 +0700
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
@@ -71,7 +71,7 @@
 @SuppressWarnings("serial")
 public final class TableSorter extends TableMap {
 
-    int indexes[];
+    int[] indexes;
     List<Integer> sortingColumns = new ArrayList<Integer>();
     boolean ascending = true;
     int compares;
@@ -249,7 +249,7 @@
     // arrays. The number of compares appears to vary between N-1 and
     // NlogN depending on the initial order but the main reason for
     // using it here is that, unlike qsort, it is stable.
-    public void shuttlesort(int from[], int to[], int low, int high) {
+    public void shuttlesort(int[] from, int[] to, int low, int high) {
         if (high - low < 2) {
             return;
         }