{"payload":{"header_redesign_enabled":false,"results":[{"id":"5172627","archived":false,"color":"#5e5086","followers":16,"has_funding_file":false,"hl_name":"diagrams/dual-tree","hl_trunc_description":"Rose (n-way) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations.","language":"Haskell","mirror":false,"owned_by_organization":true,"public":true,"repo":{"repository":{"id":5172627,"name":"dual-tree","owner_id":2036567,"owner_login":"diagrams","updated_at":"2023-11-04T11:46:37.325Z","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":363,"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%253Adiagrams%252Fdual-tree%2B%2Blanguage%253AHaskell","metadata":null,"csrf_tokens":{"/diagrams/dual-tree/star":{"post":"MkFJM7pN0ZXCEA7ellbtBDx2kWDMH6__UOGkegTnnz3_SFaT_Ste_yEicpMpXDfQI-OHmeaDC1cByptXVlZXaw"},"/diagrams/dual-tree/unstar":{"post":"1i7iw0FMVJtq69lByE-zVd6fzH3wDzD_PxrMywlUk9TU1a7BAnGZx4FYIdnPwOcuxaQiqRfpyqqZirEYCxyP_Q"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"J9ZT8ByXMjiLj9VzOEyIPmn-LIv49U0YTD9Y271TqgZXkJIRYdbNvqizlxeZAnEABtAeLcENAlIFegoWLG_6Yg"}}},"title":"Repository search results"}