acts-as-dag 2.5.7 → 3.0.0

data/Gemfile

@@ -1,8 +1,8 @@
 source 'http://rubygems.org'
 
 gem 'bundler'
-gem 'rails', '3.2.3'
 gem 'rake'
+gem 'rails', '3.2.12'
 gem 'rack'
 gem 'jeweler'
 gem 'sqlite3'

data/README.rdoc

@@ -81,7 +81,7 @@ With polymorphic graphs we also have...
 
 Each of the optional column parameters needs a field in the link table. Hence for non-polymorphic graphs a migration would look like...
 
-    create_table :links, do |t|
+    create_table :links do |t|
         t.integer :ancestor_id
         t.integer :descendant_id
         t.boolean :direct
@@ -90,7 +90,7 @@ Each of the optional column parameters needs a field in the link table. Hence fo
     
 And for polymorphic graphs...
 
-    create_table :links, do |t|
+    create_table :links do |t|
         t.integer :ancestor_id
         t.string  :ancestor_type
         t.integer :descendant_id

data/acts-as-dag.gemspec

@@ -19,7 +19,7 @@ Gem::Specification.new do |s|
   s.require_paths = ["lib"]
 
   # As specified in test/dag_test.rb
-  s.add_development_dependency 'activerecord', '~> 3.0.3'
+  s.add_development_dependency 'activerecord', '~> 3.2.12'
   s.add_development_dependency 'rake'
   s.add_development_dependency 'sqlite3'
   s.add_runtime_dependency 'activemodel'

data/lib/acts-as-dag/version.rb

@@ -1,7 +1,7 @@
 module Acts
   module As
     module Dag
-      VERSION = "2.5.7"
+      VERSION = "3.0.0"
     end
   end
 end

data/lib/dag/edges.rb

@@ -63,21 +63,6 @@ module Dag
       end
     end
 
-    #Alias for create_edge
-    def connect(ancestor, descendant)
-      self.create_edge(ancestor, descendant)
-    end
-
-    #Alias for create_edge!
-    def connect!(ancestor, descendant)
-      self.create_edge!(ancestor, descendant)
-    end
-
-    #Determines if a link exists between two points
-    def connected?(ancestor, descendant)
-      !self.find_link(ancestor, descendant).nil?
-    end
-
     #Finds the longest path between ancestor and descendant returning as an array
     def longest_path_between(ancestor, descendant, path=[])
       longest = []
@@ -88,7 +73,7 @@ module Dag
           if temp.length > longest.length
             longest = temp
           end
-        elsif self.connected?(child, descendant)
+        elsif self.find_link(child, descendant)
           temp = path.clone
           temp << child
           temp = self.longest_path_between(child, descendant, temp)
@@ -110,7 +95,7 @@ module Dag
           if shortest.blank? || temp.length < shortest.length
             shortest = temp
           end
-        elsif self.connected?(child, descendant)
+        elsif self.find_link(child, descendant)
           temp = path.clone
           temp << child
           temp = self.shortest_path_between(child, descendant, temp)
@@ -320,4 +305,4 @@ module Dag
     end
 
   end
-end
+end

data/test/dag_test.rb

@@ -1,6 +1,6 @@
 require 'test/unit'
 require 'rubygems'
-gem 'activerecord', '~> 3.0.3'
+gem 'activerecord', '~> 3.2.8'
 require "./init"
 
 
