{"payload":{"header_redesign_enabled":false,"results":[{"id":"121848140","archived":false,"color":"#b07219","followers":0,"has_funding_file":false,"hl_name":"propol/N-Queens-Problem","hl_trunc_description":"My algorithm for the solution of the N-Queens problem using concurrency","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":121848140,"name":"N-Queens-Problem","owner_id":26346357,"owner_login":"propol","updated_at":"2018-02-17T11:11:05.042Z","has_issues":true}},"sponsorable":false,"topics":["java","executor","concurrency","concurrent-programming","nqueens-problem","nqueens-problem-solver","callable","nqueens-solution","executorservice"],"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":89,"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%253Apropol%252FN-Queens-Problem%2B%2Blanguage%253AJava","metadata":null,"csrf_tokens":{"/propol/N-Queens-Problem/star":{"post":"bt0qngjjhybgesnvmlGZDP2qdUesBPtgKEkdIaTQhJM0wue8OtJ1tMUBmPL9kDk9WqaZWLbjlJnnNOxLX0C-zw"},"/propol/N-Queens-Problem/unstar":{"post":"6S0Q8h0Dz384pOGe7MPzY0-Gz51MORACHh62nUZQa3u_3Bt2z8EFwUCa3_h-HkUeg0vRF8TVHY0L_u4Qmr4R7w"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"oGlqU8l-aumawkMbZNdchOwrgWQg3_mxHODKVfINk-edEHnLf6vMS-wzmhrWpIRMADcNSn_vChcLtuvUECo76g"}}},"title":"Repository search results"}