{"id":20115492,"url":"https://github.com/asphaltt/lpmtrie","last_synced_at":"2025-05-06T13:32:50.231Z","repository":{"id":57662407,"uuid":"455904760","full_name":"Asphaltt/lpmtrie","owner":"Asphaltt","description":"LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License","archived":false,"fork":false,"pushed_at":"2022-02-05T15:32:00.000Z","size":5,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"main","last_synced_at":"2024-06-20T09:18:46.045Z","etag":null,"topics":["golang","longest-prefix-match","lpm-trie"],"latest_commit_sha":null,"homepage":"","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/Asphaltt.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":"2022-02-05T15:19:41.000Z","updated_at":"2023-03-30T08:29:31.000Z","dependencies_parsed_at":"2022-09-12T22:00:42.396Z","dependency_job_id":null,"html_url":"https://github.com/Asphaltt/lpmtrie","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/Asphaltt%2Flpmtrie","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Asphaltt%2Flpmtrie/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Asphaltt%2Flpmtrie/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Asphaltt%2Flpmtrie/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Asphaltt","download_url":"https://codeload.github.com/Asphaltt/lpmtrie/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224505534,"owners_count":17322622,"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":["golang","longest-prefix-match","lpm-trie"],"created_at":"2024-11-13T18:35:26.557Z","updated_at":"2024-11-13T18:35:27.065Z","avatar_url":"https://github.com/Asphaltt.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# lpmtrie\n\nLpmTrie is a trie data structure which implements Longest Prefix Match algorithm.\n\nIt's thread-safe and high performance with `atomic` operations.\n\n---\n\nIt's inspired by: https://github.com/torvalds/linux/blob/master/kernel/bpf/lpm_trie.c\n\n## License\n\n[MIT License](./LICENSE)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fasphaltt%2Flpmtrie","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fasphaltt%2Flpmtrie","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fasphaltt%2Flpmtrie/lists"}