@@ -9,13 +9,13 @@ ActiveRecord::Base.establish_connection(:adapter => "sqlite3", :database => "#{F
 #Used for basic graph link testing
 class Default < ActiveRecord::Base
   acts_as_dag_links :node_class_name => 'Node'
-  set_table_name 'edges'
+  self.table_name = 'edges'
 end
 
 #Used for polymorphic graph link testing
 class Poly < ActiveRecord::Base
   acts_as_dag_links :polymorphic => true
-  set_table_name 'poly_edges'
+  self.table_name = 'poly_edges'
 end
 
 #Used for redefinition testing
@@ -25,43 +25,43 @@ class Redefiner < ActiveRecord::Base
                     :count_column => 'c',
                     :ancestor_id_column => 'foo_id',
                     :descendant_id_column => 'bar_id'
-  set_table_name 'edges2'
+  self.table_name = 'edges2'
 end
 
 class Node < ActiveRecord::Base
   has_dag_links :link_class_name => 'Default'
-  set_table_name 'nodes'
+  self.table_name = 'nodes'
 end
 
 class RedefNode < ActiveRecord::Base
   has_dag_links :link_class_name => 'Redefiner'
-  set_table_name 'redef_nodes'
+  self.table_name = 'redef_nodes'
 end
 
 class AlphaNode < ActiveRecord::Base
   has_dag_links :link_class_name => 'Poly',
                 :descendant_class_names => ['BetaNode', 'GammaNode', 'ZetaNode']
-  set_table_name 'alpha_nodes'
+  self.table_name = 'alpha_nodes'
 end
 
 class BetaNode < ActiveRecord::Base
   has_dag_links :link_class_name => 'Poly',
                 :ancestor_class_names => ['AlphaNode', 'BetaNode'],
                 :descendant_class_names => ['BetaNode', 'GammaNode', 'ZetaNode']
-  set_table_name 'beta_nodes'
+  self.table_name = 'beta_nodes'
 end
 
 class GammaNode < ActiveRecord::Base
   has_dag_links :link_class_name => 'Poly',
                 :ancestor_class_names => ['AlphaNode', 'BetaNode', 'GammaNode'],
                 :descendant_class_names => ['GammaNode', 'ZetaNode']
-  set_table_name 'gamma_nodes'
+  self.table_name = 'gamma_nodes'
 end
 
 class ZetaNode < ActiveRecord::Base
   has_dag_links :link_class_name => 'Poly',
                 :ancestor_class_names => ['AlphaNode', 'BetaNode', 'GammaNode']
-  set_table_name 'zeta_nodes'
+  self.table_name = 'zeta_nodes'
 end
 
 
@@ -509,34 +509,6 @@ class DagTest < Test::Unit::TestCase
     assert_nil testnil
   end
 
-  #Tests class method connect
-  def test_manual_connect_lonely_edge
-    a = Node.create!
-    b = Node.create!
-    e = Default.connect!(a, b)
-    e2 = Default.find_edge(a, b)
-    assert e2.direct?
-    assert_equal 1, e2.count
-    assert_equal e, e2
-    assert_equal e2.ancestor, a
-    assert_equal e2.descendant, b
-  end
-
-  #Tests simple indirect link creation
-  def test_auto_simple_cross
-    a = Node.create!
-    b = Node.create!
-    c = Node.create!
-    e = Default.connect(a, b)
-    e2 = Default.connect(b, c)
-    indirect = Default.find_link(a, c)
-    assert !indirect.nil?
-    assert !indirect.direct?
-    assert_equal 1, indirect.count
-    assert_equal a, indirect.ancestor
-    assert_equal c, indirect.descendant
-  end
-
   ##########################
   #TESTS FOR has_dag_links #
   ##########################
@@ -869,4 +841,4 @@ class DagTest < Test::Unit::TestCase
     e.destroy
   end
 
-end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: acts-as-dag
 version: !ruby/object:Gem::Version
-  version: 2.5.7
+  version: 3.0.0
   prerelease: 
 platform: ruby
 authors:
@@ -10,7 +10,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-05-03 00:00:00.000000000 Z
+date: 2013-02-18 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: activerecord
@@ -19,7 +19,7 @@ dependencies:
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
-        version: 3.0.3
+        version: 3.2.12
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
@@ -27,7 +27,7 @@ dependencies:
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
-        version: 3.0.3
+        version: 3.2.12
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
@@ -104,7 +104,6 @@ files:
 - MIT-LICENSE
 - README.rdoc
 - Rakefile
-- VERSION
 - acts-as-dag.gemspec
 - init.rb
 - lib/acts-as-dag.rb
@@ -129,6 +128,9 @@ required_ruby_version: !ruby/object:Gem::Requirement
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
+      segments:
+      - 0
+      hash: -251717266432713559
 required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
   requirements:
@@ -137,7 +139,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: acts-as-dag
-rubygems_version: 1.8.24
+rubygems_version: 1.8.25
 signing_key: 
 specification_version: 3
 summary: Directed Acyclic Graph hierarchy for Rail's ActiveRecord

data/VERSION

@@ -1 +0,0 @@
-2.5.5