{"id":18584987,"url":"https://github.com/bor0/hashtable","last_synced_at":"2025-07-03T07:33:21.540Z","repository":{"id":145916291,"uuid":"82951900","full_name":"bor0/hashtable","owner":"bor0","description":"Hashtable implementation in C","archived":false,"fork":false,"pushed_at":"2021-12-28T08:14:16.000Z","size":40,"stargazers_count":9,"open_issues_count":0,"forks_count":2,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-04-11T00:35:37.726Z","etag":null,"topics":["algorithm","c","hashtable","linked-list"],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bor0.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-02-23T17:17:33.000Z","updated_at":"2025-02-24T10:43:48.000Z","dependencies_parsed_at":"2023-04-09T19:03:49.463Z","dependency_job_id":null,"html_url":"https://github.com/bor0/hashtable","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/bor0/hashtable","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bor0%2Fhashtable","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bor0%2Fhashtable/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bor0%2Fhashtable/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bor0%2Fhashtable/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bor0","download_url":"https://codeload.github.com/bor0/hashtable/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bor0%2Fhashtable/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263283084,"owners_count":23442286,"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":["algorithm","c","hashtable","linked-list"],"created_at":"2024-11-07T00:29:43.820Z","updated_at":"2025-07-03T07:33:21.528Z","avatar_url":"https://github.com/bor0.png","language":"C","readme":"Hashtable implementation\n------------------------\nHello. I wrote this mainly as an exercise to run some benchmark tests. I'm comparing this native implementation of hashtable in C with JS objects and Python dicts.\n\nThe implementation uses separate chaining with linked lists for collision resolution. Thus, we have a fixed array (malloc'd) which we have O(1) access to it, and each value is actually a linked list.\n\nThe dependency relation between ht and ll is asymmetric.\n\nFor benchmarks, check the `benchmarks` folder.\n\nTo build the tests, write `make tests`.\n\nTo build the examples, write `make examples`.\n\nTo just build the library, write `make lib`.\n\nTo build everything, write `make`.\n\nTo cleanup, run `make clean`.\n\nFor memory leaks test, run `leaks -atExit -- ./ht_test | grep LEAK:`.\n\nBoro Sitnikovski\n\nFebruary 2017\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbor0%2Fhashtable","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbor0%2Fhashtable","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbor0%2Fhashtable/lists"}