{"payload":{"header_redesign_enabled":false,"results":[{"id":"240536719","archived":false,"color":"#3178c6","followers":2,"has_funding_file":false,"hl_name":"japan-d2/js-gcd","hl_trunc_description":"Compute the greatest common divisor using Euclid's algorithm.","language":"TypeScript","mirror":false,"owned_by_organization":true,"public":true,"repo":{"repository":{"id":240536719,"name":"js-gcd","owner_id":38412596,"owner_login":"japan-d2","updated_at":"2021-07-16T01:36:27.195Z","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":74,"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%253Ajapan-d2%252Fjs-gcd%2B%2Blanguage%253ATypeScript","metadata":null,"csrf_tokens":{"/japan-d2/js-gcd/star":{"post":"gwPx82rAUypuk_-EIMjR1q57IB2M9Qtgc3vsBOkS09wPtAN661NALw45PwgITelTygdfBUgCE-KdEm9hZpOz3w"},"/japan-d2/js-gcd/unstar":{"post":"enogpiyggw7gDdn1BVEndiXuCphDpre3PbxrfUsxn-FnP1sl3LGn-EF-8DalBl8bnuylS4U7ynR2Lk6EHg3_fQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"FOTVHVt1xdil3_2hrkZ9k2ioH_AHvi95rKQYMjHFM-kyZ3xOxfe94EyV3jXEhWoufY-ai3rCVPZSmZXw_FlIHA"}}},"title":"Repository search results"}