memory-graph 0.3.52__tar.gz → 0.3.53__tar.gz

{memory_graph-0.3.52/memory_graph.egg-info → memory_graph-0.3.53}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.52
+Version: 0.3.53
 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: BSD 2-Clause License
@@ -553,6 +553,8 @@ for i in range(n):
 Here we show values being added to a Linked List in Cursor AI. When adding the last value '5' we "Step Into" the code to show more of the details.
 ![linked_list.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.gif)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/linked_list.py&timestep=0.2&play).
+
 ## Binary Tree ##
 ```python
 import memory_graph as mg
@@ -593,6 +595,7 @@ for i in range(n):
 Here we show values being inserted in a Binary Tree in Visual Studio Code. When inserting the last value '29' we "Step Into" the code to show the recursive implementation.
 ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play).
 
 ## Hash Set ##
 ```python
@@ -636,6 +639,8 @@ for i in range(n):
 Here we show values being inserted in a HashSet in PyCharm. When inserting the last value '44' we "Step Into" the code to show more of the details.
 ![images/hash_set.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.gif)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/hash_set.py&timestep=0.2&play).
+
 # Configuration #
 Different aspects of memory_graph can be configured. The default configuration can be reset by calling 'mg.config_default.reset()'.
 
@@ -746,9 +751,9 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data, 
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Linear(data,
                                                 dir(data))
-mg.config.type_to_slicer[bintrees.avltree.Node] = mg.slicer.Slicer()
+mg.config.type_to_slicer[bintrees.avltree.Node] = mg.Slicer()
 
 mg.show(locals())
 ```
@@ -770,7 +775,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_leaf.Node_Leaf(data, 
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Leaf(data,
                                                 f"key:{data.key} value:{data.value}")
 
 mg.show(locals())
@@ -791,7 +796,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data,
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Linear(data,
                                                 ['left:', data.left,
                                                  'key:', data.key,
                                                  'value:', data.value,
@@ -815,7 +820,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_key_value.Node_Key_Value(data,
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Key_Value(data,
                                                 {'left': data.left,
                                                  'key': data.key,
                                                  'value': data.value,
@@ -839,7 +844,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_table.Node_Table(data,
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Table(data,
                                                 [[data.key, data.value],
                                                  [data.left, data.right]] )
 
@@ -894,7 +899,7 @@ Arguably the visualization is then more clear when we show a List_View object as
 
 ```python
 mg.config.type_to_color[List_View] = 'hotpink'
-mg.config.type_to_node[List_View] = lambda data: mg.node_linear.Node_Linear(data,
+mg.config.type_to_node[List_View] = lambda data: mg.Node_Linear(data,
                                                     data.lst[data.begin:data.end])
 ```
 ![bin_search_linear.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_search_linear.png)

{memory_graph-0.3.52 → memory_graph-0.3.53}/README.md

@@ -508,6 +508,8 @@ for i in range(n):
 Here we show values being added to a Linked List in Cursor AI. When adding the last value '5' we "Step Into" the code to show more of the details.
 ![linked_list.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.gif)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/linked_list.py&timestep=0.2&play).
+
 ## Binary Tree ##
 ```python
 import memory_graph as mg
@@ -548,6 +550,7 @@ for i in range(n):
 Here we show values being inserted in a Binary Tree in Visual Studio Code. When inserting the last value '29' we "Step Into" the code to show the recursive implementation.
 ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play).
 
 ## Hash Set ##
 ```python
@@ -591,6 +594,8 @@ for i in range(n):
 Here we show values being inserted in a HashSet in PyCharm. When inserting the last value '44' we "Step Into" the code to show more of the details.
 ![images/hash_set.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.gif)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/hash_set.py&timestep=0.2&play).
+
 # Configuration #
 Different aspects of memory_graph can be configured. The default configuration can be reset by calling 'mg.config_default.reset()'.
 
@@ -701,9 +706,9 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data, 
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Linear(data,
                                                 dir(data))
-mg.config.type_to_slicer[bintrees.avltree.Node] = mg.slicer.Slicer()
+mg.config.type_to_slicer[bintrees.avltree.Node] = mg.Slicer()
 
 mg.show(locals())
 ```
