{"id":19839358,"url":"https://github.com/redislabs/triemap","last_synced_at":"2025-05-01T19:30:19.052Z","repository":{"id":141980909,"uuid":"79327280","full_name":"RedisLabs/triemap","owner":"RedisLabs","description":"C implementation of a compressed trie lookup map","archived":false,"fork":false,"pushed_at":"2019-05-14T10:39:09.000Z","size":47,"stargazers_count":21,"open_issues_count":2,"forks_count":9,"subscribers_count":9,"default_branch":"master","last_synced_at":"2025-04-06T17:01:48.134Z","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":"bsd-2-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/RedisLabs.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}},"created_at":"2017-01-18T10:03:21.000Z","updated_at":"2021-12-25T01:39:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"9d4d1713-dd45-48a8-9737-b80af1d08c82","html_url":"https://github.com/RedisLabs/triemap","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/RedisLabs%2Ftriemap","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RedisLabs%2Ftriemap/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RedisLabs%2Ftriemap/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RedisLabs%2Ftriemap/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/RedisLabs","download_url":"https://codeload.github.com/RedisLabs/triemap/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":251932513,"owners_count":21667157,"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-11-12T12:22:00.667Z","updated_at":"2025-05-01T19:30:18.444Z","avatar_url":"https://github.com/RedisLabs.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# triemap\n\nC implementation of a compact trie lookup map\n\n## Features\n\n* High memory efficiency, fast lookups and insertions\n* Deletions with node rejoining\n* Prefix lookups with an iterator API\n* Random key extraction\n* No external dependencies, just one C and one H file\n\n## Basic Example\n```c\n\n TrieMap *tm = NewTrieMap();\n\n char buf[32];\n\n for (int i = 0; i \u003c 100; i++) {\n    sprintf(buf, \"key%d\", i);\n    TrieMap_Add(tm, buf, strlen(buf), NULL, NULL);\n }\n \n  TrieMapIterator *it = TrieMap_Iterate(tm, \"key1\", 4);\n  \n  char *str = NULL;\n  tm_len_t len = 0;\n  void *ptr = NULL;\n\n  /* Prefix Iteration */\n  while (TrieMapIterator_Next(it, \u0026str, \u0026len, \u0026ptr)) {\n    printf(\"Found key %.*s\\n\", (int)len, str);\n  }\n  \n  TrieMapIterator_Free(\u0026it);\n  TrieMap_Free(tm, NULL);\n  \n  ```\n  \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fredislabs%2Ftriemap","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fredislabs%2Ftriemap","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fredislabs%2Ftriemap/lists"}