rubysl-tsort 1.0.0 → 2.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: dbef2bc585a86be57ed019dab0b8bb3fefbcc9ef
-  data.tar.gz: 53b88f63caead7e17da6a47ca37aedc51ee30adc
+  metadata.gz: 15567ecf63300d8393e8f0ef5fba571654f92a49
+  data.tar.gz: 084e6fb807ae8703dc7b8116a500e743a5406677
 SHA512:
-  metadata.gz: 86f2e9798814f5dba80e550ea1046625fc7c226547607d7526b16155f81a5b4263fe27b207f147b54e127d8d43db25efd0f89bbc1c61c0fd1066c2c510c33140
-  data.tar.gz: a6d219f33ada7967cbf66cc63aecd9ce7980345a3ef106ed1d42ec158310a1e0c1c297adbbfb2fee41f54aa405ac6e475438bcd5c8c479a875e861cd7b391af5
+  metadata.gz: 833370c8f10c03e3c7b26ca0904697cd1233d7903d9c5435c05137a9df95d7bd4463f93d4fa93c08147d55c7c5caf049133d56a96b02b6f05b4c39b64539d43a
+  data.tar.gz: b451e41b372266d1b8660eba5dd759919d9105e2d601aa6cdad87ecad60a2f11d5c129e12534442b048cc2083d534165f655aff586dfddef7803d081e456902c

data/.travis.yml

@@ -1,7 +1,6 @@
 language: ruby
 env:
   - RUBYLIB=lib
-script: bundle exec mspec
+script: bundle exec mspec spec
 rvm:
-  - 1.8.7
-  - rbx-nightly-18mode
+  - rbx-nightly-19mode

data/lib/rubysl/tsort/tsort.rb

@@ -1,4 +1,3 @@
-#!/usr/bin/env ruby
 #--
 # tsort.rb - provides a module for topological sorting and strongly connected components.
 #++
@@ -32,7 +31,7 @@
 # array using the user-supplied block.
 #
 #   require 'tsort'
-#   
+#
 #   class Hash
 #     include TSort
 #     alias tsort_each_node each_key
@@ -40,10 +39,10 @@
 #       fetch(node).each(&block)
 #     end
 #   end
-#   
+#
 #   {1=>[2, 3], 2=>[3], 3=>[], 4=>[]}.tsort
 #   #=> [3, 2, 1, 4]
-#   
+#
 #   {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}.strongly_connected_components
 #   #=> [[4], [2, 3], [1]]
 #
@@ -52,19 +51,19 @@
 # A very simple `make' like tool can be implemented as follows:
 #
 #   require 'tsort'
-#   
+#
 #   class Make
 #     def initialize
 #       @dep = {}
 #       @dep.default = []
 #     end
-#     
+#
 #     def rule(outputs, inputs=[], &block)
 #       triple = [outputs, inputs, block]
 #       outputs.each {|f| @dep[f] = [triple]}
 #       @dep[triple] = inputs
 #     end
-#     
+#
 #     def build(target)
 #       each_strongly_connected_component_from(target) {|ns|
 #         if ns.length != 1
@@ -88,18 +87,18 @@
 #         end
 #       }
 #     end
-#     
+#
 #     def tsort_each_child(node, &block)
 #       @dep[node].each(&block)
 #     end
 #     include TSort
 #   end
-#   
+#
 #   def command(arg)
 #     print arg, "\n"
 #     system arg
 #   end
-#   
+#
 #   m = Make.new
 #   m.rule(%w[t1]) { command 'date > t1' }
 #   m.rule(%w[t2]) { command 'date > t2' }
@@ -189,7 +188,7 @@ module TSort
   end
 
   #
-  # Iterates over strongly connected component in the subgraph reachable from 
+  # Iterates over strongly connected component in the subgraph reachable from
   # _node_.
   #
   # Return value is unspecified.
@@ -241,50 +240,3 @@ module TSort
     raise NotImplementedError.new
   end
 end
-
-if __FILE__ == $0
-  require 'test/unit'
-
-  class TSortHash < Hash # :nodoc:
-    include TSort
-    alias tsort_each_node each_key
-    def tsort_each_child(node, &block)
-      fetch(node).each(&block)
-    end
-  end
-
-  class TSortArray < Array # :nodoc:
-    include TSort
-    alias tsort_each_node each_index
-    def tsort_each_child(node, &block)
-      fetch(node).each(&block)
-    end
-  end
-
-  class TSortTest < Test::Unit::TestCase # :nodoc:
-    def test_dag
-      h = TSortHash[{1=>[2, 3], 2=>[3], 3=>[]}]
-      assert_equal([3, 2, 1], h.tsort)
-      assert_equal([[3], [2], [1]], h.strongly_connected_components)
-    end
-
-    def test_cycle
-      h = TSortHash[{1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}]
-      assert_equal([[4], [2, 3], [1]],
-        h.strongly_connected_components.map {|nodes| nodes.sort})
-      assert_raise(TSort::Cyclic) { h.tsort }
-    end
-
-    def test_array
-      a = TSortArray[[1], [0], [0], [2]]
-      assert_equal([[0, 1], [2], [3]],
-        a.strongly_connected_components.map {|nodes| nodes.sort})
-
-      a = TSortArray[[], [0]]
-      assert_equal([[0], [1]],
-        a.strongly_connected_components.map {|nodes| nodes.sort})
-    end
-  end
-
-end
-

data/lib/rubysl/tsort/version.rb

@@ -1,5 +1,5 @@
 module RubySL
   module TSort
-    VERSION = "1.0.0"
+    VERSION = "2.0.1"
   end
 end

data/rubysl-tsort.gemspec

@@ -16,6 +16,9 @@ Gem::Specification.new do |spec|
   spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
   spec.require_paths = ["lib"]
 
+  spec.required_ruby_version = "~> 2.0"
+
   spec.add_development_dependency "bundler", "~> 1.3"
   spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "mspec", "~> 1.5"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rubysl-tsort
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 2.0.1
 platform: ruby
 authors:
 - Brian Shirai
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-08-27 00:00:00.000000000 Z
+date: 2013-09-07 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -38,6 +38,20 @@ dependencies:
     - - ~>
       - !ruby/object:Gem::Version
         version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: mspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.5'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.5'
 description: Ruby standard library tsort.
 email:
 - brixen@gmail.com
@@ -66,9 +80,9 @@ require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ~>
     - !ruby/object:Gem::Version
-      version: '0'
+      version: '2.0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - '>='
@@ -81,3 +95,4 @@ signing_key:
 specification_version: 4
 summary: Ruby standard library tsort.
 test_files: []
+has_rdoc: