public HashCounter(final K key) {
			this.key = key;
			hashs = new ArrayList<Integer>(new TreeSet<Integer>(hash.hash(this.key)));
			counters = cbf.get(hashs.toArray(new Integer[hashs.size()]));
			for (Short i : counters) minCounter = (short)Math.min(i, minCounter);
			mli = hashs.get(counters.indexOf(minCounter));
		}