dep_selector 0.0.1

data/ext/dep_gecode/dep_selector_to_gecode.h

@@ -0,0 +1,136 @@
+//
+// 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.
+//
+
+#ifndef dep_selector_to_gecode_h
+#define dep_selector_to_gecode_h
+
+#include "dep_selector_to_gecode_interface.h"
+#include <iostream>	       
+#include <vector>
+
+#include <gecode/driver.hh>
+#include <gecode/int.hh>
+#include <gecode/minimodel.hh>
+
+using namespace Gecode;
+
+// TODO:
+// Allow retrieval of multiple solutions
+// Understand how assign versions where necessary, and not assign unnecessary versions.
+// Understand how to assign empty versions
+//
+
+// Extend:
+// Add optimization functions
+// Allow non-contiguous ranges in package dependencies. 
+
+class VersionProblem : public Space
+{
+ public:
+  static const int UNRESOLVED_VARIABLE;
+  static const int MIN_TRUST_LEVEL;  
+  static const int MAX_TRUST_LEVEL;
+  static const int MAX_PREFERRED_WEIGHT;
+
+  VersionProblem(int packageCount);
+  // Clone constructor; check gecode rules for this...
+  VersionProblem(bool share, VersionProblem & s);
+  virtual ~VersionProblem();
+
+  int Size();
+  int PackageCount();
+
+  IntVar & GetPackageVersionVar(int packageId);
+
+  virtual int AddPackage(int minVersion, int maxVersion, int currentVersion);
+
+  virtual bool AddVersionConstraint(int packageId, int version, 
+			    int dependentPackageId, int minDependentVersion, int maxDependentVersion);
+
+  // We may wish to indicate that some packages have suspicious constraints, and when chosing packages to disable we 
+  // would disable them first. 
+  void MarkPackageSuspicious(int packageId);
+
+  void MarkPackageRequired(int packageId); 
+
+  // Packages marked by this method are preferentially chosen at
+  // latest according to weights
+  void MarkPackagePreferredToBeAtLatest(int packageId, int weight);
+
+  void Finalize();
+  
+  virtual void constrain(const Space & _best_known_solution);
+
+  int GetPackageVersion(int packageId);
+  bool GetPackageDisabledState(int packageId);
+  int GetMax(int packageId);
+  int GetMin(int packageId);
+  int GetDisabledVariableCount();
+  
+  // Support for gecode
+  virtual Space* copy(bool share);
+
+  // Debug and utility functions
+  void Print(std::ostream &out);
+  void PrintPackageVar(std::ostream & out, int packageId) ;
+
+  static VersionProblem *Solve(VersionProblem *problem);
+ 
+
+ protected:
+  int size;
+  int cur_package;
+  bool CheckPackageId(int id);
+  bool finalized;
+  //  std::vector<int> test;
+  BoolVarArgs version_flags;
+  IntVarArray package_versions;
+  BoolVarArray disabled_package_variables;
+  IntVar total_disabled;
+
+  IntVar total_required_disabled;
+  IntVar total_induced_disabled;
+  IntVar total_suspicious_disabled;
+
+  BoolVarArray at_latest;
+  IntVar total_preferred_at_latest;
+  IntVar total_not_preferred_at_latest;
+
+  int * disabled_package_weights;
+  int * preferred_at_latest_weights;
+  int * is_required;
+  int * is_suspicious;
+
+  void AddPackagesPreferredToBeAtLatestObjectiveFunction(const VersionProblem & best_known_solution);
+  void ConstrainVectorLessThanBest(IntVarArgs & current, IntVarArgs & best);
+  void BuildCostVector(IntVarArgs & costVector) const;
+};
+
+template<class T> void PrintVarAligned(const char * message, T & var);
+template<class S, class T> void PrintVarAligned(const char * message, S & var1, T & var2);
+
+class Solver {
+ public:
+  Solver(VersionProblem *s);
+  VersionProblem GetNextSolution();
+ private:
+  Restart<VersionProblem> solver;
+};
+
+#endif dep_selector_to_gecode_h

data/ext/dep_gecode/dep_selector_to_gecode_interface.cpp

