{"id":17540355,"url":"https://github.com/bitwit/hash-table-c","last_synced_at":"2025-03-29T04:35:36.687Z","repository":{"id":69782708,"uuid":"41276253","full_name":"bitwit/hash-table-c","owner":"bitwit","description":"A basic hash table in C","archived":false,"fork":false,"pushed_at":"2015-08-24T02:16:03.000Z","size":120,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-24T03:37:42.428Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bitwit.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-08-24T02:00:46.000Z","updated_at":"2015-08-24T02:02:51.000Z","dependencies_parsed_at":"2023-02-26T11:55:51.052Z","dependency_job_id":null,"html_url":"https://github.com/bitwit/hash-table-c","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bitwit%2Fhash-table-c","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bitwit%2Fhash-table-c/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bitwit%2Fhash-table-c/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bitwit%2Fhash-table-c/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bitwit","download_url":"https://codeload.github.com/bitwit/hash-table-c/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246140574,"owners_count":20729797,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-20T22:23:34.064Z","updated_at":"2025-03-29T04:35:36.656Z","avatar_url":"https://github.com/bitwit.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Hash Table Implementation in C\n\nNotes:\n\n- This hash table is designed for storing `(char*)key`, `(char*)value` pairs\n\n- Uses an FNV1-a hashing algorithm. Based on [this discussion](http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed) it appears that FNV1-a has the most uniform distribution.\n\n- This hash table uses a chaining method to handle collisions.\n\n- Compiling and running this code will execute a small series of proofs with 2 hash tables. The first a hash table, sized for 100 items with no collisions and second a hash table sized to 1 item, where every entry will collide and form a linked list. The same series of assertions pass under both conditions. Additional information about the process and results are also printed to output.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbitwit%2Fhash-table-c","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbitwit%2Fhash-table-c","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbitwit%2Fhash-table-c/lists"}