feat: 初始化Easy Patch插件及依赖文件

- 添加Blender插件核心文件：__init__.py、ui.py、property.py、preference.py
- 添加插件工具模块：g.py、loop.py、generate_loop.py、const.py、op.py
- 添加翻译工具：utils/trans.py
- 添加PuLP线性规划库及其依赖文件，包括CBC求解器二进制文件
- 添加.gitignore和VSCode配置文件

utils/pulp/constants.py

@@ -0,0 +1,104 @@
+# PuLP : Python LP Modeler
+
+# Copyright (c) 2002-2005, Jean-Sebastien Roy (js@jeannot.org)
+# Modifications Copyright (c) 2007- Stuart Anthony Mitchell (s.mitchell@auckland.ac.nz)
+# $Id:constants.py 1791 2008-04-23 22:54:34Z smit023 $
+
+# 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."""
+
+"""
+This file contains the constant definitions for PuLP
+Note that hopefully these will be changed into something more pythonic
+"""
+VERSION = "2.7.0"
+EPS = 1e-7
+
+# variable categories
+LpContinuous = "Continuous"
+LpInteger = "Integer"
+LpBinary = "Binary"
+LpCategories = {LpContinuous: "Continuous", LpInteger: "Integer", LpBinary: "Binary"}
+
+# objective sense
+LpMinimize = 1
+LpMaximize = -1
+LpSenses = {LpMaximize: "Maximize", LpMinimize: "Minimize"}
+LpSensesMPS = {LpMaximize: "MAX", LpMinimize: "MIN"}
+
+# problem status
+LpStatusNotSolved = 0
+LpStatusOptimal = 1
+LpStatusInfeasible = -1
+LpStatusUnbounded = -2
+LpStatusUndefined = -3
+LpStatus = {
+    LpStatusNotSolved: "Not Solved",
+    LpStatusOptimal: "Optimal",
+    LpStatusInfeasible: "Infeasible",
+    LpStatusUnbounded: "Unbounded",
+    LpStatusUndefined: "Undefined",
+}
+
+# solution status
+LpSolutionNoSolutionFound = 0
+LpSolutionOptimal = 1
+LpSolutionIntegerFeasible = 2
+LpSolutionInfeasible = -1
+LpSolutionUnbounded = -2
+LpSolution = {
+    LpSolutionNoSolutionFound: "No Solution Found",
+    LpSolutionOptimal: "Optimal Solution Found",
+    LpSolutionIntegerFeasible: "Solution Found",
+    LpSolutionInfeasible: "No Solution Exists",
+    LpSolutionUnbounded: "Solution is Unbounded",
+}
+LpStatusToSolution = {
+    LpStatusNotSolved: LpSolutionInfeasible,
+    LpStatusOptimal: LpSolutionOptimal,
+    LpStatusInfeasible: LpSolutionInfeasible,
+    LpStatusUnbounded: LpSolutionUnbounded,
+    LpStatusUndefined: LpSolutionInfeasible,
+}
+
+# constraint sense
+LpConstraintLE = -1
+LpConstraintEQ = 0
+LpConstraintGE = 1
+LpConstraintTypeToMps = {LpConstraintLE: "L", LpConstraintEQ: "E", LpConstraintGE: "G"}
+LpConstraintSenses = {LpConstraintEQ: "=", LpConstraintLE: "<=", LpConstraintGE: ">="}
+# LP line size
+LpCplexLPLineSize = 78
+
+
+def isiterable(obj):
+    try:
+        obj = iter(obj)
+    except:
+        return False
+    else:
+        return True
+
+
+class PulpError(Exception):
+    """
+    Pulp Exception Class
+    """
+
+    pass