{"id":15399280,"url":"https://github.com/raviqqe/hamt","last_synced_at":"2025-05-16T08:03:19.962Z","repository":{"id":26417782,"uuid":"108698438","full_name":"raviqqe/hamt","owner":"raviqqe","description":"Immutable and Memory-Efficient Maps and Sets in Go","archived":false,"fork":false,"pushed_at":"2025-03-25T08:42:19.000Z","size":136,"stargazers_count":240,"open_issues_count":3,"forks_count":13,"subscribers_count":8,"default_branch":"v2","last_synced_at":"2025-04-08T18:19:36.935Z","etag":null,"topics":["functional-programming","go","hamt","immutable","map","set"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"unlicense","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/raviqqe.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":"2017-10-29T02:13:23.000Z","updated_at":"2025-03-25T08:42:22.000Z","dependencies_parsed_at":"2025-01-05T12:03:53.556Z","dependency_job_id":"74e05186-3031-4f50-88e8-ded0b64793a9","html_url":"https://github.com/raviqqe/hamt","commit_stats":{"total_commits":147,"total_committers":5,"mean_commits":29.4,"dds":0.1496598639455783,"last_synced_commit":"926eccc7881415c601bb45d2d2d0e7fe96632e8b"},"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raviqqe%2Fhamt","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raviqqe%2Fhamt/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raviqqe%2Fhamt/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raviqqe%2Fhamt/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/raviqqe","download_url":"https://codeload.github.com/raviqqe/hamt/tar.gz/refs/heads/v2","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254493381,"owners_count":22080126,"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":["functional-programming","go","hamt","immutable","map","set"],"created_at":"2024-10-01T15:47:59.109Z","updated_at":"2025-05-16T08:03:19.939Z","avatar_url":"https://github.com/raviqqe.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# hamt\n\n[![GitHub Action](https://img.shields.io/github/actions/workflow/status/raviqqe/hamt/test.yaml?branch=main\u0026style=flat-square)](https://github.com/raviqqe/hamt/actions)\n[![Codecov](https://img.shields.io/codecov/c/github/raviqqe/hamt.svg?style=flat-square)](https://codecov.io/gh/raviqqe/hamt)\n[![Go Report Card](https://goreportcard.com/badge/github.com/raviqqe/hamt?style=flat-square)](https://goreportcard.com/report/github.com/raviqqe/hamt)\n[![License](https://img.shields.io/github/license/raviqqe/hamt.svg?style=flat-square)][unlicense]\n\n\u003e For the old `any`-based API, refer to [the `main` branch](https://github.com/raviqqe/hamt/tree/main).\n\nImmutable and Memory Efficient Maps and Sets in Go.\n\nThis package `hamt` provides immutable collection types of maps (associative arrays)\nand sets implemented as Hash-Array Mapped Tries (HAMTs).\nAll operations of the collections, such as insert and delete, are immutable and\ncreate new ones keeping original ones unmodified.\n\n[Hash-Array Mapped Trie (HAMT)](https://en.wikipedia.org/wiki/Hash_array_mapped_trie)\nis a data structure popular as a map (a.k.a. associative array or dictionary)\nor set.\nIts immutable variant is adopted widely by functional programming languages\nlike Scala and Clojure to implement immutable and memory-efficient associative\narrays and sets.\n\n## Installation\n\n```\ngo get github.com/raviqqe/hamt/v2\n```\n\n## Documentation\n\n[GoDoc](https://godoc.org/github.com/raviqqe/hamt/v2)\n\n## Technical notes\n\nThe implementation canonicalizes tree structures of HAMTs by eliminating\nintermediate nodes during delete operations as described\nin [the CHAMP paper][champ].\n\n## References\n\n- [Ideal Hash Trees](https://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf)\n- [Optimizing Hash-Array Mapped Tries for Fast and Lean Immutable JVM Collections][champ]\n\n## License\n\n[The Unlicense][unlicense]\n\n[champ]: https://michael.steindorfer.name/publications/oopsla15.pdf\n[unlicense]: https://unlicense.org/\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraviqqe%2Fhamt","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fraviqqe%2Fhamt","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraviqqe%2Fhamt/lists"}