or-tools 0.16.1 → 0.16.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: dee4a87960e33b5a357e9549cac01fadbbed11aa0e7b8fda11355383f01f853c
-  data.tar.gz: 5cb68b2fb6beb48cf73f5d78fc14930a274da58bf8c743d5199588b4283bd3c7
+  metadata.gz: 89bf514a3bb90453c41d32c13dc1eb00130d3fb78da594540517c47d4cc7cb91
+  data.tar.gz: 2cb6aecf6356e93b334abf4a05fab50c08c115973414d5bb0be771685e3e09c2
 SHA512:
-  metadata.gz: ab8788f734a9b525c9d7f385fc32947430c9727aec659a5f898436159a8e90684031508fb5f6bf099381821ff184344f101a52c90e23f716a2bf46f91e7e78e1
-  data.tar.gz: 5b90c3c913f171e464da6c162659a7e4fc896fa30f6996e21d145b07f93d4a925d71af71d1ddee2eab27f1850545715abd2016bb52f6b6151badc06eb8a6f37a
+  metadata.gz: 71dc044a44a5d792b07d6cf956f6f5e033fa23f0ab02149ffd75bfb0a08d26a58545af32089957dc0632018a0433cf7764fb12f9a90ca1ed58b5723d4b9c5dd1
+  data.tar.gz: fed9575f36012944b25d8162367ed78a0beea5b53f76d232ce80a58ea1a18fca8d7ed2cc32b728f4573d3d2fe5d9c7a6de836fe6a9b409287507c9a68f4d6fd1

data/CHANGELOG.md

@@ -1,3 +1,11 @@
+## 0.16.3 (2026-01-05)
+
+- Fixed errors with Rice 4.9
+
+## 0.16.2 (2026-01-02)
+
+- Fixed error with Rice 4.8
+
 ## 0.16.1 (2025-10-26)
 
 - Added `add_allowed_assignments` and `add_forbidden_assignments` methods to `CpModel`

data/NOTICE.txt

@@ -1,5 +1,5 @@
 Copyright 2010-2025 Google LLC
-Copyright 2020-2025 Andrew Kane
+Copyright 2020-2026 Andrew Kane
 
 Licensed under the Apache License, Version 2.0 (the "License");
 you may not use this file except in compliance with the License.

data/ext/or-tools/bin_packing.cpp

