diff --git a/Semester 4/Assignments/MapASDV_CalebFontenot/Printed HTMLs/MapASDV.html b/Semester 4/Assignments/MapASDV_CalebFontenot/Printed HTMLs/MapASDV.html
new file mode 100644
index 0000000..fa83e3d
--- /dev/null
+++ b/Semester 4/Assignments/MapASDV_CalebFontenot/Printed HTMLs/MapASDV.html
@@ -0,0 +1,813 @@
+
+
+
+MapASDV.java
+
+
+
+
+| /home/caleb/ASDV-Java/Semester 4/Assignments/MapASDV_CalebFontenot/src/mapasdv_calebfontenot/MapASDV.java |
+
+
+nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt
+nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java
+
+package mapasdv_calebfontenot;
+
+
+
+
+
+
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.Iterator;
+import java.util.Map;
+import java.util.Objects;
+import java.util.Set;
+import java.util.function.BiConsumer;
+
+public class MapASDV<K, V> implements Map<K, V>, Cloneable {
+
+ private int capacity = 4;
+ private double = 0.75;
+ private ArrayList<ListASDV<EntryASDV<K, V>>> map = new ArrayList<>();
+
+ private Set<K> sharedKeySet = new SharedSet<>();
+ private Set<Entry<K, V>> sharedEntrySet = new SharedSet<>();
+ private Collection<V> sharedValuesCollection = new SharedCollection<>();
+
+ private class SharedCollection<V> extends ArrayList<V> {
+
+ public boolean addValue(V v) {
+ return this.add(v);
+ }
+
+ @Override
+ public boolean remove(Object o) {
+
+
+
+ return MapASDV.this.removeFirstValue(o);
+
+
+
+ }
+
+
+
+
+ o
+ callFromOuterClass
+
+
+ public boolean remove(V v, boolean callFromOuterClass) {
+
+ boolean b = super.remove(v);
+ return b;
+
+ }
+
+ @Override
+ public Object clone() {
+ return super.clone();
+ }
+
+ @Override
+ public void clear() {
+ super.clear();
+ }
+ }
+
+ private class SharedSet<E> extends HashSet<E> {
+
+ @Override
+ public boolean add(E e) {
+ return super.add(e);
+ }
+
+ @Override
+ public boolean removeAll(Collection<?> c) {
+ return super.removeAll(c);
+ }
+
+
+
+
+ e
+
+
+ private boolean addEntry(E e) {
+ return super.add(e);
+ }
+
+ @Override
+ public boolean remove(Object o) {
+
+
+ if (o instanceof EntryASDV) {
+ return removeEntry((EntryASDV) o);
+ }
+
+
+
+ MapASDV.this.remove(o);
+
+ return super.remove(o);
+ }
+
+
+
+
+ entry
+
+
+ private boolean removeEntry(EntryASDV<K, V> entry) {
+
+ MapASDV.this.remove(entry.getKey());
+ return super.remove(entry);
+ }
+
+
+
+
+ o
+ callFromOuterClass
+
+
+ public boolean remove(E o, boolean callFromOuterClass) {
+
+
+ return super.remove(o);
+ }
+
+ @Override
+ public Object clone() {
+ return super.clone();
+ }
+
+ @Override
+ public void clear() {
+ super.clear();
+ }
+
+ }
+
+ public MapASDV() {
+ for (int i = 0; i < capacity; ++i) {
+ map.add(new ListASDV<EntryASDV<K, V>>());
+ }
+ }
+
+
+
+
+ private void doubleTheSizeOfTheMapAndRehash() {
+ capacity *= 2;
+
+ ArrayList<ListASDV<EntryASDV<K, V>>> newMap = new ArrayList<ListASDV<EntryASDV<K, V>>>();
+
+
+ for (int i = 0; i < capacity; ++i) {
+ newMap.add(new ListASDV<EntryASDV<K, V>>());
+ }
+
+
+ for (int i = 0; i < map.size(); ++i)
+ {
+
+ ListASDV<EntryASDV<K, V>> list = map.get(i);
+
+
+ for (int j = 0; j < list.size(); ++j) {
+
+ int index = hash(list.get(j).getKey().hashCode());
+ newMap.get(index).add(list.get(j));
+
+ }
+ }
+ map = newMap;
+ }
+
+ class EntryASDV<K, V> implements Entry<K, V>, Comparable<K> {
+
+ K key;
+ V value;
+
+ public EntryASDV(K key, V value) {
+ this.key = key;
+ this.value = value;
+ }
+
+ @Override
+ public K getKey() {
+ return key;
+ }
+
+ @Override
+ public V getValue() {
+ return value;
+ }
+
+ @Override
+ public V setValue(V value) {
+ V oldValue = this.value;
+ this.value = value;
+ return oldValue;
+ }
+
+ @Override
+ public String toString() {
+ return "EntryASDV{" + "key=" + key + ", value=" + value + '}';
+ }
+
+ @Override
+ public boolean equals(Object obj) {
+ if (this == obj) {
+ return true;
+ }
+ if (obj == null) {
+ return false;
+ }
+ if (getClass() != obj.getClass()) {
+ return false;
+ }
+ final EntryASDV<?, ?> other = (EntryASDV<?, ?>) obj;
+ if (!Objects.equals(this.key, other.key)) {
+ return false;
+ }
+ return true;
+ }
+
+
+
+ o
+
+
+ @Override
+ public int compareTo(K o) {
+ if (getClass() != o.getClass()) {
+ throw new IllegalArgumentException("ellegal parameter " + o);
+ }
+ return ((Comparable) key).compareTo(o);
+ }
+
+ }
+
+ @Override
+ public int size() {
+ return this.keySet().size();
+ }
+
+ @Override
+ public boolean isEmpty() {
+ if (map.size() == 0) {
+ return true;
+ }
+ return false;
+ }
+
+
+ @Override
+ public boolean containsKey(Object key) {
+ String dashes = "---------";
+ System.out.println(dashes + " containsKey(" + key.toString() + ") " + dashes);
+ for (int i = 0; i < map.size(); ++i) {
+ for (int j = 0; j < map.get(i).size(); ++j) {
+ if (map.get(i).get(j).key.equals(key)) {
+ return true;
+ }
+ }
+
+ }
+ return false;
+ }
+
+
+
+
+ key
+
+
+ private EntryASDV<K, V> getEntryForKey(Object key) {
+ for (ListASDV<EntryASDV<K, V>> list : map) {
+ Iterator<EntryASDV<K, V>> it = list.iterator();
+ while (it.hasNext()) {
+ EntryASDV<K, V> entry = it.next();
+ if (key.equals(entry.getKey())) {
+ return entry;
+ }
+ }
+ }
+ return null;
+ }
+
+
+
+
+ key
+
+
+ private int getIndexForKey(Object key) {
+ for (int i = 0; i < map.size(); ++i) {
+ Iterator<EntryASDV<K, V>> it = map.get(i).iterator();
+ while (it.hasNext()) {
+ EntryASDV<K, V> entry = it.next();
+ if (key.equals(entry.getKey())) {
+ return i;
+ }
+ }
+ }
+ return -1;
+ }
+
+
+
+
+
+
+ value
+
+
+
+
+ @Override
+ public boolean containsValue(Object value) {
+ String dashes = "---------";
+ System.out.println(dashes + " containsValue(" + value.toString() + ") " + dashes);
+ for (int i = 0; i < map.size(); ++i) {
+ for (int j = 0; j < map.get(i).size(); ++j) {
+ if (map.get(i).get(j).value.equals(value)) {
+ return true;
+ }
+ }
+
+ }
+ return false;
+
+ }
+
+
+
+
+
+
+
+
+ key
+
+
+
+
+ @Override
+ public V get(Object key) {
+ String dashes = "---------";
+ try {
+ System.out.println(dashes + " get(" + key.toString() + ") " + dashes);
+ } catch (NullPointerException ex) {
+
+ System.out.println(dashes + " get(" + "null" + ") " + dashes);
+ throw new NullPointerException("null parameter");
+ }
+ Object currentKey = null;
+ for (int i = 0; i < map.size(); ++i) {
+ for (int j = 0; j < map.get(i).size(); ++j) {
+ currentKey = map.get(i).get(j).key;
+ if (currentKey.equals(key)) {
+ return map.get(i).get(j).value;
+ }
+ }
+ }
+ return null;
+ }
+
+
+
+
+ key
+ value
+
+
+
+ @Override
+ public V put(K key, V value) {
+
+ if (key == null || value == null) {
+ throw new NullPointerException("parm(s) null");
+ }
+
+
+ EntryASDV<K, V> entry = getEntryForKey(key);
+ if (entry != null) {
+ V oldValue = entry.value;
+ entry.value = value;
+
+ return oldValue;
+ }
+
+ int code = this.hash(key.hashCode());
+ int index = hash(code);
+
+ ListASDV<EntryASDV<K, V>> list = map.get(index);
+ EntryASDV e = new EntryASDV(key, value);
+ list.add(e);
+
+
+ ((SharedSet<K>) this.sharedKeySet).addEntry(key);
+ ((SharedSet<Entry<K, V>>) this.sharedEntrySet).addEntry(e);
+
+
+ V v = list.get(list.size() - 1).getValue();
+
+
+ ((SharedCollection<V>) this.sharedValuesCollection).addValue(v);
+
+
+ if ((double) this.size() / capacity >= 0.75) {
+ this.doubleTheSizeOfTheMapAndRehash();
+ }
+
+
+ return v;
+ }
+
+ int hash(int keyHashCode) {
+ int h = hashHash(keyHashCode);
+ return Math.abs(h % capacity - 1);
+ }
+
+
+
+
+ value
+
+
+
+ private boolean removeFirstValue(Object value) {
+ Iterator<V> iterator = sharedValuesCollection.iterator();
+ while (iterator.hasNext()) {
+ Object o = iterator.next();
+ if (o.equals(value)) {
+ iterator.remove();
+ return true;
+ }
+ }
+ return false;
+ }
+
+
+
+
+ h
+
+
+ private static int hashHash(int h) {
+ h ^= (h >>> 20) ^ (h >>> 12);
+ return h ^ (h >>> 7) ^ (h >>> 4);
+ }
+
+
+ public static <T> T cast(Object o, Class<T> clazz) {
+ return clazz.isInstance(o) ? clazz.cast(o) : null;
+ }
+
+
+
+
+ key
+
+
+
+ @Override
+ public V remove(Object key) {
+ String dashes = "---------";
+ try {
+ System.out.println(dashes + " remove(" + key.toString() + ") " + dashes);
+ } catch (NullPointerException ex) {
+ System.out.println(ex);
+ System.out.println(dashes + " remove(" + "null" + ") " + dashes);
+ throw new NullPointerException("null parameter");
+ }
+ K currentKey = null;
+ V currentValue = null;
+ EntryASDV<K, V> currentEntry = null;
+ for (int i = 0; i < map.size(); ++i) {
+ for (int j = 0; j < map.get(i).size(); ++j) {
+ currentEntry = map.get(i).get(j);
+ currentKey = currentEntry.key;
+ currentValue = currentEntry.value;
+ if (currentKey.equals(key) || currentValue.equals(key)) {
+ System.out.println("key: " + currentKey + "; value: " + currentValue);
+
+ map.remove(i);
+
+
+ Object[] iterateArray = sharedKeySet.toArray();
+ for (Object o : iterateArray) {
+ if (o.equals(currentKey)) {
+ System.out.println("removing " + o);
+ System.out.println("remove successful? " + sharedKeySet.remove(currentKey));
+ break;
+ }
+ }
+
+
+ iterateArray = sharedEntrySet.toArray();
+ for (Object o : iterateArray) {
+ if (o.equals(currentEntry)) {
+ System.out.println("removing " + o);
+ System.out.println("remove successful? " + sharedEntrySet.remove(currentEntry));
+ break;
+ }
+ }
+
+
+ iterateArray = sharedValuesCollection.toArray();
+ for (Object o : iterateArray) {
+
+ if (o.equals(currentValue)) {
+ System.out.println("removing " + o);
+ System.out.println("remove successful? " + sharedValuesCollection.remove(o));
+ break;
+ }
+ }
+
+ return currentValue;
+ }
+ }
+ }
+ return null;
+
+ }
+
+
+
+
+ m
+
+
+ @Override
+ public void putAll(Map<? extends K, ? extends V> m) {
+ if (m == null) {
+ throw new NullPointerException("null parameter");
+ }
+
+ BiConsumer consumeEachEntry = new BiConsumer<K, V>() {
+ MapASDV<K, V> mapForConsumer = MapASDV.this;
+
+ @Override
+ public void accept(K k, V v) {
+ mapForConsumer.put(k, v);
+ }
+ };
+
+ m.forEach(consumeEachEntry);
+ }
+
+
+
+
+ @Override
+ public void clear() {
+
+
+ map = new ArrayList<>();
+ sharedKeySet = new SharedSet<K>();
+ sharedEntrySet = new SharedSet<Entry<K, V>>();
+ sharedValuesCollection = new SharedCollection<V>();
+
+ for (int i = 0; i < capacity; ++i) {
+ map.add(new ListASDV<EntryASDV<K, V>>());
+ }
+ }
+
+
+
+
+
+
+ @Override
+ public Set<K> keySet() {
+
+ return this.sharedKeySet;
+ }
+
+
+
+
+
+
+ @Override
+ public Collection<V> values() {
+ return sharedValuesCollection;
+ }
+
+
+
+
+
+
+
+ @Override
+ public Set<Entry<K, V>> entrySet() {
+ return this.sharedEntrySet;
+ }
+
+ @Override
+ public String toString() {
+ String s = "[ ";
+ for (int i = 0; i < map.size(); ++i) {
+ s += map.get(i).toString() + "\n";
+ }
+ s += " ]";
+
+ return s;
+ }
+
+
+
+
+
+
+ @Override
+ public Object clone() {
+
+
+
+
+
+
+
+
+
+
+
+
+
+ MapASDV<K, V> clonedMap = new MapASDV<K, V>();
+ clonedMap.putAll(this);
+ return clonedMap;
+ }
+
+ public static void main(String[] args) {
+
+ MapASDV<String, Integer> map = new MapASDV<>();
+ System.out.println("---------------------------testing put(K, V)");
+ map.put("ann", 20);
+ map.put("coco", 25);
+ System.out.println(map);
+ MapASDV<String, Integer> clonedMap = (MapASDV<String, Integer>) map.clone();
+
+ System.out.println("\n\n---------------------------testing double-the-size-and-rehash by reaching 0.75 load factor with another put(K, V)");
+ map.put("Jonathan", 30);
+ System.out.println(map);
+ map.put("Jonhathan", 45);
+ System.out.println(map);
+ map.put("Alexander", 33);
+ System.out.println(map);
+
+ System.out.println("\n\n---------------------------testing putAll(Map<K,V>)");
+ Map<String, Integer> anotherJavaMap = new HashMap();
+ anotherJavaMap.put("lion king", 45);
+ anotherJavaMap.put("HYENA", 6);
+ map.putAll(anotherJavaMap);
+ System.out.println(map);
+
+ System.out.println("\n\n---------------------------testing containsKey");
+ System.out.println(map.containsKey("Alexander"));
+ System.out.println(map.containsKey("alexander"));
+
+ System.out.println("\n\n---------------------------testing containsValue");
+ System.out.println(map.containsValue(33));
+ System.out.println(map.containsValue(34));
+
+ System.out.println("\n\n---------------------------testing getEntryForKey");
+ Entry<String, Integer> e = map.getEntryForKey("Alexander");
+ System.out.println(map.getEntryForKey("Alexander"));
+ System.out.println(map.getEntryForKey("Alex"));
+
+ System.out.println("\n\n---------------------------testing get");
+ System.out.println(map.get("Alexander"));
+ System.out.println(map.get("Alex"));
+ try {
+ map.get(null);
+ } catch (NullPointerException ex) {
+ System.out.println(ex.getMessage());
+ }
+
+ System.out.println("\n\n---------------------------testing getIndexForKey");
+ System.out.println(map.getIndexForKey("Alexander"));
+ System.out.println(map.getIndexForKey("Alex"));
+
+ System.out.println("\n\n---------------------------testing isEmpty");
+ System.out.println(map.isEmpty());
+
+ System.out.println("\n\n---------------------------testing size");
+ System.out.println(map.size());
+ System.out.println(map);
+
+ System.out.println("\n\n---------------------------testing entrySet()");
+ Set<Entry<String, Integer>> entries = map.entrySet();
+ System.out.println(entries);
+
+ System.out.println("\n\n---------------------------testing keySet()");
+ Set<String> keys = map.keySet();
+ System.out.println(keys);
+
+ System.out.println("\n\n---------------------------testing values()");
+ Collection<Integer> values = map.values();
+ System.out.println(values);
+
+ System.out.println("\n\n---------------------------testing remove( K) coco 25");
+ map.remove("coco");
+ values = map.values();
+ System.out.println("map: " + map);
+ System.out.println("entries: " + entries);
+ System.out.println("keys: " + keys);
+ System.out.println("values: " + values);
+
+ System.out.println("\n\n---------------------------testing Entry-Collection remove ");
+ entries.remove(e);
+ values = map.values();
+ System.out.println("map: " + map);
+ System.out.println("entries: " + entries);
+ System.out.println("keys: " + keys);
+ System.out.println("values: " + values);
+
+ System.out.println("\n\n---------------------------testing Set Keys remove ");
+ keys.remove("ann");
+ values = map.values();
+ System.out.println("map: " + map);
+ System.out.println("entries: " + entries);
+ System.out.println("keys: " + keys);
+ System.out.println("values: " + values);
+
+ System.out.println("\n\n---------------------------testing Set Values remove ");
+ values.remove(45);
+ values = map.values();
+ System.out.println("map: " + map);
+ System.out.println("entries: " + entries);
+ System.out.println("keys: " + keys);
+ System.out.println("values: " + values);
+
+ System.out.println("\n\n---------------------------testing clear ");
+ map.clear();
+ values = map.values();
+ entries = map.entrySet();
+ keys = map.keySet();
+ System.out.println("map: " + map);
+ System.out.println("entries: " + entries);
+ System.out.println("keys: " + keys);
+ System.out.println("values: " + values);
+
+ System.out.println("\n\n---------------------------testing add of sets and collections ");
+ try {
+ keys.add("a");
+ } catch (Exception ex) {
+ System.out.println(ex.getMessage());
+ }
+ try {
+ values.add(33);
+ } catch (Exception ex) {
+ System.out.println(ex.getMessage());
+ }
+ try {
+ entries.add(e);
+ } catch (Exception ex) {
+ System.out.println(ex.getMessage());
+ }
+
+ System.out.println("\n\n---------------------------testing clone");
+ System.out.println(clonedMap);
+
+ System.out.println("---------------------------testing put(K, V) AGAIN");
+ map.put("Nicholas", 100);
+ map.put("a", 200);
+ map.put("b", -20);
+ System.out.println(map);
+ }
+
+}
+
+
+
diff --git a/Semester 4/Assignments/MapASDV_CalebFontenot/nbproject/project.properties b/Semester 4/Assignments/MapASDV_CalebFontenot/nbproject/project.properties
index 4f04225..b887cc6 100644
--- a/Semester 4/Assignments/MapASDV_CalebFontenot/nbproject/project.properties
+++ b/Semester 4/Assignments/MapASDV_CalebFontenot/nbproject/project.properties
@@ -71,7 +71,7 @@ jlink.additionalmodules=
jlink.additionalparam=
jlink.launcher=true
jlink.launcher.name=MapASDV_CalebFontenot
-main.class=mapasdv_calebfontenot.MapASDV_CalebFontenot
+main.class=mapasdv_calebfontenot.MapASDV
manifest.file=manifest.mf
meta.inf.dir=${src.dir}/META-INF
mkdist.disabled=false
diff --git a/Semester 4/Assignments/MapASDV_CalebFontenot/output-hashed-map-1.pdf b/Semester 4/Assignments/MapASDV_CalebFontenot/output-hashed-map-1.pdf
new file mode 100644
index 0000000..79c4a47
Binary files /dev/null and b/Semester 4/Assignments/MapASDV_CalebFontenot/output-hashed-map-1.pdf differ
diff --git a/Semester 4/Assignments/MapASDV_CalebFontenot/src/mapasdv_calebfontenot/ListASDV.java b/Semester 4/Assignments/MapASDV_CalebFontenot/src/mapasdv_calebfontenot/ListASDV.java
index 0aacf92..f34b3cd 100644
--- a/Semester 4/Assignments/MapASDV_CalebFontenot/src/mapasdv_calebfontenot/ListASDV.java
+++ b/Semester 4/Assignments/MapASDV_CalebFontenot/src/mapasdv_calebfontenot/ListASDV.java
@@ -1330,7 +1330,7 @@ public class ListASDV
s += '}';
return s;
}
-
+/**
public static void main(String[] args)
{
class ASDV_ENTRY implements Map.Entry
@@ -1685,6 +1685,7 @@ public class ListASDV
}
}
+ **/
}
diff --git a/Semester 4/Assignments/MapASDV_CalebFontenot/src/mapasdv_calebfontenot/MapASDV.java b/Semester 4/Assignments/MapASDV_CalebFontenot/src/mapasdv_calebfontenot/MapASDV.java
index 137c60e..e13f5ec 100644
--- a/Semester 4/Assignments/MapASDV_CalebFontenot/src/mapasdv_calebfontenot/MapASDV.java
+++ b/Semester 4/Assignments/MapASDV_CalebFontenot/src/mapasdv_calebfontenot/MapASDV.java
@@ -8,7 +8,6 @@ package mapasdv_calebfontenot;
*
* @author caleb
*/
-
//import ListASDV;
import java.util.ArrayList;
import java.util.Collection;
@@ -20,28 +19,24 @@ import java.util.Objects;
import java.util.Set;
import java.util.function.BiConsumer;//needed in putAll
-public class MapASDV implements Map, Cloneable
-{
+public class MapASDV implements Map, Cloneable {
private int capacity = 4;
private double loadFactor = 0.75;
private ArrayList>> map = new ArrayList<>();
- private Set sharedKeySet = new SharedSet();
- private Set> sharedEntrySet = new SharedSet>();
- private Collection sharedValuesCollection = new SharedCollection();
+ private Set sharedKeySet = new SharedSet<>();
+ private Set> sharedEntrySet = new SharedSet<>();
+ private Collection sharedValuesCollection = new SharedCollection<>();
- private class SharedCollection extends ArrayList
- {
+ private class SharedCollection extends ArrayList {
- public boolean addValue(V v)
- {
+ public boolean addValue(V v) {
return this.add(v);
}
@Override
- public boolean remove(Object o)
- {
+ public boolean remove(Object o) {
//> The parameter is key not entry if we are here
//>>remove value) and key) from the map
@@ -52,19 +47,13 @@ public class MapASDV implements Map, Cloneable
}
/**
- * Removes one value from the collection. This method is meant to be
- * called from out class. The overridden remove(Object o) of this inner
- * class, calls the remove of the outer class(MapASDV), and the remove
- * of the outer class, calls remove(V v, boolean callFromOuterClass)
- * instead of remove(Object o) to avoid Stack Overflow when remover of
- * inner calls remove of outer and vice versa.
+ * Removes one value from the collection. This method is meant to be called from out class. The overridden remove(Object o) of this inner class, calls the remove of the outer class(MapASDV), and the remove of the outer class, calls remove(V v, boolean callFromOuterClass) instead of remove(Object o) to avoid Stack Overflow when remover of inner calls remove of outer and vice versa.
*
* @param o - the key
* @param callFromOuterClass - dummy variable.
* @return true if the key was removed from the Set
*/
- public boolean remove(V v, boolean callFromOuterClass)
- {
+ public boolean remove(V v, boolean callFromOuterClass) {
//remove key from shared keys set
boolean b = super.remove(v);
return b;
@@ -72,57 +61,45 @@ public class MapASDV implements Map, Cloneable
}
@Override
- public Object clone()
- {
+ public Object clone() {
return super.clone();
}
@Override
- public void clear()
- {
+ public void clear() {
super.clear();
}
}
- private class SharedSet extends HashSet
- {
+ private class SharedSet extends HashSet {
@Override
- public boolean add(E e)
- {
- throw new UnsupportedOperationException("Not supported....");
- }
-
- @Override
- public boolean removeAll(Collection c)
- {
- throw new UnsupportedOperationException("Not supported....");
- }
-
- /**
- * Adds an EntryASDV to the set. It is private and cannot be used by the
- * user of the Set. It is used from the MapASDV to add EntriesASDV to
- * the SharedSet. Without this method we wouldn't be able to create a
- * Set of keys or a Set of entries to give to the user via methods
- * keySet() and entrySet() of this Map
- *
- * @param e EntryASDV
- * @return true if the entry was added false otherwise
- */
- private boolean addEntry(E e)
- {
+ public boolean add(E e) {
return super.add(e);
}
@Override
- public boolean remove(Object o)
- {
+ public boolean removeAll(Collection c) {
+ return super.removeAll(c);
+ }
+
+ /**
+ * Adds an EntryASDV to the set. It is private and cannot be used by the user of the Set. It is used from the MapASDV to add EntriesASDV to the SharedSet. Without this method we wouldn't be able to create a Set of keys or a Set of entries to give to the user via methods keySet() and entrySet() of this Map
+ *
+ * @param e EntryASDV
+ * @return true if the entry was added false otherwise
+ */
+ private boolean addEntry(E e) {
+ return super.add(e);
+ }
+
+ @Override
+ public boolean remove(Object o) {
//>if parameter oo is EntryASDV call auxiliary method removeEntry
- if (o instanceof EntryASDV)
- {
+ if (o instanceof EntryASDV) {
return removeEntry((EntryASDV) o);
- }
+ }
//> The parameter is key not entry if we are here
//>>remove key from the map
@@ -137,145 +114,120 @@ public class MapASDV implements Map, Cloneable
* @param entry the entry to be removed
* @return true if the entry was removed, false otherwise
*/
- private boolean removeEntry(EntryASDV entry)
- {
+ private boolean removeEntry(EntryASDV entry) {
MapASDV.this.remove(entry.getKey());
return super.remove(entry);
}
/**
- * Removes the key from the set. This method is meant to be called from
- * out class. The overridden remove(Object o) of this inner class calls
- * the remove of the out class, and the remove of the outer class calls
- * remove(K o, boolean callFromOuterClass) instead of remove(Object o)
- * to avoid Stack Overflow when remover of inner calls remove of outer
- * and vice versa.
+ * Removes the key from the set. This method is meant to be called from out class. The overridden remove(Object o) of this inner class calls the remove of the out class, and the remove of the outer class calls remove(K o, boolean callFromOuterClass) instead of remove(Object o) to avoid Stack Overflow when remover of inner calls remove of outer and vice versa.
*
* @param o - the key
* @param callFromOuterClass - dummy variable.
* @return true if the key was removed from the Set
*/
- public boolean remove(E o, boolean callFromOuterClass)
- {
+ public boolean remove(E o, boolean callFromOuterClass) {
//remove key from shared keys set
return super.remove(o);
}
@Override
- public Object clone()
- {
+ public Object clone() {
return super.clone();
}
@Override
- public void clear()
- {
+ public void clear() {
super.clear();
}
}
- public MapASDV()
- {
- for (int i = 0; i < capacity; ++i)
- {
+ public MapASDV() {
+ for (int i = 0; i < capacity; ++i) {
map.add(new ListASDV>());
- }
+ }
}
/**
* Double the size of the Map and rehashes the entries of the Map
*/
- private void doubleTheSizeOfTheMapAndRehash()
- {
- capacity *= 2;
- //>create a new arrayList of ListsASDV
+ private void doubleTheSizeOfTheMapAndRehash() {
+ capacity *= 2;
+ //>create a new arrayList of ListsASDV
ArrayList>> newMap = new ArrayList>>();
-
- //>Add at every enetry of the arrayList a new ASDVList
- for (int i = 0; i < capacity; ++i)
- {
+
+ //>Add at every enetry of the arrayList a new ASDVList
+ for (int i = 0; i < capacity; ++i) {
newMap.add(new ListASDV>());
- }
-
- //>for the size of the OLD arrayList
+ }
+
+ //>for the size of the OLD arrayList
for (int i = 0; i < map.size(); ++i)//array list
- {
- //>> get The ASDVlist at i
+ {
+ //>> get The ASDVlist at i
ListASDV> list = map.get(i);
- //>>for the size() of the ASDVlist
- for (int j = 0; j < list.size(); ++j)
- {
- ///>>>hash and put in the the new array
- int index = hash( list.get(j).getKey().hashCode() );
+ //>>for the size() of the ASDVlist
+ for (int j = 0; j < list.size(); ++j) {
+ ///>>>hash and put in the the new array
+ int index = hash(list.get(j).getKey().hashCode());
newMap.get(index).add(list.get(j));
- }
- }
+ }
+ }
map = newMap;
}
- class EntryASDV implements Entry, Comparable
- {
+ class EntryASDV implements Entry, Comparable {
K key;
V value;
- public EntryASDV(K key, V value)
- {
+ public EntryASDV(K key, V value) {
this.key = key;
this.value = value;
}
@Override
- public K getKey()
- {
+ public K getKey() {
return key;
}
@Override
- public V getValue()
- {
+ public V getValue() {
return value;
}
@Override
- public V setValue(V value)
- {
+ public V setValue(V value) {
V oldValue = this.value;
this.value = value;
return oldValue;
}
@Override
- public String toString()
- {
+ public String toString() {
return "EntryASDV{" + "key=" + key + ", value=" + value + '}';
}
@Override
- public boolean equals(Object obj)
- {
- if (this == obj)
- {
+ public boolean equals(Object obj) {
+ if (this == obj) {
return true;
- }
- if (obj == null)
- {
+ }
+ if (obj == null) {
return false;
- }
- if (getClass() != obj.getClass())
- {
+ }
+ if (getClass() != obj.getClass()) {
return false;
- }
+ }
final EntryASDV other = (EntryASDV) obj;
- if (!Objects.equals(this.key, other.key))
- {
+ if (!Objects.equals(this.key, other.key)) {
return false;
- }
+ }
return true;
}
@@ -285,38 +237,42 @@ public class MapASDV implements Map, Cloneable
* @return throws IllegalArgumentException if parameter class is not K
*/
@Override
- public int compareTo(K o)
- {
- if (getClass() != o.getClass())
- {
+ public int compareTo(K o) {
+ if (getClass() != o.getClass()) {
throw new IllegalArgumentException("ellegal parameter " + o);
- }
+ }
return ((Comparable) key).compareTo(o);
}
}
@Override
- public int size()
- {
+ public int size() {
return this.keySet().size();
}
@Override
- public boolean isEmpty()
- {
- throw new UnsupportedOperationException("Not supported....");
-
+ public boolean isEmpty() {
+ if (map.size() == 0) {
+ return true;
+ }
+ return false;
}
+ // done
@Override
- public boolean containsKey(Object key)
- {
+ public boolean containsKey(Object key) {
+ String dashes = "---------";
+ System.out.println(dashes + " containsKey(" + key.toString() + ") " + dashes);
for (int i = 0; i < map.size(); ++i) {
- System.out.println(map.get(i));
- }
- throw new UnsupportedOperationException("Not supported yet....");
+ for (int j = 0; j < map.get(i).size(); ++j) {
+ if (map.get(i).get(j).key.equals(key)) {
+ return true;
+ }
+ }
+ }
+ return false;
}
/**
@@ -325,20 +281,16 @@ public class MapASDV implements Map, Cloneable
* @param key the key of the entry to be returned
* @return the entry, or null if the key is not in the map
*/
- private EntryASDV getEntryForKey(Object key)
- {
- for (ListASDV> list : map)
- {
+ private EntryASDV getEntryForKey(Object key) {
+ for (ListASDV> list : map) {
Iterator> it = list.iterator();
- while (it.hasNext())
- {
+ while (it.hasNext()) {
EntryASDV entry = it.next();
- if (key.equals(entry.getKey()))
- {
+ if (key.equals(entry.getKey())) {
return entry;
- }
- }
- }
+ }
+ }
+ }
return null;
}
@@ -348,107 +300,102 @@ public class MapASDV implements Map, Cloneable
* @param key a key of the map
* @return the index of a key in the map or -1, if the key is not in the map
*/
- private int getIndexForKey(Object key)
- {
- for (int i = 0; i < map.size(); ++i)
- {
+ private int getIndexForKey(Object key) {
+ for (int i = 0; i < map.size(); ++i) {
Iterator> it = map.get(i).iterator();
- while (it.hasNext())
- {
+ while (it.hasNext()) {
EntryASDV entry = it.next();
- if (key.equals(entry.getKey()))
- {
+ if (key.equals(entry.getKey())) {
return i;
- }
- }
- }
+ }
+ }
+ }
return -1;
}
/**
- * Returns true if this map maps one or more keys to the specified value.
- * More formally, returns true if and only if this map contains at least one
- * mapping to a value v such that (value==null ? v==null : value.equals(v)).
- * This operation will probably require time linear in the map size for most
- * implementations of the Map interface.
+ * Returns true if this map maps one or more keys to the specified value. More formally, returns true if and only if this map contains at least one mapping to a value v such that (value==null ? v==null : value.equals(v)). This operation will probably require time linear in the map size for most implementations of the Map interface.
*
- * Parameters: value - value whose presence in this map is to be tested
- * Returns: true if this map maps one or more keys to the specified value
- * Throws: ClassCastException - if the value is of an inappropriate type for
- * this map (optional) NullPointerException - if the specified value is null
- * and this map does not permit null values (optional)
+ * Parameters: value - value whose presence in this map is to be tested Returns: true if this map maps one or more keys to the specified value Throws: ClassCastException - if the value is of an inappropriate type for this map (optional) NullPointerException - if the specified value is null and this map does not permit null values (optional)
*
* @param value - value whose presence in this map is to be tested
* @return true if this map maps one or more keys to the specified value
- * @throws NullPointerException - if the specified value is null and this
- * map does not permit null values (optional)
+ * @throws NullPointerException - if the specified value is null and this map does not permit null values (optional)
*/
+ //done
@Override
- public boolean containsValue(Object value)
- {
- throw new UnsupportedOperationException("Not supported yet....");
+ public boolean containsValue(Object value) {
+ String dashes = "---------";
+ System.out.println(dashes + " containsValue(" + value.toString() + ") " + dashes);
+ for (int i = 0; i < map.size(); ++i) {
+ for (int j = 0; j < map.get(i).size(); ++j) {
+ if (map.get(i).get(j).value.equals(value)) {
+ return true;
+ }
+ }
+
+ }
+ return false;
}
/**
- * Returns the value to which the specified key is mapped, or null if this
- * map contains no mapping for the key.
+ * Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
*
- * More formally, if this map contains a mapping from a key k to a value v
- * such that (key==null ? k==null : key.equals(k)), then this method returns
- * v; otherwise it returns null. (There can be at most one such mapping.)
+ * More formally, if this map contains a mapping from a key k to a value v such that (key==null ? k==null : key.equals(k)), then this method returns v; otherwise it returns null. (There can be at most one such mapping.)
*
- * If this map permits null values, then a return value of null does not
- * necessarily indicate that the map contains no mapping for the key; it's
- * also possible that the map explicitly maps the key to null. The
- * containsKey operation may be used to distinguish these two cases.
+ * If this map permits null values, then a return value of null does not necessarily indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key to null. The containsKey operation may be used to distinguish these two cases.
*
* @param key - the key whose associated value is to be returned
- * @return the value to which the specified key is mapped, or null if this
- * map contains no mapping for the key
- * @throws NullPointerException - if the specified key is null and this map
- * does not permit null keys (optional)
+ * @return the value to which the specified key is mapped, or null if this map contains no mapping for the key
+ * @throws NullPointerException - if the specified key is null and this map does not permit null keys (optional)
*/
+ //done
@Override
- public V get(Object key)
- {
- throw new UnsupportedOperationException("Not supported yet....");
-
+ public V get(Object key) {
+ String dashes = "---------";
+ try {
+ System.out.println(dashes + " get(" + key.toString() + ") " + dashes);
+ } catch (NullPointerException ex) {
+ //System.out.println(ex);
+ System.out.println(dashes + " get(" + "null" + ") " + dashes);
+ throw new NullPointerException("null parameter");
+ }
+ Object currentKey = null;
+ for (int i = 0; i < map.size(); ++i) {
+ for (int j = 0; j < map.get(i).size(); ++j) {
+ currentKey = map.get(i).get(j).key;
+ if (currentKey.equals(key)) {
+ return map.get(i).get(j).value;
+ }
+ }
+ }
+ return null;
}
/**
- * Associates the specified value with the specified key in this map
- * (optional operation). If the map previously contained a mapping for the
- * key, the old value is replaced by the specified value. (A map m is said
- * to contain a mapping for a key k if and only if m.containsKey(k) would
- * return true.)
+ * Associates the specified value with the specified key in this map (optional operation). If the map previously contained a mapping for the key, the old value is replaced by the specified value. (A map m is said to contain a mapping for a key k if and only if m.containsKey(k) would return true.)
*
* @param key - key with which the specified value is to be associated
* @param value - value to be associated with the specified key
- * @return the previous value associated with key, or null if there was no
- * mapping for key. (A null return can also indicate that the map previously
- * associated null with key, if the implementation supports null values.)
- * @throws NullPointerException - if specified key or value is null and this
- * map does not permit null keys
+ * @return the previous value associated with key, or null if there was no mapping for key. (A null return can also indicate that the map previously associated null with key, if the implementation supports null values.)
+ * @throws NullPointerException - if specified key or value is null and this map does not permit null keys
*/
@Override
- public V put(K key, V value)
- {
+ public V put(K key, V value) {
- if (key == null || value == null)
- {
+ if (key == null || value == null) {
throw new NullPointerException("parm(s) null");
- }
+ }
//>if contains the key, replace the key's value
EntryASDV entry = getEntryForKey(key);
- if (entry != null)
- {
+ if (entry != null) {
V oldValue = entry.value;
entry.value = value;
return oldValue;
- }
+ }
///>>hash and put in the array
int code = this.hash(key.hashCode());
int index = hash(code);
@@ -468,17 +415,15 @@ public class MapASDV implements Map, Cloneable
((SharedCollection) this.sharedValuesCollection).addValue(v);
//>> if reach 75% capacity double the size
- if ((double) this.size() / capacity >= 0.75)
- {
+ if ((double) this.size() / capacity >= 0.75) {
this.doubleTheSizeOfTheMapAndRehash();
- }
+ }
//>>return the value of Entry just added
return v;
}
- int hash(int keyHashCode)
- {
+ int hash(int keyHashCode) {
int h = hashHash(keyHashCode);
return Math.abs(h % capacity - 1);
}
@@ -490,10 +435,16 @@ public class MapASDV implements Map, Cloneable
* @return true if removed, false otherwise
* @throws NullPointerException if the value is null
*/
- private boolean removeFirstValue(Object value)
- {
- throw new UnsupportedOperationException("Not supported yet....");
-
+ private boolean removeFirstValue(Object value) {
+ Iterator iterator = sharedValuesCollection.iterator();
+ while (iterator.hasNext()) {
+ Object o = iterator.next();
+ if (o.equals(value)) {
+ iterator.remove();
+ return true;
+ }
+ }
+ return false;
}
/**
@@ -502,58 +453,102 @@ public class MapASDV implements Map, Cloneable
* @param h - hash code
* @return evenly distributed hash code
*/
- private static int hashHash(int h)
- {
+ private static int hashHash(int h) {
h ^= (h >>> 20) ^ (h >>> 12);
return h ^ (h >>> 7) ^ (h >>> 4);
}
+ // class cast helper method
+ public static T cast(Object o, Class clazz) {
+ return clazz.isInstance(o) ? clazz.cast(o) : null;
+ }
+
/**
- * Removes the mapping for a key from this map if it is present (optional
- * operation). More formally, if this map contains a mapping from key k to
- * value v such that (key==null ? k==null : key.equals(k)), that mapping is
- * removed. (The map can contain at most one such mapping.)
+ * Removes the mapping for a key from this map if it is present (optional operation). More formally, if this map contains a mapping from key k to value v such that (key==null ? k==null : key.equals(k)), that mapping is removed. (The map can contain at most one such mapping.)
*
* @param key - key whose mapping is to be removed from the map
- * @return the previous value associated with key, or null if there was no
- * mapping for key.
- * @throws NullPointerException - if the specified key is null and this map
- * does not permit null keys
+ * @return the previous value associated with key, or null if there was no mapping for key.
+ * @throws NullPointerException - if the specified key is null and this map does not permit null keys
*/
@Override
- public V remove(Object key)
- {
- throw new UnsupportedOperationException("Not supported yet....");
+ public V remove(Object key) {
+ String dashes = "---------";
+ try {
+ System.out.println(dashes + " remove(" + key.toString() + ") " + dashes);
+ } catch (NullPointerException ex) {
+ System.out.println(ex);
+ System.out.println(dashes + " remove(" + "null" + ") " + dashes);
+ throw new NullPointerException("null parameter");
+ }
+ K currentKey = null;
+ V currentValue = null;
+ EntryASDV currentEntry = null;
+ for (int i = 0; i < map.size(); ++i) {
+ for (int j = 0; j < map.get(i).size(); ++j) {
+ currentEntry = map.get(i).get(j);
+ currentKey = currentEntry.key;
+ currentValue = currentEntry.value;
+ if (currentKey.equals(key) || currentValue.equals(key)) {
+ System.out.println("key: " + currentKey + "; value: " + currentValue);
+ // remove the entry from the map
+ map.remove(i);
+ // remove the key from the shared key set
+ // duplicate the set so we can iterate through it and not throw a ConcurrentModificationException...
+ Object[] iterateArray = sharedKeySet.toArray();
+ for (Object o : iterateArray) {
+ if (o.equals(currentKey)) {
+ System.out.println("removing " + o);
+ System.out.println("remove successful? " + sharedKeySet.remove(currentKey));
+ break; // we only want to delete the first one
+ }
+ }
+ // remove the value from the shared key map
+ // duplicate again...
+ iterateArray = sharedEntrySet.toArray();
+ for (Object o : iterateArray) {
+ if (o.equals(currentEntry)) {
+ System.out.println("removing " + o);
+ System.out.println("remove successful? " + sharedEntrySet.remove(currentEntry));
+ break; // we only want to delete the first one
+ }
+ }
+ // Finally, remove the value from sharedValuesCollection
+ // duplicate again...
+ iterateArray = sharedValuesCollection.toArray();
+ for (Object o : iterateArray) {
+ //System.out.println(o);
+ if (o.equals(currentValue)) {
+ System.out.println("removing " + o);
+ System.out.println("remove successful? " + sharedValuesCollection.remove(o));
+ break; // we only want to delete the first one
+ }
+ }
+ //for(Object o: sharedValuesCollection.toArray()) System.out.println(o);
+ return currentValue;
+ }
+ }
+ }
+ return null;
}
/**
- * Copies all of the mappings from the specified map to this map (optional
- * operation). The effect of this call is equivalent to that of calling
- * put(k, v) on this map once for each mapping from key k to value v in the
- * specified map. The behavior of this operation is undefined if the
- * specified map is modified while the operation is in progress.
+ * Copies all of the mappings from the specified map to this map (optional operation). The effect of this call is equivalent to that of calling put(k, v) on this map once for each mapping from key k to value v in the specified map. The behavior of this operation is undefined if the specified map is modified while the operation is in progress.
*
* @param m - mappings to be stored in this map
- * @throws NullPointerException - if the specified map is null, or if this
- * map does not permit null keys or values, and the specified map contains
- * null keys
+ * @throws NullPointerException - if the specified map is null, or if this map does not permit null keys or values, and the specified map contains null keys
*/
- @Override
- public void putAll(Map m)
- {
- if (m == null)
- {
+ @Override
+ public void putAll(Map m) {
+ if (m == null) {
throw new NullPointerException("null parameter");
- }
+ }
- BiConsumer consumeEachEntry = new BiConsumer()
- {
+ BiConsumer consumeEachEntry = new BiConsumer() {
MapASDV mapForConsumer = MapASDV.this;
@Override
- public void accept(K k, V v)
- {
+ public void accept(K k, V v) {
mapForConsumer.put(k, v);
}
};
@@ -561,84 +556,61 @@ public class MapASDV implements Map, Cloneable
m.forEach(consumeEachEntry);
}
-
/**
- * Removes all of the mappings from this map (optional operation). The map
- * will be empty after this call returns. Any shared sets are also cleared.
+ * Removes all of the mappings from this map (optional operation). The map will be empty after this call returns. Any shared sets are also cleared.
*/
@Override
- public void clear()
- {
- throw new UnsupportedOperationException("Not supported yet....");
+ public void clear() {
+ // Clear everything out by redefining all internal values, and let Java's GC take care of the rest
+ map = new ArrayList<>();
+ sharedKeySet = new SharedSet();
+ sharedEntrySet = new SharedSet>();
+ sharedValuesCollection = new SharedCollection();
+ //capacity = 4;
+ for (int i = 0; i < capacity; ++i) {
+ map.add(new ListASDV>());
+ }
}
/**
- * Returns a Set view of the keys contained in this map. The set is backed
- * by the map, so changes to the map are reflected in the set, and
- * vice-versa. If the map is modified while an iteration over the set is in
- * progress (except through the iterator's own remove operation), the
- * results of the iteration are undefined. The set supports element removal,
- * which removes the corresponding mapping from the map, via the
- * Iterator.remove, Set.remove, removeAll, retainAll, and clear operations.
- * It does not support the add or addAll operations.
+ * Returns a Set view of the keys contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations.
*
* @return a set view of the keys contained in this map
*/
@Override
- public Set keySet()
- {
+ public Set keySet() {
return this.sharedKeySet;
}
/**
- * Returns a Collection view of the values contained in this map. The
- * collection is backed by the map, so changes to the map are reflected in
- * the collection, and vice-versa. If the map is modified while an iteration
- * over the collection is in progress (except through the iterator's own
- * remove operation), the results of the iteration are undefined. The
- * collection supports element removal, which removes the corresponding
- * mapping from the map, via the Iterator.remove, Collection.remove,
- * removeAll, retainAll and clear operations. It does not support the add or
- * addAll operations.
+ * Returns a Collection view of the values contained in this map. The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa. If the map is modified while an iteration over the collection is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The collection supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Collection.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations.
*
* @return
*/
@Override
- public Collection values()
- {
+ public Collection values() {
return sharedValuesCollection;
}
/**
- * Returns a Set view of the mappings contained in this map. The set is
- * backed by the map, so changes to the map are reflected in the set, and
- * vice-versa. If the map is modified while an iteration over the set is in
- * progress (except through the iterator's own remove operation, or through
- * the setValue operation on a map entry returned by the iterator) the
- * results of the iteration are undefined. The set supports element removal,
- * which removes the corresponding mapping from the map, via the
- * Iterator.remove, Set.remove, removeAll, retainAll and clear operations.
- * It does not support the add or addAll operations.
+ * Returns a Set view of the mappings contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation, or through the setValue operation on a map entry returned by the iterator) the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations.
*
*
* @return a set view of the mappings contained in this map
*/
@Override
- public Set> entrySet()
- {
+ public Set> entrySet() {
return this.sharedEntrySet;
}
@Override
- public String toString()
- {
+ public String toString() {
String s = "[ ";
- for (int i = 0; i < capacity; ++i)
- {
+ for (int i = 0; i < map.size(); ++i) {
s += map.get(i).toString() + "\n";
- }
+ }
s += " ]";
return s;
@@ -650,8 +622,7 @@ public class MapASDV implements Map, Cloneable
* @return the deep copy of the map
*/
@Override
- public Object clone()
- {
+ public Object clone() {
/*
MapASDV clonedMap = new MapASDV();
@@ -663,24 +634,22 @@ public class MapASDV implements Map, Cloneable
clonedMap.map.add(l);
}
return clonedMap;
- */
-
- MapASDV clonedMap = new MapASDV();
- clonedMap.putAll(this);
- return clonedMap;
+ */
+
+ MapASDV clonedMap = new MapASDV();
+ clonedMap.putAll(this);
+ return clonedMap;
}
- public static void main(String[] args)
- {
+ public static void main(String[] args) {
- MapASDV map = new MapASDV();
+ MapASDV map = new MapASDV<>();
System.out.println("---------------------------testing put(K, V)");
map.put("ann", 20);
map.put("coco", 25);
System.out.println(map);
- MapASDV clonedMap = ( MapASDV) map.clone();
-
-
+ MapASDV clonedMap = (MapASDV) map.clone();
+
System.out.println("\n\n---------------------------testing double-the-size-and-rehash by reaching 0.75 load factor with another put(K, V)");
map.put("Jonathan", 30);
System.out.println(map);
@@ -688,109 +657,126 @@ public class MapASDV implements Map, Cloneable
System.out.println(map);
map.put("Alexander", 33);
System.out.println(map);
-
+
System.out.println("\n\n---------------------------testing putAll(Map)");
Map anotherJavaMap = new HashMap();
anotherJavaMap.put("lion king", 45);
anotherJavaMap.put("HYENA", 6);
map.putAll(anotherJavaMap);
System.out.println(map);
-
-
- System.out.println("\n\n---------------------------testing containsKey");
- System.out.println(map.containsKey("Alexander"));
- System.out.println(map.containsKey("alexander"));
-
- System.out.println("\n\n---------------------------testing containsValue");
- System.out.println(map.containsValue(33));
- System.out.println(map.containsValue(34));
-
- System.out.println("\n\n---------------------------testing getEntryForKey");
- Entry e = map.getEntryForKey("Alexander");
- System.out.println( map.getEntryForKey("Alexander"));
- System.out.println( map.getEntryForKey("Alex"));
-
- System.out.println("\n\n---------------------------testing get");
- System.out.println(map.get( "Alexander") );
- System.out.println(map.get( "Alex") );
- try{ map.get( null);}catch (NullPointerException ex ){System.out.println(ex.getMessage());}
-
- System.out.println("\n\n---------------------------testing getIndexForKey");
- System.out.println(map.getIndexForKey("Alexander"));
- System.out.println(map.getIndexForKey("Alex"));
-
- System.out.println("\n\n---------------------------testing isEmpty");
- System.out.println( map.isEmpty());
-
-
- System.out.println("\n\n---------------------------testing size");
- System.out.println( map.size());
- System.out.println( map);
-
- System.out.println("\n\n---------------------------testing entrySet()");
- Set> entries = map.entrySet();
- System.out.println( entries);
-
- System.out.println("\n\n---------------------------testing keySet()");
- Set keys = map.keySet();
- System.out.println( keys );
-
- System.out.println("\n\n---------------------------testing values()");
- Collection values = map.values();
- System.out.println( values);
-
- System.out.println("\n\n---------------------------testing remove( K) coco 25");
- map.remove("coco");
- System.out.println(map);
- System.out.println(entries);
- System.out.println(keys);
- System.out.println(values);
-
- System.out.println("\n\n---------------------------testing Entry-Collection remove ");
- entries.remove( e);
- System.out.println(map);
- System.out.println(entries);
- System.out.println(keys);
- System.out.println(values);
-
-
- System.out.println("\n\n---------------------------testing Set Keys remove ");
- keys.remove( "ann");
- System.out.println(map);
- System.out.println(entries);
- System.out.println(keys);
- System.out.println(values);
-
-
- System.out.println("\n\n---------------------------testing Set Values remove ");
- values.remove( 45);
- System.out.println(map);
- System.out.println(entries);
- System.out.println(keys);
- System.out.println(values);
-
- System.out.println("\n\n---------------------------testing clear ");
- map.clear();
- System.out.println(map);
- System.out.println(entries);
- System.out.println(keys);
-
- System.out.println("\n\n---------------------------testing add of sets and collections ");
- try{ keys.add( "a");}catch (Exception ex ){System.out.println(ex.getMessage());}
- try{ values.add( 33);}catch (Exception ex ){System.out.println(ex.getMessage());}
- try{ entries.add( e);}catch (Exception ex ){System.out.println(ex.getMessage());}
-
-
- System.out.println("\n\n---------------------------testing clone");
- System.out.println( clonedMap);
-
- System.out.println("---------------------------testing put(K, V) AGAIN");
+ System.out.println("\n\n---------------------------testing containsKey");
+ System.out.println(map.containsKey("Alexander"));
+ System.out.println(map.containsKey("alexander"));
+
+ System.out.println("\n\n---------------------------testing containsValue");
+ System.out.println(map.containsValue(33));
+ System.out.println(map.containsValue(34));
+
+ System.out.println("\n\n---------------------------testing getEntryForKey");
+ Entry e = map.getEntryForKey("Alexander");
+ System.out.println(map.getEntryForKey("Alexander"));
+ System.out.println(map.getEntryForKey("Alex"));
+
+ System.out.println("\n\n---------------------------testing get");
+ System.out.println(map.get("Alexander"));
+ System.out.println(map.get("Alex"));
+ try {
+ map.get(null);
+ } catch (NullPointerException ex) {
+ System.out.println(ex.getMessage());
+ }
+
+ System.out.println("\n\n---------------------------testing getIndexForKey");
+ System.out.println(map.getIndexForKey("Alexander"));
+ System.out.println(map.getIndexForKey("Alex"));
+
+ System.out.println("\n\n---------------------------testing isEmpty");
+ System.out.println(map.isEmpty());
+
+ System.out.println("\n\n---------------------------testing size");
+ System.out.println(map.size());
+ System.out.println(map);
+
+ System.out.println("\n\n---------------------------testing entrySet()");
+ Set> entries = map.entrySet();
+ System.out.println(entries);
+
+ System.out.println("\n\n---------------------------testing keySet()");
+ Set keys = map.keySet();
+ System.out.println(keys);
+
+ System.out.println("\n\n---------------------------testing values()");
+ Collection values = map.values();
+ System.out.println(values);
+
+ System.out.println("\n\n---------------------------testing remove( K) coco 25");
+ map.remove("coco");
+ values = map.values();
+ System.out.println("map: " + map);
+ System.out.println("entries: " + entries);
+ System.out.println("keys: " + keys);
+ System.out.println("values: " + values);
+
+ System.out.println("\n\n---------------------------testing Entry-Collection remove ");
+ entries.remove(e);
+ values = map.values();
+ System.out.println("map: " + map);
+ System.out.println("entries: " + entries);
+ System.out.println("keys: " + keys);
+ System.out.println("values: " + values);
+
+ System.out.println("\n\n---------------------------testing Set Keys remove ");
+ keys.remove("ann");
+ values = map.values();
+ System.out.println("map: " + map);
+ System.out.println("entries: " + entries);
+ System.out.println("keys: " + keys);
+ System.out.println("values: " + values);
+
+ System.out.println("\n\n---------------------------testing Set Values remove ");
+ values.remove(45);
+ values = map.values();
+ System.out.println("map: " + map);
+ System.out.println("entries: " + entries);
+ System.out.println("keys: " + keys);
+ System.out.println("values: " + values);
+
+ System.out.println("\n\n---------------------------testing clear ");
+ map.clear();
+ values = map.values();
+ entries = map.entrySet();
+ keys = map.keySet();
+ System.out.println("map: " + map);
+ System.out.println("entries: " + entries);
+ System.out.println("keys: " + keys);
+ System.out.println("values: " + values);
+
+ System.out.println("\n\n---------------------------testing add of sets and collections ");
+ try {
+ keys.add("a");
+ } catch (Exception ex) {
+ System.out.println(ex.getMessage());
+ }
+ try {
+ values.add(33);
+ } catch (Exception ex) {
+ System.out.println(ex.getMessage());
+ }
+ try {
+ entries.add(e);
+ } catch (Exception ex) {
+ System.out.println(ex.getMessage());
+ }
+
+ System.out.println("\n\n---------------------------testing clone");
+ System.out.println(clonedMap);
+
+ System.out.println("---------------------------testing put(K, V) AGAIN");
map.put("Nicholas", 100);
map.put("a", 200);
map.put("b", -20);
- System.out.println( map);
+ System.out.println(map);
}
}
-
diff --git a/Semester 4/ZIPs/MapASDV_CalebFontenot.zip b/Semester 4/ZIPs/MapASDV_CalebFontenot.zip
new file mode 100644
index 0000000..b34dc07
Binary files /dev/null and b/Semester 4/ZIPs/MapASDV_CalebFontenot.zip differ