{"payload":{"header_redesign_enabled":false,"results":[{"id":"203328814","archived":false,"color":"#f34b7d","followers":43,"has_funding_file":false,"hl_name":"RJJxp/CoveragePlanning","hl_trunc_description":"decompose the convex polygon and for each of them, Boustrophedon planning? just complete coverage","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":203328814,"name":"CoveragePlanning","owner_id":22700165,"owner_login":"RJJxp","updated_at":"2019-11-15T08:26:15.192Z","has_issues":true}},"sponsorable":false,"topics":["coverage-path-planning","convex-decomposition"],"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":84,"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%253ARJJxp%252FCoveragePlanning%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/RJJxp/CoveragePlanning/star":{"post":"riaVLi3UGsXHO9ilqJ-O_T3DMXjZhFSYVdQEk9-usd5gELh7_qlCujeY-Xg-0O2Dq_3Xc1cV8kKZZ0PIHvu1kQ"},"/RJJxp/CoveragePlanning/unstar":{"post":"3pfaMgnSDcnsJUtjj154JHxKYCPudg4PjbaRFWzAvnrpYhi5byAsm0Us9NjBqf-AE1baQTKyWDt1qnnOpYKXww"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"HiwlC0viaFm_b8_S84bfhX-RGlVVZchWP-uEzQvfnkewKL1b0EcwI81RVG8EyGCXM2M56pI5VD2Gd3QtEfg3JQ"}}},"title":"Repository search results"}