JavaCorner
diff --git a/‎src/main/java/com/ab/collection/maps/HashCodeEqualsContract.java‎
Lines changed: 3 additions & 5 deletions b/‎src/main/java/com/ab/collection/maps/HashCodeEqualsContract.java‎
Lines changed: 3 additions & 5 deletions
diff --git a/‎src/main/java/com/ab/collection/sort/ComparatorDemo.java‎
Lines changed: 3 additions & 3 deletions b/‎src/main/java/com/ab/collection/sort/ComparatorDemo.java‎
Lines changed: 3 additions & 3 deletions
@@ -11,7 +11,6 @@
  *
  * Contract:
  * If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
- *
  * It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results.
  * However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.
  */
@@ -63,17 +62,16 @@ public static void main(String[] args) {
         map.put(p2,2345);
         map.put(p3,3456);
 
-        //implement only equals
+        //if you implement only equals
         //default hasCode() impl returns distinct integer for distinct object
         //you will not able to retrieve what you have added as the logical equal products have different hashcode
         Product p4 = new Product("P2",24);
         System.out.println(map.get(p4));
 
-        //implement only hashcode
+        //if you implement only hashcode
         //default equals() impl returns true only if two objects had the same reference pointer
         //you can add duplicate keys which are logically equal
-        //also you will not able to retrieve what you have added as the logical equal products have different hashcode
-        Product p5 = new Product("P3",29);
+        Product p5 = new Product("P3",  29);
         map.put(p5,4567);
 
         for (Map.Entry<Product,Integer> e:
 
@@ -26,7 +26,7 @@ public static void main(String[] args) {
         Utils.printArray(workerArr);
 
         //can pass on the fly anonymous comparator
-        Arrays.sort(workerArr, new Comparator<Worker>() {
+        Arrays.sort(workerArr, new Comparator<>() {
             @Override
             public int compare(Worker o1, Worker o2) {
                 return (int) (o1.getSalary() - o2.getSalary());
@@ -38,11 +38,11 @@ public int compare(Worker o1, Worker o2) {
         //Sort on multiple fields – Group by sort
         //Method 1
         //compare two worker object first on their id and if they are same then on the name.
-        Arrays.sort(workerArr, new Comparator<Worker>() {
+        Arrays.sort(workerArr, new Comparator<>() {
             @Override
             public int compare(Worker o1, Worker o2) {
                 int flag = o1.getId() - o2.getId();
-                if(flag==0) flag = o1.getFirstName().compareTo(o2.getFirstName());
+                if (flag == 0) flag = o1.getFirstName().compareTo(o2.getFirstName());
                 return flag;
             }
         });