-
Notifications
You must be signed in to change notification settings - Fork 0
/
IHashTable.java
56 lines (46 loc) · 1.46 KB
/
IHashTable.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
/**name1: Romy Shufman
id1: 209365238
username1: romyshufman
name2: Noa Hadash
id2: 316279264
username2: noahadash
*/
public interface IHashTable {
/**
*
* @param hte - the table entry to add
* @throws KeyAlreadyExistsException - throws this if an entry of the same key already exists in the table.
* @throws TableIsFullException - throws this if the probing sequence did not find a place for hte.
*/
public void Insert(HashTableElement hte) throws TableIsFullException, KeyAlreadyExistsException;
/**
*
* @param key - the key to delete from the table
* @throws KeyDoesntExistException - throws this if an entry of the searched key doesn't exist in the table.
*/
public void Delete(long key) throws KeyDoesntExistException;
/**
*
* @param key - the key to find in the table
* @return the table entry with the required key if exists, or null otherwise.
*/
public HashTableElement Find(long key);
public class TableIsFullException extends Exception{
public HashTableElement hte;
public TableIsFullException(HashTableElement hte) {
this.hte=hte;
}
}
public class KeyAlreadyExistsException extends Exception{
public HashTableElement hte;
public KeyAlreadyExistsException(HashTableElement hte) {
this.hte=hte;
}
}
public class KeyDoesntExistException extends Exception{
public long key;
public KeyDoesntExistException(long key) {
this.key=key;
}
}
}