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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.40
+Version: 0.3.42
 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
@@ -302,28 +302,50 @@ This function:
 * finally returns the 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(3)``` is computed:
+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:
 
 ```python
 import memory_graph as mg
 
 def factorial(n):
+    mg.block(mg.show, mg.stack())
     if n==0:
         return 1
-    mg.block(mg.show, mg.stack())
     result = n * factorial(n-1)
     mg.block(mg.show, mg.stack())
     return result
 
-print(factorial(3))
+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 = 6
+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. 
+```python
+import memory_graph as mg
+mg.config.type_to_vertical[list] = False  # horizontal lists
+
+def binary(value: int) -> list[int]:
+    mg.block(mg.show(), mg.stack())
+    if value == 0:
+        return []
+    quotient, remainder = divmod(value, 2)
+    result = binary(quotient) + [remainder]
+    mg.block(mg.show(), mg.stack())
+    return result
+
+print( binary(100) )
+```
+![factorial.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/binary.gif)
+```
+1100100
+```
 
 ## Power Set ##
-A more interesting recursive example that shows sharing of data is power_set(). A power set is the set of all subsets of a collection of values.
+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.
 
 ```python
 import memory_graph as mg
@@ -566,18 +588,18 @@ 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. 
 
-- ***mg.config.type_to_vertical_orientation*** : dict[type, bool]
+- ***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_slicer*** : dict[type, int]
@@ -617,24 +639,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
-    vertical_orientations = {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.
 
@@ -677,7 +681,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.
@@ -903,9 +907,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)
@@ -929,6 +935,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.40 → memory_graph-0.3.42}/README.md

@@ -282,28 +282,50 @@ This function:
 * finally returns the 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(3)``` is computed:
+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:
 
 ```python
 import memory_graph as mg
 
 def factorial(n):
+    mg.block(mg.show, mg.stack())
     if n==0:
         return 1
-    mg.block(mg.show, mg.stack())
     result = n * factorial(n-1)
     mg.block(mg.show, mg.stack())
     return result
 
-print(factorial(3))
+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 = 6
+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. 
+```python
+import memory_graph as mg
+mg.config.type_to_vertical[list] = False  # horizontal lists
+
+def binary(value: int) -> list[int]:
+    mg.block(mg.show(), mg.stack())
+    if value == 0:
+        return []
+    quotient, remainder = divmod(value, 2)
+    result = binary(quotient) + [remainder]
+    mg.block(mg.show(), mg.stack())
+    return result
+
+print( binary(100) )
+```
+![factorial.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/binary.gif)
+```
+1100100
+```
 
 ## Power Set ##
-A more interesting recursive example that shows sharing of data is power_set(). A power set is the set of all subsets of a collection of values.
+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.
 
 ```python
 import memory_graph as mg
@@ -546,18 +568,18 @@ 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. 
 
