{"id":22124212,"url":"https://github.com/federicoponzi/hashtable","last_synced_at":"2025-06-25T09:04:07.928Z","repository":{"id":74371104,"uuid":"496149338","full_name":"FedericoPonzi/HashTable","owner":"FedericoPonzi","description":"An associative array implementation in C.","archived":false,"fork":false,"pushed_at":"2022-05-25T09:31:08.000Z","size":797,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-06-25T09:03:46.991Z","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/FedericoPonzi.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-05-25T08:40:18.000Z","updated_at":"2022-06-20T21:06:28.000Z","dependencies_parsed_at":"2023-03-24T14:02:42.893Z","dependency_job_id":null,"html_url":"https://github.com/FedericoPonzi/HashTable","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/FedericoPonzi/HashTable","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FedericoPonzi%2FHashTable","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FedericoPonzi%2FHashTable/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FedericoPonzi%2FHashTable/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FedericoPonzi%2FHashTable/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/FedericoPonzi","download_url":"https://codeload.github.com/FedericoPonzi/HashTable/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FedericoPonzi%2FHashTable/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261841935,"owners_count":23217911,"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-12-01T15:46:55.387Z","updated_at":"2025-06-25T09:04:07.906Z","avatar_url":"https://github.com/FedericoPonzi.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# A simple hashmap implementation\n\n### Collision handling.\nOpen addressing with double hashing. Double hashing makes use of two hash functions\nto calculate the index an item should be stored at after i collisions. What happens when the array is full?\n\n\n\n### Naming convention\n```\nht_\u003cmodule_name\u003e_\u003cfunction_name\u003e\n```\n\nfor a function that works on a struct:\n```\nht_\u003cmodule_name\u003e_\u003cStructName\u003e_\u003cfunction_name\u003e\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffedericoponzi%2Fhashtable","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffedericoponzi%2Fhashtable","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffedericoponzi%2Fhashtable/lists"}