@Override
	public void incCount(E data) {
		//First check to see if data is already present in the HashTable
		//Get hashcode
		int hashCode = hasherH.hash(data) % table.length;
		
		//If data is already present, find it in the table and increment its count
		//It may not be in the first place we look - if so, use the secondary hash function to find it
		while (table[hashCode] != null && comparator.compare(table[hashCode].data, data) != 0) {
			hashCode = (hashCode + hasherG.hash(data)) % table.length;
		}
		
		//It's not in the table - make a new DataCount and add it in
		if(table[hashCode] == null){
			DataCount<E> dc = new DataCount<E>(data, 1);
			table[hashCode] = dc;
			keyArr[numItems] = data;
			numItems++;
			loadFactor = 1.0 * numItems / table.length;
			if (loadFactor >= 0.5) resizeTable();
		}
		//Found it - increment the count
		else if(comparator.compare(table[hashCode].data, data) == 0){
			table[hashCode].count++;
		}
	}