dep_selector_over_http 0.0.9

data/lib/dep_selector/densely_packed_set.rb

@@ -0,0 +1,59 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+require 'dep_selector/exceptions'
+
+module DepSelector
+  class DenselyPackedSet
+    attr_reader :sorted_elements
+
+    def initialize(elements)
+      @sorted_elements = elements.sort
+      @element_to_index = {}
+      @sorted_elements.each_with_index{|elt, idx| @element_to_index[elt] = idx}
+    end
+
+    def range
+      Range.new(0, @sorted_elements.size-1)
+    end
+
+    def index(element)
+      unless @element_to_index.has_key?(element)
+        msg = "#{element} is not a valid version for this package"
+        raise Exceptions::InvalidVersion.new(msg)
+      end
+      @element_to_index[element]
+    end
+
+    def [](constraint)
+      # TODO [cw/mark,2010/11/22]: don't actually need an array here, re-write
+      range = []
+      started = false
+      done = false
+      sorted_elements.each_with_index do |element, idx|
+        if constraint.include?(element)
+          raise "Currently only handle continuous gap between #{range.last} and #{idx} for #{constraint.to_s} over #{@sorted_elements.join(', ')}" if (range.any? && range.last+1 != idx)
+          range << idx
+        end
+      end
+
+      range.empty? ? [] : Range.new(range.first, range.last)
+    end
+  end
+end

data/lib/dep_selector/dep_selector_version.rb

@@ -0,0 +1,3 @@
+module DepSelector
+  VERSION = "0.0.9"
+end

data/lib/dep_selector/dependency.rb

