solutions_spec.rb in solve-0.3.1

- old
+ new

@@ -49,21 +49,21 @@
     graph.artifacts("B", "1.0.0").depends("D", "= 1.0.0")
     graph.artifacts("B", "1.1.0").depends("D", "= 1.0.0")
     graph.artifacts("B", "2.0.0").depends("D", ">= 1.3.0")
     graph.artifacts("B", "2.1.0").depends("D", ">= 2.0.0")
 
-    graph.artifacts("A", "1.0.0").depends("B", "> 1.0.0")
-    graph.artifacts("A", "1.0.0").depends("C", "= 2.0.0")
+    graph.artifacts("A", "1.0.0").depends("B", "> 2.0.0")
+    graph.artifacts("A", "1.0.0").depends("C", "= 2.1.0")
     graph.artifacts("A", "1.0.1").depends("B", "> 1.0.0")
     graph.artifacts("A", "1.0.1").depends("C", "= 2.1.0")
-    graph.artifacts("A", "1.0.2").depends("B", "> 2.0.0")
-    graph.artifacts("A", "1.0.2").depends("C", "= 2.1.0")
+    graph.artifacts("A", "1.0.2").depends("B", "> 1.0.0")
+    graph.artifacts("A", "1.0.2").depends("C", "= 2.0.0")
 
     result = Solve.it!(graph, [['A', '~> 1.0.0'], ['D', ">= 2.0.0"]])
 
 
-    result.should eql("A" => "1.0.2",
+    result.should eql("A" => "1.0.1",
                       "B" => "2.1.0",
                       "C" => "2.1.0",
                       "D" => "2.1.0")
   end
 
@@ -93,6 +93,69 @@
     result.should eql("A" => "1.0.0", 
                       "B" => "1.0.0",
                       "C" => "1.0.0")
   end
 
+  it "finds the correct solution when there is a diamond shaped dependency" do
+    graph = Solve::Graph.new
+
+    graph.artifacts("A", "1.0.0")
+      .depends("B", "1.0.0")
+      .depends("C", "1.0.0")
+    graph.artifacts("B", "1.0.0")
+      .depends("D", "1.0.0")
+    graph.artifacts("C", "1.0.0")
+      .depends("D", "1.0.0")
+    graph.artifacts("D", "1.0.0")
+
+    result = Solve.it!(graph, [["A", "1.0.0"]])
+
+    result.should eql("A" => "1.0.0",
+                      "B" => "1.0.0",
+                      "C" => "1.0.0",
+                      "D" => "1.0.0")
+  end
+
+  it "gives an empty solution when there are no demands" do
+    graph = Solve::Graph.new
+    result = Solve.it!(graph, [])
+    result.should eql({})
+  end
+
+  it "tries all combinations until it finds a solution" do
+
+    graph = Solve::Graph.new
+
+    graph.artifacts("A", "1.0.0").depends("B", "~> 1.0.0")
+    graph.artifacts("A", "1.0.1").depends("B", "~> 1.0.0")
+    graph.artifacts("A", "1.0.2").depends("B", "~> 1.0.0")
+
+    graph.artifacts("B", "1.0.0").depends("C", "~> 1.0.0")
+    graph.artifacts("B", "1.0.1").depends("C", "~> 1.0.0")
+    graph.artifacts("B", "1.0.2").depends("C", "~> 1.0.0")
+
+    graph.artifacts("C", "1.0.0").depends("D", "1.0.0")
+    graph.artifacts("C", "1.0.1").depends("D", "1.0.0")
+    graph.artifacts("C", "1.0.2").depends("D", "1.0.0")
+
+    # ensure we can't find a solution in the above
+    graph.artifacts("D", "1.0.0").depends("A", "< 0.0.0")
+
+    # Add a solution to the graph that should be reached only after
+    #   all of the others have been tried 
+    #   it must be circular to ensure that no other branch can find it
+    graph.artifacts("A", "0.0.0").depends("B", "0.0.0")
+    graph.artifacts("B", "0.0.0").depends("C", "0.0.0")
+    graph.artifacts("C", "0.0.0").depends("D", "0.0.0")
+    graph.artifacts("D", "0.0.0").depends("A", "0.0.0")
+
+    demands = [["A"]]
+
+    result = Solve.it!(graph, demands)
+    
+    result.should eql({ "A" => "0.0.0",
+                        "B" => "0.0.0",
+                        "C" => "0.0.0",
+                        "D" => "0.0.0"})
+
+  end
 end