rescuer-task 0.1.0__tar.gz

rescuer_task-0.1.0/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 rescuer-packer
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

rescuer_task-0.1.0/PKG-INFO

@@ -0,0 +1,30 @@
+Metadata-Version: 2.4
+Name: rescuer-task
+Version: 0.1.0
+Summary: Special MILP format using by rescuer packer project
+Author-email: "Vasily Stolbov a.k.a Kotomord" <vasily.v.stolbov@gmail.com>
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: ortools
+Requires-Dist: pytest
+Dynamic: license-file
+
+# rescuer-task
+
+Data classes for special MILP format 
+
+Class RescuerTask contains fields:
+- cont_bounds: upper and lower bonds on continuous variables. Can be null if there are no bonds.
+- rescuer_groups: sizes of groups of binary variables aka rescuers. The sum of variables in a group equals the size of the group minus one.
+- inequalities:  list of inequalities
+
+Class Inequality contains 4 fields:
+- conts: pairs “continuous variable number”-”continuous variable coefficient”
+- constant_term: constant term of the left side of inequality
+- right_coef: multiplier of the right side of inequality
+- rescuers: list of rescuers
+
+If rescuers is null or empty, the inequality is interpreted as “the sum of values of continuous variable with coefficients and the constant term of the left side of inequality <=0”, otherwise it’s interpreted as “the sum of values of continuous variable with coefficients and the constant term of the left side of inequality <=right_coef* sum of rescuers from field rescuers”, where right_coef should be chosen in such a way that if at least one of the rescuers has the value of 1, the inequality is satisfied.
+
+ROADMAP.md contains future plans for the library’s improvements.

rescuer_task-0.1.0/README.md

@@ -0,0 +1,18 @@
+# rescuer-task
+
+Data classes for special MILP format 
+
+Class RescuerTask contains fields:
+- cont_bounds: upper and lower bonds on continuous variables. Can be null if there are no bonds.
+- rescuer_groups: sizes of groups of binary variables aka rescuers. The sum of variables in a group equals the size of the group minus one.
+- inequalities:  list of inequalities
+
+Class Inequality contains 4 fields:
+- conts: pairs “continuous variable number”-”continuous variable coefficient”
+- constant_term: constant term of the left side of inequality
+- right_coef: multiplier of the right side of inequality
+- rescuers: list of rescuers
+
+If rescuers is null or empty, the inequality is interpreted as “the sum of values of continuous variable with coefficients and the constant term of the left side of inequality <=0”, otherwise it’s interpreted as “the sum of values of continuous variable with coefficients and the constant term of the left side of inequality <=right_coef* sum of rescuers from field rescuers”, where right_coef should be chosen in such a way that if at least one of the rescuers has the value of 1, the inequality is satisfied.
+
+ROADMAP.md contains future plans for the library’s improvements.

rescuer_task-0.1.0/pyproject.toml

@@ -0,0 +1,13 @@
+[build-system]
+requires = ["setuptools>=80.0"]
+build-backend = "setuptools.build_meta"
+
+
+[project]
+name = "rescuer-task"
+version = "0.1.0"
+description = "Special MILP format using by rescuer packer project"
+requires-python = ">=3.8"
+readme = "README.md"
+authors = [{name = "Vasily Stolbov a.k.a Kotomord", email = "vasily.v.stolbov@gmail.com"}]
+dependencies = ["ortools", "pytest"]

rescuer_task-0.1.0/rescuer_task/__init__.py

@@ -0,0 +1 @@
+__version__ = "0.1.0"

rescuer_task-0.1.0/rescuer_task/solvers.py

