memory-graph 0.3.70__tar.gz → 0.3.71__tar.gz

{memory_graph-0.3.70 → memory_graph-0.3.71}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.70
+Version: 0.3.71
 Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -1045,10 +1045,10 @@ import memory_graph as mg
 class MyClass:
     def __init__(self):
         self.children = {i: [i]*10 for i in range(5)}
-
 a = 1
-b = (1,2,3)
+b = (1, 2, 3)
 c = MyClass()
+d = (4, 5, 6, 7)
 
 mg.l()
 ```
@@ -1064,10 +1064,13 @@ class MyClass:
         self.children = {i: [i]*10 for i in range(5)}
 
 a = 1
-b = (1,2,3)
+b = (1, 2, 3)
 c = MyClass()
+d = (4, 5, 6, 7)
 
-mg.collapse_type(MyClass)  # collapse type 'MyClass' for better graph readability
+# for better graph readability in large graphs:
+mg.collapse_type(type(c))  # collapse type(c) 
+mg.collapse_type(id(d))    # collapse id(d)
 mg.l()
 ```
 ![collapse_type2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/collapse_type2.png)

{memory_graph-0.3.70 → memory_graph-0.3.71}/README.md

@@ -1025,10 +1025,10 @@ import memory_graph as mg
 class MyClass:
     def __init__(self):
         self.children = {i: [i]*10 for i in range(5)}
-
 a = 1
-b = (1,2,3)
+b = (1, 2, 3)
 c = MyClass()
+d = (4, 5, 6, 7)
 
 mg.l()
 ```
@@ -1044,10 +1044,13 @@ class MyClass:
         self.children = {i: [i]*10 for i in range(5)}
 
 a = 1
-b = (1,2,3)
+b = (1, 2, 3)
 c = MyClass()
+d = (4, 5, 6, 7)
 
-mg.collapse_type(MyClass)  # collapse type 'MyClass' for better graph readability
+# for better graph readability in large graphs:
+mg.collapse_type(type(c))  # collapse type(c) 
+mg.collapse_type(id(d))    # collapse id(d)
 mg.l()
 ```
 ![collapse_type2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/collapse_type2.png)

{memory_graph-0.3.70 → memory_graph-0.3.71}/memory_graph/__init__.py

@@ -2,7 +2,7 @@
 # Copyright (c) 2023, Bas Terwijn.
 # SPDX-License-Identifier: BSD-2-Clause
 
-__version__ = "0.3.70"
+__version__ = "0.3.71"
 __author__ = 'Bas Terwijn'
 
 import memory_graph.memory_to_nodes as memory_to_nodes

{memory_graph-0.3.70 → memory_graph-0.3.71}/memory_graph/memory_to_nodes.py

@@ -20,9 +20,11 @@ def read_nodes(data):
     - the id of 'data' as root node.
     """
 
-    def data_to_node(data_type, data):
-        """ Returns the Node for 'data' based on it's type. """
-        if data_type in config.type_to_node: # for predefined types
+    def data_to_node(data_id, data_type, data):
+        """ Returns the Node for 'data' based on it's id or type. """
+        if data_id in config.type_to_node: # for ids
+            return config.type_to_node[data_id](data)
+        elif data_type in config.type_to_node: # for predefined types
             return config.type_to_node[data_type](data)
         elif utils.has_dict_attributes(data): # for user defined classes
             return Node_Key_Value(data, utils.filter_dict(utils.get_dict_attributes(data)) )
@@ -41,7 +43,7 @@ def read_nodes(data):
             if data_id in nodes:
                 node = nodes[data_id]
             else:
-                node = data_to_node(data_type, data)
+                node = data_to_node(data_id, data_type, data)
                 if isinstance(node, Node_Key_Value):
                     nodes_key_value.append(data_id)
                 nodes[data_id] = node

{memory_graph-0.3.70 → memory_graph-0.3.71}/memory_graph.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.70
+Version: 0.3.71
 Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -1045,10 +1045,10 @@ import memory_graph as mg
 class MyClass:
     def __init__(self):
         self.children = {i: [i]*10 for i in range(5)}
-
 a = 1
-b = (1,2,3)
+b = (1, 2, 3)
 c = MyClass()
+d = (4, 5, 6, 7)
 
 mg.l()
 ```
@@ -1064,10 +1064,13 @@ class MyClass:
         self.children = {i: [i]*10 for i in range(5)}
 
 a = 1
-b = (1,2,3)
+b = (1, 2, 3)
 c = MyClass()
+d = (4, 5, 6, 7)
 
-mg.collapse_type(MyClass)  # collapse type 'MyClass' for better graph readability
+# for better graph readability in large graphs:
+mg.collapse_type(type(c))  # collapse type(c) 
+mg.collapse_type(id(d))    # collapse id(d)
 mg.l()
 ```
 ![collapse_type2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/collapse_type2.png)

{memory_graph-0.3.70 → memory_graph-0.3.71}/memory_graph.egg-info/SOURCES.txt

@@ -1,6 +1,7 @@
 LICENSE.txt
 README.md
 pyproject.toml
+setup.py
 memory_graph/__init__.py
 memory_graph/call_stack.py
 memory_graph/config.py

{memory_graph-0.3.70 → memory_graph-0.3.71}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "memory_graph"
-version = "0.3.70"
+version = "0.3.71"
 description = "Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy."
 authors = [
     {name = "Bas Terwijn", email = "bterwijn@gmail.com"}

memory_graph-0.3.71/setup.py

@@ -0,0 +1,7 @@
+from setuptools import setup
+
+setup(
+    name="memory-graph",
+    version="0.3.30",
+    packages=["memory_graph"],
+)