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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.26
+Version: 0.3.28
 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
@@ -114,7 +114,7 @@ A better way to understand what data is shared is to draw a graph of the data us
 
 [Introspection](#introspection)
 
-[Introspection Depth](#introspection-depth)
+[Graph Depth](#graph-depth)
 
 [Jupyter Notebook](#jupyter-notebook)
 
@@ -122,6 +122,8 @@ A better way to understand what data is shared is to draw a graph of the data us
 
 [In the Browser](#in-the-browser)
 
+[Animated GIF](#animated-gif)
+
 [Troubleshooting](#troubleshooting)
 
 
@@ -410,37 +412,37 @@ and pressing <Enter> a number of times, results in:
 # Data Structure Examples #
 Module memory_graph can be very useful in a course about data structures, some examples:
 
-## Doubly Linked List ##
+## Circular Doubly Linked List ##
 ```python
 import memory_graph as mg
 import random
 random.seed(0) # use same random numbers each run
 
 class Linked_List:
+    """ Circular doubly linked list """
 
-    def __init__(self, value=None, prev=None, next=None):
-        self.prev = prev
+    def __init__(self, value=None, 
+                 prev=None, next=None):
+        self.prev = prev if prev else self
         self.value = value
-        self.next = next
+        self.next = next if next else self
 
-    def add_front(self, value):
+    def add_back(self, value):
         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 = Linked_List(value, self.next)
-            self.next.next = new_node
-            self.next = new_node
+            new_node = Linked_List(value,
+                                   prev=self.prev,
+                                   next=self)
+            self.prev.next = new_node
+            self.prev = new_node
 
 linked_list = Linked_List()
 n = 100
 for i in range(n):
     value = random.randrange(n)
-    linked_list.add_front(value)
-	mg.show(locals())
+    linked_list.add_back(value)
+    mg.block(mg.show, locals()) # <--- draw locals
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
@@ -770,7 +772,7 @@ mg.show(locals())
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_table.png)
 
 
-# Introspection Depth #
+# Graph 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 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 to avoid confusion, so this overwrites the depth limit set for type `B`.
@@ -865,8 +867,24 @@ Then after starting 'ipython' call function `mg_switch()` to turn on/off the aut
 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>
 ![pyodide.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/pyodide.png)
 
-# Troubleshooting #
 
+# Animated GIF #
+To make an animated GIF use for example `mg.show` or `mg.render` like this:
+
+* mg.show(locals(), 'animated.png', numbered=True)
+* mg.render(locals(), 'animated.png', numbered=True)
+
+in your source or better as a *watch* in a debugger so that stepping through the code generates images:
+
+&nbsp;&nbsp;&nbsp; animated0.png, animated1.png, animated2.png, ...
+
+Then use these images to make an animated GIF, for example using this Bash script [create_gif.sh](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/create_gif.sh):
+
+```bash
+$ bash create_gif.sh animated
+```
+
+# Troubleshooting #
 - Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'somefile.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as the default PDF reader. Another solution is to `render()` the graph to a different output format and to open it manually.
 
 - When graph edges overlap it can be hard to distinguish them. Using an interactive graphviz viewer, such as [xdot](https://github.com/jrfonseca/xdot.py), on a '*.gv' DOT output file will help.

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

@@ -95,7 +95,7 @@ A better way to understand what data is shared is to draw a graph of the data us
 
 [Introspection](#introspection)
 
-[Introspection Depth](#introspection-depth)
+[Graph Depth](#graph-depth)
 
 [Jupyter Notebook](#jupyter-notebook)
 
@@ -103,6 +103,8 @@ A better way to understand what data is shared is to draw a graph of the data us
 
 [In the Browser](#in-the-browser)
 
+[Animated GIF](#animated-gif)
+
 [Troubleshooting](#troubleshooting)
 
 
@@ -391,37 +393,37 @@ and pressing <Enter> a number of times, results in:
 # Data Structure Examples #
 Module memory_graph can be very useful in a course about data structures, some examples:
 
-## Doubly Linked List ##
+## Circular Doubly Linked List ##
 ```python
 import memory_graph as mg
 import random
 random.seed(0) # use same random numbers each run
 
 class Linked_List:
+    """ Circular doubly linked list """
 
-    def __init__(self, value=None, prev=None, next=None):
-        self.prev = prev
+    def __init__(self, value=None, 
+                 prev=None, next=None):
+        self.prev = prev if prev else self
         self.value = value
-        self.next = next
+        self.next = next if next else self
 
-    def add_front(self, value):
+    def add_back(self, value):
         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 = Linked_List(value, self.next)
-            self.next.next = new_node
-            self.next = new_node
+            new_node = Linked_List(value,
+                                   prev=self.prev,
+                                   next=self)
+            self.prev.next = new_node
+            self.prev = new_node
 
 linked_list = Linked_List()
 n = 100
 for i in range(n):
     value = random.randrange(n)
-    linked_list.add_front(value)
-	mg.show(locals())
+    linked_list.add_back(value)
+    mg.block(mg.show, locals()) # <--- draw locals
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
@@ -751,7 +753,7 @@ mg.show(locals())
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_table.png)
 
 
-# Introspection Depth #
+# Graph 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 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 to avoid confusion, so this overwrites the depth limit set for type `B`.
@@ -846,8 +848,24 @@ Then after starting 'ipython' call function `mg_switch()` to turn on/off the aut
 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>
 ![pyodide.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/pyodide.png)
 
-# Troubleshooting #
 
+# Animated GIF #
+To make an animated GIF use for example `mg.show` or `mg.render` like this:
+
+* mg.show(locals(), 'animated.png', numbered=True)
+* mg.render(locals(), 'animated.png', numbered=True)
+
+in your source or better as a *watch* in a debugger so that stepping through the code generates images:
+
+&nbsp;&nbsp;&nbsp; animated0.png, animated1.png, animated2.png, ...
+
+Then use these images to make an animated GIF, for example using this Bash script [create_gif.sh](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/create_gif.sh):
+
+```bash
+$ bash create_gif.sh animated
+```
+
+# Troubleshooting #
 - Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'somefile.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as the default PDF reader. Another solution is to `render()` the graph to a different output format and to open it manually.
 
 - When graph edges overlap it can be hard to distinguish them. Using an interactive graphviz viewer, such as [xdot](https://github.com/jrfonseca/xdot.py), on a '*.gv' DOT output file will help.

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

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node124722886398528 [label=<
+	node136650744844864 [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]
-	node124722875623872 [label=<
+	node136650743234112 [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]
-	node124722886396736 [label=<
+	node136650744843072 [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]
-	node124722875625472 [label=<
+	node136650743230144 [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]
-	node124722875625472:ref0 -> node124722886398528:table [style=solid]
-	node124722875625472:ref1 -> node124722875623872:table [style=solid]
-	node124722875625472:ref2 -> node124722886396736:table [style=solid]
-	node124722875522544 [label=<
+	node136650743230144:ref0 -> node136650744844864:table [style=solid]
+	node136650743230144:ref1 -> node136650743234112:table [style=solid]
+	node136650743230144:ref2 -> node136650744843072:table [style=solid]
+	node136650744825872 [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]
-	node124722875514240 [label=<
+	node136650743119168 [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]
-	node124722875508928 [label=<
+	node136650743113856 [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]
-	node124722875508928:ref0 -> node124722886398528:table [style=solid]
-	node124722875508928:ref1 -> node124722875522544:table [style=solid]
-	node124722875508928:ref2 -> node124722875514240:table [style=solid]
-	node124722873168144 [label=<
+	node136650743113856:ref0 -> node136650744844864:table [style=solid]
+	node136650743113856:ref1 -> node136650744825872:table [style=solid]
+	node136650743113856:ref2 -> node136650743119168:table [style=solid]
+	node136650740772896 [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]
-	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]; }
+	node136650740772896:ref0 -> node136650743230144:table [style=solid]
+	node136650740772896:ref1 -> node136650743113856:table [style=solid]
+subgraph { rank=same; node136650743230144 -> node136650743113856[weight=10, style=invis]; }
+subgraph { rank=same; node136650744844864 -> node136650743234112 -> node136650744843072 -> node136650744825872 -> node136650743119168[weight=10, style=invis]; }
 }

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

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

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

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node124372960185536 [label=<
+	node130351332363056 [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"]
-	node124372960183776 [label=<
+	node130351332361296 [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"]
-	node124372960183936 [label=<
+	node130351332361456 [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"]
-	node124372960183936:ref0 -> node124372960183776:table [style=solid]
-	node124372962549232 [label=<
+	node130351332361456:ref0 -> node130351332361296:table [style=solid]
+	node130351336425488 [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"]
-	node124372962549232:ref0 -> node124372960185536:table [style=solid]
-	node124372962549232:ref1 -> node124372960183936:table [style=solid]
-	node124372962727920 [label=<
+	node130351336425488:ref0 -> node130351332363056:table [style=solid]
+	node130351336425488:ref1 -> node130351332361456:table [style=solid]
+	node130351334904784 [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]
-	node124372962727920:ref0 -> node124372962549232:table [style=solid]
-	node124372964581056 [label=<
+	node130351334904784:ref0 -> node130351336425488:table [style=solid]
+	node130351336759104 [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]
-	node124372964581056:ref0 -> node124372962727920:table [style=solid]
-subgraph { rank=same; node124372960185536 -> node124372960183936[weight=10, style=invis]; }
+	node130351336759104:ref0 -> node130351334904784:table [style=solid]
+subgraph { rank=same; node130351332363056 -> node130351332361456[weight=10, style=invis]; }
 }

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

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

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

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node124372960185536 [label=<
+	node130351332363056 [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"]
-	node124372960183776 [label=<
+	node130351332361296 [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"]
-	node124372960183936 [label=<
+	node130351332361456 [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"]
-	node124372960183936:ref0 -> node124372960183776:table [style=solid]
-	node124372962549232 [label=<
+	node130351332361456:ref0 -> node130351332361296:table [style=solid]
+	node130351336425488 [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"]
-	node124372962549232:ref0 -> node124372960185536:table [style=solid]
-	node124372962549232:ref1 -> node124372960183936:table [style=solid]
-	node124372962727920 [label=<
+	node130351336425488:ref0 -> node130351332363056:table [style=solid]
+	node130351336425488:ref1 -> node130351332361456:table [style=solid]
+	node130351334904784 [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]
-	node124372962727920:ref0 -> node124372962549232:table [style=solid]
-	node124372964581056 [label=<
+	node130351334904784:ref0 -> node130351336425488:table [style=solid]
+	node130351336759104 [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]
-	node124372964581056:ref0 -> node124372962727920:table [style=solid]
-subgraph { rank=same; node124372960185536 -> node124372960183936[weight=10, style=invis]; }
+	node130351336759104:ref0 -> node130351334904784:table [style=solid]
+subgraph { rank=same; node130351332363056 -> node130351332361456[weight=10, style=invis]; }
 }

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

@@ -1,49 +1,49 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node124372960185536 [label=<
+	node130351332363056 [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"]
-	node124372960183776 [label=<
+	node130351332361296 [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"]
-	node124372960183936 [label=<
+	node130351332361456 [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"]
-	node124372960183936:ref0 -> node124372960183776:table [style=solid]
-	node124372962549232 [label=<
+	node130351332361456:ref0 -> node130351332361296:table [style=solid]
+	node130351336425488 [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"]
-	node124372962549232:ref0 -> node124372960185536:table [style=solid]
-	node124372962549232:ref1 -> node124372960183936:table [style=solid]
-	node124372962727920 [label=<
+	node130351336425488:ref0 -> node130351332363056:table [style=solid]
+	node130351336425488:ref1 -> node130351332361456:table [style=solid]
+	node130351334904784 [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]
-	node124372962727920:ref0 -> node124372962549232:table [style=solid]
-	node124372964581056 [label=<
+	node130351334904784:ref0 -> node130351336425488:table [style=solid]
+	node130351336759104 [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]
-	node124372964581056:ref0 -> node124372962727920:table [style=solid]
-subgraph { rank=same; node124372960185536 -> node124372960183936[weight=10, style=invis]; }
+	node130351336759104:ref0 -> node130351334904784:table [style=solid]
+subgraph { rank=same; node130351332363056 -> node130351332361456[weight=10, style=invis]; }
 }