Method get

java/Chapter 8/Question8_10/Hash.java:34–47

(K key)

	}
	
	public V get(K key) {
		int x = hashCodeOfKey(key);
		if (items[x] == null) {
			return null;
		}
		LinkedList<Cell<K, V>> collided = items[x];
		for (Cell<K, V> c : collided) {
			if (c.equivalent(key)) {
				return c.getValue();
			}
		}
		
		return null;		
	}
	
	public void debugPrintHash() {
		for (int i = 0; i < items.length; i++) {