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

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

@@ -1,9 +1,34 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.43
+Version: 0.3.45
 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
+License: BSD 2-Clause License
+        
+        Copyright (c) 2017, pyexample
+        All rights reserved.
+        
+        Redistribution and use in source and binary forms, with or without
+        modification, are permitted provided that the following conditions are met:
+        
+        * Redistributions of source code must retain the above copyright notice, this
+          list of conditions and the following disclaimer.
+        
+        * Redistributions in binary form must reproduce the above copyright notice,
+          this list of conditions and the following disclaimer in the documentation
+          and/or other materials provided with the distribution.
+        
+        THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+        AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+        IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+        DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+        FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+        DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+        SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+        CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+        OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+        OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+        
 Project-URL: Homepage, https://github.com/bterwijn/memory_graph
 Project-URL: Repository, https://github.com/bterwijn/memory_graph.git
 Classifier: Development Status :: 4 - Beta
@@ -192,7 +217,7 @@ mg.render(locals(), 'mutable2.png')
 
 One practical reason why Python makes the distinction between mutable and immutable types is that a value of a mutable type can be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much, or are small making copying less of a concern.
 
-## Copying ##
+## Copying Values of Mutable Type ##
 Python offers three different "copy" options that we will demonstrate using a nested list:
 
 ```python
@@ -242,8 +267,8 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
 
-## Copying values of Immutable type ## 
-Because a value of immutable type will be copied automatically when it is changed, there is no need to copy it beforehand. Therefore, a shallow or deep copy of a value of immutable type will just result in an assignment to save time.
+## Copying Values of Immutable Type ## 
+Because a value of immutable type will be copied automatically when it is changed, there is no need to copy it beforehand. Therefore, a shallow or deep copy of a value of immutable type will result in just an assignment to save on the time needed to make the copy and the space (=memory) needed to store the values.
 
 ```python
 import memory_graph as mg
@@ -256,12 +281,12 @@ c1 = a
 c2 = copy.copy(a)
 c3 = copy.deepcopy(a)
 
-mg.render(locals(), 'copy_immutable.png')
+mg.show(locals())
 ```
 ![copy_immutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_immutable.png)
 
-## Copying a mix of Mutable and Immutable values ##
-When copying a mix of values of mutable and immutable type, a deep copy will try to copy as few values of immutable type as possible in order to copy each value of mutable type.
+## Copying a Mix of Mutable and Immutable Values ##
+When copying a mix of values of mutable and immutable type, to save on time and space, a deep copy will try to copy as few values of immutable type as possible in order to copy each value of mutable type.
 ```python
 import memory_graph as mg
 import copy
@@ -273,7 +298,7 @@ c1 = a
 c2 = copy.copy(a)
 c3 = copy.deepcopy(a)
 
-mg.render(locals(), 'copy_mix.png')
+mg.show(locals())
 ```
 ![copy_mix.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mix.png)
 
@@ -1017,7 +1042,7 @@ See for example [colab_example.ipynb](https://raw.githubusercontent.com/bterwijn
 ![colab_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/colab_example.png)
 
 # In the Browser #
-We can also run memory_graph in the browser: <a href="https://bterwijn.github.io/memory_graph/src/pyodide.html" target="_blank">Pyodide Example</a>
+We can also use memory_graph in the browser: <a href="https://bterwijn.github.io/memory_graph/src/pyodide.html" target="_blank">Pyodide Example</a>
 ![pyodide.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/pyodide.png)
 
 

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

@@ -172,7 +172,7 @@ mg.render(locals(), 'mutable2.png')
 
 One practical reason why Python makes the distinction between mutable and immutable types is that a value of a mutable type can be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much, or are small making copying less of a concern.
 
-## Copying ##
+## Copying Values of Mutable Type ##
 Python offers three different "copy" options that we will demonstrate using a nested list:
 
 ```python
@@ -222,8 +222,8 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
 
-## Copying values of Immutable type ## 
-Because a value of immutable type will be copied automatically when it is changed, there is no need to copy it beforehand. Therefore, a shallow or deep copy of a value of immutable type will just result in an assignment to save time.
+## Copying Values of Immutable Type ## 
+Because a value of immutable type will be copied automatically when it is changed, there is no need to copy it beforehand. Therefore, a shallow or deep copy of a value of immutable type will result in just an assignment to save on the time needed to make the copy and the space (=memory) needed to store the values.
 
 ```python
 import memory_graph as mg
@@ -236,12 +236,12 @@ c1 = a
 c2 = copy.copy(a)
 c3 = copy.deepcopy(a)
 
-mg.render(locals(), 'copy_immutable.png')
+mg.show(locals())
 ```
 ![copy_immutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_immutable.png)
 
