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

reflexive vs symmetric in hash_table.h doc #1056

Merged
merged 5 commits into from
Sep 8, 2023
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 3 additions & 2 deletions include/aws/common/hash_table.h
Original file line number Diff line number Diff line change
Expand Up @@ -103,8 +103,9 @@ typedef uint64_t(aws_hash_fn)(const void *key);
* keys, but note that the same type is used for a function that compares
* two hash table values in aws_hash_table_eq.
*
* Equality functions used in a hash table must be reflexive (i.e., a == b if
* and only if b == a), and must be consistent with the hash function in use.
* Equality functions used in a hash table must be be reflexive (a == a),
* symmetric (a == b => b == a), transitive (a == b, b == c => a == c)
* and consistent (result does not change with time).
*/
typedef bool(aws_hash_callback_eq_fn)(const void *a, const void *b);

Expand Down