{"id":18110461,"url":"https://github.com/strd6/priority_queue","last_synced_at":"2025-04-14T00:43:49.933Z","repository":{"id":586755,"uuid":"220605","full_name":"STRd6/priority_queue","owner":"STRd6","description":"A JavaScript PriorityQueue","archived":false,"fork":false,"pushed_at":"2017-11-12T03:34:27.000Z","size":59,"stargazers_count":29,"open_issues_count":0,"forks_count":12,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-04-13T02:42:07.515Z","etag":null,"topics":["coffeescript","priority-queue"],"latest_commit_sha":null,"homepage":"","language":"CoffeeScript","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/STRd6.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}},"created_at":"2009-06-07T01:59:36.000Z","updated_at":"2023-01-13T18:06:00.000Z","dependencies_parsed_at":"2022-07-07T18:02:13.655Z","dependency_job_id":null,"html_url":"https://github.com/STRd6/priority_queue","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/STRd6%2Fpriority_queue","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/STRd6%2Fpriority_queue/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/STRd6%2Fpriority_queue/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/STRd6%2Fpriority_queue/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/STRd6","download_url":"https://codeload.github.com/STRd6/priority_queue/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248804721,"owners_count":21164127,"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":["coffeescript","priority-queue"],"created_at":"2024-11-01T00:09:30.541Z","updated_at":"2025-04-14T00:43:49.907Z","avatar_url":"https://github.com/STRd6.png","language":"CoffeeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"Description\n-----------\n\nA priority queue is a handy data structure with many uses. From graph search\nalgorithms to simple job queues, having this in your toolbelt will help to give\nyou a solid foundation.\n\nFeatures\n--------\n\n* Simple to use and understand.\n* Creates a single PriorityQueue constructor.\n* Instantiate via `PriorityQueue()` or `new PriorityQueue()`\n* Offers both highest first and lowest first ordering.\n* Test suite included.\n\nThe default is highest priority first, but when doing something like A* you want lowest priority first... it handles it: `queue = PriorityQueue({low: true});` Boom!\n\nExample Usage\n-------------\n\n    # Highest priority first\n    queue = PriorityQueue()\n\n    queue.push(\"b\", 5)\n    queue.push(\"a\", 10)\n\n    queue.pop() # =\u003e \"a\"\n    queue.pop() # =\u003e \"b\"\n\n    # Lowest priority first\n    queue = PriorityQueue\n      low: true\n\n    queue.push(\"x\", 5)\n    queue.push(\"y\", 10)\n\n    queue.pop() # =\u003e \"x\"\n    queue.pop() # =\u003e \"y\"\n\nLicense\n-------\n\nMIT\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstrd6%2Fpriority_queue","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fstrd6%2Fpriority_queue","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstrd6%2Fpriority_queue/lists"}