{"payload":{"header_redesign_enabled":false,"results":[{"id":"698722310","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"nol0n/segment_intersection","hl_trunc_description":"A B-Tree implementation of sweep line algorithm for segment intersection","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":698722310,"name":"segment_intersection","owner_id":9783964,"owner_login":"nol0n","updated_at":"2024-06-27T17:54:49.188Z","has_issues":true}},"sponsorable":false,"topics":["template","b-tree","sweep-line","2-3-tree","sweep-line-algorithm","segment-intersection"],"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":82,"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%253Anol0n%252Fsegment_intersection%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/nol0n/segment_intersection/star":{"post":"jIxurjMQHaY7xUTBwmoJrMMtFOSi9jrsgXGs5GWHOzN5pG-tyHL95X4cGAjchxpVL2KoZUtH9_IymwpZJagN2A"},"/nol0n/segment_intersection/unstar":{"post":"97UmV85VQlULKWcwTN99Hc6GFoZkG0eec30O72axRBWS52tkbk0A9qc7lR_Fp-jztw4vxAmK_cu88S8AM0aLkw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"GqalJRdmOzq-pD_ttJV33zkTQH6ePfLXn4kCOf6TkDrZEkTNhRKYKyTG3DAA8o0FKbXPD8RcF1eWi4M3XAtl6w"}}},"title":"Repository search results"}