pqueue 2.1.0 → 2.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: 58541f0cdd4e79a637522d1d78794428c6ea6510
-  data.tar.gz: 7834f9997de1480be4d11bef6c9e4ad08d547644
+SHA256:
+  metadata.gz: 0d3ed13a1b45054455659acee6c9a05786157865b1610db98d338927aeace490
+  data.tar.gz: 0603f00d6aba6c57ee1c75c213d4b04de3355395216cfab491c4fc09ee345eb0
 SHA512:
-  metadata.gz: 85926b70318b7a6b3b0a5f5fbcad2ee4ef667435db897151618bcf645c5bb219ad6a5b1503c6a2871abed96f44e951a0a275c1575bcea4c641ee5323c0a0672d
-  data.tar.gz: 4dfb6c6d2e0413f6c636e6d54a4cc56216994795cd6d2fe83d07b0f01527a2ec880a82927ec44ac0bfd01babc36e41ea3a2733d8e56bfc944f9a53e4fc31eb3e
+  metadata.gz: 5d8c1d9a2998eeb423900368732929e0d240b38110c604ac7d35a8a2eef5343be91779d5ee7f9d58e717ebc71275cc589f154fc283db3a3f3ae4834ab9573c79
+  data.tar.gz: d88c2111f3c981ba576670baab6b85ca93d98dfee8ec9854a29215a42d2bc3eb3a9ec6834e118db96af48803b0b8d38f1b676d944b97e09e5e0eaaab8cbcbdaa

data/History.md

@@ -1,5 +1,19 @@
 # CHANGE HISTORY
 
+## 2.2.0 / 2026-04-02
+
+Maintenance release. Modernized project tooling.
+
+Changes:
+
+* Replace custom Indexer system with standard gemspec.
+* Replace Travis CI with GitHub Actions.
+* Add Rakefile.
+* Switch tests to minitest.
+* Update URLs to HTTPS.
+* Clean up obsolete files and .gitignore.
+
+
 ## 2.1.0 / 2014-03-03
 
 Ostatnicky has found a bug! As it turns out both `#deq` and `#shift` were 

data/README.md

@@ -1,13 +1,10 @@
 # PQueue
 