@@ -24,7 +24,7 @@ namespace Rice::detail {
 
     explicit From_Ruby(Arg* arg) : arg_(arg) { }
 
-    Convertible is_convertible(VALUE value) { return Convertible::Cast; }
+    double is_convertible(VALUE value) { return Convertible::Exact; }
 
     KnapsackSolver::SolverType convert(VALUE x) {
       auto s = Symbol(x).str();

data/ext/or-tools/constraint.cpp

@@ -44,7 +44,7 @@ namespace Rice::detail {
 
     explicit From_Ruby(Arg* arg) : arg_(arg) { }
 
-    Convertible is_convertible(VALUE value) { return Convertible::Cast; }
+    double is_convertible(VALUE value) { return Convertible::Exact; }
 
     LinearExpr convert(VALUE v) {
       LinearExpr expr;

data/ext/or-tools/linear.cpp

@@ -30,7 +30,7 @@ namespace Rice::detail {
 
     explicit From_Ruby(Arg* arg) : arg_(arg) { }
 
-    Convertible is_convertible(VALUE value) { return Convertible::Cast; }
+    double is_convertible(VALUE value) { return Convertible::Exact; }
 
     static MPSolver::OptimizationProblemType convert(VALUE x) {
       auto s = Symbol(x).str();
@@ -172,21 +172,21 @@ void init_linear(Rice::Module& m) {
     .define_singleton_function(
       "_new",
       [](const std::string& name, MPSolver::OptimizationProblemType problem_type) {
-        std::unique_ptr<MPSolver> solver(new MPSolver(name, problem_type));
+        MPSolver* solver = new MPSolver(name, problem_type);
         if (!solver) {
           throw std::runtime_error("Unrecognized solver type");
         }
         return solver;
-      })
+      }, Rice::Return().takeOwnership())
     .define_singleton_function(
       "_create",
       [](const std::string& solver_id) {
-        std::unique_ptr<MPSolver> solver(MPSolver::CreateSolver(solver_id));
+        MPSolver* solver = MPSolver::CreateSolver(solver_id);
         if (!solver) {
           throw std::runtime_error("Unrecognized solver type");
         }
         return solver;
-      })
+      }, Rice::Return().takeOwnership())
     .define_method(
       "time_limit=",
       [](MPSolver& self, double time_limit) {

data/ext/or-tools/math_opt.cpp

@@ -29,7 +29,7 @@ namespace Rice::detail {
 
     explicit From_Ruby(Arg* arg) : arg_(arg) { }
 
-    Convertible is_convertible(VALUE value) { return Convertible::Cast; }
+    double is_convertible(VALUE value) { return Convertible::Exact; }
 
     static SolverType convert(VALUE x) {
       auto s = Symbol(x).str();

data/ext/or-tools/routing.cpp

@@ -40,7 +40,7 @@ namespace Rice::detail {
 
     explicit From_Ruby(Arg* arg) : arg_(arg) { }
 
-    Convertible is_convertible(VALUE value) { return Convertible::Cast; }
+    double is_convertible(VALUE value) { return Convertible::Exact; }
 
     RoutingNodeIndex convert(VALUE x) {
       const RoutingNodeIndex index{From_Ruby<int>().convert(x)};
@@ -65,6 +65,35 @@ namespace Rice::detail {
   private:
     Arg* arg_ = nullptr;
   };
+
+  template<>
+  struct Type<RoutingModel::PenaltyCostBehavior> {
+    static bool verify() { return true; }
+  };
+
+  template<>
+  class From_Ruby<RoutingModel::PenaltyCostBehavior> {
+  public:
+    From_Ruby() = default;
+
+    explicit From_Ruby(Arg* arg) : arg_(arg) { }
+
+    double is_convertible(VALUE value) { return Convertible::Exact; }
+
+    RoutingModel::PenaltyCostBehavior convert(VALUE x) {
+      auto s = Symbol(x).str();
+      if (s == "penalize_once") {
+        return RoutingModel::PenaltyCostBehavior::PENALIZE_ONCE;
+      } else if (s == "penalize_per_inactive") {
+        return RoutingModel::PenaltyCostBehavior::PENALIZE_PER_INACTIVE;
+      } else {
+        throw std::runtime_error("Unknown penalty cost behavior: " + s);
+      }
+    }
+
+  private:
+    Arg* arg_ = nullptr;
+  };
 } // namespace Rice::detail
 
 void init_routing(Rice::Module& m) {
@@ -347,7 +376,7 @@ void init_routing(Rice::Module& m) {
     .define_method("add_resource_group", &RoutingModel::AddResourceGroup)
     .define_method("dimension_resource_group_indices", &RoutingModel::GetDimensionResourceGroupIndices)
     .define_method("dimension_resource_group_index", &RoutingModel::GetDimensionResourceGroupIndex)
-    .define_method("add_disjunction", &RoutingModel::AddDisjunction, Rice::Arg("_indices"), Rice::Arg("_penalty"), Rice::Arg("_max_cardinality") = static_cast<int64_t>(1), Rice::Arg("_penalty_cost_behavior") = RoutingModel::PenaltyCostBehavior::PENALIZE_ONCE)
+    .define_method("_add_disjunction", &RoutingModel::AddDisjunction)
     .define_method("disjunction_indices", &RoutingModel::GetDisjunctionIndices)
     .define_method("disjunction_penalty", &RoutingModel::GetDisjunctionPenalty)
     .define_method("disjunction_max_cardinality", &RoutingModel::GetDisjunctionMaxCardinality)

data/lib/or_tools/routing_model.rb

@@ -17,5 +17,9 @@ module ORTools
       search_parameters.log_search = log_search unless log_search.nil?
       solve_with_parameters(search_parameters)
     end
+
+    def add_disjunction(indices, penalty, max_cardinality = 1, penalty_cost_behavior = :penalize_once)
+      _add_disjunction(indices, penalty, max_cardinality, penalty_cost_behavior)
+    end
   end
 end

data/lib/or_tools/version.rb

@@ -1,3 +1,3 @@
 module ORTools
-  VERSION = "0.16.1"
+  VERSION = "0.16.3"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: or-tools
 version: !ruby/object:Gem::Version
-  version: 0.16.1
+  version: 0.16.3
 platform: ruby
 authors:
 - Andrew Kane
@@ -15,14 +15,14 @@ dependencies:
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
-        version: '4.7'
+        version: '4.8'
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
-        version: '4.7'
+        version: '4.8'
 email: andrew@ankane.org
 executables: []
 extensions:
@@ -85,7 +85,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.6.9
+rubygems_version: 4.0.3
 specification_version: 4
 summary: Operations research tools for Ruby
 test_files: []