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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.52
+Version: 0.3.54
 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)
-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/#breakpoints=8&continues=1&timestep=1.0&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
@@ -164,8 +164,6 @@ A better way to understand what values are shared is to draw a graph using [memo
 
 [Troubleshooting](#troubleshooting)
 
-[Social Media](#social-media)
-
 [Other Packages](#other-packages)
 
 ## Author ##
@@ -174,6 +172,10 @@ Bas Terwijn
 ## Inspiration ##
 Inspired by [Python Tutor](https://pythontutor.com/).
 
+## Social Media #
+* LinkedIn: https://www.linkedin.com/groups/13244150/
+* Reddit: https://www.reddit.com/r/Python_memory_graph/
+
 ## Supported by ##
 <img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/uva.png" alt="University of Amsterdam" width="600">
 
@@ -274,6 +276,8 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
 
+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/custom_copy.py&breakpoints=15&continues=1&play).
+
 ## Name Rebinding ##
 When `a` and `b` share a mutable value, then changing the value of `b` changes the value of `a` and vice versa. However, reassigning `b` does not change `a`. When you reassign `b`, you only rebind the name `b` to another value without effecting any other variables.
 
@@ -348,6 +352,8 @@ print(f"a:{a} b:{b} c:{c}")
 ```
 ![add_one.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/add_one.png)
 
+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/function_call.py&play).
+
 In the printed output only `a` is changed as a result of the function call:
 ```
 a:[4, 3, 2, 1] b:(4, 3, 2) c:[4, 3, 2]
@@ -355,6 +361,8 @@ a:[4, 3, 2, 1] b:(4, 3, 2) c:[4, 3, 2]
 
 This is because `b` is of immutable type 'tuple' so its value gets copied automatically when it is changed. And because the function is called with a copy of `c`, its original value is not changed by the function. The value of variable `a` is the only value of mutable type that is shared between the root stack frame **'0: \<module>'** and the **'1: add_one'** stack frame of the function so only that variable is affected as a result of the function call. The other changes remain confined to the local variables of the ```add_one()``` function.
 
+Now is a good time to practice the Python Data Model. Here are [some exercises](https://github.com/bterwijn/memory_graph_videos/blob/main/exercises/exercises.md) on references, mutability, copies, and function calls.
+
 ## Block ##
 It is often helpful to temporarily block program execution to inspect the graph. For this we can use the `mg.block()` function:
 
@@ -384,16 +392,17 @@ def factorial(n):
 
 print( factorial(4) )
 ```
-
 ![factorial.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial.gif)
 
 and the result is: 1 x 2 x 3 x 4 = 24
 
-## Binary ##
+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/factorial.py&timestep=1.0&play).
+
+## Binary Convert ##
 A more interesting recursive example is function `binary()` that converts a decimal integer to binary representation. 
 ```python
 import memory_graph as mg
-mg.config.type_to_vertical[list] = False  # horizontal lists
+mg.config.type_to_horizontal[list] = True  # horizontal lists
 
 def binary(value: int) -> list[int]:
     mg.block(mg.show(), mg.stack())
@@ -411,6 +420,8 @@ print( binary(100) )
 1100100
 ```
 
+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/binary_convert.py&timestep=1.0&play).
+
 ## Power Set ##
 A more complex recursive example is function `power_set()` where lists are shared by different function calls. A power set is the set of all subsets of a collection of values.
 
@@ -553,6 +564,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 +606,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,8 +650,10 @@ 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&breakpoints=32&continues=1&timestep=0.5&play).
+
 # Configuration #
-Different aspects of memory_graph can be configured. The default configuration can be reset by calling 'mg.config_default.reset()'.
+Different aspects of memory_graph can be configured. The default configuration can be reset by calling 'mg.config_default.reset()'. The Memory Graph Web Debugger gives examples of the [most important configurations](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/config.py&play).
 
 - ***mg.config.reopen_viewer*** : bool
   - If True the viewer is reopened each time show() is called, this might change window focus, default True.
@@ -672,8 +688,8 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.type_to_color*** : dict[type, color]
   - Maps a type to the [graphviz color](https://graphviz.org/doc/info/colors.html) it gets in the graph. 
 
-- ***mg.config.type_to_vertical*** : dict[type, bool]
-  - Maps a type to its orientation. Use 'True' for vertical and 'False' for horizontal. If not specified Node_Linear and Node_Key_Value are vertical unless they have references to children.
+- ***mg.config.type_to_horizontal*** : dict[type, bool]
+  - Maps a type to its orientation for Node_Linear and Node_Key_Value. Use 'True' for horizontal and 'False' for vertical. If not specified these nodes vertical unless they have references to children.
 
 - ***mg.config.type_to_slicer*** : dict[type, int]
   - 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.
@@ -730,7 +746,6 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_fail.png)
 
-
 ## All attributes using dir() ##
 A useful start is to give it some color, show the list of all its attributes using `dir()`, and setting an empty Slicer to see the attribute list in full.
 
@@ -746,13 +761,13 @@ 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())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_dir.png)
+![avltree_dir.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_dir.png)
 
 Next figure out what the attributes are you want to graph and choose a Node type, there are four options:
 
@@ -770,12 +785,12 @@ 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())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_leaf.png)
+![avltree_leaf.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_leaf.png)
 
 ## 2) Node_Linear ##
 Node_Linear shows multiple values in a line like a list.
@@ -791,7 +806,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,
@@ -799,7 +814,7 @@ mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node
 
 mg.show(locals())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_linear.png)
+![avltree_linear.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_linear.png)
 
 ## 3) Node_Key_Value ##
 Node_Key_Value shows key-value pairs like a dictionary. Note the required `items()` call at the end.
@@ -815,7 +830,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,
@@ -823,7 +838,7 @@ mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_key_value.N
 
 mg.show(locals())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_key_value.png)
+![avltree_key_value.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_key_value.png)
 
 ## 4) Node_Table ##
 Node_Table shows all the values as a table.
@@ -839,13 +854,13 @@ 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]] )
 
 mg.show(locals())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_table.png)
+![avltree_table.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_table.png)
 
 ## Binary Search ##
 For binary search we can use a List_View class to represent a particular sublist without making a list copy.
@@ -894,7 +909,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)
@@ -950,7 +965,7 @@ mg.config.type_to_depth[B] = 3
 mg.config.type_to_depth[id(c)] = 2
 mg.show(locals())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/introspect_depth.png)
+![introspect_depth.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/introspect_depth.png)
 
 ## Hidden Edges ##
 
@@ -966,7 +981,7 @@ for i in range(20):
 
 mg.show(locals())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hidden_edges.png)
+![hidden_edges.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hidden_edges.png)
 
 # Extensions #
 Different extensions are available for types from other Python packages. 
@@ -989,6 +1004,8 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#micropip=numpy&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_numpy.py&continues=1).
+
 ## Pandas ##
 Pandas types `Series` and `DataFrame` can be graphed with "memory_graph.extension_pandas":
 
@@ -1008,6 +1025,8 @@ mg.show(locals())
 ```
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#micropip=pandas&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_pandas.py&continues=1).
+
 ## PyTorch ##
 Torch type `tensor` can be graphed with "memory_graph.extension_torch":
 
@@ -1086,9 +1105,5 @@ $ bash create_gif.sh animated
 
 - When graph edges overlap it can be hard to distinguish them. Using an interactive graphviz viewer, such as [xdot](https://github.com/jrfonseca/xdot.py), on a '*.gv' DOT output file will help.
 
-# Social Media #
-* LinkedIn: https://www.linkedin.com/groups/13244150/
-* Reddit: https://www.reddit.com/r/Python_memory_graph/
-
 # Other Packages #
 The [memory_graph](https://pypi.org/project/memory-graph/) package visualizes your data. If instead you want to visualize function calls, check out the [invocation_tree](https://pypi.org/project/invocation-tree/) package.

{memory_graph-0.3.52 → memory_graph-0.3.54}/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)
-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/#breakpoints=8&continues=1&timestep=1.0&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
@@ -119,8 +119,6 @@ A better way to understand what values are shared is to draw a graph using [memo
 
 [Troubleshooting](#troubleshooting)
 
-[Social Media](#social-media)
-
 [Other Packages](#other-packages)
 
 ## Author ##
@@ -129,6 +127,10 @@ Bas Terwijn
 ## Inspiration ##
 Inspired by [Python Tutor](https://pythontutor.com/).
 
+## Social Media #
+* LinkedIn: https://www.linkedin.com/groups/13244150/
+* Reddit: https://www.reddit.com/r/Python_memory_graph/
+
 ## Supported by ##
 <img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/uva.png" alt="University of Amsterdam" width="600">
 
@@ -229,6 +231,8 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
 
+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/custom_copy.py&breakpoints=15&continues=1&play).
+
 ## Name Rebinding ##
 When `a` and `b` share a mutable value, then changing the value of `b` changes the value of `a` and vice versa. However, reassigning `b` does not change `a`. When you reassign `b`, you only rebind the name `b` to another value without effecting any other variables.
 
@@ -303,6 +307,8 @@ print(f"a:{a} b:{b} c:{c}")
 ```
 ![add_one.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/add_one.png)
 
+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/function_call.py&play).
+
 In the printed output only `a` is changed as a result of the function call:
 ```
 a:[4, 3, 2, 1] b:(4, 3, 2) c:[4, 3, 2]
@@ -310,6 +316,8 @@ a:[4, 3, 2, 1] b:(4, 3, 2) c:[4, 3, 2]
 
 This is because `b` is of immutable type 'tuple' so its value gets copied automatically when it is changed. And because the function is called with a copy of `c`, its original value is not changed by the function. The value of variable `a` is the only value of mutable type that is shared between the root stack frame **'0: \<module>'** and the **'1: add_one'** stack frame of the function so only that variable is affected as a result of the function call. The other changes remain confined to the local variables of the ```add_one()``` function.
 
+Now is a good time to practice the Python Data Model. Here are [some exercises](https://github.com/bterwijn/memory_graph_videos/blob/main/exercises/exercises.md) on references, mutability, copies, and function calls.
+
 ## Block ##
 It is often helpful to temporarily block program execution to inspect the graph. For this we can use the `mg.block()` function:
 
@@ -339,16 +347,17 @@ def factorial(n):
 
 print( factorial(4) )
 ```
-
 ![factorial.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial.gif)
 
 and the result is: 1 x 2 x 3 x 4 = 24
 
-## Binary ##
+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/factorial.py&timestep=1.0&play).
+
+## Binary Convert ##
 A more interesting recursive example is function `binary()` that converts a decimal integer to binary representation. 
 ```python
 import memory_graph as mg
-mg.config.type_to_vertical[list] = False  # horizontal lists
+mg.config.type_to_horizontal[list] = True  # horizontal lists
 
 def binary(value: int) -> list[int]:
     mg.block(mg.show(), mg.stack())
@@ -366,6 +375,8 @@ print( binary(100) )
 1100100
 ```
 
+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/binary_convert.py&timestep=1.0&play).
+
 ## Power Set ##
 A more complex recursive example is function `power_set()` where lists are shared by different function calls. A power set is the set of all subsets of a collection of values.
 
@@ -508,6 +519,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 +561,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,8 +605,10 @@ 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&breakpoints=32&continues=1&timestep=0.5&play).
+
 # Configuration #
-Different aspects of memory_graph can be configured. The default configuration can be reset by calling 'mg.config_default.reset()'.
+Different aspects of memory_graph can be configured. The default configuration can be reset by calling 'mg.config_default.reset()'. The Memory Graph Web Debugger gives examples of the [most important configurations](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/config.py&play).
 
 - ***mg.config.reopen_viewer*** : bool
   - If True the viewer is reopened each time show() is called, this might change window focus, default True.
@@ -627,8 +643,8 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.type_to_color*** : dict[type, color]
   - Maps a type to the [graphviz color](https://graphviz.org/doc/info/colors.html) it gets in the graph. 
 
-- ***mg.config.type_to_vertical*** : dict[type, bool]
-  - Maps a type to its orientation. Use 'True' for vertical and 'False' for horizontal. If not specified Node_Linear and Node_Key_Value are vertical unless they have references to children.
+- ***mg.config.type_to_horizontal*** : dict[type, bool]
+  - Maps a type to its orientation for Node_Linear and Node_Key_Value. Use 'True' for horizontal and 'False' for vertical. If not specified these nodes vertical unless they have references to children.
 
 - ***mg.config.type_to_slicer*** : dict[type, int]
   - 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.
@@ -685,7 +701,6 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_fail.png)
 
-
 ## All attributes using dir() ##
 A useful start is to give it some color, show the list of all its attributes using `dir()`, and setting an empty Slicer to see the attribute list in full.
 
@@ -701,13 +716,13 @@ 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())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_dir.png)
+![avltree_dir.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_dir.png)
 
 Next figure out what the attributes are you want to graph and choose a Node type, there are four options:
 
@@ -725,12 +740,12 @@ 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())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_leaf.png)
+![avltree_leaf.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_leaf.png)
 
 ## 2) Node_Linear ##
 Node_Linear shows multiple values in a line like a list.
@@ -746,7 +761,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,
@@ -754,7 +769,7 @@ mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node
 
 mg.show(locals())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_linear.png)
+![avltree_linear.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_linear.png)
 
 ## 3) Node_Key_Value ##
 Node_Key_Value shows key-value pairs like a dictionary. Note the required `items()` call at the end.
@@ -770,7 +785,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,
@@ -778,7 +793,7 @@ mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_key_value.N
 
 mg.show(locals())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_key_value.png)
+![avltree_key_value.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_key_value.png)
 
 ## 4) Node_Table ##
 Node_Table shows all the values as a table.
@@ -794,13 +809,13 @@ 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]] )
 
 mg.show(locals())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_table.png)
+![avltree_table.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_table.png)
 
 ## Binary Search ##
 For binary search we can use a List_View class to represent a particular sublist without making a list copy.
@@ -849,7 +864,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)
@@ -905,7 +920,7 @@ mg.config.type_to_depth[B] = 3
 mg.config.type_to_depth[id(c)] = 2
 mg.show(locals())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/introspect_depth.png)
+![introspect_depth.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/introspect_depth.png)
 
 ## Hidden Edges ##
 
@@ -921,7 +936,7 @@ for i in range(20):
 
 mg.show(locals())
 ```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hidden_edges.png)
+![hidden_edges.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hidden_edges.png)
 
 # Extensions #
 Different extensions are available for types from other Python packages. 
@@ -944,6 +959,8 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#micropip=numpy&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_numpy.py&continues=1).
+
 ## Pandas ##
 Pandas types `Series` and `DataFrame` can be graphed with "memory_graph.extension_pandas":
 
@@ -963,6 +980,8 @@ mg.show(locals())
 ```
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
 
+Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#micropip=pandas&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_pandas.py&continues=1).
+
 ## PyTorch ##
 Torch type `tensor` can be graphed with "memory_graph.extension_torch":
 
@@ -1041,9 +1060,5 @@ $ bash create_gif.sh animated
 
 - When graph edges overlap it can be hard to distinguish them. Using an interactive graphviz viewer, such as [xdot](https://github.com/jrfonseca/xdot.py), on a '*.gv' DOT output file will help.
 
-# Social Media #
-* LinkedIn: https://www.linkedin.com/groups/13244150/
-* Reddit: https://www.reddit.com/r/Python_memory_graph/
-
 # Other Packages #
 The [memory_graph](https://pypi.org/project/memory-graph/) package visualizes your data. If instead you want to visualize function calls, check out the [invocation_tree](https://pypi.org/project/invocation-tree/) package.

{memory_graph-0.3.52 → memory_graph-0.3.54}/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.54}/images/binary.py

@@ -1,6 +1,6 @@
 import memory_graph as mg
 import typing
-mg.config.type_to_vertical[list] = False  # horizontal lists
+mg.config.type_to_horizontal[list] = True  # horizontal lists
 
 def binary(value: int) -> typing.List[int]:
     mg.render(mg.stack(), 'binary.png', numbered=True)

{memory_graph-0.3.52 → memory_graph-0.3.54}/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.54}/memory_graph/__init__.py

@@ -2,6 +2,9 @@
 # Copyright (c) 2023, Bas Terwijn.
 # SPDX-License-Identifier: BSD-2-Clause
 
+__version__ = "0.3.54"
+__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.54}/memory_graph/config.py

@@ -36,6 +36,7 @@ type_to_node = { }
 
 type_to_color = { }
 
+type_to_horizontal = { }
 type_to_vertical = { }
 
 type_to_slicer = { }