memory-graph 0.3.41__tar.gz → 0.3.43__tar.gz

{memory_graph-0.3.41/memory_graph.egg-info → memory_graph-0.3.43}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.41
+Version: 0.3.43
 Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -213,7 +213,7 @@ mg.show(locals())
 * `c2` is a **shallow copy**, only the value referenced by the first reference is copied, all the underlying values are shared
 * `c3` is a **deep copy**, all the values are copied, nothing is shared
 
-![copies.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copies.png)
+![copy_mutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mutable.png)
 
 
 ## Custom Copy ##
@@ -242,6 +242,41 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
 
+## Copying values of Immutable type ## 
+Because a value of immutable type will be copied automatically when it is changed, there is no need to copy it beforehand. Therefore, a shallow or deep copy of a value of immutable type will just result in an assignment to save time.
+
+```python
+import memory_graph as mg
+import copy
+
+a = ( (1, 2), ('x', 'y') ) # a nested tuple
+
+# three different ways to make a "copy" of 'a':
+c1 = a
+c2 = copy.copy(a)
+c3 = copy.deepcopy(a)
+
+mg.render(locals(), 'copy_immutable.png')
+```
+![copy_immutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_immutable.png)
+
+## Copying a mix of Mutable and Immutable values ##
+When copying a mix of values of mutable and immutable type, a deep copy will try to copy as few values of immutable type as possible in order to copy each value of mutable type.
+```python
+import memory_graph as mg
+import copy
+
+a = ( [1, 2], ('x', 'y') ) # mix of mutable and immutable
+
+# three different ways to make a "copy" of 'a':
+c1 = a
+c2 = copy.copy(a)
+c3 = copy.deepcopy(a)
+
+mg.render(locals(), 'copy_mix.png')
+```
+![copy_mix.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mix.png)
+
 ## 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 a new value without effecting any other variables.
 
@@ -299,7 +334,7 @@ This function:
 * first executes `fun(arg1, arg2, ...)`
 * then prints the current source location in the program
 * then blocks execution until the &lt;Enter&gt; key is pressed
-* finally returns the value of the `fun()` call
+* finally returns the return value of the `fun()` call
 
 ## Recursion ##
 The call stack is also helpful to visualize how recursion works. Here we use `mg.block()` to show each step of how recursively `factorial(4)` is computed:
@@ -323,7 +358,7 @@ print( factorial(4) )
 and the result is: 1 x 2 x 3 x 4 = 24
 
 ## Binary ##
-A more interesting recursive example is function `binary()` that converts an integer to binary representation. 
+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
@@ -385,7 +420,7 @@ as a *watch* in a debugger tool such as the integrated debugger in Visual Studio
 ## Call Stack in Watch Context ##
 The ```mg.stack()``` doesn't work well in *watch* context in most debuggers because debuggers introduce additional stack frames that cause problems. Use these alternative functions for various debuggers to filter out these problematic stack frames:
 
