{"payload":{"header_redesign_enabled":false,"results":[{"id":"157998362","archived":false,"color":"#555555","followers":0,"has_funding_file":false,"hl_name":"staeter/fillit","hl_trunc_description":"[42 cursus] A backtracking algorithm to find the smallest square possible with the given tetriminos.","language":"C","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":157998362,"name":"fillit","owner_id":35398967,"owner_login":"staeter","updated_at":"2019-02-23T17:07:53.624Z","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":67,"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%253Astaeter%252Ffillit%2B%2Blanguage%253AC","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/staeter/fillit/star":{"post":"D0hXPbuf-Sh1g0VmYCDbzvRsK8R5q-atWaTLE3pygtcND-aks9UMEzO6kEe68ountKVgGxWZ4OSDE8HofgcBOg"},"/staeter/fillit/unstar":{"post":"HK-eMtiwNJuMoD8AXqUeWPCi4RbMd1Z8Bstu1B105u8PQuPON6_27AEU9XRJsjtXPylEXcs71tV2W2ctr7sang"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"0LL0eXQQ3LPw5IN3MB7JT_3XU7Stfez_8qcveuUkCt94F92w3MNbRgzthQlN3vqJZLd1lWNMRk8Pi-grynDBlA"}}},"title":"Repository search results"}