Spring cleaning. [admin]

Author: trans

.index

@@ -0,0 +1,82 @@
+---
+revision: 2013
+type: ruby
+sources:
+- var
+authors:
+- name: Trans
+  email: transfire@gmail.com
+- name: K. Kodama
+- name: Ronald Butler
+- name: Olivier Renaud
+- name: Rick Bradley
+organizations:
+- name: Rubyworks
+requirements:
+- groups:
+  - build
+  development: true
+  name: detroit
+- groups:
+  - build
+  development: true
+  name: ergo
+- groups:
+  - test
+  development: true
+  name: rubytest
+- groups:
+  - test
+  development: true
+  name: rubytest-cli
+- groups:
+  - test
+  development: true
+  name: microtest
+- groups:
+  - test
+  development: true
+  name: ae
+conflicts: []
+alternatives: []
+resources:
+- type: home
+  uri: http://rubyworks.github.com/pqueue
+  label: Homepage
+- type: code
+  uri: http://github.com/rubyworks/pqueue
+  label: Source Code
+- type: mail
+  uri: http://groups.google.com/group/rubyworks-mailinglist
+  label: Mailing List
+- type: bugs
+  uri: http://github.com/rubyworks/pqueue/issues
+  label: Issue Tracker
+repositories:
+- name: upstream
+  scm: git
+  uri: git://github.com/rubyworks/pqueue.git
+categories: []
+copyrights:
+- holder: Rubyworks
+  year: '2009'
+- holder: K. Kodama
+  year: '2001'
+customs: []
+paths:
+  lib:
+  - lib
+created: '2001-03-10'
+summary: Queue of Prioritized Elements
+title: PQueue
+version: 2.0.2
+name: pqueue
+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.'
+date: '2013-03-10'

.ruby

@@ -1,10 +1,10 @@
 ---
-script: "bundle exec ruby-test test/test_*.rb"
+script: "bundle exec rubytest"
 rvm:
   - 1.8.7
-  - 1.9.2
   - 1.9.3
   - jruby
-  - ree
-  - rbx-2.0
+  - jruby-19mode
+  - rbx
+  - rbx-19mode
 

.travis.yml

@@ -25,13 +25,13 @@ vclog:
 tag:
   service: custom
   release: |
-    cmd = %[pom news | git tag -a -F - #{project.version}]
+    cmd = %[gemdo news | git tag -a -F - #{project.version}]
     puts cmd
     sh cmd
 
-#rubytest:
-#  path: test/*.rb
-#
+rubytest:
+  loadpath: lib
+  files: test/test_*.rb
 
 #qed:
 #  files: qed/

Assembly

@@ -1,6 +1,6 @@
-= CHANGE HISTORY
+# CHANGE HISTORY
 
-== 2.0.2 / 2011-10-29
+## 2.0.2 / 2011-10-29
 
 It's been one of those days. I went to to get a wash cloth for the shower,
 on my way through the kitchen realized the chilling cookie dough needed to
@@ -16,7 +16,7 @@ Changes:
 * Fixed #reheap search algorithm.
 
 
-== 2.0.1 / 2011-10-29
+## 2.0.1 / 2011-10-29
 
 Quick fix to remove old legacy library that was supposed to be 
 removed in previous release. No big deal, it just confused the 
@@ -27,7 +27,7 @@ Changes:
 * Remove legacy version of library.
 
 
-== 2.0.0 / 2011-10-29
+## 2.0.0 / 2011-10-29
 
 This is a complete rewrite to simplify the design and use more
 of Ruby's internal methods.  Overall performance should be markedly
@@ -44,7 +44,7 @@ Changes:
 * Switch to BSD-2-Clause license.
 
 
-== 1.0.0 / 2009-07-05
+## 1.0.0 / 2009-07-05
 
 This is the initial standalone release of PQueue, spun-off from the
 Ruby Facets and originally written by K. Komada.

COPYING.rdoc

@@ -0,0 +1,23 @@
+(BSD-2-Clause License)
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+   1. Redistributions of source code must retain the above copyright notice,
+      this list of conditions and the following disclaimer.
+
+   2. Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
+INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
+INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR  SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
+OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+

HISTORY.rdoc HISTORY.mdHISTORY.rdoc renamed to HISTORY.md

@@ -0,0 +1,66 @@
+# 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) ·
+[API](http://rubydoc.info/gems/pqueue) ·
+[User Guide](http://wiki.github.com/rubyworks/pqueue) ·
+[Report Issue](http://github.com/rubyworks/pqueue/issues) ·
+[Source Code](http://github.com/rubyworks/pqueue)
+
+
+## DESCRIPTION
+
+Priority queue with array based heap.
+
+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. Also, retrieving an element
+from the queue will always return the one with the highest priority
+(see #pop and #top).
+
+The default is to compare the elements in respect to their #<=> method.
+For example, Numeric elements with higher values will have higher
+priorities.
+
+This library is  a rewrite of the original PQueue.rb by K. Kodama and
+Heap.rb by Ronald Butler. The two libraries were later merged
+and generally improved by Olivier Renaud. Then the whole library 
+rewritten by Trans using the original as a functional reference.
+
+
+## USAGE
+
+Usage is simple enough. Think of it as an array that takes a block, where
+the block decides which element of the array goes first.
+
+    require 'pqueue'
+
+    pq = PQueue.new([2,3,1]){ |a,b| a > b }
+
+    pq.pop  #=> 3
+
+
+## ACKNOWLEDGMENTS
+
+Although the library has been completely rewritten since, we still would
+like to acknowledge the efforts of the original PQueue authors and
+contributors.
+
+* Olivier Renaud (2007)
+* Rick Bradley (2003)
+* Ronald Butler (2002)
+* K Kodama (2001, original library)
+
+
+## COPYRIGHTS
+
+Copyright (c) 2011 Rubyworks
+
+PQueue is distributable in accordance with the *BSD-2-Clause* license.
+
+PQueue is based on the original PQueue library (c) 2001 by K. Kodama.
+
+See the LICENSE.txt file for details.