toString modified

Author: nisabmohd

build/classes/Maps/HashMapCustom.class

@@ -122,16 +122,17 @@ public void clear() {
 
     @Override
     public String toString() {
-        String str = "{ ";
+        StringBuilder builder = new StringBuilder("{");
         for (int i = 0; i < bucket.length; i++) {
             Entry temp = bucket[i];
             while (temp != null) {
-                str += temp.key + "=" + temp.val + " ";
+                builder.append(temp.key + "=" + temp.val + ",");
                 temp = temp.next;
             }
         }
-        str += "}";
-        return str;
+        if(builder.length()==1) builder.append(" ");
+        String t = builder.substring(0, builder.length() - 1);
+        return (new StringBuilder(t)).append("}").toString();
     }
 
     public int size() {

build/classes/Maps/LinkedHashMapCustom.class

@@ -27,46 +27,41 @@ public Entry(K key, V val, Entry next, Entry after, Entry before) {
     }
 
     private int hashCode(K key) {
-        return key.hashCode()%bucket.length;
+        return key.hashCode() % bucket.length;
     }
 
     public boolean put(K key, V val) {
-
         int hash = hashCode(key);
-        Entry t = new Entry(key, val, null, null, previous);
-        if (bucket[hash] == null) {
-            bucket[hash] = t;
+        if (root == null) {
+            root = new Entry<>(key, val, null, null, null);
+            previous = root;
+            bucket[hash] = root;
             size++;
-        } else {
-            Entry temp = bucket[hash];
-            if (temp.next == null) {
-                if (temp.key.equals(key)) {
-                    temp.val = val;
-                    return true;
-                }
-            }
-            while (temp.next != null) {
-                if (temp.key.equals(key)) {
-                    temp.val = val;
-                    return true;
-                }
-                temp = temp.next;
-            }
+            return true;
+        }
+        Entry<K, V> temp = bucket[hash];
+        if (temp == null) {
+            bucket[hash] = new Entry<>(key, val, null, null, previous);
+            previous.after = bucket[hash];
+            previous = bucket[hash];
+            size++;
+            return true;
+        }
+        while (temp.next != null) {
             if (temp.key.equals(key)) {
                 temp.val = val;
                 return true;
             }
-            temp.next = t;
-            t.before = previous;
-            size++;
-        }
-        if (previous != null) {
-            previous.after = t;
+            temp = temp.next;
         }
-        previous = t;
-        if (root == null) {
-            root = t;
+        if (temp.key.equals(key)) {
+            temp.val = val;
+            return true;
         }
+        temp.next = new Entry<>(key, val, null, null, previous);
+        previous.after = temp.next;
+        previous = temp.next;
+        size++;
         return true;
     }
 
@@ -165,14 +160,15 @@ public void clear() {
 
     @Override
     public String toString() {
-        String ret = "{ ";
-        Entry temp = root;
+        Entry<K, V> temp = root;
+        StringBuilder builder = new StringBuilder("{");
         while (temp != null) {
-            ret += temp.key + "=" + temp.val + " ";
+            builder.append(temp.key + "=" + temp.val + ",");
             temp = temp.after;
         }
-        ret += "}";
-        return ret;
+        if(builder.length()==1) builder.append(" ");
+        String t = builder.substring(0, builder.length() - 1);
+        return new StringBuilder(t).append("}").toString();
     }
 
     public int size() {

build/classes/Maps/Main.class

@@ -84,15 +84,18 @@ private V get(K key, Node node) {
         return get(key, node.left);
     }
 
-    boolean that=false;
+    boolean that = false;
+
     public V remove(K key) {
         V val = get(key);
         if (val == null) {
             return null;
         }
-        that=false;
+        that = false;
         root = remove(key, root);
-        if(that ) size++;
+        if (that) {
+            size++;
+        }
         return val;
     }
 
@@ -115,8 +118,8 @@ private Node remove(K key, Node node) {
                 size--;
                 return node.left;
             } else {
-               size--;
-               that=true;
+                size--;
+                that = true;
                 Node minKey = getMin(node.right);
                 node.right = remove((K) minKey.key, node.right);
                 node.key = minKey.key;
@@ -143,18 +146,19 @@ private void display(Node node, StringBuilder helper) {
             return;
         }
         display(node.left, helper);
-        helper.append(node.key + "=" + node.val + " ");
+        helper.append(node.key + "=" + node.val + ",");
         display(node.right, helper);
     }
 
     @Override
     public String toString() {
-        StringBuilder builder = new StringBuilder("[ ");
+        StringBuilder builder = new StringBuilder("{");
         StringBuilder temp = new StringBuilder();
         display(root, temp);
         builder.append(temp);
-        builder.append("]");
-        return builder.toString();
+        if(builder.length()==1) builder.append(" ");
+        String t = builder.substring(0, builder.length() - 1);
+        return (new StringBuilder(t)).append("}").toString();
     }
 
     public ArrayList<K> toKeyArray() {