{"id":15567615,"url":"https://github.com/purehyperbole/art","last_synced_at":"2025-09-04T01:37:48.152Z","repository":{"id":54670421,"uuid":"212888717","full_name":"purehyperbole/art","owner":"purehyperbole","description":"an Adaptive Radix Tree implementation in go","archived":false,"fork":false,"pushed_at":"2021-11-03T09:56:39.000Z","size":56,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-29T05:35:48.355Z","etag":null,"topics":["adaptive-radix-tree","golang","radix","radix-tree","thread-safe"],"latest_commit_sha":null,"homepage":null,"language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/purehyperbole.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}},"created_at":"2019-10-04T19:30:44.000Z","updated_at":"2022-09-05T19:00:26.000Z","dependencies_parsed_at":"2022-08-13T23:30:28.594Z","dependency_job_id":null,"html_url":"https://github.com/purehyperbole/art","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/purehyperbole/art","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/purehyperbole%2Fart","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/purehyperbole%2Fart/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/purehyperbole%2Fart/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/purehyperbole%2Fart/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/purehyperbole","download_url":"https://codeload.github.com/purehyperbole/art/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/purehyperbole%2Fart/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273539293,"owners_count":25123499,"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","status":"online","status_checked_at":"2025-09-03T02:00:09.631Z","response_time":76,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["adaptive-radix-tree","golang","radix","radix-tree","thread-safe"],"created_at":"2024-10-02T17:12:01.531Z","updated_at":"2025-09-04T01:37:48.128Z","avatar_url":"https://github.com/purehyperbole.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Art [![GoDoc](https://godoc.org/github.com/purehyperbole/art?status.svg)](https://godoc.org/github.com/purehyperbole/art) [![Go Report Card](https://goreportcard.com/badge/github.com/purehyperbole/art)](https://goreportcard.com/report/github.com/purehyperbole/art) [![Build Status](https://travis-ci.org/purehyperbole/art.svg?branch=master)](https://travis-ci.org/purehyperbole/art)\n\n\nA thread safe Adaptive Radix Tree implementation in go\n\n\n# Installation\n\nTo start using art, you can run:\n\n`$ go get github.com/purehyperbole/art`\n\n# Usage\n\nTo create a new radix tree\n\n```go\npackage main\n\nimport (\n    \"github.com/purehyperbole/art\"\n)\n\nfunc main() {\n    // create a new art tree\n    r := art.New()\n}\n```\n\n`Lookup` can be used to retrieve a stored value\n\n```go\nvalue := r.Lookup([]byte(\"myKey1234\"))\n```\n\n`Insert` allows a value to be stored for a given key.\n\n```go\nr.Insert([]byte(\"key\"), \u0026Thing{12345})\n```\n\n`Iterate` allows for iterating keys in the tree\n\n```go\n// iterate over all keys\nr.Iterate(nil, func(key []byte, value interface{}) {\n    ...\n})\n\n// iterate over all subkeys of \"art\"\nr.Iterate([]byte(\"art\"), func(key []byte, value interface{}) {\n    ...\n})\n```\n\n## Why?\n\nThis project was created to explore the performance tradeoffs of a more memory efficient radix tree with my other lock free implementation (github.com/purehyperbole/rad).\n\n## Versioning\n\nFor transparency into our release cycle and in striving to maintain backward\ncompatibility, this project is maintained under [the Semantic Versioning guidelines](http://semver.org/).\n\n## Copyright and License\n\nCode and documentation copyright since 2019 purehyperbole.\n\nCode released under\n[the MIT License](LICENSE).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpurehyperbole%2Fart","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpurehyperbole%2Fart","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpurehyperbole%2Fart/lists"}