{"id":41783763,"url":"https://github.com/anjulapaulus/tinyqueue","last_synced_at":"2026-01-25T04:07:22.936Z","repository":{"id":114770786,"uuid":"254700165","full_name":"anjulapaulus/tinyqueue","owner":"anjulapaulus","description":"A simple and smallest binary heap priority queue in golang","archived":false,"fork":false,"pushed_at":"2020-04-17T19:16:46.000Z","size":10,"stargazers_count":1,"open_issues_count":1,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-06-20T03:38:33.775Z","etag":null,"topics":["algorithm","binary-heap","datastructure","go","golang","priority-queue"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/anjulapaulus.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2020-04-10T17:53:23.000Z","updated_at":"2023-03-05T07:12:07.000Z","dependencies_parsed_at":null,"dependency_job_id":"48df0c40-123b-4d31-a912-8f82ec9e0054","html_url":"https://github.com/anjulapaulus/tinyqueue","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/anjulapaulus/tinyqueue","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anjulapaulus%2Ftinyqueue","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anjulapaulus%2Ftinyqueue/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anjulapaulus%2Ftinyqueue/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anjulapaulus%2Ftinyqueue/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anjulapaulus","download_url":"https://codeload.github.com/anjulapaulus/tinyqueue/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anjulapaulus%2Ftinyqueue/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28742983,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-25T02:46:29.005Z","status":"ssl_error","status_checked_at":"2026-01-25T02:44:29.968Z","response_time":113,"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":["algorithm","binary-heap","datastructure","go","golang","priority-queue"],"created_at":"2026-01-25T04:07:22.866Z","updated_at":"2026-01-25T04:07:22.920Z","avatar_url":"https://github.com/anjulapaulus.png","language":"Go","readme":"[![Build Status](https://travis-ci.com/anjulapaulus/tinyqueue.svg?branch=master)](https://travis-ci.com/anjulapaulus/tinyqueue)\n[![codecov](https://codecov.io/gh/anjulapaulus/tinyqueue/branch/master/graph/badge.svg)](https://codecov.io/gh/anjulapaulus/config)\n[![HitCount](http://hits.dwyl.com/anjulapaulus/tinyqueue.svg)](http://hits.dwyl.com/anjulapaulus/tinyqueue)\n# tinyqueue\n\nA simple and smallest binary heap priority queue in golang.\n\n\n#### Installation\n````\ngo get -u github.com/anjulapaulus/tinyqueue\n````\n\n\n#### Acknowledgement\nThe current implementation is inspired on the javascript library [tinyqueue](https://github.com/mourner/tinyqueue) by Vladimir Agafonkin.\n\n#### Implementation\n\n````\npackage main\n\nimport queue \"github.com/anjulapaulus/tinyqueue\"\n\ntype Val int64\n\nfunc (a Val) Compare (b queue.Item) bool{\n\treturn a \u003c= b.(Val)\n}\n\nfunc main(){\n\tq:= queue.Queue{}   //Initialize Queue\n\n\tq.Push(Val(2))      //Insert Items to queue\n\tq.Push(Val(5))\n\tq.Push(Val(10))\n\n\tarray := q.All()    //returns array of elemeents in queue\n\n\tq.Peek()    //returns the top item without removal\n\n\tq.Len()     //length of queue\n\n\tq.Pop()     //removes the top item and displays\n}\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanjulapaulus%2Ftinyqueue","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanjulapaulus%2Ftinyqueue","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanjulapaulus%2Ftinyqueue/lists"}