refactor: use %n in printf format instead of \n

Author: oldratlee

src/main/java/fucking/concurrency/demo/HashMapHangDemo.java

@@ -30,7 +30,7 @@ public static void main(String[] args) {
 
                 // If the hashmap occurs hang problem, the following output will not appear again.
                 // On my dev machine, this problem is easily observed in the first round.
-                System.out.printf("Got key %s in round %s\n", j, i);
+                System.out.printf("Got key %s in round %s%n", j, i);
             }
         }
     }

src/main/java/fucking/concurrency/demo/InconsistentReadDemo.java

@@ -35,7 +35,7 @@ public void run() {
                     c++;
                     // On my dev machine,
                     // a batch of inconsistent reads can be observed when the process starts
-                    System.err.printf("Fuck! Got inconsistent read!! check time=%s, happen time=%s(%s%%), 1=%s, 2=%s\n",
+                    System.err.printf("Fuck! Got inconsistent read!! check time=%s, happen time=%s(%s%%), 1=%s, 2=%s%n",
                             i + 1, c, (float) c / (i + 1) * 100, c1, c2);
                 }
             }

src/main/java/fucking/concurrency/demo/InvalidCombinationStateDemo.java

@@ -33,12 +33,12 @@ public void run() {
                 int i2 = state2;
                 if (i1 * 2 != i2) {
                     c++;
-                    System.err.printf("Fuck! Got invalid CombinationStat!! check time=%s, happen time=%s(%s%%), count value=%s|%s\n",
+                    System.err.printf("Fuck! Got invalid CombinationStat!! check time=%s, happen time=%s(%s%%), count value=%s|%s%n",
                             i + 1, c, (float) c / (i + 1) * 100, i1, i2);
                 } else {
                     // if remove blew output,
                     // the probability of invalid combination on my dev machine goes from ~5% to ~0.1%
-                    System.out.printf("Emm... %s|%s\n", i1, i2);
+                    System.out.printf("Emm... %s|%s%n", i1, i2);
                 }
             }
         }

src/main/java/fucking/concurrency/demo/InvalidLongDemo.java

@@ -37,11 +37,11 @@ public void run() {
                 long low = l & 0xFFFFFFFFL;
                 if (high != low) {
                     c++;
-                    System.err.printf("Fuck! Got invalid long!! check time=%s, happen time=%s(%s%%), count value=%s|%s\n",
+                    System.err.printf("Fuck! Got invalid long!! check time=%s, happen time=%s(%s%%), count value=%s|%s%n",
                             i + 1, c, (float) c / (i + 1) * 100, high, low);
                 } else {
                     // If remove this output, invalid long is not observed on my dev machine
-                    System.out.printf("Emm... %s|%s\n", high, low);
+                    System.out.printf("Emm... %s|%s%n", high, low);
                 }
             }
         }

src/main/java/fucking/concurrency/demo/ReentrantLockLivelockDemo.java

@@ -18,7 +18,6 @@ public static void main(String[] args) throws Exception {
         thread2.start();
     }
 
-    @SuppressWarnings("InfiniteLoopStatement")
     private static void concurrencyCheckTask1() {
         System.out.println("Started concurrency check task 1");
         int counter = 0;
@@ -44,12 +43,11 @@ private static void concurrencyCheckTask1() {
             break;
         }
 
-        System.err.printf("Fuck! No meaningful work done in %s iterations of task 1.\n", counter);
+        System.err.printf("Fuck! No meaningful work done in %s iterations of task 1.%n", counter);
         lock2.unlock();
         lock1.unlock();
     }
 
-    @SuppressWarnings("InfiniteLoopStatement")
     private static void concurrencyCheckTask2() {
         System.out.println("Started concurrency check task 2");
 
@@ -75,7 +73,7 @@ private static void concurrencyCheckTask2() {
             break;
         }
 
-        System.err.printf("Fuck! No meaningful work done in %s iterations of task 2.\n", counter);
+        System.err.printf("Fuck! No meaningful work done in %s iterations of task 2.%n", counter);
         lock2.unlock();
         lock1.unlock();
     }

src/main/java/fucking/concurrency/demo/SynchronizationOnMutableFieldDemo.java

@@ -33,7 +33,7 @@ public static void main(String[] args) throws Exception {
             // On my development machine, it's almost must occur!
             // Simple and safe solution:
             //   final List field and use concurrency-safe List, such as CopyOnWriteArrayList
-            System.err.printf("Fuck! Lost update on mutable field! actual %s expected %s.\n", actualSize, expectedSize);
+            System.err.printf("Fuck! Lost update on mutable field! actual %s expected %s.%n", actualSize, expectedSize);
         } else {
             System.out.println("Emm... Got right answer!!");
         }

src/main/java/fucking/concurrency/demo/WrongCounterDemo.java

@@ -27,7 +27,7 @@ public static void main(String[] args) throws Exception {
             // On my dev machine, it's almost must occur!
             // Simple and safe solution:
             //   use AtomicInteger
-            System.err.printf("Fuck! Got wrong count!! actual %s, expected: %s.", actualCounter, expectedCount);
+            System.err.printf("Fuck! Got wrong count!! actual %s, expected: %s.%n", actualCounter, expectedCount);
         } else {
             System.out.println("Wow... Got right count!");
         }