-[![Gem Version](https://badge.fury.io/rb/pqueue.png)](http://badge.fury.io/rb/pqueue)
-[![Build Status](https://secure.travis-ci.org/rubyworks/pqueue.png)](http://travis-ci.org/rubyworks/pqueue)    
-[![Flattr Me](http://api.flattr.com/button/flattr-badge-large.png)](http://flattr.com/thing/324911/Rubyworks-Ruby-Development-Fund)
-
-[Website](http://rubyworks.github.com/pqueue) ·
-[YARD API](http://rubydoc.info/gems/pqueue) ·
-[Report Issue](http://github.com/rubyworks/pqueue/issues) ·
-[Source Code](http://github.com/rubyworks/pqueue)
+[Source Code](https://github.com/rubyworks/pqueue) |
+[Report Issue](https://github.com/rubyworks/pqueue/issues)
+
+[![Gem Version](https://img.shields.io/gem/v/pqueue.svg?style=flat)](https://rubygems.org/gems/pqueue)
+[![Build Status](https://github.com/rubyworks/pqueue/actions/workflows/test.yml/badge.svg)](https://github.com/rubyworks/pqueue/actions/workflows/test.yml)
 
 
 ## About

data/lib/pqueue.rb

@@ -18,7 +18,7 @@
 class PQueue
 
   #
-  VERSION = "2.1.0"  #:erb: VERSION = "<%= version %>"
+  VERSION = "2.2.0"
 
   #
   # Returns a new priority queue.

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: pqueue
 version: !ruby/object:Gem::Version
-  version: 2.1.0
+  version: 2.2.0
 platform: ruby
 authors:
 - Trans
@@ -9,141 +9,71 @@ authors:
 - Ronald Butler
 - Olivier Renaud
 - Rick Bradley
-autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-03-03 00:00:00.000000000 Z
+date: 1980-01-02 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
-  name: microtest
+  name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
+        version: '13'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
+        version: '13'
 - !ruby/object:Gem::Dependency
-  name: ae
+  name: minitest
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
+        version: '5'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
-- !ruby/object:Gem::Dependency
-  name: rubytest
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - '>='
-      - !ruby/object:Gem::Version
-        version: '0'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - '>='
-      - !ruby/object:Gem::Version
-        version: '0'
-- !ruby/object:Gem::Dependency
-  name: rubytest-cli
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - '>='
-      - !ruby/object:Gem::Version
-        version: '0'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - '>='
-      - !ruby/object:Gem::Version
-        version: '0'
-- !ruby/object:Gem::Dependency
-  name: indexer
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - '>='
-      - !ruby/object:Gem::Version
-        version: '0'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - '>='
-      - !ruby/object:Gem::Version
-        version: '0'
-- !ruby/object:Gem::Dependency
-  name: mast
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - '>='
-      - !ruby/object:Gem::Version
-        version: '0'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - '>='
-      - !ruby/object:Gem::Version
-        version: '0'
+        version: '5'
 description: A priority queue is like a standard queue, except that each inserted
-  elements is given a certain priority, based on the result of the comparison block
+  element is given a certain priority, based on the result of the comparison block
   given at instantiation time. Retrieving an element from the queue will always return
   the one with the highest priority.
 email:
 - transfire@gmail.com
 executables: []
 extensions: []
-extra_rdoc_files:
-- License.txt
-- README.md
-- History.md
-- Contributing.md
+extra_rdoc_files: []
 files:
-- lib/pqueue.rb
-- test/test_pqueue.rb
+- History.md
 - License.txt
-- Gemfile.lock
-- Index.yml
 - README.md
-- History.md
-- Contributing.md
-homepage: http://rubyworks.github.com/pqueue
+- lib/pqueue.rb
+homepage: https://github.com/rubyworks/pqueue
 licenses:
-- BSD-2
+- BSD-2-Clause
 metadata: {}
-post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
-      version: '0'
+      version: '3.1'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.0.3
-signing_key: 
+rubygems_version: 3.6.9
 specification_version: 4
 summary: Queue of Prioritized Elements
-test_files:
-- test/test_pqueue.rb
-has_rdoc: 
+test_files: []

data/Contributing.md

@@ -1,63 +0,0 @@
-# CONTRIBUTING
-
-## Setup
-
-Once you've cloned the repo, hit up Bundler.
-
-```
-$ bundle
-```
-
-## Testing
-
-We are using the Microtest framework which is a very simple test
-framework built to mimic the original Test::Unit but build on
-Ruby Test, the slick meta-testing framework.
-
-Thanks to the configuration in `etc/test.rb` running test should
-be as simple as:
-
-```
-$ rubytest
-```
-
-## Releasing
-
-When releasing a new version there a few things that need to done.
-First, of course, make sure the version number is correct by editing
-the `Index.yml` file. Then update the canonical `.index` file via:
-
-```
-$ index -u Index.yml Gemfile
-```
-
-Also, don't forget to add an entry to the `HISTORY.md` file for the
-new release.
-
-Though it is not likely to be needed for this project, ensure the MANIFEST
-is up to date:
-
-```
-$ mast -u
-```
-
-Now build the gem:
-
-```
-$ gem build .gemspec
-```
-
-To release simply use:
-
-```
-$ gem push pqueue-x.x.x.gem
-```
-
-Finally, don't forget to add a tag for the release. I always use the
-description of the release from the HISTORY file as the tag message
-(excluding the changes list).
-
-```
-$ gem tag -a x.x.x
-```
-

data/Gemfile.lock

@@ -1,24 +0,0 @@
-GEM
-  remote: https://rubygems.org/
-  specs:
-    ae (1.8.2)
-      ansi
-    ansi (1.4.3)
-    indexer (0.3.1)
-    microtest (0.2.1)
-      rubytest
-    rubytest (0.7.0)
-      ansi
-    rubytest-cli (0.1.0)
-      ansi
-      rubytest (>= 0.7.0)
-
-PLATFORMS
-  ruby
-
-DEPENDENCIES
-  ae
-  indexer
-  microtest
-  rubytest
-  rubytest-cli

data/Index.yml

@@ -1,44 +0,0 @@
----
-name:
-  pqueue
-
-version:
-  2.1.0
-
-title:
-  PQueue
-
-summary:
-  Queue of Prioritized Elements
-
-description:
-  A priority queue is like a standard queue, except that each inserted elements
-  is given a certain priority, based on the result of the comparison block given
-  at instantiation time. Retrieving an element from the queue will always return
-  the one with the highest priority.
-
-resources:
-  home: http://rubyworks.github.com/pqueue
-  code: http://github.com/rubyworks/pqueue
-  bugs: http://github.com/rubyworks/pqueue/issues
-
-repositories:
-  upstream: git://github.com/rubyworks/pqueue.git
-
-authors:
-  - Trans <transfire@gmail.com>
-  - K. Kodama
-  - Ronald Butler
-  - Olivier Renaud
-  - Rick Bradley
-
-organization:
-  Rubyworks
-
-created:
-  2001-03-10
-
-copyrights:
-  - (c) 2009 Rubyworks (BSD-2)
-  - (c) 2001 K. Kodama
-

data/test/test_pqueue.rb

@@ -1,178 +0,0 @@
-require 'microtest'
-require 'ae'
-require 'ae/legacy'
-
-require 'pqueue'
-
-class PQueueTest < MicroTest::TestCase
-  include AE::Legacy::Assertions
-
-  ARY_TEST   = [2,6,1,3,8,15,0,-4,7,8,10]
-  ARY_TEST_2 = [25,10,5,13,16,9,16,12]
-
-  def test_initialize_empty
-    PQueue.new
-  end
-
-  def test_initialize_single_element
-    PQueue.new([3])
-  end
-
-  def test_initialize_multiple_elements
-    PQueue.new(ARY_TEST)
-  end
-
-  def test_initialize_with_custom_comparison
-    PQueue.new {|a,b| b<=>a}
-    PQueue.new([3]) {|a,b| b<=>a}
-    PQueue.new(ARY_TEST) {|a,b| b<=>a}
-  end
-
-  def test_top
-    assert_equal(ARY_TEST.max, PQueue.new(ARY_TEST).top)
-    assert_nil(PQueue.new.top)
-  end
-
-  def test_pop
-    sorted_ary = ARY_TEST.sort
-    q = PQueue.new(ARY_TEST)
-    ARY_TEST.size.times do
-      assert_equal(sorted_ary.pop, q.pop)
-    end
-    assert_equal(0, q.size)
-    assert_nil(PQueue.new.pop)
-  end
-
-  def test_insertion
-    q = PQueue.new(ARY_TEST)
-    assert_equal(ARY_TEST.size, q.size)
-
-    ret = q.push(24)
-    assert_equal(q, ret)
-    assert_equal(ARY_TEST.size+1, q.size)
-  end
-
-  def test_concat
-    q = PQueue.new(ARY_TEST)
-
-    ret = q.concat(ARY_TEST_2)
-    assert_equal(q, ret)
-    assert_equal(ARY_TEST.size+ARY_TEST_2.size, q.size)
-
-    q = PQueue.new(ARY_TEST)
-    r = PQueue.new(ARY_TEST_2)
-    q.concat(r)
-    assert_equal(ARY_TEST.size + ARY_TEST_2.size, q.size)
-  end
-
-  def test_clear
-    q = PQueue.new(ARY_TEST).clear
-    assert_equal(q, q.clear)
-    assert_equal(0, q.size)
-  end
-
-  def test_replace
-    q = PQueue.new(ARY_TEST)
-    q.replace(ARY_TEST_2)
-    assert_equal(ARY_TEST_2.size, q.size)
-
-    q = PQueue.new(ARY_TEST)
-    q.replace(PQueue.new(ARY_TEST_2))
-    assert_equal(ARY_TEST_2.size, q.size)
-  end
-
-  def test_inspect
-    assert_equal("<PQueue: size=#{ARY_TEST.size}, top=#{ARY_TEST.max}>",
-                 PQueue.new(ARY_TEST).inspect)
-  end
-
-  def test_to_a
-    q = PQueue.new(ARY_TEST)
-    assert_equal(ARY_TEST.sort, q.to_a)
-    q = PQueue.new(0..4)
-    assert_equal([0,1,2,3,4], q.to_a)
-  end
-
-  def pop_array
-    q = PQueue.new(ARY_TEST)
-    assert_equal(ARY_TEST.sort.reverse[0..5], q.pop_array(5))
-    q = PQueue.new(ARY_TEST)
-    assert_equal(ARY_TEST.sort.reverse, q.pop_array)
-  end
-
-  def test_include
-    q = PQueue.new(ARY_TEST + [21] + ARY_TEST_2)
-    assert_equal(true, q.include?(21))
-
-    q = PQueue.new(ARY_TEST - [15])
-    assert_equal(false, q.include?(15))
-  end
-
-  def test_equal
-    assert_equal(PQueue.new, PQueue.new)
-    assert_equal(PQueue.new(ARY_TEST), PQueue.new(ARY_TEST.sort_by{rand}))
-  end
-
-  def test_swap
-    q = PQueue.new
-    assert_nil(q.swap(6))
-    assert_equal(6, q.top)
-
-    q = PQueue.new(ARY_TEST)
-    h = PQueue.new(ARY_TEST)
-    q.pop; q.push(11)
-    h.swap(11)
-    assert_equal(q, h)
-  end
-
-  def test_dup
-    q = PQueue.new(ARY_TEST)
-    assert_equal(q, q.dup)
-  end
-
-  def test_array_copied
-    ary = ARY_TEST.dup
-    q = PQueue.new(ary)
-    q.pop
-    assert_equal(ARY_TEST, ary)
-
-    ary = ARY_TEST.dup
-    q = PQueue.new
-    q.replace(ary)
-    q.pop
-    assert_equal(ARY_TEST, ary)
-
-    ary = ARY_TEST.dup
-    q = PQueue.new([1])
-    q.concat(ary)
-    q.pop
-    assert_equal(ARY_TEST, ary)
-
-    q = PQueue.new(ARY_TEST)
-    r = q.dup
-    q.pop
-    assert_not_equal(q, r)
-  end
-
-  def test_reheap
-    q = PQueue.new([2,4,5])
-    q << 6
-    q.to_a.assert == [2,4,5,6]
-    q << 1
-    q.to_a.assert == [1,2,4,5,6]
-    q << 3
-    q.to_a.assert == [1,2,3,4,5,6]
-
-    q = PQueue.new([100,5,25])
-    q.to_a.assert == [5,25,100]
-    q << 17
-    q.to_a.assert == [5,17,25,100]
-    q << 0
-    q.to_a.assert == [0,5,17,25,100]
-    q << -5
-    q.to_a.assert == [-5,0,5,17,25,100]
-    q << 100
-    q.to_a.assert == [-5,0,5,17,25,100,100]
-  end
-
-end