@@ -0,0 +1,84 @@
+from typing import List
+
+from ortools.linear_solver.pywraplp import Solver
+
+from rescuer_task.task import RescuerTask, Inequality
+
+
+def as_milp_task(solver: Solver,  task: RescuerTask):
+    def int_var(var_name):
+        return solver.IntVar(0, 1, var_name)
+
+    return _build_task(solver, task, int_var)
+
+def as_lp_task(solver: Solver, task: RescuerTask):
+    def int_var(var_name):
+        return solver.NumVar(0, 1, var_name)
+    return _build_task(solver, task, int_var)
+
+def as_lp_task_with_point(solver: Solver, task: RescuerTask, point: List[bool], validate_point: bool = False):
+    if validate_point:
+        _check_point_validity(task, point)
+    cont_vars = _build_cont_vars(solver, task)
+    def skip(ineq: Inequality):
+        if ineq.rescuers is not None:
+            for t in ineq.rescuers:
+                if point[t]:
+                    return True
+        return False
+    for inequality in task.inequalities:
+        if skip(inequality):
+            continue
+        solver.Add(_build_left(inequality, cont_vars) <= 0)
+
+def _build_task(solver: Solver, task: RescuerTask, int_var):
+    cont_vars = _build_cont_vars(solver, task)
+    rescuers = []
+    r_pos = 0
+    for c in task.rescuer_groups:
+        rescuer_group = []
+        for i in range(c):
+            rescuer_group.append(int_var('r_' + str(r_pos)))
+            r_pos += 1
+        solver.Add(solver.Sum(rescuer_group) == c - 1)
+        rescuers.extend(rescuer_group)
+    for inequality in task.inequalities:
+        solver.Add(_build_left(inequality, cont_vars) <= _build_right(inequality, rescuers))
+
+    return cont_vars, rescuers
+
+
+def _build_cont_vars(solver: Solver, task: RescuerTask):
+    cont_count = len(task.cont_bounds)
+    cont_vars = []
+    inf = solver.Infinity()
+
+    def num_var(var_name, bounds):
+        lb = bounds[0] if bounds[0] is not None else -inf
+        ub = bounds[1] if bounds[1] is not None else inf
+        return solver.NumVar(lb, ub, var_name)
+
+    for i in range(cont_count):
+        cont_vars.append(num_var('cont_' + str(i), task.cont_bounds[i]))
+    return cont_vars
+
+
+def _build_left(inequality: Inequality, cont_vars):
+    ans = inequality.constant_term
+    if inequality.conts is not None:
+        for k, v in inequality.conts.items():
+            ans += cont_vars[k]*v
+    return ans
+
+def _build_right(inequality: Inequality, rescuers):
+    if inequality.rescuers is None:
+        return 0
+    if len(inequality.rescuers) == 0:
+        return 0
+    ans = 0
+    for r in inequality.rescuers:
+        ans += rescuers[r]
+    return ans * inequality.right_coef
+
+def _check_point_validity(task: RescuerTask, point: List[int]):
+    pass #TODO

rescuer_task-0.1.0/rescuer_task/task.py

@@ -0,0 +1,16 @@
+from typing import Dict, List
+
+
+class Inequality:
+    def __init__(self, conts: Dict[int, float]|None, constant_term: float, right_coef: float, rescuers: List[int] | None):
+        self.conts = conts
+        self.constant_term = constant_term
+        self.right_coef = right_coef
+        self.rescuers = rescuers
+
+
+class RescuerTask:
+    def __init__(self):
+        self.inequalities: List[Inequality] = []
+        self.rescuer_groups: List[int] = []
+        self.cont_bounds: List[List[float]] = []

rescuer_task-0.1.0/rescuer_task/vaildator.py

@@ -0,0 +1,5 @@
+from .task import RescuerTask
+
+
+def validate(task: RescuerTask,  optimize: bool = False):
+    pass #TODO

rescuer_task-0.1.0/rescuer_task.egg-info/PKG-INFO

@@ -0,0 +1,30 @@
+Metadata-Version: 2.4
+Name: rescuer-task
+Version: 0.1.0
+Summary: Special MILP format using by rescuer packer project
+Author-email: "Vasily Stolbov a.k.a Kotomord" <vasily.v.stolbov@gmail.com>
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: ortools
+Requires-Dist: pytest
+Dynamic: license-file
+
+# rescuer-task
+
+Data classes for special MILP format 
+
+Class RescuerTask contains fields:
+- cont_bounds: upper and lower bonds on continuous variables. Can be null if there are no bonds.
+- rescuer_groups: sizes of groups of binary variables aka rescuers. The sum of variables in a group equals the size of the group minus one.
+- inequalities:  list of inequalities
+
+Class Inequality contains 4 fields:
+- conts: pairs “continuous variable number”-”continuous variable coefficient”
+- constant_term: constant term of the left side of inequality
+- right_coef: multiplier of the right side of inequality
+- rescuers: list of rescuers
+
+If rescuers is null or empty, the inequality is interpreted as “the sum of values of continuous variable with coefficients and the constant term of the left side of inequality <=0”, otherwise it’s interpreted as “the sum of values of continuous variable with coefficients and the constant term of the left side of inequality <=right_coef* sum of rescuers from field rescuers”, where right_coef should be chosen in such a way that if at least one of the rescuers has the value of 1, the inequality is satisfied.
+
+ROADMAP.md contains future plans for the library’s improvements.

rescuer_task-0.1.0/rescuer_task.egg-info/SOURCES.txt

@@ -0,0 +1,12 @@
+LICENSE
+README.md
+pyproject.toml
+rescuer_task/__init__.py
+rescuer_task/solvers.py
+rescuer_task/task.py
+rescuer_task/vaildator.py
+rescuer_task.egg-info/PKG-INFO
+rescuer_task.egg-info/SOURCES.txt
+rescuer_task.egg-info/dependency_links.txt
+rescuer_task.egg-info/requires.txt
+rescuer_task.egg-info/top_level.txt

rescuer_task-0.1.0/rescuer_task.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

rescuer_task-0.1.0/rescuer_task.egg-info/requires.txt

@@ -0,0 +1,2 @@
+ortools
+pytest

rescuer_task-0.1.0/rescuer_task.egg-info/top_level.txt

@@ -0,0 +1 @@
+rescuer_task

rescuer_task-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+