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

{memory_graph-0.3.51/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.51
+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
@@ -52,7 +52,7 @@ Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 
 # Highlights #
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
-Or run a live demo in the 👉[**Memory Graph Web Debugger**](https://memory-graph.com/#play)👈 now, no installation required!!!
+Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#play) 👈 now, no installation required!
 
 - learn the right **mental model** to think about Python data (references, mutability, shallow vs deep copy)
 - **visualize the structure of your data** to easily understand and debug any data structure
@@ -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()'.
 
@@ -663,6 +668,9 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.embedding_types*** : set[type]
   - Holds all dictionary types that embed their key-value tuple children.
 
+- ***mg.config.no_index_types*** : set[type]
+  - Holds all types like 'set' and 'frozenset' that should not have indices as Node_Linear.
+
 - ***mg.config.type_to_node*** : dict[type, fun(data) -> Node]
   - Determines how a data type is converted to a Node subclass for visualization in the graph.
 
@@ -676,7 +684,7 @@ Different aspects of memory_graph can be configured. The default configuration c
   - Maps a type to a Slicer. A slicer determines how many elements of a data type are shown in the graph to prevent the graph from getting too big. 'Slicer()' does no slicing, 'Slicer(1,2,3)' shows just 1 element at the beginning, 2 in the middle, and 3 at the end.
 
 - ***mg.config.max_graph_depth*** : int
-  - The maxium depth of the graph with default value 12.
+  - The maxium depth of the graph with default value 1000.
 
 - ***mg.config.graph_cut_symbol*** : str
   - The symbol indicating where the graph is cut short with default `✂`.
@@ -743,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())
 ```
@@ -767,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())
@@ -788,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,
@@ -812,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,
@@ -836,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]] )
 
@@ -891,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.51 → memory_graph-0.3.53}/README.md

@@ -7,7 +7,7 @@ Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 
 # Highlights #
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
-Or run a live demo in the 👉[**Memory Graph Web Debugger**](https://memory-graph.com/#play)👈 now, no installation required!!!
+Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#play) 👈 now, no installation required!
 
 - learn the right **mental model** to think about Python data (references, mutability, shallow vs deep copy)
 - **visualize the structure of your data** to easily understand and debug any data structure
@@ -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()'.
 
@@ -618,6 +623,9 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.embedding_types*** : set[type]
   - Holds all dictionary types that embed their key-value tuple children.
 
+- ***mg.config.no_index_types*** : set[type]
+  - Holds all types like 'set' and 'frozenset' that should not have indices as Node_Linear.
+
 - ***mg.config.type_to_node*** : dict[type, fun(data) -> Node]
   - Determines how a data type is converted to a Node subclass for visualization in the graph.
 
@@ -631,7 +639,7 @@ Different aspects of memory_graph can be configured. The default configuration c
   - Maps a type to a Slicer. A slicer determines how many elements of a data type are shown in the graph to prevent the graph from getting too big. 'Slicer()' does no slicing, 'Slicer(1,2,3)' shows just 1 element at the beginning, 2 in the middle, and 3 at the end.
 
 - ***mg.config.max_graph_depth*** : int
-  - The maxium depth of the graph with default value 12.
+  - The maxium depth of the graph with default value 1000.
 
 - ***mg.config.graph_cut_symbol*** : str
   - The symbol indicating where the graph is cut short with default `✂`.
@@ -698,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())
 ```
@@ -722,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())
@@ -743,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,
@@ -767,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,
@@ -791,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]] )
 
@@ -846,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.51 → 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.51 → 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.51 → memory_graph-0.3.53}/images/create_gif.sh

@@ -5,7 +5,8 @@
 #   sudo apt install imagemagick
 
 name="$1"
-files=$(ls -v $name*.png)
+files=$(ls -v $name*.png | tr '\n' ' ')
+files_gv=$(ls -v $name*.gv | tr '\n' ' ')
 echo "creating gif with:"
 echo "$files"
 
@@ -17,4 +18,10 @@ mogrify -resize $largest_size -background white -gravity center -extent $largest
 
 echo "creating file: $name.gif"
 convert -delay 150 -dither None -loop 0 $files $name.gif
+
+if [ "$2" = "-d" ]; then
+    echo "deleting: $files $files_gv"
+    rm $files $files_gv
+fi
+
 echo "done"

{memory_graph-0.3.51 → memory_graph-0.3.53}/images/create_images.sh

@@ -3,7 +3,7 @@ python many_types.py
 
 # debugging
 python debugging.py
-bash create_gif.sh debugging
+bash create_gif.sh debugging -d
 
 # data model
 python immutable.py
@@ -17,11 +17,11 @@ python name_rebinding.py
 # call stack
 python add_one.py
 python factorial.py
-bash create_gif.sh factorial
+bash create_gif.sh factorial -d
 python binary.py
-bash create_gif.sh binary
+bash create_gif.sh binary -d
 python power_set.py
-bash create_gif.sh power_set
+bash create_gif.sh power_set -d
 
 # datastructures
 python linked_list.py
@@ -40,3 +40,6 @@ python hidden_edges.py
 # extensions
 python extension_numpy.py
 python extension_pandas.py
+
+# clean up the graphviz files
+rm *.gv

{memory_graph-0.3.51 → memory_graph-0.3.53}/images/hidden_edges.py

@@ -2,7 +2,7 @@ import memory_graph as mg
 
 data = []
 x = ['x']
-for i in range(20):
+for i in range(35):
     data.append(x)
 
 mg.render(locals(), 'hidden_edges.png')

{memory_graph-0.3.51 → 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.51"
-__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.51 → memory_graph-0.3.53}/memory_graph/config.py

