priority-queue

Version, currently 1.1.04 versions

github.com/spider-gazelle/priority-queue

Priority Queue and Heap implementation for Crystal Lang

12 stars
7 dependents
License: MIT

Nothing has been indexed for 1.1.0 yet. The tag is recorded, its shard.yml has not been read, so the manifest and dependency list below are empty because they are unknown rather than because they are absent.

Installation

# Add this to your shard.yml
dependencies:
  priority-queue:
    github: spider-gazelle/priority-queue
    version: ~> 1.1.0

Then run:

shards install

shard.yml

No shard.yml has been indexed for 1.1.0. You can read it on the repository.

Dependencies

Unknown: the shard.yml for this version has not been read yet.

README

This README is the one indexed from the repository at its latest ref, not from the tag for this version.

Crystal Lang Priority Queue

CI

Usage

Simple priority queue.

  • Higher numbers pop first
  • lower numbers shift first
  • always insert using push or << to maintain validity

require 'priority-queue'

queue = Priority::Queue(String).new
queue.push 10, "Insert 1"
queue.push 20, "Insert 2"

queue.pop.value # => "Insert 2"
queue.pop.value # => "Insert 1"

A named priority queue where newer items with the same name replace existing items. The highest of the two priorities is inherited by the new item.


require 'priority-queue'

queue = Priority::NamedQueue(String).new
queue.push 20, "Insert 1", :named
queue.push 20, "Insert 2"
queue.push 10, "Insert 3", :named

queue.size # => 2

queue.pop.value # => "Insert 3"
queue.pop.value # => "Insert 2"