@@ -725,7 +730,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_leaf.Node_Leaf(data, 
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Leaf(data,
                                                 f"key:{data.key} value:{data.value}")
 
 mg.show(locals())
@@ -746,7 +751,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data,
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Linear(data,
                                                 ['left:', data.left,
                                                  'key:', data.key,
                                                  'value:', data.value,
@@ -770,7 +775,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_key_value.Node_Key_Value(data,
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Key_Value(data,
                                                 {'left': data.left,
                                                  'key': data.key,
                                                  'value': data.value,
@@ -794,7 +799,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_table.Node_Table(data,
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Table(data,
                                                 [[data.key, data.value],
                                                  [data.left, data.right]] )
 
@@ -849,7 +854,7 @@ Arguably the visualization is then more clear when we show a List_View object as
 
 ```python
 mg.config.type_to_color[List_View] = 'hotpink'
-mg.config.type_to_node[List_View] = lambda data: mg.node_linear.Node_Linear(data,
+mg.config.type_to_node[List_View] = lambda data: mg.Node_Linear(data,
                                                     data.lst[data.begin:data.end])
 ```
 ![bin_search_linear.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_search_linear.png)

{memory_graph-0.3.52 → memory_graph-0.3.53}/images/avltree.py

@@ -15,29 +15,28 @@ tree.insert(15, "fifteen")
 # mg.render(locals(), 'avltree_fail.png') # id keeps changing
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data, dir(data))
-mg.config.type_to_slicer[bintrees.avltree.Node] = mg.slicer.Slicer()
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Linear(data, dir(data))
+mg.config.type_to_slicer[bintrees.avltree.Node] = mg.Slicer()
 # mg.render(locals(), 'avltree_dir.png') # stuff changes
 
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_leaf.Node_Leaf(data, f"key:{data.key} value:{data.value}")
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Leaf(data, f"key:{data.key} value:{data.value}")
 mg.render(locals(), 'avltree_leaf.png')
 
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data,
-                                                                                        ['left:', data.left,
-                                                                                         'key:', data.key,
-                                                                                         'value:', data.value,
-                                                                                         'right:', data.right])
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Linear(data,
+                                                                            ['left:', data.left,
+                                                                             'key:', data.key,
+                                                                             'value:', data.value,
+                                                                             'right:', data.right])
 mg.render(locals(), 'avltree_linear.png')
 
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_key_value.Node_Key_Value(data,
-                                                                                              {'left': data.left,
-                                                                                               'key': data.key,
-                                                                                               'value': data.value,
-                                                                                               'right': data.right}.items())
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Key_Value(data,
+                                                                               {'left': data.left,
+                                                                                'key': data.key,
+                                                                                'value': data.value,
+                                                                                'right': data.right}.items())
 mg.render(locals(), 'avltree_key_value.png')
 
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_table.Node_Table(data,
-                                                                                      [[data.key, data.value],
-                                                                                       [data.left, data.right]]
-                                                                                      )
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Table(data,
+                                                                           [[data.key, data.value],
+                                                                            [data.left, data.right]])
 mg.render(locals(), 'avltree_table.png')

{memory_graph-0.3.52 → memory_graph-0.3.53}/images/copy_mutable.py

@@ -12,4 +12,4 @@ c1 = a
 c2 = copy.copy(a) # equivalent to:  a.copy() a[:] list(a)
 c3 = copy.deepcopy(a)
 
-mg.render(locals(), 'copies.png')
+mg.render(locals(), 'copy_mutable.png')

{memory_graph-0.3.52 → memory_graph-0.3.53}/memory_graph/__init__.py

@@ -2,6 +2,9 @@
 # Copyright (c) 2023, Bas Terwijn.
 # SPDX-License-Identifier: BSD-2-Clause
 
+__version__ = "0.3.53"
+__author__ = 'Bas Terwijn'
+
 import memory_graph.memory_to_nodes as memory_to_nodes
 import memory_graph.config as config
 import memory_graph.config_default
@@ -21,8 +24,13 @@ import builtins
 if not hasattr(builtins, "mg"):
     builtins.mg = mg
 
-__version__ = "0.3.52"
-__author__ = 'Bas Terwijn'
+# re-exports for shorter names
+from .slicer          import Slicer
+from .node_leaf       import Node_Leaf
+from .node_linear     import Node_Linear
+from .node_key_value  import Node_Key_Value
+from .node_table      import Node_Table
+
 
 last_show_filename = None
 render_filename_count = 0

{memory_graph-0.3.52 → memory_graph-0.3.53}/memory_graph/slicer.py

@@ -15,7 +15,7 @@ class Slicer:
             self.end, self.middle = self.middle, self.end
 
     def __repr__(self) -> str:
-        return f"Slicer({self.begin},{self.middle},{self.end})"
+        return f"Slicer({self.begin}, {self.middle}, {self.end})"
 
     def get_slices(self, length):
         slices1d = Slices1D()

{memory_graph-0.3.52 → memory_graph-0.3.53/memory_graph.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.52
+Version: 0.3.53
 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: BSD 2-Clause License
@@ -553,6 +553,8 @@ for i in range(n):
 Here we show values being added to a Linked List in Cursor AI. When adding the last value '5' we "Step Into" the code to show more of the details.
 ![linked_list.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.gif)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/linked_list.py&timestep=0.2&play).
+
 ## Binary Tree ##
 ```python
 import memory_graph as mg
@@ -593,6 +595,7 @@ for i in range(n):
 Here we show values being inserted in a Binary Tree in Visual Studio Code. When inserting the last value '29' we "Step Into" the code to show the recursive implementation.
 ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play).
 
 ## Hash Set ##
 ```python
@@ -636,6 +639,8 @@ for i in range(n):
 Here we show values being inserted in a HashSet in PyCharm. When inserting the last value '44' we "Step Into" the code to show more of the details.
 ![images/hash_set.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.gif)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/hash_set.py&timestep=0.2&play).
+
 # Configuration #
 Different aspects of memory_graph can be configured. The default configuration can be reset by calling 'mg.config_default.reset()'.
 
@@ -746,9 +751,9 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data, 
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Linear(data,
                                                 dir(data))
-mg.config.type_to_slicer[bintrees.avltree.Node] = mg.slicer.Slicer()
+mg.config.type_to_slicer[bintrees.avltree.Node] = mg.Slicer()
 
 mg.show(locals())
 ```
@@ -770,7 +775,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_leaf.Node_Leaf(data, 
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Leaf(data,
                                                 f"key:{data.key} value:{data.value}")
 
 mg.show(locals())
@@ -791,7 +796,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data,
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Linear(data,
                                                 ['left:', data.left,
                                                  'key:', data.key,
                                                  'value:', data.value,
@@ -815,7 +820,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_key_value.Node_Key_Value(data,
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Key_Value(data,
                                                 {'left': data.left,
                                                  'key': data.key,
                                                  'value': data.value,
@@ -839,7 +844,7 @@ tree.insert(20, "twenty")
 tree.insert(15, "fifteen")
 
 mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_table.Node_Table(data,
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Table(data,
                                                 [[data.key, data.value],
                                                  [data.left, data.right]] )
 
@@ -894,7 +899,7 @@ Arguably the visualization is then more clear when we show a List_View object as
 
 ```python
 mg.config.type_to_color[List_View] = 'hotpink'
-mg.config.type_to_node[List_View] = lambda data: mg.node_linear.Node_Linear(data,
+mg.config.type_to_node[List_View] = lambda data: mg.Node_Linear(data,
                                                     data.lst[data.begin:data.end])
 ```
 ![bin_search_linear.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_search_linear.png)

{memory_graph-0.3.52 → memory_graph-0.3.53}/memory_graph.egg-info/SOURCES.txt

@@ -21,9 +21,6 @@ images/bin_tree.py
 images/binary.gif
 images/binary.py
 images/colab_example.png
-images/copies.png
-images/copies_immutable.png
-images/copies_mix.png
 images/copy_immutable.png
 images/copy_immutable.py
 images/copy_method.png
@@ -37,7 +34,6 @@ images/create_images.sh
 images/debug_vscode.png
 images/debugging.gif
 images/debugging.py
-images/depth.png
 images/embedded1.png
 images/embedded2.png
 images/extension_numpy.png
@@ -53,7 +49,6 @@ images/hash_set.png
 images/hash_set.py
 images/hidden_edges.png
 images/hidden_edges.py
-images/hidden_edges2.png
 images/immutable.py
 images/immutable1.png
 images/immutable2.png
@@ -67,7 +62,6 @@ images/linked_list.py
 images/many_types.png
 images/many_types.py
 images/marimo_example.png
-images/memory_graph.gv.pdf
 images/memory_graph_web_debugger.png
 images/mutable.py
 images/mutable1.png

{memory_graph-0.3.52 → memory_graph-0.3.53}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "memory_graph"
-version = "0.3.52"
+version = "0.3.53"
 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"}