@@ -21,6 +21,8 @@ embedded_key_types = {}
 embedding_types = set()
 no_child_references_types = embedding_types # deprecated
 
+no_index_types = {}
+
 type_to_string = { }
 
 def to_string(data):

{memory_graph-0.3.51 → memory_graph-0.3.53}/memory_graph/config_default.py

@@ -52,7 +52,10 @@ def reset():
     """ Types that will embed their children. """
     config.embedding_types = {dict, types.MappingProxyType}
 
-    """ Types that need an special conversion """
+    """ Types that should not show an index """
+    config.no_index_types = {set, frozenset}
+
+    """ Types that need a special conversion """
     config.type_to_string = {
         types.FunctionType: lambda data: data.__qualname__,
         types.MethodType: lambda data: data.__qualname__,
@@ -107,13 +110,13 @@ def reset():
     
     """ Slicer objects for different types. """
     config.type_to_slicer = {
-        Node_Linear: Slicer(5,3,5),
-        Node_Key_Value: Slicer(5,3,5),
-        Node_Table: (Slicer(3,2,3), Slicer(3,2,3)),
+        Node_Linear: Slicer(10, 5, 10),
+        Node_Key_Value: Slicer(10, 5, 10),
+        Node_Table: (Slicer(3, 2, 3), Slicer(3, 2, 3)),
     }
 
     """ The maximum depth of nodes in the graph. When the graph gets too big set this to a small positive number. A `✂` symbol indictes where the graph is cut short. """
-    config.max_graph_depth = 12
+    config.max_graph_depth = 1000
     config.graph_cut_symbol = '✂'
     
 

{memory_graph-0.3.51 → memory_graph-0.3.53}/memory_graph/memory_to_nodes.py

@@ -149,8 +149,12 @@ def add_missing_edges(nodes, id_to_slices, max_missing_edges=3):
             for index in indices:
                 if parent_slices is None or not parent_slices.has_index(index):
                     type_to_parent_indices.setdefault(parent_type, [])
+                    #if not parent_type in type_to_parent_indices:
+                    #    type_to_parent_indices[parent_type] = []
                     parent_indices = type_to_parent_indices[parent_type]
-                    if len(parent_indices) < max_missing_edges:
+                    if len(parent_indices) > max_missing_edges:
+                        break
+                    else:
                         parent_indices.append((parent, index))
         add_parent_indices(nodes, type_to_parent_indices, id_to_slices, max_missing_edges)    
     

{memory_graph-0.3.51 → memory_graph-0.3.53}/memory_graph/node_linear.py

@@ -6,6 +6,7 @@ from memory_graph.node_base import Node_Base
 from memory_graph.sequence import Sequence1D
 
 import memory_graph.config_helpers as config_helpers
+import memory_graph.config as config
 
 class Node_Linear(Node_Base):
     """
@@ -56,9 +57,11 @@ class Node_Linear(Node_Base):
         """
         Helper function to fill the html_table with the children of the Node_Base in vertical orientation.
         """
+        show_index = not self.get_type() in config.no_index_types
         for index in slices.table_iter(self.children.size()):
             if index>=0:
-                html_table.add_index(index)
+                if show_index:
+                    html_table.add_index(index)
                 child = self.children[index]
                 html_table.add_entry(self, nodes, child, id_to_slices, dashed=slices.is_dashed(index))
                 html_table.add_new_line()
@@ -71,9 +74,11 @@ class Node_Linear(Node_Base):
         """
         Helper function to fill the html_table with the children of the Node_Base in horizontal orientation.
         """
+        show_index = not self.get_type() in config.no_index_types
         for index in slices.table_iter(self.children.size()):
             if index>=0:
-                html_table.add_index(index)
+                if show_index:
+                    html_table.add_index(index)
             else:
                 html_table.add_value('', border=0)
         html_table.add_new_line()

{memory_graph-0.3.51 → 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.51 → 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.51
+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
@@ -52,7 +52,7 @@ Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 
 # Highlights #
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
-Or run a live demo in the 👉[**Memory Graph Web Debugger**](https://memory-graph.com/#play)👈 now, no installation required!!!
+Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#play) 👈 now, no installation required!
 
 - learn the right **mental model** to think about Python data (references, mutability, shallow vs deep copy)
 - **visualize the structure of your data** to easily understand and debug any data structure
@@ -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()'.
 
@@ -663,6 +668,9 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.embedding_types*** : set[type]
   - Holds all dictionary types that embed their key-value tuple children.
 
+- ***mg.config.no_index_types*** : set[type]
+  - Holds all types like 'set' and 'frozenset' that should not have indices as Node_Linear.
+
 - ***mg.config.type_to_node*** : dict[type, fun(data) -> Node]
   - Determines how a data type is converted to a Node subclass for visualization in the graph.
 
@@ -676,7 +684,7 @@ Different aspects of memory_graph can be configured. The default configuration c
   - Maps a type to a Slicer. A slicer determines how many elements of a data type are shown in the graph to prevent the graph from getting too big. 'Slicer()' does no slicing, 'Slicer(1,2,3)' shows just 1 element at the beginning, 2 in the middle, and 3 at the end.
 
 - ***mg.config.max_graph_depth*** : int
-  - The maxium depth of the graph with default value 12.
+  - The maxium depth of the graph with default value 1000.
 
 - ***mg.config.graph_cut_symbol*** : str
   - The symbol indicating where the graph is cut short with default `✂`.
@@ -743,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())
 ```
@@ -767,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())
@@ -788,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,
@@ -812,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,
@@ -836,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]] )
 
@@ -891,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)