Cleaning up repo

Author: deepak-malik

src/com/deepak/LinkedList/BasicOperations.java

@@ -1,7 +1,7 @@
 /**
  * Data-Structures-And-Algorithms-in-Java
  */
-package com.deepak.Arrays;
+package com.deepak.data.structures.Arrays;
 
 /**
  * Class to hold implementation of basic operations in java

src/com/deepak/LinkedList/DoublyLinkedList.java

@@ -2,7 +2,7 @@
  * Data-Structures-And-Algorithms-in-Java
  * ConcurrentHashMapImplementation.java
  */
-package com.deepak.Hashing;
+package com.deepak.data.structures.Hashing;
 
 import java.util.Map;
 import java.util.concurrent.ConcurrentHashMap;

src/com/deepak/LinkedList/LinkedListConcepts

@@ -2,7 +2,7 @@
  * Data-Structures-And-Algorithms-in-Java
  * ConcurrentModificationException.java
  */
-package com.deepak.Hashing;
+package com.deepak.data.structures.Hashing;
 
 import java.util.HashMap;
 import java.util.Iterator;

src/com/deepak/Arrays/ArraysConcepts renamed to src/com/deepak/data/structures/Arrays/ArraysConcepts

@@ -2,7 +2,7 @@
  * Data-Structures-And-Algorithms-in-Java
  * CustomHashMap.java
  */
-package com.deepak.Hashing;
+package com.deepak.data.structures.Hashing;
 
 import java.util.Map;
 import java.util.Objects;

src/com/deepak/Arrays/BasicOperations.java renamed to src/com/deepak/data/structures/Arrays/BasicOperations.java

@@ -0,0 +1,61 @@
+package com.deepak.data.structures.Hashing;
+
+import java.util.Map;
+import java.util.Objects;
+
+public class CustomHashTable<K, V> {
+
+	/**
+	 * This is a node representation of Linked List
+	 * @author Deepak
+	 *
+	 * @param <K>
+	 * @param <V>
+	 */
+	static class Entry<K, V> {
+		final int hash;
+		final K key;
+		V value;
+		Entry<K, V> next;
+
+		/**
+		 * Constructor for creating a entry
+		 * @param hash
+		 * @param key
+		 * @param value
+		 * @param next
+		 */
+		public Entry(int hash, K key, V value, Entry<K, V> next) {
+			this.hash = hash;
+			this.key = key;
+			this.value = value;
+			this.next = next;
+		}
+
+		/**
+		 * HashCode implementation for entry
+		 */
+		public final int hashCode() {
+			return Objects.hashCode(key) ^ Objects.hashCode(value);
+		}
+
+		/**
+		 * Method to check if two objects are equal
+		 */
+		public final boolean equals(Object o) {
+			if (o == this) {
+				return true;
+			}
+			if (o instanceof Map.Entry) {
+				Map.Entry<?,?> e = (Map.Entry<?,?>)o;
+				if (Objects.equals(key, e.getKey()) &&
+						Objects.equals(value, e.getValue())) {
+					return true;
+				}
+			}
+			return false;
+		}
+
+	}
+
+}