{"id":21426568,"url":"https://github.com/sanjid133/go-collections","last_synced_at":"2026-04-16T22:30:58.524Z","repository":{"id":65788671,"uuid":"599662225","full_name":"sanjid133/go-collections","owner":"sanjid133","description":"Implement data structure using golang generics","archived":false,"fork":false,"pushed_at":"2023-02-09T16:21:35.000Z","size":3,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-23T08:18:11.634Z","etag":null,"topics":["data-structures","golang"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sanjid133.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-02-09T16:06:43.000Z","updated_at":"2023-02-10T13:09:47.000Z","dependencies_parsed_at":null,"dependency_job_id":"0e58eb74-1ede-4245-b211-95393fbc0723","html_url":"https://github.com/sanjid133/go-collections","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/sanjid133/go-collections","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sanjid133%2Fgo-collections","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sanjid133%2Fgo-collections/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sanjid133%2Fgo-collections/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sanjid133%2Fgo-collections/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sanjid133","download_url":"https://codeload.github.com/sanjid133/go-collections/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sanjid133%2Fgo-collections/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31907424,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-16T18:22:33.417Z","status":"ssl_error","status_checked_at":"2026-04-16T18:21:47.142Z","response_time":69,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["data-structures","golang"],"created_at":"2024-11-22T21:42:44.536Z","updated_at":"2026-04-16T22:30:58.501Z","avatar_url":"https://github.com/sanjid133.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Implement following data structure using golang generics\n    - stack\n    - queue\n    - set\n\n\n### Stack\nA stack is a data structure that follows the LIFO (last in, first out) principle.\n\nImplemented methods are:\n- Push : add an element to the top of the stack\n- Pop : remove the top element from the stack\n- Top : return the top element of the stack\n- IsEmpty : return true if the stack is empty, false otherwise\n- Len : return the number of elements in the stack\n\n### Queue\nA queue is a data structure that follows the FIFO (first in, first out) principle.\n\nImplemented methods are:\n- Push : add an element to the back of the queue\n- Pop : remove the front element from the queue\n- Front : return the front element of the queue\n- Back : return the back element of the queue\n- IsEmpty : return true if the queue is empty, false otherwise\n- Len : return the number of elements in the queue\n\n### Set\nA set is a data structure that contains a collection of unique elements.\n\nImplemented methods are:\n- Insert : add an element to the set\n- Remove : remove an element from the set\n- Contains : return true if the element is in the set, false otherwise\n- IsEmpty : return true if the set is empty, false otherwise\n- Len : return the number of elements in the set\n\n## Installation\nTo install the package, run the following command:\n```\ngo get github.com/sanjid133/go-collections\n```\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsanjid133%2Fgo-collections","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsanjid133%2Fgo-collections","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsanjid133%2Fgo-collections/lists"}