-## Copying a mix of Mutable and Immutable values ##
-When copying a mix of values of mutable and immutable type, a deep copy will try to copy as few values of immutable type as possible in order to copy each value of mutable type.
+## Copying a Mix of Mutable and Immutable Values ##
+When copying a mix of values of mutable and immutable type, to save on time and space, a deep copy will try to copy as few values of immutable type as possible in order to copy each value of mutable type.
 ```python
 import memory_graph as mg
 import copy
@@ -253,7 +253,7 @@ c1 = a
 c2 = copy.copy(a)
 c3 = copy.deepcopy(a)
 
-mg.render(locals(), 'copy_mix.png')
+mg.show(locals())
 ```
 ![copy_mix.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mix.png)
 
@@ -997,7 +997,7 @@ See for example [colab_example.ipynb](https://raw.githubusercontent.com/bterwijn
 ![colab_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/colab_example.png)
 
 # In the Browser #
-We can also run memory_graph in the browser: <a href="https://bterwijn.github.io/memory_graph/src/pyodide.html" target="_blank">Pyodide Example</a>
+We can also use memory_graph in the browser: <a href="https://bterwijn.github.io/memory_graph/src/pyodide.html" target="_blank">Pyodide Example</a>
 ![pyodide.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/pyodide.png)
 
 

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

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

{memory_graph-0.3.43 → memory_graph-0.3.45}/images/avltree_key_value.gv

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

{memory_graph-0.3.43 → memory_graph-0.3.45}/images/avltree_leaf.gv

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

{memory_graph-0.3.43 → memory_graph-0.3.45}/images/avltree_linear.gv

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

{memory_graph-0.3.43 → memory_graph-0.3.45}/images/avltree_table.gv

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

{memory_graph-0.3.43 → memory_graph-0.3.45}/images/bin_search.gv

@@ -1,11 +1,11 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node92207600 [label=<
+	node71226912 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="0" CELLPADDING="0" BGCOLOR="seagreen3" PORT="table">
     <TR><TD BORDER="0"> </TD></TR>
 </TABLE>
 > xlabel=type]
-	node124238232052864 [label=<
+	node136060382225536 [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"> 57 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 86 </TD></TR>
@@ -24,96 +24,96 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">14</font></TD><TD BORDER="1"> 978 </TD></TR>
 </TABLE>
 > xlabel=list]
-	node124238228316992 [label=<
+	node136060378326208 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> List_View </TD><TD BORDER="1" STYLE="ROUNDED"> n </TD><TD BORDER="1" STYLE="ROUNDED"> data </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 15 </TD><TD BORDER="1" PORT="ref1"> </TD><TD BORDER="1"> 315 </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node124238228316992:ref0 -> node92207600:table [style=solid]
-	node124238228316992:ref1 -> node124238232052864:table [style=solid]
-	node124238230628944 [label=<
+	node136060378326208:ref0 -> node71226912:table [style=solid]
+	node136060378326208:ref1 -> node136060382225536:table [style=solid]
+	node136060380605008 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> lst </TD><TD BORDER="1" STYLE="ROUNDED"> begin </TD><TD BORDER="1" STYLE="ROUNDED"> end </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 0 </TD><TD BORDER="1"> 15 </TD></TR>
 </TABLE>
 > xlabel=List_View]
-	node124238230628944:ref0 -> node124238232052864:table [style=solid]
-	node124238228317504 [label=<
+	node136060380605008:ref0 -> node136060382225536:table [style=solid]
+	node136060378326720 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> view </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> mid </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 315 </TD><TD BORDER="1"> 7 </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node124238228317504:ref0 -> node124238230628944:table [style=solid]
-	node124238229351440 [label=<
+	node136060378326720:ref0 -> node136060380605008:table [style=solid]
+	node136060379343888 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> lst </TD><TD BORDER="1" STYLE="ROUNDED"> begin </TD><TD BORDER="1" STYLE="ROUNDED"> end </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 0 </TD><TD BORDER="1"> 7 </TD></TR>
 </TABLE>
 > xlabel=List_View]
-	node124238229351440:ref0 -> node124238232052864:table [style=solid]
-	node124238228317632 [label=<
+	node136060379343888:ref0 -> node136060382225536:table [style=solid]
+	node136060378326848 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> view </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> mid </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 315 </TD><TD BORDER="1"> 3 </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node124238228317632:ref0 -> node124238229351440:table [style=solid]
-	node124238229351760 [label=<
+	node136060378326848:ref0 -> node136060379343888:table [style=solid]
+	node136060379344208 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> lst </TD><TD BORDER="1" STYLE="ROUNDED"> begin </TD><TD BORDER="1" STYLE="ROUNDED"> end </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 3 </TD><TD BORDER="1"> 7 </TD></TR>
 </TABLE>
 > xlabel=List_View]
-	node124238229351760:ref0 -> node124238232052864:table [style=solid]
-	node124238228317760 [label=<
+	node136060379344208:ref0 -> node136060382225536:table [style=solid]
+	node136060378326976 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> view </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> mid </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 315 </TD><TD BORDER="1"> 5 </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node124238228317760:ref0 -> node124238229351760:table [style=solid]
-	node124238228129648 [label=<
+	node136060378326976:ref0 -> node136060379344208:table [style=solid]
+	node136060378138480 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> lst </TD><TD BORDER="1" STYLE="ROUNDED"> begin </TD><TD BORDER="1" STYLE="ROUNDED"> end </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 3 </TD><TD BORDER="1"> 5 </TD></TR>
 </TABLE>
 > xlabel=List_View]
-	node124238228129648:ref0 -> node124238232052864:table [style=solid]
-	node124238228317888 [label=<
+	node136060378138480:ref0 -> node136060382225536:table [style=solid]
+	node136060378327104 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> view </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> mid </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 315 </TD><TD BORDER="1"> 4 </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node124238228317888:ref0 -> node124238228129648:table [style=solid]
-	node124238228129952 [label=<
+	node136060378327104:ref0 -> node136060378138480:table [style=solid]
+	node136060378138784 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> lst </TD><TD BORDER="1" STYLE="ROUNDED"> begin </TD><TD BORDER="1" STYLE="ROUNDED"> end </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD><TD BORDER="1"> 5 </TD></TR>
 </TABLE>
 > xlabel=List_View]
-	node124238228129952:ref0 -> node124238232052864:table [style=solid]
-	node124238228318016 [label=<
+	node136060378138784:ref0 -> node136060382225536:table [style=solid]
+	node136060378327232 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> view </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> mid </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 315 </TD><TD BORDER="1"> 4 </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node124238228318016:ref0 -> node124238228129952:table [style=solid]
-	node124238228291040 [label=<
+	node136060378327232:ref0 -> node136060378138784:table [style=solid]
+	node136060378399440 [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: bin_search </TD><TD BORDER="1" STYLE="ROUNDED"> 2: bin_search </TD><TD BORDER="1" STYLE="ROUNDED"> 3: bin_search </TD><TD BORDER="1" STYLE="ROUNDED"> 4: bin_search </TD><TD BORDER="1" STYLE="ROUNDED"> 5: bin_search </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD><TD BORDER="1" PORT="ref2"> </TD><TD BORDER="1" PORT="ref3"> </TD><TD BORDER="1" PORT="ref4"> </TD><TD BORDER="1" PORT="ref5"> </TD></TR>
 </TABLE>
 > xlabel=call_stack]
-	node124238228291040:ref0 -> node124238228316992:table [style=solid]
-	node124238228291040:ref1 -> node124238228317504:table [style=solid]
-	node124238228291040:ref2 -> node124238228317632:table [style=solid]
-	node124238228291040:ref3 -> node124238228317760:table [style=solid]
-	node124238228291040:ref4 -> node124238228317888:table [style=solid]
-	node124238228291040:ref5 -> node124238228318016:table [style=solid]
-subgraph { rank=same; node124238228316992 -> node124238228317504 -> node124238228317632 -> node124238228317760 -> node124238228317888 -> node124238228318016[weight=10, style=invis]; }
-subgraph { rank=same; node92207600 -> node124238232052864 -> node124238230628944 -> node124238229351440 -> node124238229351760 -> node124238228129648 -> node124238228129952[weight=10, style=invis]; }
+	node136060378399440:ref0 -> node136060378326208:table [style=solid]
+	node136060378399440:ref1 -> node136060378326720:table [style=solid]
+	node136060378399440:ref2 -> node136060378326848:table [style=solid]
+	node136060378399440:ref3 -> node136060378326976:table [style=solid]
+	node136060378399440:ref4 -> node136060378327104:table [style=solid]
+	node136060378399440:ref5 -> node136060378327232:table [style=solid]
+subgraph { rank=same; node136060378326208 -> node136060378326720 -> node136060378326848 -> node136060378326976 -> node136060378327104 -> node136060378327232[weight=10, style=invis]; }
+subgraph { rank=same; node71226912 -> node136060382225536 -> node136060380605008 -> node136060379343888 -> node136060379344208 -> node136060378138480 -> node136060378138784[weight=10, style=invis]; }
 }