Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Chapter 20 (Hash tables) challenge 1 solution bug #1091

Open
bayerf42 opened this issue Oct 1, 2022 · 0 comments
Open

Chapter 20 (Hash tables) challenge 1 solution bug #1091

bayerf42 opened this issue Oct 1, 2022 · 0 comments

Comments

@bayerf42
Copy link

bayerf42 commented Oct 1, 2022

The bold code fragment should be IS_EMPTY. Otherwise the key nil would not be possible in a hash table.

+bool tableGet(Table* table, Value key, Value* value) {
if (table->entries == NULL) return false;

Entry* entry = findEntry(table->entries, table->capacity, key);

  • if (entry->key == NULL) return false;
  • if (IS_NIL(entry->key)) return false;

    *value = entry->value;
    return true;

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant