openforge 0.1.0__py3-none-any.whl

OpenForge/ibrahim/Markov_Chains_Module.py

@@ -0,0 +1,157 @@
+import numpy as np
+import random
+
+class MarkovChains:
+    def __init__(self,data:list,lvl=6):
+        """
+        Markov Chain-based sequence predictor.
+
+        Made By: Muhammad Ibrahim
+            https://github.com/Ibraheem5002/
+        
+        Parameters:
+        -----------
+        data : list
+            List of possible outcome values
+            Best case if all are of same data type
+
+        lvl : int (optional)
+            Maximum pattern length to track (n-gram order)
+            Default value = 6
+        """
+
+        self.in_hist = []
+        self.patterns = {}
+        self.ops = data
+        self.N = len(self.ops)
+        self.probability = np.full(self.N,1/self.N)
+        self.in_op = None
+        self.out_op = None
+        self.Level = lvl
+    
+    def _add_pattern(self,key,Z):
+        if key in self.patterns:
+            self.patterns[key].append(Z)
+        else:
+            self.patterns[key] = [Z]
+    
+    def _update_pattern(self):
+        self.in_hist.append(self.in_op)
+
+        for L in range(1,self.Level+1):
+            if len(self.in_hist) >= L+1:
+                key = tuple(self.in_hist[-(L+1):-1])
+                Z = self.in_hist[-1]
+                self._add_pattern(key,Z)
+    
+    def _normalize_prob(self):
+        total = sum(self.probability)
+
+        if total <= 0:
+            self.probability = np.full(self.N,1/self.N)
+        else:
+            self.probability = self.probability / total
+    
+    def _cal_probability(self,key):
+        lst = self.patterns[key]
+        total = len(lst)
+
+        if total > 0:
+            for i in range(self.N):
+                self.probability[i] = lst.count(self.ops[i]) / total
+        else:
+            self.probability = np.full(self.N,1/self.N)
+        
+        self._normalize_prob()
+    
+    def _choose_ans(self):
+        sorted_prob = sorted(self.probability,reverse=True)
+        best = sorted_prob[0]
+        scnd = sorted_prob[1]
+
+        if best-scnd > 0.15:
+            max_idx = list(self.probability).index(best)
+            return self.ops[max_idx]
+        else:
+            return np.random.choice(self.ops,p=self.probability)
+    
+    def _predict_ans(self):
+        self.probability = np.full(self.N,1/self.N)
+        probs = []
+        pLen = []
+
+        for L in range(self.Level,0,-1):
+            if len(self.in_hist) < L:
+                continue
+
+            key = tuple(self.in_hist[-L:])
+
+            if key in self.patterns:
+                self._cal_probability(key)
+                probs.append(self.probability.copy())
+                pLen.append(len(self.patterns[key]))
+
+        if len(probs) == 0:
+            self.out_op = random.choice(self.ops)
+        else:
+            mx = -100000
+            idx = -1
+
+            for i in range(len(probs)):
+                pMax = max(probs[i])
+                score = pMax * pLen[i]
+
+                if score > mx:
+                    mx = score
+                    idx = i
+            
+            self.probability = probs[idx]
+            self.out_op = self._choose_ans()
+    
+    def predict(self,X):
+        """
+        Make prediction and update patterns.
+        If first call, then output is total random
+        
+        Parameters:
+        -----------
+        X : any
+            Observed input (must be in self.ops)
+            
+        Returns:
+            Predicted next outcome
+        """
+
+        if X not in self.ops:
+            raise ValueError(f"Input {X} is not in valid operations: {self.ops}")
+
+        self.in_op = X
+        self._predict_ans()
+        self._update_pattern()
+        return self.out_op
+    
+    def fit(self,lst:list):
+        """
+        Reset and fit new sequence of observed data
+        All elements must be of given outcomes
+
+        Parameters:
+        -----------
+        lst : List
+            List of all observed input values
+        """
+
+        for i in range(len(lst)):
+            if lst[i] not in self.ops:
+                raise ValueError(f"Input {lst[i]} is not in valid operations: {self.ops}")
+
+        self.reset()
+        self.in_hist = lst
+    
+    def reset(self):
+        """Reset the model to initial state"""
+        self.in_hist = []
+        self.patterns = {}
+        self.probability = np.full(self.N,1/self.N)
+        self.in_op = None
+        self.out_op = None

openforge-0.1.0.dist-info/METADATA

