memory-graph 0.3.42__tar.gz → 0.3.44__tar.gz

{memory_graph-0.3.42/memory_graph.egg-info → memory_graph-0.3.44}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.42
+Version: 0.3.44
 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
@@ -192,7 +192,7 @@ mg.render(locals(), 'mutable2.png')
 
 One practical reason why Python makes the distinction between mutable and immutable types is that a value of a mutable type can be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much, or are small making copying less of a concern.
 
-## Copying ##
+## Copying Values of Mutable Type ##
 Python offers three different "copy" options that we will demonstrate using a nested list:
 
 ```python
@@ -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 result in just an assignment to save on the time needed to make the copy and the space (=memory) needed to store the values.
+
+```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.show(locals())
+```
+![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, to save on time and space, 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.show(locals())
+```
+![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()` |
@@ -982,7 +1017,7 @@ See for example [colab_example.ipynb](https://raw.githubusercontent.com/bterwijn
 ![colab_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/colab_example.png)
 
 # In the Browser #
-We can also run memory_graph in the browser: <a href="https://bterwijn.github.io/memory_graph/src/pyodide.html" target="_blank">Pyodide Example</a>
+We can also use memory_graph in the browser: <a href="https://bterwijn.github.io/memory_graph/src/pyodide.html" target="_blank">Pyodide Example</a>
 ![pyodide.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/pyodide.png)
 
 

{memory_graph-0.3.42 → memory_graph-0.3.44}/README.md

@@ -172,7 +172,7 @@ mg.render(locals(), 'mutable2.png')
 
 One practical reason why Python makes the distinction between mutable and immutable types is that a value of a mutable type can be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much, or are small making copying less of a concern.
 
-## Copying ##
+## Copying Values of Mutable Type ##
 Python offers three different "copy" options that we will demonstrate using a nested list:
 
 ```python
@@ -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 result in just an assignment to save on the time needed to make the copy and the space (=memory) needed to store the values.
+
+```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.show(locals())
+```
+![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, to save on time and space, 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.show(locals())
+```
+![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()` |
@@ -962,7 +997,7 @@ See for example [colab_example.ipynb](https://raw.githubusercontent.com/bterwijn
 ![colab_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/colab_example.png)
 
 # In the Browser #
-We can also run memory_graph in the browser: <a href="https://bterwijn.github.io/memory_graph/src/pyodide.html" target="_blank">Pyodide Example</a>
+We can also use memory_graph in the browser: <a href="https://bterwijn.github.io/memory_graph/src/pyodide.html" target="_blank">Pyodide Example</a>
 ![pyodide.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/pyodide.png)
 
 

{memory_graph-0.3.42 → memory_graph-0.3.44}/images/add_one.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node123501132205632 [label=<
+	node127655305006656 [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]
-	node123501131031488 [label=<
+	node127655294509888 [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]
-	node123501130294400 [label=<
+	node127655293772928 [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]
-	node123501130853888 [label=<
+	node127655294332544 [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]
-	node123501130853888:ref0 -> node123501132205632:table [style=solid]
-	node123501130853888:ref1 -> node123501131031488:table [style=solid]
-	node123501130853888:ref2 -> node123501130294400:table [style=solid]
-	node123501132148592 [label=<
+	node127655294332544:ref0 -> node127655305006656:table [style=solid]
+	node127655294332544:ref1 -> node127655294509888:table [style=solid]
+	node127655294332544:ref2 -> node127655293772928:table [style=solid]
+	node127655294474960 [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]
-	node123501131031872 [label=<
+	node127655294510272 [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]
-	node123501126452672 [label=<
+	node127655289932736 [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]
-	node123501126452672:ref0 -> node123501132205632:table [style=solid]
-	node123501126452672:ref1 -> node123501132148592:table [style=solid]
-	node123501126452672:ref2 -> node123501131031872:table [style=solid]
-	node123501126509712 [label=<
+	node127655289932736:ref0 -> node127655305006656:table [style=solid]
+	node127655289932736:ref1 -> node127655294474960:table [style=solid]
+	node127655289932736:ref2 -> node127655294510272:table [style=solid]
+	node127655290005664 [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]
-	node123501126509712:ref0 -> node123501130853888:table [style=solid]
-	node123501126509712:ref1 -> node123501126452672:table [style=solid]
-subgraph { rank=same; node123501130853888 -> node123501126452672[weight=10, style=invis]; }
-subgraph { rank=same; node123501132205632 -> node123501131031488 -> node123501130294400 -> node123501132148592 -> node123501131031872[weight=10, style=invis]; }
+	node127655290005664:ref0 -> node127655294332544:table [style=solid]
+	node127655290005664:ref1 -> node127655289932736:table [style=solid]
+subgraph { rank=same; node127655294332544 -> node127655289932736[weight=10, style=invis]; }
+subgraph { rank=same; node127655305006656 -> node127655294509888 -> node127655293772928 -> node127655294474960 -> node127655294510272[weight=10, style=invis]; }
 }

{memory_graph-0.3.42 → memory_graph-0.3.44}/images/avltree_key_value.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134455640685072 [label=<
+	node134196776614496 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> left </TD><TD BORDER="1"> None </TD></TR>
     <TR><TD BORDER="1" STYLE="ROUNDED"> key </TD><TD BORDER="1"> 5 </TD></TR>
@@ -8,7 +8,7 @@ digraph memory_graph {
     <TR><TD BORDER="1" STYLE="ROUNDED"> right </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node134455640930432 [label=<
+	node134196776859856 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> left </TD><TD BORDER="1"> None </TD></TR>
     <TR><TD BORDER="1" STYLE="ROUNDED"> key </TD><TD BORDER="1"> 15 </TD></TR>
@@ -16,34 +16,34 @@ digraph memory_graph {
     <TR><TD BORDER="1" STYLE="ROUNDED"> right </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node134455640930512 [label=<
+	node134196776859936 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> left </TD><TD BORDER="1" STYLE="ROUNDED"> key </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> right </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 20 </TD><TD BORDER="1"> twenty </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node134455640930512:ref0 -> node134455640930432:table [style=solid]
-	node134455655526256 [label=<
+	node134196776859936:ref0 -> node134196776859856:table [style=solid]
+	node134196791832432 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> left </TD><TD BORDER="1" STYLE="ROUNDED"> key </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> right </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 10 </TD><TD BORDER="1"> ten </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node134455655526256:ref0 -> node134455640685072:table [style=solid]
-	node134455655526256:ref1 -> node134455640930512:table [style=solid]
-	node134455642149216 [label=<
+	node134196791832432:ref0 -> node134196776614496:table [style=solid]
+	node134196791832432:ref1 -> node134196776859936:table [style=solid]
+	node134196778143760 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
 </TABLE>
 > xlabel=AVLTree]
-	node134455642149216:ref0 -> node134455655526256:table [style=solid]
-	node134455644882880 [label=<
+	node134196778143760:ref0 -> node134196791832432:table [style=solid]
+	node134196780812224 [label=<
 <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node134455644882880:ref0 -> node134455642149216:table [style=solid]
-subgraph { rank=same; node134455640685072 -> node134455640930512[weight=10, style=invis]; }
+	node134196780812224:ref0 -> node134196778143760:table [style=solid]
+subgraph { rank=same; node134196776614496 -> node134196776859936[weight=10, style=invis]; }
 }

{memory_graph-0.3.42 → memory_graph-0.3.44}/images/avltree_leaf.gv

@@ -1,22 +1,22 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134455655526256 [label=<
+	node134196791832432 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="1"> key:10 value:ten </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node134455642149216 [label=<
+	node134196778143760 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
 </TABLE>
 > xlabel=AVLTree]
-	node134455642149216:ref0 -> node134455655526256:table [style=solid]
-	node134455644882880 [label=<
+	node134196778143760:ref0 -> node134196791832432:table [style=solid]
+	node134196780812224 [label=<
 <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node134455644882880:ref0 -> node134455642149216:table [style=solid]
+	node134196780812224:ref0 -> node134196778143760:table [style=solid]
 }

{memory_graph-0.3.42 → memory_graph-0.3.44}/images/avltree_linear.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134455640685072 [label=<
+	node134196776614496 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> left: </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD></TR>
@@ -12,7 +12,7 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">7</font></TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node134455640930432 [label=<
+	node134196776859856 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> left: </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD></TR>
@@ -24,34 +24,34 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">7</font></TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node134455640930512 [label=<
+	node134196776859936 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="0"><font color="#505050">4</font></TD><TD BORDER="0"><font color="#505050">5</font></TD><TD BORDER="0"><font color="#505050">6</font></TD><TD BORDER="0"><font color="#505050">7</font></TD></TR>
     <TR><TD BORDER="1"> left: </TD><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> key: </TD><TD BORDER="1"> 20 </TD><TD BORDER="1"> value: </TD><TD BORDER="1"> twenty </TD><TD BORDER="1"> right: </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node134455640930512:ref0 -> node134455640930432:table [style=solid]
-	node134455655526256 [label=<
+	node134196776859936:ref0 -> node134196776859856:table [style=solid]
+	node134196791832432 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="0"><font color="#505050">4</font></TD><TD BORDER="0"><font color="#505050">5</font></TD><TD BORDER="0"><font color="#505050">6</font></TD><TD BORDER="0"><font color="#505050">7</font></TD></TR>
     <TR><TD BORDER="1"> left: </TD><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> key: </TD><TD BORDER="1"> 10 </TD><TD BORDER="1"> value: </TD><TD BORDER="1"> ten </TD><TD BORDER="1"> right: </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node134455655526256:ref0 -> node134455640685072:table [style=solid]
-	node134455655526256:ref1 -> node134455640930512:table [style=solid]
-	node134455642149216 [label=<
+	node134196791832432:ref0 -> node134196776614496:table [style=solid]
+	node134196791832432:ref1 -> node134196776859936:table [style=solid]
+	node134196778143760 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
 </TABLE>
 > xlabel=AVLTree]
-	node134455642149216:ref0 -> node134455655526256:table [style=solid]
-	node134455644882880 [label=<
+	node134196778143760:ref0 -> node134196791832432:table [style=solid]
+	node134196780812224 [label=<
 <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node134455644882880:ref0 -> node134455642149216:table [style=solid]
-subgraph { rank=same; node134455640685072 -> node134455640930512[weight=10, style=invis]; }
+	node134196780812224:ref0 -> node134196778143760:table [style=solid]
+subgraph { rank=same; node134196776614496 -> node134196776859936[weight=10, style=invis]; }
 }

{memory_graph-0.3.42 → memory_graph-0.3.44}/images/avltree_table.gv

@@ -1,49 +1,49 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134455640685072 [label=<
+	node134196776614496 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0">  </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 5 </TD><TD BORDER="1"> five </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node 2⨯2"]
-	node134455640930432 [label=<
+	node134196776859856 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0">  </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 15 </TD><TD BORDER="1"> fifteen </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node 2⨯2"]
-	node134455640930512 [label=<
+	node134196776859936 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0">  </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 20 </TD><TD BORDER="1"> twenty </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node 2⨯2"]
-	node134455640930512:ref0 -> node134455640930432:table [style=solid]
-	node134455655526256 [label=<
+	node134196776859936:ref0 -> node134196776859856:table [style=solid]
+	node134196791832432 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0">  </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 10 </TD><TD BORDER="1"> ten </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
 </TABLE>
 > xlabel="Node 2⨯2"]
-	node134455655526256:ref0 -> node134455640685072:table [style=solid]
-	node134455655526256:ref1 -> node134455640930512:table [style=solid]
-	node134455642149216 [label=<
+	node134196791832432:ref0 -> node134196776614496:table [style=solid]
+	node134196791832432:ref1 -> node134196776859936:table [style=solid]
+	node134196778143760 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
 </TABLE>
 > xlabel=AVLTree]
-	node134455642149216:ref0 -> node134455655526256:table [style=solid]
-	node134455644882880 [label=<
+	node134196778143760:ref0 -> node134196791832432:table [style=solid]
+	node134196780812224 [label=<
 <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node134455644882880:ref0 -> node134455642149216:table [style=solid]
-subgraph { rank=same; node134455640685072 -> node134455640930512[weight=10, style=invis]; }
+	node134196780812224:ref0 -> node134196778143760:table [style=solid]
+subgraph { rank=same; node134196776614496 -> node134196776859936[weight=10, style=invis]; }
 }