-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhtab_find.c
61 lines (54 loc) · 1.69 KB
/
htab_find.c
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
57
58
59
60
61
/*
Daniel Pátek (xpatek08)
VUT FIT
IJC - Projekt 2
19.4.2020
překladač: gcc (Ubuntu 7.5.0-3ubuntu1~18.04) 7.5.0
*/
#include "htab.h"
#include "htab_struct.h"
htab_iterator_t htab_find(htab_t * t, htab_key_t key) {
unsigned int hash = htab_hash_fun(key);
size_t index = hash % t->arr_size;
struct htab_item *item = t->arr[index];
//zkontroluji prvni polozku v seznamu
if (strlen(key) == strlen(item->key)) {
if (strncmp(key, item->key, strlen(key)) == 0) {
//polozky jsou shodne -> vracim iterator
htab_iterator_t iterator;
iterator.ptr = item;
iterator.t = t;
iterator.idx = index;
return iterator;
}
}
while (item->next != NULL) {
//existuje dalsi polozka
//musim zjistit, zda je aktualni polozka uplne stejna
if (strlen(key) == strlen(item->key)) {
if (strncmp(key, item->key, strlen(key)) == 0) {
//polozky jsou shodne -> vracim iterator
htab_iterator_t iterator;
iterator.ptr = item;
iterator.t = t;
iterator.idx = index;
return iterator;
}
}
//dalsi polozka
item = item->next;
}
//zkontroluji posledni polozku listu
if (strlen(key) == strlen(item->key)) {
if (strncmp(key, item->key, strlen(key)) == 0) {
//polozky jsou shodne -> vracim iterator
htab_iterator_t iterator;
iterator.ptr = item;
iterator.t = t;
iterator.idx = index;
return iterator;
}
}
//polozka nebyla nalezena
return htab_end(t);
}