Rev 1248 | Rev 1702 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1248 | Rev 1337 | ||
---|---|---|---|
Line 104... | Line 104... | ||
104 | ASSERT(h && h->op && h->op->hash && h->op->compare); |
104 | ASSERT(h && h->op && h->op->hash && h->op->compare); |
105 | 105 | ||
106 | chain = h->op->hash(key); |
106 | chain = h->op->hash(key); |
107 | ASSERT(chain < h->entries); |
107 | ASSERT(chain < h->entries); |
108 | 108 | ||
109 | /* |
- | |
110 | * The hash table is not redundant. |
- | |
111 | * Check if the keys are not in place already. |
- | |
112 | */ |
- | |
113 | for (cur = h->entry[chain].next; cur != &h->entry[chain]; cur = cur->next) { |
109 | for (cur = h->entry[chain].next; cur != &h->entry[chain]; cur = cur->next) { |
114 | if (h->op->compare(key, h->max_keys, cur)) { |
110 | if (h->op->compare(key, h->max_keys, cur)) { |
115 | /* |
111 | /* |
116 | * The entry is there. |
112 | * The entry is there. |
117 | */ |
113 | */ |