System.out.println(key + " not found for remove");
	public Object remove(long key) {		int idx = hash(key) % tabSize;		if(idx < 0)			idx *= -1;		if (values[idx] == null) {			System.out.println(key + " not found for remove");			return null; // key does not exist		} else if (keys[idx] == key) {			if(values[idx] == REMOVED)				return null;	// key has already been removed			Object o = values[idx];			values[idx] = REMOVED;			--items;			return o;		}		int rehashVal = rehash(idx);		for (int i = 0; i < tabSize; i++) {			idx = (idx + rehashVal) % tabSize;			if (values[idx] == null) {				System.out.println(key + " not found for remove");				return null; // key not found			} else if (keys[idx] == key) {				if(values[idx] == REMOVED)					return null;	// key has already been removed				Object o = values[idx];				values[idx] = REMOVED;				--items;				return o;			}		}		System.out.println(key + " not found for remove");		return null;	}