Benutzer:Riemer

Aus ProgrammingWiki

Archivierte Version vom 2012-03-29T10:05:29+00:00. Aktuelle Version

Klassen-Definitionen

public Object Elem(int d) {
	int data = d;
	int getKey() {
		return data;
	}
        return this;
}
public Object HashTable(int size) {
	int arraySize = size;
        int steps;

	Object[] hashArray = new Object[arraySize];
	for(i = 0; i < arraySize; i++) {
                hashArray[i] = null;
        }

	void displayTable() {
		for (int i = 0; i < arraySize; i++) {
			if (hashArray[i] != null)
				System.out.print(hashArray[i].getKey() + " ");
			else
				System.out.print("# ");
		}
		System.out.println("");
	}

	int hashFunction(int key) {
		return key % arraySize;
	}

	void insert(elem) {
		steps = 0;
		int key = elem.getKey();
		int hashVal = hashFunction(key);

		while (hashArray[hashVal] != null) {
                        steps++;
			if (steps > arraySize) {
				System.out.println(key + " konnte nicht eingefügt werden");
				return;
			}
			++hashVal;
			hashVal %= arraySize;
		}
		hashArray[hashVal] = elem;
		System.out.println(steps + " Sondierungen für " + key);
	}

	Object remove(int key) {
		int hashVal = hashFunction(key);

		while (hashArray[hashVal] != null)
		{
			if (hashArray[hashVal].getKey() == key) {
				return hashArray[hashVal] = null;
			}
			++hashVal;
			hashVal %= arraySize;
		}
		return null;
	}

	Object find(int key)
	{
		int hashVal = hashFunction(key);

		while (hashArray[hashVal] != null)
		{
			if (hashArray[hashVal].getKey() == key)
				return hashArray[hashVal];
			++hashVal;
			hashVal %= arraySize;
		}
		return null;
	}
        return this;
}

void fillHashTable(Object hashTable, int numberOfKeys) {

        for (int i = 0; i < numberOfKeys; i++) {
	        key = (int) (Math.random() * 10 * size);
	        elem = Elem(key);
	        hashTable.insert(elem);
        }
}

size = 17;
n = 10;

hashTable = HashTable(size);
fillHashTable(hashTable, n);
hashTable.displayTable();

Benutzer:Riemer

Suche