{"id":22378203,"url":"https://github.com/aminography/radixtree","last_synced_at":"2025-10-06T11:12:37.468Z","repository":{"id":54392374,"uuid":"339017598","full_name":"aminography/RadixTree","owner":"aminography","description":"An implementation of RadixTree data-structure, which is a great tool for indexing a large number of records with string keys.","archived":false,"fork":false,"pushed_at":"2021-12-29T11:25:53.000Z","size":117,"stargazers_count":4,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-31T23:45:52.133Z","etag":null,"topics":["data-structures","indexing","prefix-search","prefix-tree","radix-tree","radix-trie","tree-structure"],"latest_commit_sha":null,"homepage":"","language":"Kotlin","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/aminography.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2021-02-15T08:56:09.000Z","updated_at":"2022-01-16T21:47:18.000Z","dependencies_parsed_at":"2022-08-13T14:20:18.965Z","dependency_job_id":null,"html_url":"https://github.com/aminography/RadixTree","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aminography%2FRadixTree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aminography%2FRadixTree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aminography%2FRadixTree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aminography%2FRadixTree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aminography","download_url":"https://codeload.github.com/aminography/RadixTree/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245709863,"owners_count":20659781,"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":["data-structures","indexing","prefix-search","prefix-tree","radix-tree","radix-trie","tree-structure"],"created_at":"2024-12-04T22:18:04.459Z","updated_at":"2025-10-06T11:12:32.437Z","avatar_url":"https://github.com/aminography.png","language":"Kotlin","readme":"# `RadixTree` :zap:\n![mavenCentral](https://img.shields.io/maven-central/v/com.aminography/radixtree?color=blue)\n[![Codacy Badge](https://app.codacy.com/project/badge/Grade/5716eecf43294ddd9463e129cf6d6073)](https://www.codacy.com/gh/aminography/RadixTree/dashboard?utm_source=github.com\u0026amp;utm_medium=referral\u0026amp;utm_content=aminography/RadixTree\u0026amp;utm_campaign=Badge_Grade)\n\nThis project provides an implementation of [`RadixTree`](https://en.wikipedia.org/wiki/Radix_tree) data-structure, which is a great tool for indexing a large number of records with string keys and performing a prefix search with an optimal time complexity. \n\n\u003cbr/\u003e\n\nTable of Contents\n-----------------\n- [Main Characteristics](#main-characteristics)\n- [Complexity Order](#complexity-order)\n\n\u003cbr/\u003e\n\nMain Characteristics\n--------------------\n- Space and time efficient.\n- Retrieves elements sorted, when elements insertion is sorted.\n\n\u003cbr/\u003e\n\nComplexity Order\n--------------------\n`RadixTree` or compressed trie is the compact and space-optimized form of prefix tree,\nwhich enables us to find all nodes whose keys start with a prefix string, by a `O(L + V)` complexity order, where `L` is the length of input\nprefix, and `V` stands for number of nodes that will be discovered.\n\nIn case of large datasets, the length of keys are dramatically lower than number of items, which means that the time complexity of prefix search using `RadixTree` is significantly better than linear search.\n\n\u003cbr/\u003e\n\nDownload\n--------\n**`RadixTree`** is available on `MavenCentral` to download using build tools systems.\n\n### • Gradle\nAdd the following lines to your `build.gradle` file:\n\n```gradle\ndependencies {\n    implementation 'com.aminography:radixtree:1.2.0'\n}\n```\n\n### • Maven\nAdd the following lines to your `pom.xml` file:\n\n```xml\n\u003cdependencies\u003e\n    \u003cdependency\u003e\n        \u003cgroupId\u003ecom.aminography\u003c/groupId\u003e\n        \u003cartifactId\u003eradixtree\u003c/artifactId\u003e\n        \u003cversion\u003e1.2.0\u003c/version\u003e\n    \u003c/dependency\u003e\n\u003c/dependencies\u003e\n```\n\n\u003cbr/\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faminography%2Fradixtree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faminography%2Fradixtree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faminography%2Fradixtree/lists"}