completed

README.md

@@ -24,7 +24,7 @@ A list map stores every entry in a list. Every time the user calls `put`, create
 **BONUS**: Uncomment the remove method and add the code to pass the tests.
 
 ### Part 3 - MyHashMap
-If you still have no idea what a HashMap is, read this [article](https://medium.com/@nhu313/what-is-a-java-hashmap-83152fb632bb) or watch this [video](https://www.youtube.com/watch?v=shs0KM3wKv8). Notice I add the `bucketIndex` to help you determine where to store the entry. The `bucketIndex` uses the `hashCode` to try to evenly distribute the entries.
+If you still have no idea what a HashMap is, read this [article](v) or watch this [video](https://www.youtube.com/watch?v=shs0KM3wKv8). Notice I add the `bucketIndex` to help you determine where to store the entry. The `bucketIndex` uses the `hashCode` to try to evenly distribute the entries.
   1. `put` - find which bucket it belongs to, then add it to the list of that bucket
   2. `get` - find which bucket it belongs to, then loop through the list to find the entry corresponding to the key
   3. Uncomment line 178 - 196. Notice how fast it takes to run.

src/main/java/org/zipcoder/store/Cart.java

@@ -12,4 +12,18 @@ public class Cart {
     public long getId(){
         return this.id;
     }
+
+    @Override
+    public boolean equals(Object o) {
+        if (this == o) return true;
+        if (o == null || getClass() != o.getClass()) return false;
+        Cart cart = (Cart) o;
+        return id == cart.id;
+    }
+
+    @Override
+    public int hashCode() {
+
+        return Objects.hash(id);
+    }
 }

src/main/java/org/zipcoder/store/ListMap.java

@@ -4,45 +4,70 @@ import java.util.ArrayList;
 import java.util.List;
 
 public class ListMap implements MyMap {
-    // instance field that is intialize to an ArrayList
     private List<Entry> entries = new ArrayList<>();
 
     @Override
     public int size() {
-        return -1;
+        return entries.size();
     }
 
     @Override
     public boolean isEmptry() {
-        return false;
+        return entries.isEmpty();
     }
 
     @Override
     public Cart get(User key) {
-        // find the cart associate with the key
+        for (Entry e : entries) {
+            if (e.getKey().equals(key)) {
+                return e.getValue();
+            }
+        }
         return null;
     }
 
     @Override
     public void put(User key, Cart value) {
-        // add the key, value entry to the entries list
+        if (get(key) == null) entries.add(new Entry(key, value));
+        else {
+            for (Entry e : entries) {
+                if (e.getKey().equals(key)) {
+                    entries.remove(e);
+                    e.setValue(value);
+                    entries.add(e);
+                }
+            }
+        }
     }
 
 
     @Override
     public List<User> getKeys() {
-        // get all the keys in the map
-        return null;
+        List<User> users = new ArrayList<>();
+        for (Entry e : entries) {
+            users.add(e.getKey());
+        }
+        return users;
     }
 
     @Override
     public List<Cart> getValues() {
-        // get all the values in the map
-        return null;
+        List<Cart> carts = new ArrayList<>();
+        for (Entry e : entries) {
+            carts.add(e.getValue());
+        }
+        return carts;
     }
 
     @Override
     public Cart remove(User key) {
-        return null;
+        Cart cart = null;
+        for (Entry e : entries) {
+            if (e.getKey().equals(key)) {
+                cart = e.getValue();
+                entries.remove(e);
+            }
+        }
+        return cart;
     }
 }

src/main/java/org/zipcoder/store/MyHashMap.java

@@ -2,49 +2,80 @@ package org.zipcoder.store;
 
 import java.util.*;
 
-public class MyHashMap implements MyMap{
+public class MyHashMap implements MyMap {
     // final field that doesn't change for any object
     private static final int BUCKET_SIZE = 15;
 
     // instance field that can only be set once. It is different for every Object
     private final List<Entry>[] entries;
 
-    public MyHashMap(){
+    public MyHashMap() {
         entries = new List[BUCKET_SIZE];
 
-        for(int i = 0; i < BUCKET_SIZE; i++) {
+        for (int i = 0; i < BUCKET_SIZE; i++) {
             entries[i] = new ArrayList<>();
         }
     }
 
     @Override
     public int size() {
-        return -1;
+        int size = 0;
+        for (List<Entry> lst : entries) {
+            size += lst.size();
+        }
+        return size;
     }
 
     @Override
     public boolean isEmptry() {
-        return false;
+        if (size() == 0) {
+            return true;
+        } else {
+            return false;
+        }
     }
 
     @Override
     public Cart get(User key) {
-        return null;
+        Cart c = null;
+        List<Entry> entryList = entries[bucketIndex(key)];
+        for (Entry e : entryList) {
+            if (e.getKey().equals(key)) {
+                c = e.getValue();
+            }
+
+        }
+        return c;
     }
 
     @Override
     public void put(User key, Cart value) {
+        entries[bucketIndex(key)].add(new Entry(key, value));
 
     }
 
     @Override
     public List<User> getKeys() {
-        return null;
+        List<User> user = new ArrayList<>();
+
+        for (List<Entry> entryList : entries) {
+            for (Entry e : entryList) {
+                user.add(e.getKey());
+            }
+
+        }
+        return user;
     }
 
     @Override
     public List<Cart> getValues() {
-        return null;
+        List<Cart> c = new ArrayList<>();
+        for (List<Entry> entryList : entries) {
+            for (Entry e : entryList) {
+                c.add(e.getValue());
+            }
+        }
+        return c;
     }
 
     @Override
@@ -52,7 +83,7 @@ public class MyHashMap implements MyMap{
         return null;
     }
 
-    private int bucketIndex(User key){
+    private int bucketIndex(User key) {
         return Math.abs(key.hashCode()) % entries.length;
     }
 }

src/main/java/org/zipcoder/store/User.java

@@ -7,7 +7,8 @@ public class User {
     private long id;
     private String name;
 
-    public User(){}
+    public User() {
+    }
 
     public User(long id) {
         this.id = id;
@@ -17,7 +18,7 @@ public class User {
         this.name = name;
     }
 
-    public User(long id, String name){
+    public User(long id, String name) {
         this.id = id;
         this.name = name;
     }
@@ -37,4 +38,19 @@ public class User {
     public void setName(String name) {
         this.name = name;
     }
+
+    public boolean equals(Object obj) {
+        boolean answer =false;
+                User user = (User) obj;
+                if ((this.getId() == user.getId()) && (this.getName() == user.getName())) {
+                        answer = true;
+                    }
+                return answer;
+            }
+
+
+    public int hashCode() {
+        return Objects.hash(id, name);
+
+    }
 }

src/test/java/org/zipcoder/store/ListMapTest.java

@@ -174,58 +174,57 @@ public class ListMapTest {
         Assert.assertTrue(values.contains(cart2));
     }
 
-//    I commented this out because it takes a long time to run. Uncomment it when implement your put method, uncomment this test
-//    @Test
-//    public void testPutAndGet_WithManyItems(){
-//        // Given
-//        int numberOfEntries = 70000;
-//
-//        for (int i = 0; i < numberOfEntries; i++) {
-//            myMap.put(new User(i), new Cart(i));
-//        }
-//
-//
-//        for (int i = 0; i < numberOfEntries; i++) {
-//            // When
-//            Cart actualCart = myMap.get(new User(i));
-//            Cart expectedCart = new Cart(i);
-//
-//            // Then
-//            Assert.assertEquals(actualCart, expectedCart);
-//        }
-//    }
-
-//    BONUS
-//    @Test
-//    public void testRemove(){
-//        // Given
-//        User user1 = new User("Lena");
-//        Cart cart1 = new Cart(11);
-//
-//        User user2 = new User("Jamal");
-//        Cart cart2 = new Cart(21);
-//
-//        User user3 = new User("Kelvin");
-//        Cart cart3 = new Cart(31);
-//
-//        // When
-//        myMap.put(user1, cart1);
-//        myMap.put(user2, cart2);
-//        myMap.put(user3, cart3);
-//
-//        // Then
-//        Cart actualCart = myMap.remove(user2);
-//
-//        Assert.assertEquals(cart2, actualCart);
-//        Assert.assertNull(myMap.get(user2));
-//    }
-//
-//    @Test
-//    public void testRemove_CartNotInTheMap(){
-//        // Given
-//        User user1 = new User("Lena");
-//
-//        // When & Then
-//        Assert.assertNull(myMap.remove(user1));
-//    }
+    @Test
+    public void testPutAndGet_WithManyItems(){
+        // Given
+        int numberOfEntries = 70000;
+
+        for (int i = 0; i < numberOfEntries; i++) {
+            myMap.put(new User(i), new Cart(i));
+        }
+
+
+        for (int i = 0; i < numberOfEntries; i++) {
+            // When
+            Cart actualCart = myMap.get(new User(i));
+            Cart expectedCart = new Cart(i);
+
+            // Then
+            Assert.assertEquals(actualCart, expectedCart);
+        }
+    }
+
+
+    @Test
+    public void testRemove(){
+        // Given
+        User user1 = new User("Lena");
+        Cart cart1 = new Cart(11);
+
+        User user2 = new User("Jamal");
+        Cart cart2 = new Cart(21);
+
+        User user3 = new User("Kelvin");
+        Cart cart3 = new Cart(31);
+
+        // When
+        myMap.put(user1, cart1);
+        myMap.put(user2, cart2);
+        myMap.put(user3, cart3);
+
+        // Then
+        Cart actualCart = myMap.remove(user2);
+
+        Assert.assertEquals(cart2, actualCart);
+        Assert.assertNull(myMap.get(user2));
+    }
+
+    @Test
+    public void testRemove_CartNotInTheMap(){
+        // Given
+        User user1 = new User("Lena");
+
+        // When & Then
+        Assert.assertNull(myMap.remove(user1));
+    }
 }