usecasing 0.1.2 → 0.1.3

data/README.md

@@ -7,10 +7,7 @@
 
 Add this line to your application's Gemfile:
 
-I did not (YET) upload this code to the rubygems.   
-To early adopters use the :git path
-
-    gem 'usecasing', :git => 'https://github.com/tdantas/usecasing.git'
+  	gem 'usecasing'
 
 And then execute:
 

data/lib/usecasing/execution_order.rb

@@ -1,9 +1,12 @@
+require 'set'
+require 'tsort'
+
 module UseCase
 
   class ExecutionOrder
 
     def self.run(start_node)
-      any_ciclic, ciclic = CyclicFinder.new(start_node).cyclic?
+      any_ciclic, ciclic = CyclicFinder.cyclic?(start_node)
       raise StandardError.new("cyclic detected: #{ciclic}") if any_ciclic
       post_order(start_node, [])
     end
@@ -18,6 +21,47 @@ module UseCase
 
       result.push(node)
     end
+  end
+
+  class CyclicFinder
+    include TSort
+
+    def self.cyclic?(start_point)
+      new(start_point).cyclic?
+    end
+    
+    def initialize(start_point)
+      @start_point = start_point
+      @nodes       = discover_nodes
+    end
+
+    def tsort_each_node(&block)
+      @nodes.each &block
+    end
+
+    def tsort_each_child(node, &block)
+      node.dependencies.each &block
+    end
+
+    def cyclic?
+      components = strongly_connected_components
+      result = components.any?{ |component| component.size != 1 }
+      [ result, components.select{|component| component.size != 1 } ]
+    end
+
+    private
+    def discover_nodes
+      visited = {}
+      stack = [@start_point]
+      result = Set.new
+      until stack.empty?
+        node = stack.pop
+        result.add node
+        stack.push(*(node.dependencies)) if not visited[node]
+        visited[node] = true
+      end
+      return result
+    end
 
   end
 end

data/lib/usecasing/version.rb

@@ -1,3 +1,3 @@
 module Usecasing
-  VERSION = "0.1.2"
+  VERSION = "0.1.3"
 end

data/lib/usecasing.rb

@@ -3,6 +3,5 @@ require "usecasing/version"
 module UseCase
   autoload :Context,        'usecasing/context'
   autoload :Base,           'usecasing/base'
-  autoload :CyclicFinder,   'usecasing/cyclic_finder'
   autoload :ExecutionOrder, 'usecasing/execution_order'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: usecasing
 version: !ruby/object:Gem::Version
-  version: 0.1.2
+  version: 0.1.3
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-12-23 00:00:00.000000000 Z
+date: 2013-12-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec
@@ -76,7 +76,6 @@ files:
 - lib/usecasing.rb
 - lib/usecasing/base.rb
 - lib/usecasing/context.rb
-- lib/usecasing/cyclic_finder.rb
 - lib/usecasing/execution_order.rb
 - lib/usecasing/version.rb
 - spec/context_spec.rb
@@ -98,7 +97,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
       version: '0'
       segments:
       - 0
-      hash: 183179680279514934
+      hash: 3012714953632075920
 required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
   requirements:
@@ -107,7 +106,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
       segments:
       - 0
-      hash: 183179680279514934
+      hash: 3012714953632075920
 requirements: []
 rubyforge_project: 
 rubygems_version: 1.8.24

data/lib/usecasing/cyclic_finder.rb

@@ -1,44 +0,0 @@
-require 'set'
-require 'tsort'
-
-module UseCase
-
-  class CyclicFinder
-    include TSort
-    
-    def initialize(start_point)
-      @start_point = start_point
-      @nodes = discover_nodes
-    end
-
-    def tsort_each_node(&block)
-      @nodes.each &block
-    end
-
-    def tsort_each_child(node, &block)
-      node.dependencies.each &block
-    end
-
-    def cyclic?
-      components = strongly_connected_components
-      result = components.any?{ |component| component.size != 1 }
-      [ result, components.select{|component| component.size != 1 } ]
-    end
-
-    private
-    def discover_nodes
-      visited = {}
-      stack = [@start_point]
-      result = Set.new
-      until stack.empty?
-        node = stack.pop
-        result.add node
-        stack.push(*(node.dependencies)) if not visited[node]
-        visited[node] = true
-      end
-
-      return result
-    end
-
-  end
-end