iita-python 1.4.4__tar.gz → 1.4.5__tar.gz

{iita_python-1.4.4/iita_python.egg-info → iita_python-1.4.5}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: iita_python
-Version: 1.4.4
+Version: 1.4.5
 Summary: IITA algorithm in python
 Author-email: Aliaksei Badnarchuk <alexejbodnarchuk@gmail.com>
 Requires-Python: >=3.9

{iita_python-1.4.4 → iita_python-1.4.5}/iita_python/_version.py

@@ -18,7 +18,7 @@ version_tuple: tuple[int | str, ...]
 commit_id: str | None
 __commit_id__: str | None
 
-__version__ = version = '1.4.4'
-__version_tuple__ = version_tuple = (1, 4, 4)
+__version__ = version = '1.4.5'
+__version_tuple__ = version_tuple = (1, 4, 5)
 
-__commit_id__ = commit_id = 'g2692f8c6e'
+__commit_id__ = commit_id = 'gca397753e'

{iita_python-1.4.4 → iita_python-1.4.5}/iita_python/quasiorder.py

@@ -3,12 +3,12 @@ import numpy.typing as npt
 import pandas as pd
 
 class QuasiOrder:
-    knowledge_space = None
+    _knowledge_space = None
     full_matrix: np.ndarray
 
     def __init__(self, matrix: np.ndarray, knowledge_space: np.ndarray|None = None):
         self.full_matrix = matrix
-        self.knowledge_space = knowledge_space if knowledge_space is not None else self.get_knowledge_space()
+        self._knowledge_space = knowledge_space
 
     def get_edge_list(self, buff=0):
         """
@@ -24,7 +24,7 @@ class QuasiOrder:
                 if (self.full_matrix[i][j]):
                     edge_list.append([i+buff, j+buff])
         
-        return edge_list   
+        return edge_list
     
     def get_knowledge_space(self, override: bool = False) -> npt.NDArray[np.int_]:
         """
@@ -33,8 +33,8 @@ class QuasiOrder:
         and the columns represent the items. An entry is 1 if the item is in the knowledge state, and 0 otherwise.
         """
 
-        if (self.knowledge_space is not None and not override):
-            return self.knowledge_space
+        if (self._knowledge_space is not None and not override):
+            return self._knowledge_space
 
         n = self.full_matrix.shape[0]
 
@@ -58,11 +58,15 @@ class QuasiOrder:
         masks = np.array(sorted(knowledge_space_set), dtype=object)
         knowledge_space_matrix = ((masks[:, None] & bits) != 0).astype(np.int_)
 
-        if (self.knowledge_space is None or override):
-            self.knowledge_space = knowledge_space_matrix
+        if (self._knowledge_space is None or override):
+            self._knowledge_space = knowledge_space_matrix
 
         return knowledge_space_matrix
 
+    @property
+    def knowledge_space(self):
+        return self.get_knowledge_space()
+
 def ind_gen(counterexamples: pd.DataFrame) -> list[QuasiOrder]:
     """
     Inductively generates quasiorders from counterexample count DataFrame\n

{iita_python-1.4.4 → iita_python-1.4.5/iita_python.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: iita_python
-Version: 1.4.4
+Version: 1.4.5
 Summary: IITA algorithm in python
 Author-email: Aliaksei Badnarchuk <alexejbodnarchuk@gmail.com>
 Requires-Python: >=3.9

iita_python-1.4.5/iita_python.egg-info/scm_version.json

@@ -0,0 +1,8 @@
+{
+  "tag": "1.4.5",
+  "distance": 0,
+  "node": "gca397753e545a477fc93ee18a09c02b4981e03fc",
+  "dirty": false,
+  "branch": "HEAD",
+  "node_date": "2026-11-07"
+}

iita_python-1.4.4/iita_python.egg-info/scm_version.json

@@ -1,8 +0,0 @@
-{
-  "tag": "1.4.4",
-  "distance": 0,
-  "node": "g2692f8c6edf6743d34e5e4e79295e1c64f4fa61d",
-  "dirty": false,
-  "branch": "HEAD",
-  "node_date": "2026-10-22"
-}