@@ -0,0 +1,122 @@
+//
+// 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.
+//
+
+#include <iostream>
+
+#include "dep_selector_to_gecode_interface.h"
+#include "dep_selector_to_gecode.h"
+//#include "version_problem_oc_ih.h"
+
+//
+// TODO:
+//  Trap all exceptions
+//  insure proper memory behaviour
+
+// FFI friendly
+VersionProblem * VersionProblemCreate(int packageCount) 
+{
+  return new VersionProblem(packageCount);
+}
+
+void VersionProblemDestroy(VersionProblem * p)
+{
+  delete p;
+}
+
+int VersionProblemSize(VersionProblem *p) 
+{
+  return p->Size();
+}
+
+int VersionProblemPackageCount(VersionProblem *p) 
+{
+  return p->PackageCount();
+}
+
+
+
+void VersionProblemDump(VersionProblem *p)
+{
+  p->Print(std::cout);
+  std::cout.flush();
+}
+
+void VersionProblemPrintPackageVar(VersionProblem *p, int packageId) 
+{
+  p->PrintPackageVar(std::cout, packageId);
+  std::cout.flush();
+}
+
+// Return ID #
+int AddPackage(VersionProblem *problem, int min, int max, int currentVersion) {
+  problem->AddPackage(min,max,currentVersion);
+}
+// Add constraint for package pkg @ version, 
+// that dependentPackage is at version [minDependentVersion,maxDependentVersion]
+// Returns false if system becomes insoluble.
+bool AddVersionConstraint(VersionProblem *problem, int packageId, int version, 
+			  int dependentPackageId, int minDependentVersion, int maxDependentVersion) 
+{
+  problem->AddVersionConstraint(packageId, version, dependentPackageId, minDependentVersion, maxDependentVersion);
+}
+
+void MarkPackageSuspicious(VersionProblem *problem, int packageId) 
+{
+  problem->MarkPackageSuspicious(packageId);
+}
+
+void MarkPackagePreferredToBeAtLatest(VersionProblem *problem, int packageId, int weight)
+{
+  problem->MarkPackagePreferredToBeAtLatest(packageId, weight);
+}
+
+void MarkPackageRequired(VersionProblem *problem, int packageId)
+{
+  problem->MarkPackageRequired(packageId);
+}
+
+int GetPackageVersion(VersionProblem *problem, int packageId)
+{
+  problem->GetPackageVersion(packageId);
+}
+
+bool GetPackageDisabledState(VersionProblem *problem, int packageId)
+{
+  problem->GetPackageDisabledState(packageId);
+}
+
+int GetPackageMax(VersionProblem *problem, int packageId)
+{
+  problem->GetMax(packageId);
+}
+
+int GetPackageMin(VersionProblem *problem, int packageId)
+{
+  problem->GetMin(packageId);
+}
+
+int GetDisabledVariableCount(VersionProblem *problem)
+{
+  problem->GetDisabledVariableCount();
+}
+
+
+VersionProblem * Solve(VersionProblem * problem)  {
+  return VersionProblem::Solve(problem);
+}

data/ext/dep_gecode/dep_selector_to_gecode_interface.h

@@ -0,0 +1,70 @@
+//
+// 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.
+//
+
+#ifndef dep_selector_to_gecode_interface_h
+#define dep_selector_to_gecode_interface_h
+
+// Conceptual Api
+#ifdef __cplusplus
+extern "C" {
+#endif __cplusplus
+
+#ifdef __cplusplus
+  class VersionProblem;
+#else
+  typedef struct VersionProblem VersionProblem;
+#endif
+
+  VersionProblem * VersionProblemCreate(int packageCount);
+  void VersionProblemDestroy(VersionProblem * vp);
+
+
+  int VersionProblemSize(VersionProblem *p);
+  int VersionProblemPackageCount(VersionProblem *p);
+
+  // Return ID #
+  int AddPackage(VersionProblem *problem, int min, int max, int currentVersion);
+  // Add constraint for package pkg @ version, 
+  // that dependentPackage is at version [minDependentVersion,maxDependentVersion]
+  // Returns false if system becomes insoluble.
+  bool AddVersionConstraint(VersionProblem *problem, int packageId, int version, 
+			    int dependentPackageId, int minDependentVersion, int maxDependentVersion);
+
+  void MarkPackageSuspicious(VersionProblem *problem, int packageId);
+  void MarkPackageRequired(VersionProblem *problem, int packageId);
+  void MarkPackagePreferredToBeAtLatest(VersionProblem *problem, int packageId, int weight);
+
+  int GetPackageVersion(VersionProblem *problem, int packageId);
+  bool GetPackageDisabledState(VersionProblem *problem, int packageId);
+
+  int GetPackageMax(VersionProblem *problem, int packageId);
+  int GetPackageMin(VersionProblem *problem, int packageId);
+
+  int GetDisabledVariableCount(VersionProblem *problem);
+
+  void VersionProblemDump(VersionProblem * problem);
+  void VersionProblemPrintPackageVar(VersionProblem * problem, int packageId);
+
+  VersionProblem * Solve(VersionProblem * problem);
+
+#ifdef __cplusplus
+}
+#endif __cplusplus
+
+#endif // dep_selector_to_gecode_interface_h

data/ext/dep_gecode/extconf.rb

@@ -0,0 +1,36 @@
+#
+# 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.
+#
+
+#
+# GECODE needs to be built with 
+# ./configure --with-architectures=i386,x86_64
+# to work properly here.
+require 'mkmf'
+
+$LIBS << " -lstdc++"
+
+#$CFLAGS << "-g"
+
+have_library('gecodesearch')
+have_library('gecodeint')
+have_library('gecodekernel')
+have_library('gecodesupport')
+have_library('gecodeminimodel')
+
+create_makefile('dep_gecode')

data/ext/dep_gecode/lib/dep_selector_to_gecode.rb

@@ -0,0 +1,11 @@
+#!/usr/bin/ruby
+
+
+require "ffi"
+
+module VersionProblem
+  extend FFI:Library
+#  ffi_lib FFI:Library:????
+  attach_function 'VersionProblemCreate', [ ], :pointer
+  attach_function 'VersionProblemDump', [ :pointer ], :void
+end

data/lib/dep_selector.rb

@@ -0,0 +1,32 @@
+#
+# 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/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'

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