{"payload":{"header_redesign_enabled":false,"results":[{"id":"46876618","archived":false,"color":"#b07219","followers":2,"has_funding_file":false,"hl_name":"MichalGoly/CS21120-DoubleEndedPriorityQueue","hl_trunc_description":"Double ended priority queue implemented using an interval heap in Java","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":46876618,"name":"CS21120-DoubleEndedPriorityQueue","owner_id":10882074,"owner_login":"MichalGoly","updated_at":"2015-11-25T17:41:12.814Z","has_issues":true}},"sponsorable":false,"topics":["java","queue","priority","efficiency","complexity","heap","double","interval-heap","depq","ended"],"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":92,"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%253AMichalGoly%252FCS21120-DoubleEndedPriorityQueue%2B%2Blanguage%253AJava","metadata":null,"csrf_tokens":{"/MichalGoly/CS21120-DoubleEndedPriorityQueue/star":{"post":"mQpu0pu0do9PYAgf9ckVTlpmHGMRq9JgzyDBZ2pXXbkt84mkjXTHuqlaw85OMqiYXYkBD7DiEl8JoaBsFk3BAA"},"/MichalGoly/CS21120-DoubleEndedPriorityQueue/unstar":{"post":"HcvB-0l08Z4dNTB2y9GK9VC_DZySfEPJoQ5RiYKSjCQtxRxlnMYhA7Xq2_gFn1DIMMJWiS8NwImRn-deuf1rrA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"vK1EyMD9KRUeXlO8areJqPY4oJsPPiukelYYC-ekGIgpIIORJtkUgGdz67xTvdVsrPR4LiWhS9lnu7Lf-3D_1Q"}}},"title":"Repository search results"}