tu-darmstadt-informatik/AuD18
1
0
Fork 0
mirror of https://github.com/tu-darmstadt-informatik/AuD18.git synced 2025-12-13 01:45:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Increase insert try cutoff to capacity squared

Browse Source
This commit is contained in:
rec0de 2018-05-16 21:37:47 +02:00
parent 3e93faca5e
commit 58bd1921bf
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
HashTable/src/lab/HashTable.java
View File

@ -112,7 +112,7 @@ public class HashTable {
// Find a free or deleted slot to insert the entry
while(this.data[address] != null && !this.data[address].isDeleted()) {
// Don't insert if there is no more space (this shouldn't happen due to auto-rehashing) or if the key is already present
if(i > this.capacity || this.data[address].getKey().equals(insertEntry.getKey()))
if(i > Math.pow(this.capacity, 2) || this.data[address].getKey().equals(insertEntry.getKey())) // The try cutoff of n² is pretty much trial and error - definitely safe for linear probing, not sure about quadratic
return false;
i += 1;
address = this.getProbingAddr(base, i);