@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;
			}
			
			
			if(table[hashCode] == null){								//Add new word
				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();
			}else if(comparator.compare(table[hashCode].data, data) == 0){//Found it - increment the count
				table[hashCode].count++;
			}
		//If data is not already present, find a blank spot in the table and insert a new DataCount for it
		//else {

			//Make a new DataCount to put in the table

			
			//Find an empty spot and insert the new DataCount element

			
			//Update keyArr, numItems, and loadFactor, and then check if a table resize is needed

		//}
	}