@@ -0,0 +1,62 @@
+Metadata-Version: 2.4
+Name: openforge
+Version: 0.1.0
+Summary: A public repository and museum for high-quality, reinvented machine learning modules and core computing algorithms.
+Author-email: Muhammad Ibrahim <ibrahim@example.com>
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Intended Audience :: Developers
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+License-File: LICENSE.txt
+Dynamic: license-file
+
+# OpenForge
+
+Welcome to **OpenForge**! This is a public Python library built for developers who love to build things from scratch. 
+
+Have you ever spent days coding a custom Linear Regression algorithm, a unique Markov Chain module, or a custom game engine just to learn how it works under the hood? You can't merge it into major libraries like Scikit-Learn because they already have it—but your hard work shouldn't be wasted. 
+
+This library is a **museum of reinvented wheels**. It is a place to publish your custom-built modules, showcase your engineering grit, and leave your permanent mark on the open-source world.
+
+---
+
+## 🛠️ How It Works (The Import Layout)
+
+To prevent anyone's code from overwriting someone else's, every single developer gets their own isolated **username space**. Users can import your exact code using this clean layout:
+
+```python
+# If your username is 'alex' and you built a tictactoe bot
+from artisan_wheelhouse.alex import infinite_tictactoe
+
+# If your username is 'sarah' and you organized your ML modules
+from artisan_wheelhouse.sarah.ml.supervised import linear_regression
+```
+
+---
+
+## 📜 The Rules for Publishing
+
+Anyone is welcome to contribute! To keep the library clean, functional, and organized, all submissions must follow these simple rules:
+
+1. **Anyone Can Publish:** Whether you are a computer science student or a senior engineer, if you built something from scratch to learn, you can submit it.
+2. **Unique Usernames:** Your username folder must be completely unique. Once a username is taken, it belongs to that developer.
+3. **Username Format:** Your username folder name must be **all lowercase** and contain **no spaces** (use underscores if needed, e.g., `john_doe`). It must be a valid Python identifier.
+4. **Strict Boundaries:** You can only add or modify files inside your own specific username folder. Touching or modifying another user's folder will result in immediate rejection.
+5. **The `__init__.py` Requirement:** Every folder and sub-folder you create inside your namespace **must** contain an `__init__.py` file so Python can find and import your modules correctly.
+6. **Honest & Working Code:** Your module must do exactly what it claims to do. It will be carefully reviewed. If it contains game-breaking bugs, malicious code, or does not work as advertised, it will be rejected.
+7. **Keep Dependencies Low:** Try to use vanilla Python or basic standard libraries. If your module requires heavy external packages, explain why in your pull request.
+
+---
+
+## 🚀 How to Submit Your Module
+
+1. **Fork** the repository on GitHub.
+2. Create your unique username folder under `artisan_wheelhouse/` (e.g., `artisan_wheelhouse/your_username/`).
+3. Add an empty `__init__.py` file inside your folder.
+4. Write your beautiful code, organize it into categories if you like, and include a short docstring explaining how to use it.
+5. Open a **Pull Request (PR)**. Once reviewed and merged, your code will be bundled into the next official PyPI release for everyone to `pip install`!
+
+*Let's build, reinvent, and leave a mark!*

openforge-0.1.0.dist-info/RECORD

@@ -0,0 +1,7 @@
+OpenForge/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+OpenForge/ibrahim/Markov_Chains_Module.py,sha256=3vm4Zw2vNW9Zsi6kr7UmuXJ2GjvmTzkRXZ2GyVv92dc,4456
+openforge-0.1.0.dist-info/licenses/LICENSE.txt,sha256=GVkeeBv0Ma8dGvCFfltufWE2fP0C2A5Q1udfqQ-lXQ0,1092
+openforge-0.1.0.dist-info/METADATA,sha256=xGOaq-5jeb0_1pN5tPjT3AOXv5Swq-T7eGgCcpZyBHU,3758
+openforge-0.1.0.dist-info/WHEEL,sha256=aeYiig01lYGDzBgS8HxWXOg3uV61G9ijOsup-k9o1sk,91
+openforge-0.1.0.dist-info/top_level.txt,sha256=VgKNmRVFbcwVtxmy2yHT-LzmBSdpWteh4uAp0E_YuzE,10
+openforge-0.1.0.dist-info/RECORD,,

openforge-0.1.0.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (82.0.1)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

openforge-0.1.0.dist-info/licenses/LICENSE.txt

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Muhammad Ibrahim
+
+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.

openforge-0.1.0.dist-info/top_level.txt

@@ -0,0 +1 @@
+OpenForge