{"id":13995659,"url":"https://github.com/zvelo/hat-trie","last_synced_at":"2025-07-22T22:31:50.550Z","repository":{"id":4159927,"uuid":"5274443","full_name":"zvelo/hat-trie","owner":"zvelo","description":"An efficient trie implementation.","archived":false,"fork":true,"pushed_at":"2017-03-02T05:52:50.000Z","size":338,"stargazers_count":1,"open_issues_count":1,"forks_count":2,"subscribers_count":48,"default_branch":"master","last_synced_at":"2024-08-10T14:20:05.517Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Shell","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":"dcjones/hat-trie","license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/zvelo.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"COPYING","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2012-08-02T15:42:52.000Z","updated_at":"2017-07-25T04:13:19.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/zvelo/hat-trie","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/zvelo%2Fhat-trie","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zvelo%2Fhat-trie/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zvelo%2Fhat-trie/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zvelo%2Fhat-trie/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/zvelo","download_url":"https://codeload.github.com/zvelo/hat-trie/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":227190279,"owners_count":17745238,"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-08-09T14:03:32.162Z","updated_at":"2024-11-29T18:30:48.539Z","avatar_url":"https://github.com/zvelo.png","language":"Shell","funding_links":[],"categories":["Shell"],"sub_categories":[],"readme":"\nHat-Trie\n========\n\nThis a ANSI C99 implementation of the HAT-trie data structure of Askitis and\nSinha, an extremely efficient (space and time) modern variant of tries.\n\nThe version implemented here maps arrays of bytes to words (i.e., unsigned\nlongs), which can be used to store counts, pointers, etc, or not used at all if\nyou simply want to maintain a set of unique strings.\n\nFor details see,\n\n  1. Askitis, N., \u0026 Sinha, R. (2007). HAT-trie: a cache-conscious trie-based data\n     structure for strings. Proceedings of the thirtieth Australasian conference on\n     Computer science-Volume 62 (pp. 97–105). Australian Computer Society, Inc.\n\n  2. Askitis, N., \u0026 Zobel, J. (2005). Cache-conscious collision resolution in\n     string hash tables. String Processing and Information Retrieval (pp.\n     91–102). Springer.\n\n\nInstallation\n------------\n\n    git clone git@github.com:dcjones/hat-trie.git\n    cd hat-trie\n    autoreconf -i\n    ./configure\n    make install\n\nTo use the library, include `hat-trie.h` and link using `lhat-trie`.\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzvelo%2Fhat-trie","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fzvelo%2Fhat-trie","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzvelo%2Fhat-trie/lists"}