-| debugger | function to get the call stack |
+| debugger | function to get the call stack in 'watch' context |
 |:---|:---|
 | [pdb](https://docs.python.org/3/library/pdb.html), [pudb](https://pypi.org/project/pudb/) | `mg.stack_pdb()` |
 | [Visual Studio Code](https://code.visualstudio.com/docs/languages/python) | `mg.stack_vscode()` |
@@ -588,13 +623,13 @@ Different aspects of memory_graph can be configured. The default configuration c
   - The maximum length of strings shown in the graph. Longer strings will be truncated.
 
 - ***mg.config.not_node_types*** : set[type]
-  - Holds all types for which no seperate node is drawn but that instead are shown as elements in their parent Node.
+  - Holds all types for which no separate node is drawn but that instead are shown as elements in their parent Node.
 
 - ***mg.config.no_child_references_types*** : set[type]
   - The set of key_value types that don't draw references to their direct childeren but have their children shown as elements of their node.
 
 - ***mg.config.type_to_node*** : dict[type, fun(data) -> Node]
-  - Determines how a data types is converted to a Node (sub)class for visualization in the graph.
+  - Determines how a data type is converted to a Node subclass for visualization in the graph.
 
 - ***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. 
@@ -639,24 +674,6 @@ mg.render(locals(), 'not_node_types2.png')
 
 Additionally, the simplification hides away the [reuse of small int values \[-5, 256\]](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
 
-## Temporary Configuration ##
-In addition to the global configuration, a temporary configuration can be set for a single `show()` or `render()` call to change the colors, orientation, and slicer. This example highlights a particular list element in red, gives it a horizontal orientation, and overwrites the default slicer for lists:
-
-```python
-import memory_graph as mg
-from memory_graph.slicer import Slicer
-
-data = [ list(range(20)) for i in range(1,5)]
-highlight = data[2]
-
-mg.show( locals(),
-    colors    = {id(highlight): "red"   },  # set color to red
-    verticals = {id(highlight): False   },  # set horizontal orientation
-    slicers   = {id(highlight): Slicer()}   # set no slicing 
-)
-```
-![highlight.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/highlight.png)
-
 # Introspection #
 This section is likely to change. Sometimes the introspection fails or is not as desired. For example the `bintrees.avltree.Node` object doesn't show any attributes in the graph below.
 
@@ -699,7 +716,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_dir.png)
 
-Next figure out what are the attributes you want to graph and choose a Node type, there are four options:
+Next figure out what the attributes are you want to graph and choose a Node type, there are four options:
 
 ## 1) Node_Leaf ##
 Node_Leaf is a node with no children and shows just a single value.
@@ -925,9 +942,11 @@ import numpy as np
 import memory_graph.extension_numpy
 np.random.seed(0) # use same random numbers each run
 
-array = np.array([1.1, 2, 3, 4, 5])
-matrix = np.matrix([[i*20+j for j in range(20)] for i in range(20)])
-ndarray = np.random.rand(20,20)
+matrix = np.matrix([[i*5+j for j in range(4)] for i in range(5)])
+ndarray_1d = np.array([1.1, 2, 3, 4, 5])
+ndarray_2d = np.random.rand(3,2)
+ndarray_3d = np.random.rand(2,2,2)
+
 mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
@@ -951,6 +970,23 @@ mg.show(locals())
 ```
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
 
+## PyTorch ##
+Torch type `tensor` can be graphed with "memory_graph.extension_torch":
+
+```python
+import memory_graph as mg
+import torch
+import memory_graph.extension_torch
+torch.manual_seed(0) # same random numbers each run
+
+tensor_1d = torch.rand(3)
+tensor_2d = torch.rand(3, 2)
+tensor_3d = torch.rand(2, 2, 2)
+
+mg.show(locals())
+```
+![extension_torch.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_torch.png)
+
 # Jupyter Notebook #
 In Jupyter Notebook `locals()` has additional variables that cause problems in the graph, use `mg.locals_jupyter()` to get the local variables with these problematic variables filtered out. Use `mg.stack_jupyter()` to get the whole call stack with these variables filtered out.
 

{memory_graph-0.3.41 → memory_graph-0.3.43}/README.md

@@ -193,7 +193,7 @@ mg.show(locals())
 * `c2` is a **shallow copy**, only the value referenced by the first reference is copied, all the underlying values are shared
 * `c3` is a **deep copy**, all the values are copied, nothing is shared
 
-![copies.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copies.png)
+![copy_mutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mutable.png)
 
 
 ## Custom Copy ##
@@ -222,6 +222,41 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
 
+## Copying values of Immutable type ## 
+Because a value of immutable type will be copied automatically when it is changed, there is no need to copy it beforehand. Therefore, a shallow or deep copy of a value of immutable type will just result in an assignment to save time.
+
+```python
+import memory_graph as mg
+import copy
+
+a = ( (1, 2), ('x', 'y') ) # a nested tuple
+
+# three different ways to make a "copy" of 'a':
+c1 = a
+c2 = copy.copy(a)
+c3 = copy.deepcopy(a)
+
+mg.render(locals(), 'copy_immutable.png')
+```
+![copy_immutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_immutable.png)
+
+## Copying a mix of Mutable and Immutable values ##
+When copying a mix of values of mutable and immutable type, a deep copy will try to copy as few values of immutable type as possible in order to copy each value of mutable type.
+```python
+import memory_graph as mg
+import copy
+
+a = ( [1, 2], ('x', 'y') ) # mix of mutable and immutable
+
+# three different ways to make a "copy" of 'a':
+c1 = a
+c2 = copy.copy(a)
+c3 = copy.deepcopy(a)
+
+mg.render(locals(), 'copy_mix.png')
+```
+![copy_mix.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mix.png)
+
 ## 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 a new value without effecting any other variables.
 
@@ -279,7 +314,7 @@ This function:
 * first executes `fun(arg1, arg2, ...)`
 * then prints the current source location in the program
 * then blocks execution until the <Enter> key is pressed
-* finally returns the value of the `fun()` call
+* finally returns the return value of the `fun()` call
 
 ## Recursion ##
 The call stack is also helpful to visualize how recursion works. Here we use `mg.block()` to show each step of how recursively `factorial(4)` is computed:
@@ -303,7 +338,7 @@ print( factorial(4) )
 and the result is: 1 x 2 x 3 x 4 = 24
 
 ## Binary ##
-A more interesting recursive example is function `binary()` that converts an integer to binary representation. 
+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
@@ -365,7 +400,7 @@ as a *watch* in a debugger tool such as the integrated debugger in Visual Studio
 ## Call Stack in Watch Context ##
 The ```mg.stack()``` doesn't work well in *watch* context in most debuggers because debuggers introduce additional stack frames that cause problems. Use these alternative functions for various debuggers to filter out these problematic stack frames:
 
-| debugger | function to get the call stack |
+| debugger | function to get the call stack in 'watch' context |
 |:---|:---|
 | [pdb](https://docs.python.org/3/library/pdb.html), [pudb](https://pypi.org/project/pudb/) | `mg.stack_pdb()` |
 | [Visual Studio Code](https://code.visualstudio.com/docs/languages/python) | `mg.stack_vscode()` |
@@ -568,13 +603,13 @@ Different aspects of memory_graph can be configured. The default configuration c
   - The maximum length of strings shown in the graph. Longer strings will be truncated.
 
 - ***mg.config.not_node_types*** : set[type]
-  - Holds all types for which no seperate node is drawn but that instead are shown as elements in their parent Node.
+  - Holds all types for which no separate node is drawn but that instead are shown as elements in their parent Node.
 
 - ***mg.config.no_child_references_types*** : set[type]
   - The set of key_value types that don't draw references to their direct childeren but have their children shown as elements of their node.
 
 - ***mg.config.type_to_node*** : dict[type, fun(data) -> Node]
-  - Determines how a data types is converted to a Node (sub)class for visualization in the graph.
+  - Determines how a data type is converted to a Node subclass for visualization in the graph.
 
 - ***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. 
@@ -619,24 +654,6 @@ mg.render(locals(), 'not_node_types2.png')
 
 Additionally, the simplification hides away the [reuse of small int values \[-5, 256\]](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
 
-## Temporary Configuration ##
-In addition to the global configuration, a temporary configuration can be set for a single `show()` or `render()` call to change the colors, orientation, and slicer. This example highlights a particular list element in red, gives it a horizontal orientation, and overwrites the default slicer for lists:
-
-```python
-import memory_graph as mg
-from memory_graph.slicer import Slicer
-
-data = [ list(range(20)) for i in range(1,5)]
-highlight = data[2]
-
-mg.show( locals(),
-    colors    = {id(highlight): "red"   },  # set color to red
-    verticals = {id(highlight): False   },  # set horizontal orientation
-    slicers   = {id(highlight): Slicer()}   # set no slicing 
-)
-```
-![highlight.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/highlight.png)
-
 # Introspection #
 This section is likely to change. Sometimes the introspection fails or is not as desired. For example the `bintrees.avltree.Node` object doesn't show any attributes in the graph below.
 
@@ -679,7 +696,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_dir.png)
 
-Next figure out what are the attributes you want to graph and choose a Node type, there are four options:
+Next figure out what the attributes are you want to graph and choose a Node type, there are four options:
 
 ## 1) Node_Leaf ##
 Node_Leaf is a node with no children and shows just a single value.
@@ -905,9 +922,11 @@ import numpy as np
 import memory_graph.extension_numpy
 np.random.seed(0) # use same random numbers each run
 
-array = np.array([1.1, 2, 3, 4, 5])
-matrix = np.matrix([[i*20+j for j in range(20)] for i in range(20)])
-ndarray = np.random.rand(20,20)
+matrix = np.matrix([[i*5+j for j in range(4)] for i in range(5)])
+ndarray_1d = np.array([1.1, 2, 3, 4, 5])
+ndarray_2d = np.random.rand(3,2)
+ndarray_3d = np.random.rand(2,2,2)
+
 mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
@@ -931,6 +950,23 @@ mg.show(locals())
 ```
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
 
+## PyTorch ##
+Torch type `tensor` can be graphed with "memory_graph.extension_torch":
+
+```python
+import memory_graph as mg
+import torch
+import memory_graph.extension_torch
+torch.manual_seed(0) # same random numbers each run
+
+tensor_1d = torch.rand(3)
+tensor_2d = torch.rand(3, 2)
+tensor_3d = torch.rand(2, 2, 2)
+
+mg.show(locals())
+```
+![extension_torch.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_torch.png)
+
 # Jupyter Notebook #
 In Jupyter Notebook `locals()` has additional variables that cause problems in the graph, use `mg.locals_jupyter()` to get the local variables with these problematic variables filtered out. Use `mg.stack_jupyter()` to get the whole call stack with these variables filtered out.
 

memory_graph-0.3.43/images/.idea/.gitignore

@@ -0,0 +1,8 @@
+# Default ignored files
+/shelf/
+/workspace.xml
+# Editor-based HTTP Client requests
+/httpRequests/
+# Datasource local storage ignored files
+/dataSources/
+/dataSources.local.xml

memory_graph-0.3.43/images/.idea/images.iml

@@ -0,0 +1,12 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="PYTHON_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="jdk" jdkName="Python 3.13 virtualenv at ~/python3.13_env" jdkType="Python SDK" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+  <component name="PyDocumentationSettings">
+    <option name="format" value="PLAIN" />
+    <option name="myDocStringFormat" value="Plain" />
+  </component>
+</module>

memory_graph-0.3.43/images/.idea/inspectionProfiles/profiles_settings.xml

@@ -0,0 +1,6 @@
+<component name="InspectionProjectProfileManager">
+  <settings>
+    <option name="USE_PROJECT_PROFILE" value="false" />
+    <version value="1.0" />
+  </settings>
+</component>

memory_graph-0.3.43/images/.idea/misc.xml

@@ -0,0 +1,7 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="Black">
+    <option name="sdkName" value="Python 3.13 virtualenv at ~/python3.13_env" />
+  </component>
+  <component name="ProjectRootManager" version="2" project-jdk-name="Python 3.13 virtualenv at ~/python3.13_env" project-jdk-type="Python SDK" />
+</project>

memory_graph-0.3.43/images/.idea/modules.xml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/images.iml" filepath="$PROJECT_DIR$/.idea/images.iml" />
+    </modules>
+  </component>
+</project>

memory_graph-0.3.43/images/.idea/vcs.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$/.." vcs="Git" />
+  </component>
+</project>

memory_graph-0.3.43/images/.idea/workspace.xml

@@ -0,0 +1,83 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="AutoImportSettings">
+    <option name="autoReloadType" value="SELECTIVE" />
+  </component>
+  <component name="ChangeListManager">
+    <list default="true" id="6720a3cc-6c0b-46cb-bb85-b452407a2980" name="Changes" comment="" />
+    <option name="SHOW_DIALOG" value="false" />
+    <option name="HIGHLIGHT_CONFLICTS" value="true" />
+    <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
+    <option name="LAST_RESOLUTION" value="IGNORE" />
+  </component>
+  <component name="Git.Settings">
+    <option name="RECENT_GIT_ROOT_PATH" value="$PROJECT_DIR$/.." />
+  </component>
+  <component name="ProjectColorInfo">{
+  &quot;associatedIndex&quot;: 5
+}</component>
+  <component name="ProjectId" id="2yB9ZteNF5pFmuhrHRsT32pNxbW" />
+  <component name="ProjectViewState">
+    <option name="hideEmptyMiddlePackages" value="true" />
+    <option name="showLibraryContents" value="true" />
+  </component>
+  <component name="PropertiesComponent">{
+  &quot;keyToString&quot;: {
+    &quot;ModuleVcsDetector.initialDetectionPerformed&quot;: &quot;true&quot;,
+    &quot;Python.vsc.executor&quot;: &quot;Debug&quot;,
+    &quot;RunOnceActivity.ShowReadmeOnStart&quot;: &quot;true&quot;,
+    &quot;RunOnceActivity.git.unshallow&quot;: &quot;true&quot;,
+    &quot;git-widget-placeholder&quot;: &quot;main&quot;,
+    &quot;node.js.detected.package.eslint&quot;: &quot;true&quot;,
+    &quot;node.js.detected.package.tslint&quot;: &quot;true&quot;,
+    &quot;node.js.selected.package.eslint&quot;: &quot;(autodetect)&quot;,
+    &quot;node.js.selected.package.tslint&quot;: &quot;(autodetect)&quot;,
+    &quot;nodejs_package_manager_path&quot;: &quot;npm&quot;,
+    &quot;vue.rearranger.settings.migration&quot;: &quot;true&quot;
+  }
+}</component>
+  <component name="SharedIndexes">
+    <attachedChunks>
+      <set>
+        <option value="bundled-js-predefined-d6986cc7102b-6a121458b545-JavaScript-PY-251.25410.159" />
+        <option value="bundled-python-sdk-e0ed3721d81e-36ea0e71a18c-com.jetbrains.pycharm.pro.sharedIndexes.bundled-PY-251.25410.159" />
+      </set>
+    </attachedChunks>
+  </component>
+  <component name="TaskManager">
+    <task active="true" id="Default" summary="Default task">
+      <changelist id="6720a3cc-6c0b-46cb-bb85-b452407a2980" name="Changes" comment="" />
+      <created>1749297161293</created>
+      <option name="number" value="Default" />
+      <option name="presentableId" value="Default" />
+      <updated>1749297161293</updated>
+      <workItem from="1749297163364" duration="1155000" />
+      <workItem from="1749298804721" duration="147000" />
+      <workItem from="1749299658479" duration="919000" />
+    </task>
+    <servers />
+  </component>
+  <component name="TypeScriptGeneratedFilesManager">
+    <option name="version" value="3" />
+  </component>
+  <component name="XDebuggerManager">
+    <breakpoint-manager>
+      <breakpoints>
+        <line-breakpoint enabled="true" suspend="THREAD" type="python-line">
+          <url>file://$PROJECT_DIR$/vsc.py</url>
+          <line>26</line>
+          <option name="timeStamp" value="3" />
+        </line-breakpoint>
+      </breakpoints>
+    </breakpoint-manager>
+    <watches-manager>
+      <configuration name="PythonConfigurationType">
+        <watch expression="mg.save_call_stack('stack.txt')" language="Python" />
+        <watch expression="mg.render(mg.stack_pycharm())" language="Python" />
+      </configuration>
+    </watches-manager>
+  </component>
+  <component name="com.intellij.coverage.CoverageDataManagerImpl">
+    <SUITE FILE_PATH="coverage/images$vsc.coverage" NAME="vsc Coverage Results" MODIFIED="1749300268269" SOURCE_PROVIDER="com.intellij.coverage.DefaultCoverageFileProvider" RUNNER="coverage.py" COVERAGE_BY_TEST_ENABLED="false" COVERAGE_TRACING_ENABLED="false" WORKING_DIRECTORY="$PROJECT_DIR$" />
+  </component>
+</project>

{memory_graph-0.3.41 → memory_graph-0.3.43}/images/add_one.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node126342197744192 [label=<
+	node124410937527872 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="lightcoral" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
@@ -8,30 +8,30 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
 </TABLE>
 > xlabel=list]
-	node126342187335232 [label=<
+	node124410926965568 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="orange" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="1"> 2 </TD></TR>
 </TABLE>
 > xlabel=tuple]
-	node126342197742400 [label=<
+	node124410926228608 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="lightcoral" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="1"> 2 </TD></TR>
 </TABLE>
 > xlabel=list]
-	node126342187215040 [label=<
+	node124410926788224 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> a </TD><TD BORDER="1" STYLE="ROUNDED"> b </TD><TD BORDER="1" STYLE="ROUNDED"> c </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD><TD BORDER="1" PORT="ref2"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node126342187215040:ref0 -> node126342197744192:table [style=solid]
-	node126342187215040:ref1 -> node126342187335232:table [style=solid]
-	node126342187215040:ref2 -> node126342197742400:table [style=solid]
-	node126342197725200 [label=<
+	node124410926788224:ref0 -> node124410937527872:table [style=solid]
+	node124410926788224:ref1 -> node124410926965568:table [style=solid]
+	node124410926788224:ref2 -> node124410926228608:table [style=solid]
+	node124410937470832 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="orange" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
@@ -39,7 +39,7 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
 </TABLE>
 > xlabel=tuple]
-	node126342187331776 [label=<
+	node124410926965952 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="lightcoral" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
@@ -47,23 +47,23 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
 </TABLE>
 > xlabel=list]
-	node126342184895424 [label=<
+	node124410922387648 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> a </TD><TD BORDER="1" STYLE="ROUNDED"> b </TD><TD BORDER="1" STYLE="ROUNDED"> c </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD><TD BORDER="1" PORT="ref2"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node126342184895424:ref0 -> node126342197744192:table [style=solid]
-	node126342184895424:ref1 -> node126342197725200:table [style=solid]
-	node126342184895424:ref2 -> node126342187331776:table [style=solid]
-	node126342184890960 [label=<
+	node124410922387648:ref0 -> node124410937527872:table [style=solid]
+	node124410922387648:ref1 -> node124410937470832:table [style=solid]
+	node124410922387648:ref2 -> node124410926965952:table [style=solid]
+	node124410922460144 [label=<
 <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="khaki" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> 0: &lt;module&gt; </TD><TD BORDER="1" STYLE="ROUNDED"> 1: add_one </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
 </TABLE>
 > xlabel=call_stack]
-	node126342184890960:ref0 -> node126342187215040:table [style=solid]
-	node126342184890960:ref1 -> node126342184895424:table [style=solid]
-subgraph { rank=same; node126342187215040 -> node126342184895424[weight=10, style=invis]; }
-subgraph { rank=same; node126342197744192 -> node126342187335232 -> node126342197742400 -> node126342197725200 -> node126342187331776[weight=10, style=invis]; }
+	node124410922460144:ref0 -> node124410926788224:table [style=solid]
+	node124410922460144:ref1 -> node124410922387648:table [style=solid]
+subgraph { rank=same; node124410926788224 -> node124410922387648[weight=10, style=invis]; }
+subgraph { rank=same; node124410937527872 -> node124410926965568 -> node124410926228608 -> node124410937470832 -> node124410926965952[weight=10, style=invis]; }
 }

memory_graph-0.3.43/images/avltree.py~

@@ -0,0 +1,41 @@
+import memory_graph as mg
+import bintrees
+
+# Create an AVL tree
+tree = bintrees.AVLTree()
+tree.insert(10, "ten")
+tree.insert(5, "five")
+tree.insert(20, "twenty")
+tree.insert(15, "fifteen")
+
+mg.render(locals(), 'avltree_fail.png')
+
+mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
+mg.render(locals(), 'avltree_color.png')
+
+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.render(locals(), 'avltree_dir.png')
+
+mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_base.Node_Base(f"key:{data.key} value:{data.value}")
+mg.render(locals(), 'avltree_base.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.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.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.render(locals(), 'avltree_table.png')