public int find(long key) {
    	int find_attempt = 1;
		int hash = hashFn(key);
      int initialHash = -1;
      while (hash != initialHash
                  && (table[hash] == DeletedEntry.getUniqueDeletedEntry()
                  || table[hash] != null
                  && table[hash].getKey() != key)) {
            if (initialHash == -1)
                  initialHash = hash;
            hash = (hash + 1) % table.length;
            find_attempt += 1;
      }
      if (table[hash] == null || hash == initialHash)
            return 0;
      else
            return find_attempt;
}