{"id":13724218,"url":"https://github.com/golang-collections/collections","last_synced_at":"2025-05-07T17:33:47.792Z","repository":{"id":24260808,"uuid":"27654673","full_name":"golang-collections/collections","owner":"golang-collections","description":null,"archived":false,"fork":true,"pushed_at":"2022-08-14T21:01:16.000Z","size":120,"stargazers_count":231,"open_issues_count":5,"forks_count":54,"subscribers_count":8,"default_branch":"master","last_synced_at":"2024-11-14T13:37:45.955Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Go","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":"badgerodon/collections","license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/golang-collections.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}},"created_at":"2014-12-07T00:49:41.000Z","updated_at":"2024-10-27T15:06:30.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/golang-collections/collections","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/golang-collections%2Fcollections","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/golang-collections%2Fcollections/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/golang-collections%2Fcollections/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/golang-collections%2Fcollections/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/golang-collections","download_url":"https://codeload.github.com/golang-collections/collections/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252926758,"owners_count":21826361,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":[],"created_at":"2024-08-03T01:01:52.210Z","updated_at":"2025-05-07T17:33:47.782Z","avatar_url":"https://github.com/golang-collections.png","language":"Go","funding_links":[],"categories":["Go"],"sub_categories":[],"readme":"# Badgerodon Collections\r\n\r\nMaps and slices go a long way in Go, but sometimes you need more. This is a collection of collections that may be useful.\r\n\r\n## Queue\r\nA [queue](http://en.wikipedia.org/wiki/Queue_(data_structure%29) is a first-in first-out data structure.\r\n\r\n## Set\r\nA [set](http://en.wikipedia.org/wiki/Set_(computer_science%29) is an unordered collection of unique values typically used for testing membership.\r\n\r\n## Skip list\r\nA [skip list](http://en.wikipedia.org/wiki/Skip_list) is a data structure that stores nodes in a hierarchy of linked lists. It gives performance similar to binary search trees by using a random number of forward links to skip parts of the list.\r\n\r\n## Splay Tree\r\n\r\nA [splay tree](http://en.wikipedia.org/wiki/Splay_tree) is a type of binary search tree where every access to the tree results in the tree being rearranged so that the current node gets put on top.\r\n\r\n## Stack\r\nA [stack](http://en.wikipedia.org/wiki/Stack_(abstract_data_type%29) is a last-in last-out data structure.\r\n\r\n## Trie\r\nA [trie](http://en.wikipedia.org/wiki/Trie) is a type of tree where each node represents one byte of a key.\r\n\r\n## Ternary Search Tree\r\n\r\nA [ternary search tree](http://en.wikipedia.org/wiki/Ternary_search_tree) is similar to a trie in that nodes store the letters of the key, but instead of either using a list or hash at each node a binary tree is used. Ternary search trees have the performance benefits of a trie without the usual memory costs.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgolang-collections%2Fcollections","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgolang-collections%2Fcollections","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgolang-collections%2Fcollections/lists"}