{"payload":{"header_redesign_enabled":false,"results":[{"id":"2503671","archived":false,"color":"#f34b7d","followers":55,"has_funding_file":false,"hl_name":"ot/path_decomposed_tries","hl_trunc_description":"Implementation of the data structures described in the paper \"Fast Compressed Tries using Path Decomposition\".","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":2503671,"name":"path_decomposed_tries","owner_id":17024,"owner_login":"ot","updated_at":"2023-01-27T15:21:26.031Z","has_issues":true}},"sponsorable":false,"topics":[],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":110,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Aot%252Fpath_decomposed_tries%2B%2Blanguage%253AC%252B%252B","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/ot/path_decomposed_tries/star":{"post":"UKP_lrFpP6abjfPthkJGUntGK-ZwDsRtDIHzODYS2QwmF9jCbpEqneyqCIXaxhr3iHMJqx1MWEOy8ox_WMJD1A"},"/ot/path_decomposed_tries/unstar":{"post":"4V5QMVMWygMeZNlxqunKPzSq85Xszd7nLyhQoXuN0Dba4sH7AxNkQViCnYA4ljMbpIsgbqoBoczUwH5fkDI_Rg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"TPLnhquurTk3F3DZpxHNsssAl9DPQIgdRSGGRtZvlsCuMcULA5Cb8cuWJ3sKRfUtZoLwkfQcR_3n-XQ81Y2qIQ"}}},"title":"Repository search results"}