{"payload":{"header_redesign_enabled":false,"results":[{"id":"210876518","archived":false,"color":"#b07219","followers":0,"has_funding_file":false,"hl_name":"fefong/java_towerOfHanoi_equation","hl_trunc_description":"Example Application: Tower of Hanoi minimal number of moves required to solve.","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":210876518,"name":"java_towerOfHanoi_equation","owner_id":26600374,"owner_login":"fefong","updated_at":"2019-09-25T15:17:37.740Z","has_issues":true}},"sponsorable":false,"topics":["java","netbeans","eclipse","hanoi","tower","towerofhanoi","felipefong","ffong"],"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":62,"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%253Afefong%252Fjava_towerOfHanoi_equation%2B%2Blanguage%253AJava","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/fefong/java_towerOfHanoi_equation/star":{"post":"ImnxgvMSYHxePTwhEONFOaZYXPQM9nlplBXt0_2durpngk6wC46SDM6l7Q0tf14w8lf6DIegwl6tMGHepA57nA"},"/fefong/java_towerOfHanoi_equation/unstar":{"post":"0Bb7Op6BOLZHUt4PNeQO2pMzkZG-QwULVscm-n_4KqT6kwUGmF5lkjPjxiYIxdDLglFoyjnssg8OLDD_2jwZ4Q"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"NIwq1PFsirNXcEQPt7ISyT8D3HPEYMWivzM53KxWg2b2lUhiKZ8O3VFoh_zpYTwGSXuMakBCiOu1td26bZ3eTw"}}},"title":"Repository search results"}