{"id":17011766,"url":"https://github.com/flaribbit/my-hashmap","last_synced_at":"2026-04-27T12:38:48.038Z","repository":{"id":137699836,"uuid":"535918791","full_name":"flaribbit/my-hashmap","owner":"flaribbit","description":"仿照 lua table 原理实现的哈希表，略有改动","archived":false,"fork":false,"pushed_at":"2022-09-18T01:31:27.000Z","size":12,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-27T12:49:33.408Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","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/flaribbit.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-09-13T01:52:41.000Z","updated_at":"2022-09-18T01:41:29.000Z","dependencies_parsed_at":null,"dependency_job_id":"628c081c-36ff-4ab5-8d97-722cd36e8d77","html_url":"https://github.com/flaribbit/my-hashmap","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/flaribbit%2Fmy-hashmap","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/flaribbit%2Fmy-hashmap/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/flaribbit%2Fmy-hashmap/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/flaribbit%2Fmy-hashmap/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/flaribbit","download_url":"https://codeload.github.com/flaribbit/my-hashmap/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244960721,"owners_count":20538870,"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-14T06:07:57.585Z","updated_at":"2026-04-27T12:38:48.003Z","avatar_url":"https://github.com/flaribbit.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# my hashmap\n\n仿照 lua table 原理实现的哈希表，略有改动。\n\n哈希表在解决冲突有两个常用的方法：\n- 开放定址法：把冲突数据放到空位置。\n- 链地址法：把冲突数据串成单链表挂在对应位置下面。\n\n而 lua 的实现结合了两种方法：把链表的节点放在空位置，从而节省内存，而又不增加查找和插入复杂度。\n\n![原理图](https://img-blog.csdnimg.cn/20190630185911843.png)\n\n具体原理参考[这篇文章](https://blog.csdn.net/y1196645376/article/details/94348873)。\n\n## 其他\n之后有时间再改用 c++ 模板实现。\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fflaribbit%2Fmy-hashmap","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fflaribbit%2Fmy-hashmap","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fflaribbit%2Fmy-hashmap/lists"}