-- ***mg.config.type_to_vertical_orientation*** : dict[type, bool]
+- ***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_slicer*** : dict[type, int]
@@ -597,24 +619,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
-    vertical_orientations = {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.
 
@@ -657,7 +661,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.
@@ -883,9 +887,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)
@@ -909,6 +915,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.40 → memory_graph-0.3.42}/images/add_one.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134420842319424 [label=<
+	node123501132205632 [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]
-	node134420832617152 [label=<
+	node123501131031488 [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]
-	node134420831954048 [label=<
+	node123501130294400 [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]
-	node134420832513664 [label=<
+	node123501130853888 [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]
-	node134420832513664:ref0 -> node134420842319424:table [style=solid]
-	node134420832513664:ref1 -> node134420832617152:table [style=solid]
-	node134420832513664:ref2 -> node134420831954048:table [style=solid]
-	node134420842262384 [label=<
+	node123501130853888:ref0 -> node123501132205632:table [style=solid]
+	node123501130853888:ref1 -> node123501131031488:table [style=solid]
+	node123501130853888:ref2 -> node123501130294400:table [style=solid]
+	node123501132148592 [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]
-	node134420832641984 [label=<
+	node123501131031872 [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]
-	node134420830922432 [label=<
+	node123501126452672 [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]
-	node134420830922432:ref0 -> node134420842319424:table [style=solid]
-	node134420830922432:ref1 -> node134420842262384:table [style=solid]
-	node134420830922432:ref2 -> node134420832641984:table [style=solid]
-	node134420828004560 [label=<
+	node123501126452672:ref0 -> node123501132205632:table [style=solid]
+	node123501126452672:ref1 -> node123501132148592:table [style=solid]
+	node123501126452672:ref2 -> node123501131031872:table [style=solid]
+	node123501126509712 [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]
-	node134420828004560:ref0 -> node134420832513664:table [style=solid]
-	node134420828004560:ref1 -> node134420830922432:table [style=solid]
-subgraph { rank=same; node134420832513664 -> node134420830922432[weight=10, style=invis]; }
-subgraph { rank=same; node134420842319424 -> node134420832617152 -> node134420831954048 -> node134420842262384 -> node134420832641984[weight=10, style=invis]; }
+	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]; }
 }

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

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node128266169186192 [label=<
+	node134455640685072 [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"]
-	node128266169431552 [label=<
+	node134455640930432 [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"]
-	node128266169431632 [label=<
+	node134455640930512 [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"]
-	node128266169431632:ref0 -> node128266169431552:table [style=solid]
-	node128266183667568 [label=<
+	node134455640930512:ref0 -> node134455640930432:table [style=solid]
+	node134455655526256 [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"]
-	node128266183667568:ref0 -> node128266169186192:table [style=solid]
-	node128266183667568:ref1 -> node128266169431632:table [style=solid]
-	node128266170748608 [label=<
+	node134455655526256:ref0 -> node134455640685072:table [style=solid]
+	node134455655526256:ref1 -> node134455640930512:table [style=solid]
+	node134455642149216 [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]
-	node128266170748608:ref0 -> node128266183667568:table [style=solid]
-	node128266173384640 [label=<
+	node134455642149216:ref0 -> node134455655526256:table [style=solid]
+	node134455644882880 [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]
-	node128266173384640:ref0 -> node128266170748608:table [style=solid]
-subgraph { rank=same; node128266169186192 -> node128266169431632[weight=10, style=invis]; }
+	node134455644882880:ref0 -> node134455642149216:table [style=solid]
+subgraph { rank=same; node134455640685072 -> node134455640930512[weight=10, style=invis]; }
 }

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

@@ -1,22 +1,22 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node128266183667568 [label=<
+	node134455655526256 [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"]
-	node128266170748608 [label=<
+	node134455642149216 [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]
-	node128266170748608:ref0 -> node128266183667568:table [style=solid]
-	node128266173384640 [label=<
+	node134455642149216:ref0 -> node134455655526256:table [style=solid]
+	node134455644882880 [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]
-	node128266173384640:ref0 -> node128266170748608:table [style=solid]
+	node134455644882880:ref0 -> node134455642149216:table [style=solid]
 }

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

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node128266169186192 [label=<
+	node134455640685072 [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"]
-	node128266169431552 [label=<
+	node134455640930432 [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"]
-	node128266169431632 [label=<
+	node134455640930512 [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"]
-	node128266169431632:ref0 -> node128266169431552:table [style=solid]
-	node128266183667568 [label=<
+	node134455640930512:ref0 -> node134455640930432:table [style=solid]
+	node134455655526256 [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"]
-	node128266183667568:ref0 -> node128266169186192:table [style=solid]
-	node128266183667568:ref1 -> node128266169431632:table [style=solid]
-	node128266170748608 [label=<
+	node134455655526256:ref0 -> node134455640685072:table [style=solid]
+	node134455655526256:ref1 -> node134455640930512:table [style=solid]
+	node134455642149216 [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]
-	node128266170748608:ref0 -> node128266183667568:table [style=solid]
-	node128266173384640 [label=<
+	node134455642149216:ref0 -> node134455655526256:table [style=solid]
+	node134455644882880 [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]
-	node128266173384640:ref0 -> node128266170748608:table [style=solid]
-subgraph { rank=same; node128266169186192 -> node128266169431632[weight=10, style=invis]; }
+	node134455644882880:ref0 -> node134455642149216:table [style=solid]
+subgraph { rank=same; node134455640685072 -> node134455640930512[weight=10, style=invis]; }
 }

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

@@ -1,49 +1,49 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node128266169186192 [label=<
+	node134455640685072 [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"]
-	node128266169431552 [label=<
+	node134455640930432 [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"]
-	node128266169431632 [label=<
+	node134455640930512 [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"]
-	node128266169431632:ref0 -> node128266169431552:table [style=solid]
-	node128266183667568 [label=<
+	node134455640930512:ref0 -> node134455640930432:table [style=solid]
+	node134455655526256 [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"]
-	node128266183667568:ref0 -> node128266169186192:table [style=solid]
-	node128266183667568:ref1 -> node128266169431632:table [style=solid]
-	node128266170748608 [label=<
+	node134455655526256:ref0 -> node134455640685072:table [style=solid]
+	node134455655526256:ref1 -> node134455640930512:table [style=solid]
+	node134455642149216 [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]
-	node128266170748608:ref0 -> node128266183667568:table [style=solid]
-	node128266173384640 [label=<
+	node134455642149216:ref0 -> node134455655526256:table [style=solid]
+	node134455644882880 [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]
-	node128266173384640:ref0 -> node128266170748608:table [style=solid]
-subgraph { rank=same; node128266169186192 -> node128266169431632[weight=10, style=invis]; }
+	node134455644882880:ref0 -> node134455642149216:table [style=solid]
+subgraph { rank=same; node134455640685072 -> node134455640930512[weight=10, style=invis]; }
 }