@@ -0,0 +1,46 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+require 'dep_selector/version_constraint'
+
+module DepSelector
+  class Dependency
+    attr_reader :package, :constraint
+
+    def initialize(package, constraint=nil)
+      @package = package
+      @constraint = constraint || VersionConstraint.new
+    end
+
+    def to_s(incl_densely_packed_versions = false)
+      range = package.densely_packed_versions[constraint]
+      "(#{package.name} #{constraint.to_s}#{incl_densely_packed_versions ? " (#{range})" : ''})"
+    end
+
+    def ==(o)
+      o.respond_to?(:package) && package == o.package &&
+        o.respond_to?(:constraint) && constraint == o.constraint
+    end
+
+    def eql?(o)
+      self.class == o.class && self == o
+    end
+
+  end
+end

data/lib/dep_selector/dependency_graph.rb

@@ -0,0 +1,71 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+require 'dep_selector/package'
+
+# DependencyGraphs contain Packages, which in turn contain
+# PackageVersions. Packages are created at access-time through
+# #package
+module DepSelector
+  class DependencyGraph
+
+    DebugOptionFile = "/tmp/DepSelectorDebugOn"
+
+    attr_reader :packages
+
+    def initialize
+      @packages = {}
+    end
+
+    def package(name)
+      packages.has_key?(name) ? packages[name] : (packages[name]=Package.new(self, name))
+    end
+
+    def each_package
+      packages.each do |name, pkg|
+        yield pkg
+      end
+    end
+
+    def gecode_wrapper
+      raise "Must invoke generate_gecode_wrapper_constraints before attempting to access gecode_wrapper" unless @gecode_wrapper
+      @gecode_wrapper
+    end
+
+    # Note: only invoke this method once all Packages and
+    # PackageVersions have been added.
+    def generate_gecode_wrapper_constraints(packages_to_include_in_solve=nil)
+      raise "#generate_gecode_wrapper_constraints references c extensions. don't use." 
+    end
+
+    def gecode_model_vars
+      packages.inject({}){|acc, elt| acc[elt.first] = elt.last.gecode_model_var ; acc }
+    end
+
+    def to_s(incl_densely_packed_versions = false)
+      packages.keys.sort.map{|name| packages[name].to_s(incl_densely_packed_versions)}.join("\n")
+    end
+
+    # TODO [cw,2010/11/23]: this is a simple but inefficient impl. Do
+    # it for realz.
+    def clone
+      Marshal.load(Marshal.dump(self))
+    end
+  end
+end

data/lib/dep_selector/error_reporter/simple_tree_traverser.rb

@@ -0,0 +1,183 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+require 'dep_selector/error_reporter'
+
+# This error reporter simply maps the versions of packages explicitly
+# included in the list of solution constraints to the restrictions
+# placed on the most constrained package.
+module DepSelector
+  class ErrorReporter
+    class SimpleTreeTraverser < ErrorReporter
+
+      def give_feedback(dep_graph, soln_constraints, unsatisfiable_constraint_idx, most_constrained_pkg)
+        unsatisfiable_soln_constraint = soln_constraints[unsatisfiable_constraint_idx]
+        feedback = "Unable to satisfy constraints on package #{most_constrained_pkg.name}"
+        feedback << ", which does not exist," unless most_constrained_pkg.valid?
+        feedback << " due to solution constraint #{unsatisfiable_soln_constraint}. "
+
+        all_paths = paths_from_soln_constraints_to_pkg_constraints(dep_graph, soln_constraints, most_constrained_pkg)
+        collapsed_paths = collapse_adjacent_paths(all_paths).map{|collapsed_path| "[#{print_path(collapsed_path).join(' -> ')}]"}
+
+        feedback << "Solution constraints that may result in a constraint on #{most_constrained_pkg.name}: #{collapsed_paths.join(', ')}"
+      end
+
+      private
+
+      def paths_from_soln_constraints_to_pkg_constraints(dep_graph, soln_constraints, most_constrained_pkg)
+        all_paths = []
+        soln_constraints.each do |soln_constraint|
+          paths_to_pkg(dep_graph,
+                       soln_constraint.package,
+                       soln_constraint.constraint,
+                       most_constrained_pkg,
+                       [],
+                       all_paths)
+        end
+
+        all_paths
+      end
+
+      def paths_to_pkg(dep_graph, curr_pkg, version_constraint, target_pkg, curr_path, all_paths)
+        if curr_pkg == target_pkg
+          # register the culminating constraint
+          all_paths.push(Array.new(curr_path).push(SolutionConstraint.new(curr_pkg, version_constraint)))
+          return
+        end
+
+        # curr_pkg has no versions, it is invalid so don't recurse
+        if curr_pkg.versions.empty?
+          # TODO [cw, 2011/2/17]: find a way to track these invalid
+          # packages and return as potential conflict-causing
+          # constraints.
+          return
+        end
+
+        if curr_path.select{|elt| elt.package == curr_pkg}.any?
+          # TODO [cw, 2011/2/18]: this indicates a circular dependency
+          # in the dependency graph. This might be useful warning
+          # information to report to the user.
+          return
+        end
+
+        # determine all versions of curr_pkg that match
+        # version_constraint and recurse into them
+        curr_pkg[version_constraint].each do |curr_pkg_ver|
+          curr_path.push(curr_pkg_ver)
+          curr_pkg_ver.dependencies.each do |dep|
+            paths_to_pkg(dep_graph, dep.package, dep.constraint, target_pkg, curr_path, all_paths)
+          end
+          curr_path.pop
+        end
+      end
+
+      # This is a simple collapsing function. For each adjacent path,
+      # if there is only one element different between the two paths
+      # and their packages are the same (meaning only the version
+      # binding is different), then the elements are considered
+      # collasable. The merged path has all the common elements and a
+      # set containing the two version bindings in place of the
+      # contentious path item.
+      def collapse_adjacent_paths(paths)
+        return paths if paths.length < 2
+
+        paths.inject([]) do |collapsed_paths, path|
+          merge_path_into_collapsed_paths(collapsed_paths, path)
+        end
+      end
+
+      def print_path(path)
+        path.map do |step|
+          if step.respond_to? :version
+            "(#{step.package.name} = #{step.version})"
+          elsif step.respond_to? :constraint
+            step.to_s
+          elsif step.kind_of?(Array)
+            # TODO [cw, 2011/2/23]: consider detecting complete
+            # ranges here instead of calling each out individually
+            "(#{step.first.package.name} = {#{step.map{|elt| "#{elt.version}"}.join(',')}})"
+          else
+            raise "don't know how to print step"
+          end
+        end
+      end
+
+      # collapses path_under_consideration onto the end of
+      # collapsed_paths or adds a new path to be used in the next
+      # round(s) of collapsing.
+      #
+      # Note: collapsed_paths is side-effected
+      def merge_path_into_collapsed_paths(collapsed_paths, path_under_consideration)
+        curr_collapsed_path = collapsed_paths.last
+
+        # if there is no curr_collapsed_path or it isn't the same
+        # length as path_under_consideration, then they cannot
+        # possibly be mergeable
+        if curr_collapsed_path.nil? || curr_collapsed_path.length != path_under_consideration.length
+          # TODO [cw.2011/2/7]: do we need this to be a new array, or
+          # can we save ourselves a little memory and work by just
+          # pushing the reference to path_under_consideration?
+          return collapsed_paths << Array.new(path_under_consideration)
+        end
+
+        # lengths are equal, so find the first path element where
+        # curr_collapsed_path and path_under_consideration diverge, if
+        # that is the only unequal element, it's for the same package,
+        # and they are both PackageVersion objects then merge;
+        # otherwise, this is a new path
+        #
+        # TODO [cw,2011/2/7]: should we merge even if they're not for
+        # the same package?
+        unequal_idx = nil
+        merged_set = nil
+        mergeable = true
+        path_under_consideration.each_with_index do |path_element, curr_idx|
+          if path_element != curr_collapsed_path[curr_idx]
+            unless unequal_idx
+              merged_set = [curr_collapsed_path[curr_idx]].flatten
+              if merged_set.first.package == path_element.package &&
+                  merged_set.first.is_a?(PackageVersion) &&
+                  path_element.is_a?(PackageVersion)
+                merged_set << path_element
+              else
+                mergeable = false
+                break
+              end
+              unequal_idx = curr_idx
+            else
+              # this is the second place they are unequal. fast-fail,
+              # because we know we can't merge the paths.
+              mergeable = false
+              break
+            end
+          end
+        end
+
+        if unequal_idx && mergeable
+          curr_collapsed_path[unequal_idx] = merged_set
+        else
+          collapsed_paths << Array.new(path_under_consideration)
+        end
+
+        collapsed_paths
+      end
+
+    end
+  end
+end

data/lib/dep_selector/error_reporter.rb

@@ -0,0 +1,28 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+module DepSelector
+  class ErrorReporter
+
+    def give_feedback(workspace, solution_constraints, unsatisfiable_constraint_idx, most_constrained_package)
+      raise "Sub-class must implement"
+    end
+
+  end
+end

data/lib/dep_selector/exceptions.rb

@@ -0,0 +1,67 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+module DepSelector
+  module Exceptions
+
+    # This exception is what the client of dep_selector should
+    # catch. It contains the solution constraint that introduces
+    # unsatisfiability, as well as the set of packages that are
+    # required to be disabled due to 
+    class NoSolutionExists < StandardError
+      attr_reader :message, :unsatisfiable_solution_constraint,
+                  :disabled_non_existent_packages,
+                  :disabled_most_constrained_packages
+      def initialize(message, unsatisfiable_solution_constraint,
+                     disabled_non_existent_packages = [],
+                     disabled_most_constrained_packages = [])
+        @message = message
+        @unsatisfiable_solution_constraint = unsatisfiable_solution_constraint
+        @disabled_non_existent_packages = disabled_non_existent_packages
+        @disabled_most_constrained_packages = disabled_most_constrained_packages
+      end
+    end
+
+    # This exception is thrown by gecode_wrapper and only used
+    # internally
+    class NoSolutionFound < StandardError
+      attr_reader :unsatisfiable_problem
+      def initialize(unsatisfiable_problem=nil)
+        @unsatisfiable_problem = unsatisfiable_problem
+      end
+    end
+
+    # This exception is thrown during Selector#find_solution if any of
+    # the solution constraints make finding solution impossible. The
+    # two cases are if a solution constraint references a package that
+    # doesn't exist or if the constraint on an extant package matches
+    # no versions.
+    class InvalidSolutionConstraints < ArgumentError
+      attr_reader :non_existent_packages, :constrained_to_no_versions
+      def initialize(non_existent_packages, constrained_to_no_versions)
+        @non_existent_packages = non_existent_packages
+        @constrained_to_no_versions = constrained_to_no_versions
+      end
+    end
+
+    class InvalidVersion < ArgumentError ; end
+    class InvalidVersionConstraint < ArgumentError; end
+
+  end
+end

data/lib/dep_selector/package.rb

@@ -0,0 +1,116 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+require 'dep_selector/package_version'
+require 'dep_selector/densely_packed_set'
+
+module DepSelector
+  class Package
+    attr_reader :dependency_graph, :name, :versions
+
+    def initialize(dependency_graph, name)
+      @dependency_graph = dependency_graph
+      @name = name
+      @versions = []
+    end
+
+    def add_version(version)
+      versions << (pv = PackageVersion.new(self, version))
+      pv
+    end
+
+    # Note: only invoke this method after all PackageVersions have been added
+    def densely_packed_versions
+      @densely_packed_versions ||= DenselyPackedSet.new(versions.map{|pkg_version| pkg_version.version})
+    end
+
+    # Given a version, this method returns the corresonding
+    # PackageVersion. Given a version constraint, this method returns
+    # an array of matching PackageVersions.
+    #--
+    # TODO [cw,2011/2/4]: rationalize this with DenselyPackedSet#[]
+    def [](version_or_constraint)
+      # version constraints must abide the include? contract
+      if version_or_constraint.respond_to?(:include?)
+        versions.select do |ver|
+          version_or_constraint.include?(ver)
+        end
+      else
+        versions.find{|pkg_version| pkg_version.version == version_or_constraint}
+      end
+    end
+
+    # A Package is considered valid if it has at least one version
+    def valid?
+      versions.any?
+    end
+
+    def to_s(incl_densely_packed_versions = false)
+      components = []
+      components << "Package #{name}"
+      if incl_densely_packed_versions
+        components << " (#{densely_packed_versions.range})"
+      end
+      versions.each{|version| components << "\n  #{version.to_s(incl_densely_packed_versions)}"}
+      components.flatten.join
+    end
+
+    # Note: only invoke this method after all PackageVersions have been added
+    def gecode_package_id
+      # Note: gecode does naive bounds propagation at every post,
+      # which means that any package with exactly one version is
+      # considered bound and its dependencies propagated even though
+      # there might not be a solution constraint that requires that
+      # package to be bound, which means that otherwise-irrelevant
+      # constraints (e.g. A1->B1 when the solution constraint is B=2
+      # and there is nothing to induce a dependency on A) can cause
+      # unsatisfiability. Therefore, we want every package to have at
+      # least two versions, one of which is neither the target of
+      # other packages' dependencies nor induces other
+      # dependencies. Package version id -1 serves this purpose.
+      #
+      # TODO [cw, 2011/2/22]: Do we likewise want to leave packages
+      # with no versions (the target of an invalid dependency) with
+      # two versions in order to allow the solver to explore the
+      # invalid portion of the state space instead of naively limiting
+      # it for the purposes of having failure count heuristics?
+      max = densely_packed_versions.range.max || -1
+      @gecode_package_id ||= dependency_graph.gecode_wrapper.add_package(-1, max, 0)
+    end
+
+    def generate_gecode_wrapper_constraints
+      # if this is a valid package (has versions), we don't need to
+      # explicitly call gecode_package_id, because they will do it for
+      # us; however, if this package isn't valid (it only exists as an
+      # invalid dependency and thus has no versions), the solver gets
+      # confused, because we won't have generated its package id by
+      # the time it starts solving.
+      gecode_package_id
+      versions.each{|version| version.generate_gecode_wrapper_constraints }
+    end
+
+    def eql?(o)
+      # TODO [cw,2011/2/7]: this is really shallow. should implement
+      # == for DependencyGraph
+      self.class == o.class && name == o.name
+    end
+    alias :== :eql?
+
+  end
+end

data/lib/dep_selector/package_version.rb

@@ -0,0 +1,68 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+module DepSelector
+  class PackageVersion
+    attr_accessor :package, :version, :dependencies
+
+    def initialize(package, version)
+      @package = package
+      @version = version
+      @dependencies = []
+    end
+
+    def generate_gecode_wrapper_constraints
+      pkg_densely_packed_version = package.densely_packed_versions.index(version)
+
+      dependencies.each do |dep|
+        dep_pkg_range = dep.package.densely_packed_versions[dep.constraint]
+        package.dependency_graph.gecode_wrapper.add_version_constraint(package.gecode_package_id, pkg_densely_packed_version, dep.package.gecode_package_id, dep_pkg_range.min, dep_pkg_range.max)
+      end
+    end
+
+    def to_s(incl_densely_packed_versions = false)
+      components = []
+      components << "#{version}"
+      if incl_densely_packed_versions
+        components << " (#{package.densely_packed_versions.index(version)})"
+      end
+      components << " -> [#{dependencies.map{|d|d.to_s(incl_densely_packed_versions)}.join(', ')}]"
+      components.join
+    end
+
+    def hash
+      # Didn't put any thought or research into this, probably can be
+      # done better
+      to_s.hash
+    end
+
+    def eql?(o)
+      o.class == self.class &&
+        package == o.package &&
+        version == o.version &&
+        dependencies == o.dependencies
+    end
+    alias :== :eql?
+
+    def to_hash
+      { :package_name => package.name, :version => version }
+    end
+
+  end
+end

data/lib/dep_selector/selector.rb

@@ -0,0 +1,46 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+require 'dep_selector/dependency_graph'
+require 'dep_selector/exceptions'
+require 'dep_selector/error_reporter'
+require 'dep_selector/error_reporter/simple_tree_traverser'
+
+# A Selector contains the a DependencyGraph, which is populated with
+# the dependency relationships, and an array of solution
+# constraints. When a solution is asked for (via #find_solution),
+# either a valid assignment is returned or the first solution
+# constraint that makes a solution impossible.
+module DepSelector
+  class Selector
+    attr_accessor :dep_graph, :error_reporter
+
+    DEFAULT_ERROR_REPORTER = ErrorReporter::SimpleTreeTraverser.new
+
+    def initialize(dep_graph, error_reporter = DEFAULT_ERROR_REPORTER)
+      @dep_graph = dep_graph
+      @error_reporter = error_reporter
+    end
+
+    def find_solution(solution_constraints, valid_packages = nil)
+      result = Net::HTTP.post_form(URI('http://localhost:9393/'), {selector: self.to_yaml, solution_constraints: solution_constraints.to_yaml, valid_packages: valid_packages.to_yaml})
+      JSON.parse(result.body)
+    end
+  end
+end

data/lib/dep_selector/solution_constraint.rb

@@ -0,0 +1,22 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+require 'dep_selector/dependency'
+
+class DepSelector::SolutionConstraint < DepSelector::Dependency ; end

data/lib/dep_selector/version.rb

@@ -0,0 +1,74 @@
+#
+# Author:: Seth Falcon (<seth@opscode.com>)
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Copyright:: Copyright 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+# 
+#     http://www.apache.org/licenses/LICENSE-2.0
+# 
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+require 'dep_selector/exceptions'
+
+module DepSelector
+  class Version
+    include Comparable
+    attr_reader :major, :minor, :patch
+
+    def initialize(str="")
+      @major, @minor, @patch = parse(str)
+    end
+
+    def inspect
+      "#{@major}.#{@minor}.#{@patch}"
+    end
+
+    def to_s
+      "#{@major}.#{@minor}.#{@patch}"
+    end
+
+    def <=>(v)
+      [:major, :minor, :patch].each do |method|
+        ans = (self.send(method) <=> v.send(method))
+        return ans if ans != 0
+      end
+      0
+    end
+
+    def hash
+      # Didn't put any thought or research into this, probably can be
+      # done better
+      to_s.hash
+    end
+
+    # For hash
+    def eql?(other)
+      other.is_a?(Version) && self == other
+    end
+
+    private
+
+    def parse(str="")
+      @major, @minor, @patch =
+        case str.to_s
+        when /^(\d+)\.(\d+)\.(\d+)$/
+          [ $1.to_i, $2.to_i, $3.to_i ]
+        when /^(\d+)\.(\d+)$/
+          [ $1.to_i, $2.to_i, 0 ]
+        else
+          msg = "'#{str.to_s}' does not match 'x.y.z' or 'x.y'"
+          raise Exceptions::InvalidVersion.new msg
+        end
+    end
+
+  end
+end

data/lib/dep_selector/version_constraint.rb

@@ -0,0 +1,120 @@
+#
+# Author:: Seth Falcon (<seth@opscode.com>)
+# Copyright:: Copyright 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+require 'dep_selector/version'
+require 'dep_selector/exceptions'
+
+module DepSelector
+  class VersionConstraint
+    DEFAULT_CONSTRAINT = ">= 0.0.0"
+    STANDARD_OPS = %w(< > <= >=)
+    OPS = %w(< > = <= >= ~>)
+    PATTERN = /^(#{OPS.join('|')}) (.+)$/
+
+    attr_reader :op, :version
+
+    def initialize(constraint_spec=nil)
+      constraint_spec ||= DEFAULT_CONSTRAINT
+      case constraint_spec
+      when nil
+        parse(DEFAULT_CONSTRAINT)
+      when Array
+        parse_from_array(constraint_spec)
+      when String
+        parse(constraint_spec)
+      else
+        msg = "VersionConstraint should be created from a String. You gave: #{constraint_spec.inspect}"
+        raise Exceptions::InvalidVersionConstraint, msg
+      end
+    end
+
+    def include?(v)
+      version = if v.respond_to? :version
+                  Version.new(v.version.to_s)
+                else
+                  Version.new(v.to_s)
+                end
+     do_op(version)
+    end
+
+    def inspect
+      "(#{@op} #{@version})"
+    end
+
+    def to_s
+      "#{@op} #{@version}"
+    end
+
+    def eql?(o)
+      o.class == self.class && @op == o.op && @version == o.version
+    end
+    alias_method :==, :eql?
+
+    private
+
+    def do_op(other_version)
+      if STANDARD_OPS.include? @op
+        other_version.send(@op.to_sym, @version)
+      elsif @op == '='
+        other_version == @version
+      elsif @op == '~>'
+        if @missing_patch_level
+          (other_version.major == @version.major &&
+           other_version.minor >= @version.minor)
+        else
+          (other_version.major == @version.major &&
+           other_version.minor == @version.minor &&
+           other_version.patch >= @version.patch)
+        end
+      else                      # should never happen
+        raise "bad op #{@op}"
+      end
+    end
+
+    def parse_from_array(constraint_spec)
+      if constraint_spec.empty?
+        parse(DEFAULT_CONSTRAINT)
+      elsif constraint_spec.size == 1
+        parse(constraint_spec.first)
+      else
+        msg = "only one version constraint operation is supported, but you gave #{constraint_spec.size} "
+        msg << "['#{constraint_spec.join(', ')}']"
+        raise Exceptions::InvalidVersionConstraint, msg
+      end
+    end
+
+    def parse(str)
+      @missing_patch_level = false
+      if str.index(" ").nil? && str =~ /^[0-9]/
+        # try for lone version, implied '='
+        @version = Version.new(str)
+        @op = "="
+      elsif PATTERN.match str
+        @op = $1
+        raw_version = $2
+        @version = Version.new(raw_version)
+        if raw_version.split('.').count == 2
+          @missing_patch_level = true
+        end
+      else
+        raise Exceptions::InvalidVersionConstraint, "'#{str}'"
+      end
+    end
+
+  end
+end

data/lib/dep_selector.rb

@@ -0,0 +1,34 @@
+#
+# Author:: Christopher Walters (<cw@opscode.com>)
+# Author:: Mark Anderson (<mark@opscode.com>)
+# Copyright:: Copyright (c) 2010-2011 Opscode, Inc.
+# License:: Apache License, Version 2.0
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+require 'dep_selector/dep_selector_version'
+
+require 'dep_selector/selector'
+require 'dep_selector/dependency_graph'
+require 'dep_selector/package'
+require 'dep_selector/package_version'
+require 'dep_selector/dependency'
+require 'dep_selector/solution_constraint'
+require 'dep_selector/version'
+require 'dep_selector/version_constraint'
+require 'dep_selector/exceptions'
+
+# error reporting
+require 'dep_selector/error_reporter'
+require 'dep_selector/error_reporter/simple_tree_traverser'

metadata

@@ -0,0 +1,63 @@
+--- !ruby/object:Gem::Specification
+name: dep_selector_over_http
+version: !ruby/object:Gem::Version
+  version: 0.0.9
+  prerelease: 
+platform: ruby
+authors:
+- Josiah Kiehl
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-05-23 00:00:00.000000000 Z
+dependencies: []
+description: Given packages, versions, and a dependency graph, find a valid assignment
+  of package versions
+email:
+- cw@opscode.com
+- mark@opscode.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/dep_selector/densely_packed_set.rb
+- lib/dep_selector/dep_selector_version.rb
+- lib/dep_selector/dependency.rb
+- lib/dep_selector/dependency_graph.rb
+- lib/dep_selector/error_reporter/simple_tree_traverser.rb
+- lib/dep_selector/error_reporter.rb
+- lib/dep_selector/exceptions.rb
+- lib/dep_selector/package.rb
+- lib/dep_selector/package_version.rb
+- lib/dep_selector/selector.rb
+- lib/dep_selector/solution_constraint.rb
+- lib/dep_selector/version.rb
+- lib/dep_selector/version_constraint.rb
+- lib/dep_selector.rb
+homepage: http://github.com/RiotGames/dep-selector-over-http
+licenses:
+- Apache v2
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.11
+signing_key: 
+specification_version: 3
+summary: Given packages, versions, and a dependency graph, find a valid assignment
+  of package versions
+test_files: []