{"payload":{"header_redesign_enabled":false,"results":[{"id":"111683990","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"tchond/pardisp","hl_trunc_description":"Partition-based distance and shortest path query processing.","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":111683990,"name":"pardisp","owner_id":17951230,"owner_login":"tchond","updated_at":"2018-02-26T13:29:18.008Z","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":74,"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%253Atchond%252Fpardisp%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/tchond/pardisp/star":{"post":"yeq9iGGWIHG6DQKOB0K8pm2pB4_Un8KxazfUmNuwaRqxIctjDtQcHeZHZbjuFlvpXBa_rQWKTDCU_7b8zh_z8w"},"/tchond/pardisp/unstar":{"post":"BHIg1nOf-zN0ouyR1sFDdYl6nM_ajO_3avxrUnRcfgalW39AD8TS8KPgNhiDYL9F7G-JrVOsNyzmcT_yyuZq7w"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"UV1lgpIycYa5d6l9IwZdT4VNq5uDJbnEHXyOIg-VdnBhPLDflvkW4p7_9oYxZVFJESMlUrSursO_ahOQ2nld8Q"}}},"title":"Repository search results"}