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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.54
+Version: 0.3.56
 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
@@ -58,6 +58,10 @@ Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph
 - **visualize the structure of your data** to easily understand and debug any data structure
 - understand function calls, variable scope, and the **complete program state** through call stack visualization
 
+An example Binary Tree data structure:
+![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).
+
 # Videos #
 | [![Quick Intro](https://img.youtube.com/vi/23_bHcr7hqo/0.jpg)](https://www.youtube.com/watch?v=23_bHcr7hqo) | [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
 |:--:|:--:|
@@ -132,7 +136,7 @@ identical?: True
 ```
 A better way to understand what values are shared is to draw a graph using [memory_graph](https://pypi.org/project/memory-graph/).
 
-# Chapters #
+# Topics #
 
 [Python Data Model](#python-data-model)
 
@@ -173,8 +177,8 @@ Bas Terwijn
 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/
+* [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">
@@ -358,9 +362,33 @@ 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]
 ```
-
 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.
 
+## Function Call That Changes 'int' Value ##
+Even though `int` is an immutable type, so an `int` value can not be changed by directly passing it to a function, we can still change it by wrapping it in a mutable container.
+
+```python
+import memory_graph as mg
+
+def add_one(a, b):
+    a += 1     # change remains confined to 'a' in the add_one function
+    b[0] += 1  # change also effects 'b' outside of the add_one function
+    mg.show(mg.stack())
+
+a = 10
+b = [10]  # wrap in a value of mutable type list
+add_one(a, b)
+
+print(f"a:{a} b:{b[0]}")
+```
+![wap_int.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/wrap_int.png)
+```
+a:10 b:11
+```
+Calling `add_one()` does not effect the `int` value of `a` but does effect the `int` value of `b` because it's wrapped in a mutable container.
+
+## Exercises ##
+
 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 ##
@@ -398,8 +426,8 @@ and the result is: 1 x 2 x 3 x 4 = 24
 
 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. 
+## Binary Conversion ##
+A more interesting recursive example is function `binary()` that converts a integer from decimal to binary representation. 
 ```python
 import memory_graph as mg
 mg.config.type_to_horizontal[list] = True  # horizontal lists
@@ -417,7 +445,7 @@ print( binary(100) )
 ```
 ![factorial.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/binary.gif)
 ```
-1100100
+[1, 1, 0, 0, 1, 0, 0]
 ```
 
 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).
@@ -452,6 +480,8 @@ print( power_set(['a', 'b', 'c']) )
 [['a', 'b', 'c'], ['a', 'b'], ['a', 'c'], ['a'], ['b', 'c'], ['b'], ['c'], []]
 ```
 
+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/power_set.py&timestep=1.0&play).
+
 # Debugging #
 
 For the best debugging experience with memory_graph set for example expression:
@@ -1101,7 +1131,7 @@ $ bash create_gif.sh animated
 ```
 
 # Troubleshooting #
-- Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'somefile.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as the default PDF reader. Another solution is to `render()` the graph to a different output format and to open it manually.
+- Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'memory_graph.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as your default PDF reader. Another solution is to `render()` the graph to a different output format.
 
 - 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.
 

{memory_graph-0.3.54 → memory_graph-0.3.56}/README.md

@@ -13,6 +13,10 @@ Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph
 - **visualize the structure of your data** to easily understand and debug any data structure
 - understand function calls, variable scope, and the **complete program state** through call stack visualization
 
+An example Binary Tree data structure:
+![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).
+
 # Videos #
 | [![Quick Intro](https://img.youtube.com/vi/23_bHcr7hqo/0.jpg)](https://www.youtube.com/watch?v=23_bHcr7hqo) | [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
 |:--:|:--:|
@@ -87,7 +91,7 @@ identical?: True
 ```
 A better way to understand what values are shared is to draw a graph using [memory_graph](https://pypi.org/project/memory-graph/).
 
-# Chapters #
+# Topics #
 
 [Python Data Model](#python-data-model)
 
@@ -128,8 +132,8 @@ Bas Terwijn
 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/
+* [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">
@@ -313,9 +317,33 @@ 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]
 ```
-
 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.
 
+## Function Call That Changes 'int' Value ##
+Even though `int` is an immutable type, so an `int` value can not be changed by directly passing it to a function, we can still change it by wrapping it in a mutable container.
+
+```python
+import memory_graph as mg
+
+def add_one(a, b):
+    a += 1     # change remains confined to 'a' in the add_one function
+    b[0] += 1  # change also effects 'b' outside of the add_one function
+    mg.show(mg.stack())
+
+a = 10
+b = [10]  # wrap in a value of mutable type list
+add_one(a, b)
+
+print(f"a:{a} b:{b[0]}")
+```
+![wap_int.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/wrap_int.png)
+```
+a:10 b:11
+```
+Calling `add_one()` does not effect the `int` value of `a` but does effect the `int` value of `b` because it's wrapped in a mutable container.
+
+## Exercises ##
+
 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 ##
@@ -353,8 +381,8 @@ and the result is: 1 x 2 x 3 x 4 = 24
 
 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. 
+## Binary Conversion ##
+A more interesting recursive example is function `binary()` that converts a integer from decimal to binary representation. 
 ```python
 import memory_graph as mg
 mg.config.type_to_horizontal[list] = True  # horizontal lists
@@ -372,7 +400,7 @@ print( binary(100) )
 ```
 ![factorial.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/binary.gif)
 ```
-1100100
+[1, 1, 0, 0, 1, 0, 0]
 ```
 
 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).
@@ -407,6 +435,8 @@ print( power_set(['a', 'b', 'c']) )
 [['a', 'b', 'c'], ['a', 'b'], ['a', 'c'], ['a'], ['b', 'c'], ['b'], ['c'], []]
 ```
 
+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/power_set.py&timestep=1.0&play).
+
 # Debugging #
 
 For the best debugging experience with memory_graph set for example expression:
@@ -1056,7 +1086,7 @@ $ bash create_gif.sh animated
 ```
 
 # Troubleshooting #
-- Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'somefile.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as the default PDF reader. Another solution is to `render()` the graph to a different output format and to open it manually.
+- Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'memory_graph.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as your default PDF reader. Another solution is to `render()` the graph to a different output format.
 
 - 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.
 

{memory_graph-0.3.54 → memory_graph-0.3.56}/images/create_images.sh

@@ -16,6 +16,7 @@ python name_rebinding.py
 
 # call stack
 python add_one.py
+python wrap_int.py
 python factorial.py
 bash create_gif.sh factorial -d
 python binary.py

memory_graph-0.3.56/images/wrap_int.py

@@ -0,0 +1,16 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
+import memory_graph as mg
+
+def add_one(a, b):
+    a += 1
+    b[0] += 1
+    mg.render( mg.stack(), "wrap_int.png")
+
+a = 10
+b = [10]
+
+add_one(a, b)
+print(f"a:{a} b:{b[0]}")

{memory_graph-0.3.54 → memory_graph-0.3.56}/memory_graph/__init__.py

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

{memory_graph-0.3.54 → memory_graph-0.3.56}/memory_graph/memory_to_nodes.py

@@ -257,9 +257,9 @@ def memory_to_nodes(data):
     id_to_slices = add_missing_edges(nodes, id_to_slices, config.max_missing_edges)
     #print('id_to_slices:',id_to_slices)
     embed_keys_in_key_value_nodes(nodes, nodes_key_value, id_to_slices)
-    graphviz_graph_attr = {}
-    graphviz_node_attr = {'shape':'plaintext'}
-    graphviz_edge_attr = {}
+    graphviz_graph_attr = {'fontname': 'Courier', 'fontsize': '14'}
+    graphviz_node_attr = {'fontname': 'Courier', 'fontsize': '14', 'shape': 'plaintext'}
+    graphviz_edge_attr = {'fontname': 'Courier', 'fontsize': '14'}
     graphviz_graph=graphviz.Digraph('memory_graph',
                                     graph_attr=graphviz_graph_attr,
                                     node_attr=graphviz_node_attr,

{memory_graph-0.3.54 → memory_graph-0.3.56}/memory_graph/utils.py

@@ -20,7 +20,7 @@ def is_function(obj):
 
 def filter_dict(dictionary):
     """ Filters out the unwanted dict attributes. """
-    if '__name__' in dictionary: # only filter stack frames, for example locals()
+    if '__name__' in dictionary: # filter stack frames in global scope
         return [
             (k,v) for k, v in dictionary.items() if
             not (type(k) is str and k.startswith('__')) and

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.54
+Version: 0.3.56
 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
@@ -58,6 +58,10 @@ Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph
 - **visualize the structure of your data** to easily understand and debug any data structure
 - understand function calls, variable scope, and the **complete program state** through call stack visualization
 
+An example Binary Tree data structure:
+![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).
+
 # Videos #
 | [![Quick Intro](https://img.youtube.com/vi/23_bHcr7hqo/0.jpg)](https://www.youtube.com/watch?v=23_bHcr7hqo) | [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
 |:--:|:--:|
@@ -132,7 +136,7 @@ identical?: True
 ```
 A better way to understand what values are shared is to draw a graph using [memory_graph](https://pypi.org/project/memory-graph/).
 
-# Chapters #
+# Topics #
 
 [Python Data Model](#python-data-model)
 
@@ -173,8 +177,8 @@ Bas Terwijn
 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/
+* [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">
@@ -358,9 +362,33 @@ 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]
 ```
-
 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.
 
+## Function Call That Changes 'int' Value ##
+Even though `int` is an immutable type, so an `int` value can not be changed by directly passing it to a function, we can still change it by wrapping it in a mutable container.
+
+```python
+import memory_graph as mg
+
+def add_one(a, b):
+    a += 1     # change remains confined to 'a' in the add_one function
+    b[0] += 1  # change also effects 'b' outside of the add_one function
+    mg.show(mg.stack())
+
+a = 10
+b = [10]  # wrap in a value of mutable type list
+add_one(a, b)
+
+print(f"a:{a} b:{b[0]}")
+```
+![wap_int.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/wrap_int.png)
+```
+a:10 b:11
+```
+Calling `add_one()` does not effect the `int` value of `a` but does effect the `int` value of `b` because it's wrapped in a mutable container.
+
+## Exercises ##
+
 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 ##
@@ -398,8 +426,8 @@ and the result is: 1 x 2 x 3 x 4 = 24
 
 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. 
+## Binary Conversion ##
+A more interesting recursive example is function `binary()` that converts a integer from decimal to binary representation. 
 ```python
 import memory_graph as mg
 mg.config.type_to_horizontal[list] = True  # horizontal lists
@@ -417,7 +445,7 @@ print( binary(100) )
 ```
 ![factorial.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/binary.gif)
 ```
-1100100
+[1, 1, 0, 0, 1, 0, 0]
 ```
 
 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).
@@ -452,6 +480,8 @@ print( power_set(['a', 'b', 'c']) )
 [['a', 'b', 'c'], ['a', 'b'], ['a', 'c'], ['a'], ['b', 'c'], ['b'], ['c'], []]
 ```
 
+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/power_set.py&timestep=1.0&play).
+
 # Debugging #
 
 For the best debugging experience with memory_graph set for example expression:
@@ -1101,7 +1131,7 @@ $ bash create_gif.sh animated
 ```
 
 # Troubleshooting #
-- Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'somefile.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as the default PDF reader. Another solution is to `render()` the graph to a different output format and to open it manually.
+- Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'memory_graph.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as your default PDF reader. Another solution is to `render()` the graph to a different output format.
 
 - 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.
 

{memory_graph-0.3.54 → memory_graph-0.3.56}/memory_graph.egg-info/SOURCES.txt

@@ -74,6 +74,8 @@ images/rebinding1.png
 images/rebinding2.png
 images/uva.png
 images/vscode_copying.gif
+images/wrap_int.png
+images/wrap_int.py
 memory_graph/__init__.py
 memory_graph/call_stack.py
 memory_graph/config.py

{memory_graph-0.3.54 → memory_graph-0.3.56}/pyproject.toml

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