memory-graph 0.3.24__tar.gz → 0.3.26__tar.gz

{memory_graph-0.3.24/memory_graph.egg-info → memory_graph-0.3.26}/PKG-INFO

@@ -1,7 +1,7 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.24
-Summary: Generate intuitive graphs of your Python data, great for debugging and understanding complex relationships.
+Version: 0.3.26
+Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
 Author-email: bterwijn@gmail.com
@@ -24,6 +24,11 @@ pip install --upgrade memory_graph
 ```
 Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 
+# Videos #
+| [![Quick Intro](https://img.youtube.com/vi/23_bHcr7hqo/0.jpg)](https://www.youtube.com/watch?v=23_bHcr7hqo) | [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
+|:--:|:--:|
+| [Quick Intro](https://www.youtube.com/watch?v=23_bHcr7hqo) | [Mutability](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
+
 # Memory Graph #
 For program understanding and debugging, the [memory_graph](https://pypi.org/project/memory-graph/) package can visualize your data, supporting many different data types, including but not limited to:
 
@@ -41,7 +46,7 @@ mg.show(data)
 ```
 ![many_types.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/many_types.png)
 
-Instead of showing the graph on screen you can also render it to an output file of your choosing (see [Graphviz Output Formats](https://graphviz.org/docs/outputs/)) using for example:
+Instead of showing the graph on screen you can also render it to an output file (see [Graphviz Output Formats](https://graphviz.org/docs/outputs/)) using for example:
 
 ```python
 mg.render(data, "my_graph.pdf")
@@ -93,13 +98,6 @@ identical?: True
 ```
 A better way to understand what data is shared is to draw a graph of the data using the [memory_graph](https://pypi.org/project/memory-graph/) package.
 
-# Videos #
-
-| [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
-|:--:|
-| [Mutability](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
-
-
 # Chapters #
 
 [Python Data Model](#python-data-model)
@@ -364,7 +362,7 @@ The ```mg.stack()``` doesn't work well in *watch* context in most debuggers beca
 | **Visual Studio Code** | `mg.stack_vscode()` |
 | **Pycharm** | `mg.stack_pycharm()` |
 
-![debug_vscode.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debug_vscode.png)
+![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
 
 ## Other Debuggers ##
 For other debuggers, invoke this function within the *watch* context. Then, in the "call_stack.txt" file, identify the slice of functions you wish to include in the call stack.
@@ -418,35 +416,31 @@ import memory_graph as mg
 import random
 random.seed(0) # use same random numbers each run
 
-class Node:
+class Linked_List:
 
-    def __init__(self, value):
-        self.prev = None
+    def __init__(self, value=None, prev=None, next=None):
+        self.prev = prev
         self.value = value
-        self.next = None
-
-class LinkedList:
-
-    def __init__(self):
-        self.head = None
-        self.tail = None
+        self.next = next
 
     def add_front(self, value):
-        new_node = Node(value)
-        if self.head is None:
-            self.head = new_node
-            self.tail = new_node
+        if self.value == None:
+            self.value = value 
+        elif self.next is None:
+            new_node = Linked_List(value)
+            self.prev = new_node
+            self.next = new_node
         else:
-            new_node.next = self.head
-            self.head.prev = new_node
-            self.head = new_node
-        mg.block(mg.show, locals()) # <--- draw locals
+            new_node = Linked_List(value, self.next)
+            self.next.next = new_node
+            self.next = new_node
 
-linked_list = LinkedList()
+linked_list = Linked_List()
 n = 100
 for i in range(n):
-    new_value = random.randrange(n)
-    linked_list.add_front(new_value)
+    value = random.randrange(n)
+    linked_list.add_front(value)
+	mg.show(locals())
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
@@ -581,7 +575,7 @@ mg.render(locals(), 'not_node_types2.png')
 |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
 | not_node_types1.png — simplified | not_node_types2.png — technically correct |
 
-Additionally, the simplification hides away the [reuse of small int values](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.
+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:
@@ -777,9 +771,9 @@ mg.show(locals())
 
 
 # Introspection Depth #
-To limit the size of the graph the maximum depth of the graph is set by `mg.config.max_graph_depth`. Additionally for each type a depth can be set to further limit the graph, as is done for type `B` in the example below. Scissors indicate where the graph is cut. Alternatively the `id()` of a data elements can be used to further limit the graph, as is done for variable `c`.
+To limit the size of the graph the maximum depth of the graph is set by `mg.config.max_graph_depth`. Additionally for each type a depth can be set to further limit the graph, as is done for type `B` in the example below. Scissors indicate where the graph is cut short. Alternatively the `id()` of a data elements can be used to limit the graph for that specific element, as is done for the value referenced by variable `c`.
 
-The value of variable `x` is shown as it is at depth 1 from the root of the graph, but as it can also be reached via `b2` that path need to be shown as well, so this overwrites the depth limit set for type `B`.
+The value of variable `x` is shown as it is at depth 1 from the root of the graph, but as it can also be reached via `b2`, that path need to be shown as well to avoid confusion, so this overwrites the depth limit set for type `B`.
 
 ```python
 import memory_graph as mg
@@ -830,7 +824,7 @@ mg.show(locals())
 
 ## Hidden Edges ##
 
-As the value of `x` is shown in the graph, we would want to show all the references to it, but the Slicer hides references by slicing the list to keep the graph small. The `max_missing_edges` variable determines how many hidden references to `x` we show. If there are more references then we show, then theses hidden references are shown with dashed lines to indicate some references are left out.
+As the value of `x` is shown in the graph, we would want to show all the references to it, but the default list Slicer hides references by slicing the list to keep the graph small. The `max_missing_edges` variable then determines how many additional hidden references to `x` we show. If there are more references then we show, then theses hidden references are shown with dashed lines to indicate some references are left out.
 
 ```python
 import memory_graph as mg

{memory_graph-0.3.24 → memory_graph-0.3.26}/README.md

@@ -5,6 +5,11 @@ pip install --upgrade memory_graph
 ```
 Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 
+# Videos #
+| [![Quick Intro](https://img.youtube.com/vi/23_bHcr7hqo/0.jpg)](https://www.youtube.com/watch?v=23_bHcr7hqo) | [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
+|:--:|:--:|
+| [Quick Intro](https://www.youtube.com/watch?v=23_bHcr7hqo) | [Mutability](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
+
 # Memory Graph #
 For program understanding and debugging, the [memory_graph](https://pypi.org/project/memory-graph/) package can visualize your data, supporting many different data types, including but not limited to:
 
@@ -22,7 +27,7 @@ mg.show(data)
 ```
 ![many_types.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/many_types.png)
 
-Instead of showing the graph on screen you can also render it to an output file of your choosing (see [Graphviz Output Formats](https://graphviz.org/docs/outputs/)) using for example:
+Instead of showing the graph on screen you can also render it to an output file (see [Graphviz Output Formats](https://graphviz.org/docs/outputs/)) using for example:
 
 ```python
 mg.render(data, "my_graph.pdf")
@@ -74,13 +79,6 @@ identical?: True
 ```
 A better way to understand what data is shared is to draw a graph of the data using the [memory_graph](https://pypi.org/project/memory-graph/) package.
 
-# Videos #
-
-| [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
-|:--:|
-| [Mutability](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
-
-
 # Chapters #
 
 [Python Data Model](#python-data-model)
@@ -345,7 +343,7 @@ The ```mg.stack()``` doesn't work well in *watch* context in most debuggers beca
 | **Visual Studio Code** | `mg.stack_vscode()` |
 | **Pycharm** | `mg.stack_pycharm()` |
 
-![debug_vscode.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debug_vscode.png)
+![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
 
 ## Other Debuggers ##
 For other debuggers, invoke this function within the *watch* context. Then, in the "call_stack.txt" file, identify the slice of functions you wish to include in the call stack.
@@ -399,35 +397,31 @@ import memory_graph as mg
 import random
 random.seed(0) # use same random numbers each run
 
-class Node:
+class Linked_List:
 
-    def __init__(self, value):
-        self.prev = None
+    def __init__(self, value=None, prev=None, next=None):
+        self.prev = prev
         self.value = value
-        self.next = None
-
-class LinkedList:
-
-    def __init__(self):
-        self.head = None
-        self.tail = None
+        self.next = next
 
     def add_front(self, value):
-        new_node = Node(value)
-        if self.head is None:
-            self.head = new_node
-            self.tail = new_node
+        if self.value == None:
+            self.value = value 
+        elif self.next is None:
+            new_node = Linked_List(value)
+            self.prev = new_node
+            self.next = new_node
         else:
-            new_node.next = self.head
-            self.head.prev = new_node
-            self.head = new_node
-        mg.block(mg.show, locals()) # <--- draw locals
+            new_node = Linked_List(value, self.next)
+            self.next.next = new_node
+            self.next = new_node
 
-linked_list = LinkedList()
+linked_list = Linked_List()
 n = 100
 for i in range(n):
-    new_value = random.randrange(n)
-    linked_list.add_front(new_value)
+    value = random.randrange(n)
+    linked_list.add_front(value)
+	mg.show(locals())
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
@@ -562,7 +556,7 @@ mg.render(locals(), 'not_node_types2.png')
 |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
 | not_node_types1.png — simplified | not_node_types2.png — technically correct |
 
-Additionally, the simplification hides away the [reuse of small int values](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.
+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:
@@ -758,9 +752,9 @@ mg.show(locals())
 
 
 # Introspection Depth #
-To limit the size of the graph the maximum depth of the graph is set by `mg.config.max_graph_depth`. Additionally for each type a depth can be set to further limit the graph, as is done for type `B` in the example below. Scissors indicate where the graph is cut. Alternatively the `id()` of a data elements can be used to further limit the graph, as is done for variable `c`.
+To limit the size of the graph the maximum depth of the graph is set by `mg.config.max_graph_depth`. Additionally for each type a depth can be set to further limit the graph, as is done for type `B` in the example below. Scissors indicate where the graph is cut short. Alternatively the `id()` of a data elements can be used to limit the graph for that specific element, as is done for the value referenced by variable `c`.
 
-The value of variable `x` is shown as it is at depth 1 from the root of the graph, but as it can also be reached via `b2` that path need to be shown as well, so this overwrites the depth limit set for type `B`.
+The value of variable `x` is shown as it is at depth 1 from the root of the graph, but as it can also be reached via `b2`, that path need to be shown as well to avoid confusion, so this overwrites the depth limit set for type `B`.
 
 ```python
 import memory_graph as mg
@@ -811,7 +805,7 @@ mg.show(locals())
 
 ## Hidden Edges ##
 
-As the value of `x` is shown in the graph, we would want to show all the references to it, but the Slicer hides references by slicing the list to keep the graph small. The `max_missing_edges` variable determines how many hidden references to `x` we show. If there are more references then we show, then theses hidden references are shown with dashed lines to indicate some references are left out.
+As the value of `x` is shown in the graph, we would want to show all the references to it, but the default list Slicer hides references by slicing the list to keep the graph small. The `max_missing_edges` variable then determines how many additional hidden references to `x` we show. If there are more references then we show, then theses hidden references are shown with dashed lines to indicate some references are left out.
 
 ```python
 import memory_graph as mg

{memory_graph-0.3.24 → memory_graph-0.3.26}/images/add_one.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node137952073011776 [label=<
+	node124722886398528 [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]
-	node137952062761408 [label=<
+	node124722875623872 [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]
-	node137952073009984 [label=<
+	node124722886396736 [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]
-	node137952062763008 [label=<
+	node124722875625472 [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]
-	node137952062763008:ref0 -> node137952073011776:table [style=solid]
-	node137952062763008:ref1 -> node137952062761408:table [style=solid]
-	node137952062763008:ref2 -> node137952073009984:table [style=solid]
-	node137952062660080 [label=<
+	node124722875625472:ref0 -> node124722886398528:table [style=solid]
+	node124722875625472:ref1 -> node124722875623872:table [style=solid]
+	node124722875625472:ref2 -> node124722886396736:table [style=solid]
+	node124722875522544 [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]
-	node137952062651776 [label=<
+	node124722875514240 [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]
-	node137952062646464 [label=<
+	node124722875508928 [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]
-	node137952062646464:ref0 -> node137952073011776:table [style=solid]
-	node137952062646464:ref1 -> node137952062660080:table [style=solid]
-	node137952062646464:ref2 -> node137952062651776:table [style=solid]
-	node137952060305680 [label=<
+	node124722875508928:ref0 -> node124722886398528:table [style=solid]
+	node124722875508928:ref1 -> node124722875522544:table [style=solid]
+	node124722875508928:ref2 -> node124722875514240:table [style=solid]
+	node124722873168144 [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]
-	node137952060305680:ref0 -> node137952062763008:table [style=solid]
-	node137952060305680:ref1 -> node137952062646464:table [style=solid]
-subgraph { rank=same; node137952062763008 -> node137952062646464[weight=10, style=invis]; }
-subgraph { rank=same; node137952073011776 -> node137952062761408 -> node137952073009984 -> node137952062660080 -> node137952062651776[weight=10, style=invis]; }
+	node124722873168144:ref0 -> node124722875625472:table [style=solid]
+	node124722873168144:ref1 -> node124722875508928:table [style=solid]
+subgraph { rank=same; node124722875625472 -> node124722875508928[weight=10, style=invis]; }
+subgraph { rank=same; node124722886398528 -> node124722875623872 -> node124722886396736 -> node124722875522544 -> node124722875514240[weight=10, style=invis]; }
 }

{memory_graph-0.3.24 → memory_graph-0.3.26}/images/avltree_dir.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134306137677296 [label=<
+	node124372962549232 [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"> __class__ </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> __delattr__ </TD></TR>
@@ -38,18 +38,18 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">33</font></TD><TD BORDER="1"> value </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node134306137855984 [label=<
+	node124372962727920 [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]
-	node134306137855984:ref0 -> node134306137677296:table [style=solid]
-	node134306139709120 [label=<
+	node124372962727920:ref0 -> node124372962549232:table [style=solid]
+	node124372964581056 [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]
-	node134306139709120:ref0 -> node134306137855984:table [style=solid]
+	node124372964581056:ref0 -> node124372962727920:table [style=solid]
 }

{memory_graph-0.3.24 → memory_graph-0.3.26}/images/avltree_key_value.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134306135313600 [label=<
+	node124372960185536 [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"]
-	node134306135311840 [label=<
+	node124372960183776 [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"]
-	node134306135312000 [label=<
+	node124372960183936 [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"]
-	node134306135312000:ref0 -> node134306135311840:table [style=solid]
-	node134306137677296 [label=<
+	node124372960183936:ref0 -> node124372960183776:table [style=solid]
+	node124372962549232 [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"]
-	node134306137677296:ref0 -> node134306135313600:table [style=solid]
-	node134306137677296:ref1 -> node134306135312000:table [style=solid]
-	node134306137855984 [label=<
+	node124372962549232:ref0 -> node124372960185536:table [style=solid]
+	node124372962549232:ref1 -> node124372960183936:table [style=solid]
+	node124372962727920 [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]
-	node134306137855984:ref0 -> node134306137677296:table [style=solid]
-	node134306139709120 [label=<
+	node124372962727920:ref0 -> node124372962549232:table [style=solid]
+	node124372964581056 [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]
-	node134306139709120:ref0 -> node134306137855984:table [style=solid]
-subgraph { rank=same; node134306135313600 -> node134306135312000[weight=10, style=invis]; }
+	node124372964581056:ref0 -> node124372962727920:table [style=solid]
+subgraph { rank=same; node124372960185536 -> node124372960183936[weight=10, style=invis]; }
 }

{memory_graph-0.3.24 → memory_graph-0.3.26}/images/avltree_leaf.gv

@@ -1,22 +1,22 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134306137677296 [label=<
+	node124372962549232 [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"]
-	node134306137855984 [label=<
+	node124372962727920 [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]
-	node134306137855984:ref0 -> node134306137677296:table [style=solid]
-	node134306139709120 [label=<
+	node124372962727920:ref0 -> node124372962549232:table [style=solid]
+	node124372964581056 [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]
-	node134306139709120:ref0 -> node134306137855984:table [style=solid]
+	node124372964581056:ref0 -> node124372962727920:table [style=solid]
 }

{memory_graph-0.3.24 → memory_graph-0.3.26}/images/avltree_linear.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134306135313600 [label=<
+	node124372960185536 [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"]
-	node134306135311840 [label=<
+	node124372960183776 [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"]
-	node134306135312000 [label=<
+	node124372960183936 [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"]
-	node134306135312000:ref0 -> node134306135311840:table [style=solid]
-	node134306137677296 [label=<
+	node124372960183936:ref0 -> node124372960183776:table [style=solid]
+	node124372962549232 [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"]
-	node134306137677296:ref0 -> node134306135313600:table [style=solid]
-	node134306137677296:ref1 -> node134306135312000:table [style=solid]
-	node134306137855984 [label=<
+	node124372962549232:ref0 -> node124372960185536:table [style=solid]
+	node124372962549232:ref1 -> node124372960183936:table [style=solid]
+	node124372962727920 [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]
-	node134306137855984:ref0 -> node134306137677296:table [style=solid]
-	node134306139709120 [label=<
+	node124372962727920:ref0 -> node124372962549232:table [style=solid]
+	node124372964581056 [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]
-	node134306139709120:ref0 -> node134306137855984:table [style=solid]
-subgraph { rank=same; node134306135313600 -> node134306135312000[weight=10, style=invis]; }
+	node124372964581056:ref0 -> node124372962727920:table [style=solid]
+subgraph { rank=same; node124372960185536 -> node124372960183936[weight=10, style=invis]; }
 }

{memory_graph-0.3.24 → memory_graph-0.3.26}/images/avltree_table.gv

@@ -1,49 +1,49 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134306135313600 [label=<
+	node124372960185536 [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"]
-	node134306135311840 [label=<
+	node124372960183776 [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"]
-	node134306135312000 [label=<
+	node124372960183936 [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"]
-	node134306135312000:ref0 -> node134306135311840:table [style=solid]
-	node134306137677296 [label=<
+	node124372960183936:ref0 -> node124372960183776:table [style=solid]
+	node124372962549232 [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"]
-	node134306137677296:ref0 -> node134306135313600:table [style=solid]
-	node134306137677296:ref1 -> node134306135312000:table [style=solid]
-	node134306137855984 [label=<
+	node124372962549232:ref0 -> node124372960185536:table [style=solid]
+	node124372962549232:ref1 -> node124372960183936:table [style=solid]
+	node124372962727920 [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]
-	node134306137855984:ref0 -> node134306137677296:table [style=solid]
-	node134306139709120 [label=<
+	node124372962727920:ref0 -> node124372962549232:table [style=solid]
+	node124372964581056 [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]
-	node134306139709120:ref0 -> node134306137855984:table [style=solid]
-subgraph { rank=same; node134306135313600 -> node134306135312000[weight=10, style=invis]; }
+	node124372964581056:ref0 -> node124372962727920:table [style=solid]
+subgraph { rank=same; node124372960185536 -> node124372960183936[weight=10, style=invis]; }
 }