{"payload":{"header_redesign_enabled":false,"results":[{"id":"470254913","archived":false,"color":"#3572A5","followers":1,"has_funding_file":false,"hl_name":"youssef-el1/GCD-Poly-","hl_trunc_description":"calculate the GCD (Greatest Common Divisor) of two polynomials using the gmp library","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":470254913,"name":"GCD-Poly-","owner_id":81429819,"owner_login":"youssef-el1","updated_at":"2022-03-15T17:02:35.894Z","has_issues":true}},"sponsorable":false,"topics":["python","gmpy2"],"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":58,"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%253Ayoussef-el1%252FGCD-Poly-%2B%2Blanguage%253APython","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/youssef-el1/GCD-Poly-/star":{"post":"pBQLbY-8yieyYKFbFa36EljWrX1yZohW_Dh3ARbR8J9ZFwqu8_MwjaKy2dMy3iZBnMckA_CkJUDv3C9BY0eMAQ"},"/youssef-el1/GCD-Poly-/unstar":{"post":"onxmK00ZxCZwk4WWQRqNbn6XfJkZXVJ-iAQCrO-g4vgj-_hdqrG_y-q4Olan1RlsLXL2_6lQPDUNXmUHgszDKw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"CzS7H1U8oMBZ29GA5y7cWfAXDz2dyRld6XcRH-FXhG0Eomkbn2ecekYIwjJ2HoY5Toyk7vM6SOrTadtFbZJKcg"}}},"title":"Repository search results"}