{"payload":{"header_redesign_enabled":false,"results":[{"id":"310600718","archived":false,"color":"#b07219","followers":1,"has_funding_file":false,"hl_name":"javaf/combining-tree","hl_trunc_description":"A Combining Tree is an N-ary tree of nodes, that follows software combining to reduce memory contention while updating a shared value.","language":"Java","mirror":false,"owned_by_organization":true,"public":true,"repo":{"repository":{"id":310600718,"name":"combining-tree","owner_id":32804476,"owner_login":"javaf","updated_at":"2020-12-19T08:06:23.761Z","has_issues":true}},"sponsorable":false,"topics":["java","data","tree","binary","structures","yay","software","concurrent","trinary","hard","nary","combining","ary"],"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":73,"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%253Ajavaf%252Fcombining-tree%2B%2Blanguage%253AJava","metadata":null,"csrf_tokens":{"/javaf/combining-tree/star":{"post":"XK4RMUAVp4jUZtLafg34UTfNbX4lQz0H39fL_uVbpJgLqdIDjC1exCfuT4MHyUPEh7Gsb47HbQESFFpNjTYUDA"},"/javaf/combining-tree/unstar":{"post":"j59R2NnSYfgsD4zUb1RLAAmy-w8ndj_5Ob1EtWblxsdlSwt-jgq-pnUT_dpZ_dTBcKVqlA0Ay5S5w5lJH_QO-Q"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"fyFyUw6y4wwmbm_4BmqzgppwqWHJvhhFYy3RZNjXGSABh3i9hi216swSr6p2NkQF4DCJ6EY8sdpOzloFmRoREw"}}},"title":"Repository search results"}