memory-graph 0.3.38__tar.gz → 0.3.39__tar.gz

{memory_graph-0.3.38/memory_graph.egg-info → memory_graph-0.3.39}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.38
+Version: 0.3.39
 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
@@ -61,7 +61,7 @@ mg.render(data) # renders to default: 'memory_graph.pdf'
 ```
 
 # Sharing Values #
-In Python, assigning the list from variable `a` to variable `b` causes both variables to reference the same list value and thus share it. Consequently, any change applied through one variable will impact the other. This behavior can lead to elusive bugs if a programmer incorrectly assumes that list `a` and `b` are independent.
+In Python, assigning a list from variable `a` to variable `b` causes both variables to reference the same list value and thus share it. Consequently, any change applied through one variable will impact the other. This behavior can lead to elusive bugs if a programmer incorrectly assumes that list `a` and `b` are independent.
 
 <table><tr><td> 
 
@@ -100,7 +100,7 @@ b: 4, 3, 2, 1
 ids: 126432214913216 126432214913216
 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.
+A better way to understand what data is shared is to draw a graph using [memory_graph](https://pypi.org/project/memory-graph/).
 
 # Chapters #
 
@@ -108,20 +108,18 @@ A better way to understand what data is shared is to draw a graph of the data us
 
 [Call Stack](#call-stack)
 
-[Global Import Trick](#global-import-trick)
-
 [Debugging](#debugging)
 
 [Data Structure Examples](#data-structure-examples)
 
 [Configuration](#configuration)
 
-[Extensions](#extensions)
-
 [Introspection](#introspection)
 
 [Graph Depth](#graph-depth)
 
+[Extensions](#extensions)
+
 [Jupyter Notebook](#jupyter-notebook)
 
 [ipython](#ipython)
@@ -182,7 +180,7 @@ a = [4, 3, 2]
 b = a
 mg.render(locals(), 'mutable1.png')
 
-b += [1] # equivalent to:  b.append(1)
+b += [1]  # equivalent to:  b.append(1)
 mg.render(locals(), 'mutable2.png')
 ```
 | ![mutable1.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/mutable1.png) | ![mutable2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/mutable2.png) |
@@ -198,11 +196,11 @@ Python offers three different "copy" options that we will demonstrate using a ne
 import memory_graph as mg
 import copy
 
-a = [ [1, 2], ['x', 'y'] ] # a nested list (a list containing lists)
+a = [ [1, 2], ['x', 'y'] ]  # a nested list (a list containing lists)
 
 # three different ways to make a "copy" of 'a':
 c1 = a
-c2 = copy.copy(a) # equivalent to:  a.copy() a[:] list(a)
+c2 = copy.copy(a)  # equivalent to:  a.copy() a[:] list(a)
 c3 = copy.deepcopy(a)
 
 mg.show(locals())
@@ -333,9 +331,9 @@ def get_subsets(subsets, data, i, subset):
         subsets.append(subset.copy())
         return
     subset.append(data[i])
-    get_subsets(subsets, data, i+1, subset) #    do include data[i]
+    get_subsets(subsets, data, i+1, subset)  #    do include data[i]
     subset.pop()
-    get_subsets(subsets, data, i+1, subset) # don't include data[i]
+    get_subsets(subsets, data, i+1, subset)  # don't include data[i]
     mg.block(mg.show, mg.stack())
 
 def power_set(data):
@@ -429,7 +427,7 @@ Package memory_graph can be very useful in a data structures course, some exampl
 ```python
 import memory_graph as mg
 import random
-random.seed(0) # use same random numbers each run
+random.seed(0)  # use same random numbers each run
 
 class Linked_List:
     """ Circular doubly linked list """
@@ -455,7 +453,7 @@ n = 100
 for i in range(n):
     value = random.randrange(n)
     linked_list.add_back(value)
-    mg.block(mg.show, locals()) # <--- draw locals
+    mg.block(mg.show, locals())  # <--- draw locals
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
@@ -489,7 +487,7 @@ class BinTree:
                 self.larger = BinTree(value)
             else:
                 self.larger.add(value)
-        mg.block(mg.show, mg.stack()) # <--- draw stack
+        mg.block(mg.show, mg.stack())  # <--- draw stack
 
 tree = BinTree()
 n = 100
@@ -508,7 +506,7 @@ Here we show values being inserted in a Binary Tree in Visual Studio Code. When
 ```python
 import memory_graph as mg
 import random
-random.seed(0) # use same random numbers each run
+random.seed(0)  # use same random numbers each run
 
 class HashSet:
 
@@ -521,7 +519,7 @@ class HashSet:
             self.buckets[index] = []
         bucket = self.buckets[index]
         bucket.append(value)
-        mg.block(mg.show, locals()) # <--- draw locals
+        mg.block(mg.show, locals())  # <--- draw locals
 
     def contains(self, value):
         index = hash(value) % len(self.buckets)
@@ -549,6 +547,9 @@ Here we show values being inserted in a HashSet in PyCharm. When inserting the l
 # Configuration #
 Different aspects of memory_graph can be configured. The default configuration can be reset by calling 'mg.config_default.reset()'.
 
+- ***mg.reopen_viewer*** : bool
+  - If True the viewer is reopened each time show() is called, this might change window focus, default True.
+
 - ***mg.config.render_filename*** : str
   - The default filename to render to, default 'memory_graph.pdf'.
 
@@ -603,7 +604,7 @@ a = [100, 200, 300]
 b = a.copy()
 mg.render(locals(), 'not_node_types1.png')
 
-mg.config.not_node_types.remove(int) # now show separate nodes for int values
+mg.config.not_node_types.remove(int)  # now show separate nodes for int values
 
 mg.render(locals(), 'not_node_types2.png')
 ```
@@ -624,51 +625,13 @@ data = [ list(range(20)) for i in range(1,5)]
 highlight = data[2]
 
 mg.show( locals(),
-    colors                = {id(highlight): "red"   }, # set color to red
-    vertical_orientations = {id(highlight): False   }, # set horizontal orientation
-    slicers               = {id(highlight): Slicer()}  # set no slicing 
+    colors                = {id(highlight): "red"   },  # set color to red
+    vertical_orientations = {id(highlight): False   },  # set horizontal orientation
+    slicers               = {id(highlight): Slicer()}   # set no slicing
 )
 ```
 ![highlight.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/highlight.png)
 
-# Extensions #
-Different extensions are available for types from other Python packages. 
-
-## Numpy ##
-Numpy types `array` and `matrix` and `ndarray` can be graphed with "memory_graph.extension_numpy":
-
-```python
-import memory_graph as mg
-import numpy as np
-import memory_graph.extension_numpy
-np.random.seed(0) # use same random numbers each run
-
-array = np.array([1.1, 2, 3, 4, 5])
-matrix = np.matrix([[i*20+j for j in range(20)] for i in range(20)])
-ndarray = np.random.rand(20,20)
-mg.show(locals())
-```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
-
-## Pandas ##
-Pandas types `Series` and `DataFrame` can be graphed with "memory_graph.extension_pandas":
-
-```python
-import memory_graph as mg
-import pandas as pd
-import memory_graph.extension_pandas
-
-series = pd.Series( [i for i in range(20)] )
-dataframe1 = pd.DataFrame({  "calories": [420, 380, 390],
-                             "duration": [50, 40, 45] })
-dataframe2 = pd.DataFrame({  'Name'   : [ 'Tom', 'Anna', 'Steve', 'Lisa'],
-                             'Age'    : [    28,     34,      29,     42],
-                             'Length' : [  1.70,   1.66,    1.82,   1.73] },
-                            index=['one', 'two', 'three', 'four']) # with row names
-mg.show(locals())
-```
-![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
-
 # Introspection #
 This section is likely to change. Sometimes the introspection fails or is not as desired. For example the `bintrees.avltree.Node` object doesn't show any attributes in the graph below.
 
@@ -810,7 +773,7 @@ For binary search we can use a List_View class to represent a particular sublist
 ```python
 import memory_graph as mg
 import random
-random.seed(2) # same random numbers each run
+random.seed(2)  # same random numbers each run
 
 class List_View:
 
@@ -828,7 +791,7 @@ class List_View:
 def bin_search(view, value):
     mid = view.get_mid()
     if view.begin == mid:
-        mg.show(mg.stack()) # <--- show stack
+        mg.show(mg.stack())  # <--- show stack
         return view.begin
     if value < view[mid]:
         return bin_search(List_View(view.lst, view.begin, mid), value)
@@ -925,6 +888,44 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hidden_edges.png)
 
+# Extensions #
+Different extensions are available for types from other Python packages. 
+
+## Numpy ##
+Numpy types `array` and `matrix` and `ndarray` can be graphed with "memory_graph.extension_numpy":
+
+```python
+import memory_graph as mg
+import numpy as np
+import memory_graph.extension_numpy
+np.random.seed(0) # use same random numbers each run
+
+array = np.array([1.1, 2, 3, 4, 5])
+matrix = np.matrix([[i*20+j for j in range(20)] for i in range(20)])
+ndarray = np.random.rand(20,20)
+mg.show(locals())
+```
+![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
+
+## Pandas ##
+Pandas types `Series` and `DataFrame` can be graphed with "memory_graph.extension_pandas":
+
+```python
+import memory_graph as mg
+import pandas as pd
+import memory_graph.extension_pandas
+
+series = pd.Series( [i for i in range(20)] )
+dataframe1 = pd.DataFrame({  "calories": [420, 380, 390],
+                             "duration": [50, 40, 45] })
+dataframe2 = pd.DataFrame({  'Name'   : [ 'Tom', 'Anna', 'Steve', 'Lisa'],
+                             'Age'    : [    28,     34,      29,     42],
+                             'Length' : [  1.70,   1.66,    1.82,   1.73] },
+                            index=['one', 'two', 'three', 'four']) # with row names
+mg.show(locals())
+```
+![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
+
 # Jupyter Notebook #
 In Jupyter Notebook `locals()` has additional variables that cause problems in the graph, use `mg.locals_jupyter()` to get the local variables with these problematic variables filtered out. Use `mg.stack_jupyter()` to get the whole call stack with these variables filtered out.
 

{memory_graph-0.3.38 → memory_graph-0.3.39}/README.md

@@ -41,7 +41,7 @@ mg.render(data) # renders to default: 'memory_graph.pdf'
 ```
 
 # Sharing Values #
-In Python, assigning the list from variable `a` to variable `b` causes both variables to reference the same list value and thus share it. Consequently, any change applied through one variable will impact the other. This behavior can lead to elusive bugs if a programmer incorrectly assumes that list `a` and `b` are independent.
+In Python, assigning a list from variable `a` to variable `b` causes both variables to reference the same list value and thus share it. Consequently, any change applied through one variable will impact the other. This behavior can lead to elusive bugs if a programmer incorrectly assumes that list `a` and `b` are independent.
 
 <table><tr><td> 
 
@@ -80,7 +80,7 @@ b: 4, 3, 2, 1
 ids: 126432214913216 126432214913216
 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.
+A better way to understand what data is shared is to draw a graph using [memory_graph](https://pypi.org/project/memory-graph/).
 
 # Chapters #
 
@@ -88,20 +88,18 @@ A better way to understand what data is shared is to draw a graph of the data us
 
 [Call Stack](#call-stack)
 
-[Global Import Trick](#global-import-trick)
-
 [Debugging](#debugging)
 
 [Data Structure Examples](#data-structure-examples)
 
 [Configuration](#configuration)
 
-[Extensions](#extensions)
-
 [Introspection](#introspection)
 
 [Graph Depth](#graph-depth)
 
+[Extensions](#extensions)
+
 [Jupyter Notebook](#jupyter-notebook)
 
 [ipython](#ipython)
@@ -162,7 +160,7 @@ a = [4, 3, 2]
 b = a
 mg.render(locals(), 'mutable1.png')
 
-b += [1] # equivalent to:  b.append(1)
+b += [1]  # equivalent to:  b.append(1)
 mg.render(locals(), 'mutable2.png')
 ```
 | ![mutable1.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/mutable1.png) | ![mutable2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/mutable2.png) |
@@ -178,11 +176,11 @@ Python offers three different "copy" options that we will demonstrate using a ne
 import memory_graph as mg
 import copy
 
-a = [ [1, 2], ['x', 'y'] ] # a nested list (a list containing lists)
+a = [ [1, 2], ['x', 'y'] ]  # a nested list (a list containing lists)
 
 # three different ways to make a "copy" of 'a':
 c1 = a
-c2 = copy.copy(a) # equivalent to:  a.copy() a[:] list(a)
+c2 = copy.copy(a)  # equivalent to:  a.copy() a[:] list(a)
 c3 = copy.deepcopy(a)
 
 mg.show(locals())
@@ -313,9 +311,9 @@ def get_subsets(subsets, data, i, subset):
         subsets.append(subset.copy())
         return
     subset.append(data[i])
-    get_subsets(subsets, data, i+1, subset) #    do include data[i]
+    get_subsets(subsets, data, i+1, subset)  #    do include data[i]
     subset.pop()
-    get_subsets(subsets, data, i+1, subset) # don't include data[i]
+    get_subsets(subsets, data, i+1, subset)  # don't include data[i]
     mg.block(mg.show, mg.stack())
 
 def power_set(data):
@@ -409,7 +407,7 @@ Package memory_graph can be very useful in a data structures course, some exampl
 ```python
 import memory_graph as mg
 import random
-random.seed(0) # use same random numbers each run
+random.seed(0)  # use same random numbers each run
 
 class Linked_List:
     """ Circular doubly linked list """
@@ -435,7 +433,7 @@ n = 100
 for i in range(n):
     value = random.randrange(n)
     linked_list.add_back(value)
-    mg.block(mg.show, locals()) # <--- draw locals
+    mg.block(mg.show, locals())  # <--- draw locals
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
@@ -469,7 +467,7 @@ class BinTree:
                 self.larger = BinTree(value)
             else:
                 self.larger.add(value)
-        mg.block(mg.show, mg.stack()) # <--- draw stack
+        mg.block(mg.show, mg.stack())  # <--- draw stack
 
 tree = BinTree()
 n = 100
@@ -488,7 +486,7 @@ Here we show values being inserted in a Binary Tree in Visual Studio Code. When
 ```python
 import memory_graph as mg
 import random
-random.seed(0) # use same random numbers each run
+random.seed(0)  # use same random numbers each run
 
 class HashSet:
 
@@ -501,7 +499,7 @@ class HashSet:
             self.buckets[index] = []
         bucket = self.buckets[index]
         bucket.append(value)
-        mg.block(mg.show, locals()) # <--- draw locals
+        mg.block(mg.show, locals())  # <--- draw locals
 
     def contains(self, value):
         index = hash(value) % len(self.buckets)
@@ -529,6 +527,9 @@ Here we show values being inserted in a HashSet in PyCharm. When inserting the l
 # Configuration #
 Different aspects of memory_graph can be configured. The default configuration can be reset by calling 'mg.config_default.reset()'.
 
+- ***mg.reopen_viewer*** : bool
+  - If True the viewer is reopened each time show() is called, this might change window focus, default True.
+
 - ***mg.config.render_filename*** : str
   - The default filename to render to, default 'memory_graph.pdf'.
 
@@ -583,7 +584,7 @@ a = [100, 200, 300]
 b = a.copy()
 mg.render(locals(), 'not_node_types1.png')
 
-mg.config.not_node_types.remove(int) # now show separate nodes for int values
+mg.config.not_node_types.remove(int)  # now show separate nodes for int values
 
 mg.render(locals(), 'not_node_types2.png')
 ```
@@ -604,51 +605,13 @@ data = [ list(range(20)) for i in range(1,5)]
 highlight = data[2]
 
 mg.show( locals(),
-    colors                = {id(highlight): "red"   }, # set color to red
-    vertical_orientations = {id(highlight): False   }, # set horizontal orientation
-    slicers               = {id(highlight): Slicer()}  # set no slicing 
+    colors                = {id(highlight): "red"   },  # set color to red
+    vertical_orientations = {id(highlight): False   },  # set horizontal orientation
+    slicers               = {id(highlight): Slicer()}   # set no slicing
 )
 ```
 ![highlight.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/highlight.png)
 
-# Extensions #
-Different extensions are available for types from other Python packages. 
-
-## Numpy ##
-Numpy types `array` and `matrix` and `ndarray` can be graphed with "memory_graph.extension_numpy":
-
-```python
-import memory_graph as mg
-import numpy as np
-import memory_graph.extension_numpy
-np.random.seed(0) # use same random numbers each run
-
-array = np.array([1.1, 2, 3, 4, 5])
-matrix = np.matrix([[i*20+j for j in range(20)] for i in range(20)])
-ndarray = np.random.rand(20,20)
-mg.show(locals())
-```
-![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
-
-## Pandas ##
-Pandas types `Series` and `DataFrame` can be graphed with "memory_graph.extension_pandas":
-
-```python
-import memory_graph as mg
-import pandas as pd
-import memory_graph.extension_pandas
-
-series = pd.Series( [i for i in range(20)] )
-dataframe1 = pd.DataFrame({  "calories": [420, 380, 390],
-                             "duration": [50, 40, 45] })
-dataframe2 = pd.DataFrame({  'Name'   : [ 'Tom', 'Anna', 'Steve', 'Lisa'],
-                             'Age'    : [    28,     34,      29,     42],
-                             'Length' : [  1.70,   1.66,    1.82,   1.73] },
-                            index=['one', 'two', 'three', 'four']) # with row names
-mg.show(locals())
-```
-![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
-
 # Introspection #
 This section is likely to change. Sometimes the introspection fails or is not as desired. For example the `bintrees.avltree.Node` object doesn't show any attributes in the graph below.
 
@@ -790,7 +753,7 @@ For binary search we can use a List_View class to represent a particular sublist
 ```python
 import memory_graph as mg
 import random
-random.seed(2) # same random numbers each run
+random.seed(2)  # same random numbers each run
 
 class List_View:
 
@@ -808,7 +771,7 @@ class List_View:
 def bin_search(view, value):
     mid = view.get_mid()
     if view.begin == mid:
-        mg.show(mg.stack()) # <--- show stack
+        mg.show(mg.stack())  # <--- show stack
         return view.begin
     if value < view[mid]:
         return bin_search(List_View(view.lst, view.begin, mid), value)
@@ -905,6 +868,44 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hidden_edges.png)
 
+# Extensions #
+Different extensions are available for types from other Python packages. 
+
+## Numpy ##
+Numpy types `array` and `matrix` and `ndarray` can be graphed with "memory_graph.extension_numpy":
+
+```python
+import memory_graph as mg
+import numpy as np
+import memory_graph.extension_numpy
+np.random.seed(0) # use same random numbers each run
+
+array = np.array([1.1, 2, 3, 4, 5])
+matrix = np.matrix([[i*20+j for j in range(20)] for i in range(20)])
+ndarray = np.random.rand(20,20)
+mg.show(locals())
+```
+![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
+
+## Pandas ##
+Pandas types `Series` and `DataFrame` can be graphed with "memory_graph.extension_pandas":
+
+```python
+import memory_graph as mg
+import pandas as pd
+import memory_graph.extension_pandas
+
+series = pd.Series( [i for i in range(20)] )
+dataframe1 = pd.DataFrame({  "calories": [420, 380, 390],
+                             "duration": [50, 40, 45] })
+dataframe2 = pd.DataFrame({  'Name'   : [ 'Tom', 'Anna', 'Steve', 'Lisa'],
+                             'Age'    : [    28,     34,      29,     42],
+                             'Length' : [  1.70,   1.66,    1.82,   1.73] },
+                            index=['one', 'two', 'three', 'four']) # with row names
+mg.show(locals())
+```
+![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
+
 # Jupyter Notebook #
 In Jupyter Notebook `locals()` has additional variables that cause problems in the graph, use `mg.locals_jupyter()` to get the local variables with these problematic variables filtered out. Use `mg.stack_jupyter()` to get the whole call stack with these variables filtered out.
 

{memory_graph-0.3.38 → memory_graph-0.3.39}/images/add_one.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node124959625924160 [label=<
+	node137846488649280 [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]
-	node124959624625536 [label=<
+	node137846487401344 [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]
-	node124959624012928 [label=<
+	node137846486738048 [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]
-	node124959624571648 [label=<
+	node137846487297536 [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]
-	node124959624571648:ref0 -> node124959625924160:table [style=solid]
-	node124959624571648:ref1 -> node124959624625536:table [style=solid]
-	node124959624571648:ref2 -> node124959624012928:table [style=solid]
-	node124959625867120 [label=<
+	node137846487297536:ref0 -> node137846488649280:table [style=solid]
+	node137846487297536:ref1 -> node137846487401344:table [style=solid]
+	node137846487297536:ref2 -> node137846486738048:table [style=solid]
+	node137846488592240 [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]
-	node124959624624768 [label=<
+	node137846487408320 [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]
-	node124959625014912 [label=<
+	node137846485706304 [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]
-	node124959625014912:ref0 -> node124959625924160:table [style=solid]
-	node124959625014912:ref1 -> node124959625867120:table [style=solid]
-	node124959625014912:ref2 -> node124959624624768:table [style=solid]
-	node124959620219600 [label=<
+	node137846485706304:ref0 -> node137846488649280:table [style=solid]
+	node137846485706304:ref1 -> node137846488592240:table [style=solid]
+	node137846485706304:ref2 -> node137846487408320:table [style=solid]
+	node137846482952640 [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]
-	node124959620219600:ref0 -> node124959624571648:table [style=solid]
-	node124959620219600:ref1 -> node124959625014912:table [style=solid]
-subgraph { rank=same; node124959624571648 -> node124959625014912[weight=10, style=invis]; }
-subgraph { rank=same; node124959625924160 -> node124959624625536 -> node124959624012928 -> node124959625867120 -> node124959624624768[weight=10, style=invis]; }
+	node137846482952640:ref0 -> node137846487297536:table [style=solid]
+	node137846482952640:ref1 -> node137846485706304:table [style=solid]
+subgraph { rank=same; node137846487297536 -> node137846485706304[weight=10, style=invis]; }
+subgraph { rank=same; node137846488649280 -> node137846487401344 -> node137846486738048 -> node137846488592240 -> node137846487408320[weight=10, style=invis]; }
 }

{memory_graph-0.3.38 → memory_graph-0.3.39}/images/avltree_key_value.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node123343309412432 [label=<
+	node124963934926736 [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"]
-	node123343309608640 [label=<
+	node124963935172096 [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"]
-	node123343309608720 [label=<
+	node124963935172176 [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"]
-	node123343309608720:ref0 -> node123343309608640:table [style=solid]
-	node123343315169136 [label=<
+	node124963935172176:ref0 -> node124963935172096:table [style=solid]
+	node124963950129008 [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"]
-	node123343315169136:ref0 -> node123343309412432:table [style=solid]
-	node123343315169136:ref1 -> node123343309608720:table [style=solid]
-	node123343310801952 [label=<
+	node124963950129008:ref0 -> node124963934926736:table [style=solid]
+	node124963950129008:ref1 -> node124963935172176:table [style=solid]
+	node124963936489152 [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]
-	node123343310801952:ref0 -> node123343315169136:table [style=solid]
-	node123343313520512 [label=<
+	node124963936489152:ref0 -> node124963950129008:table [style=solid]
+	node124963939125184 [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]
-	node123343313520512:ref0 -> node123343310801952:table [style=solid]
-subgraph { rank=same; node123343309412432 -> node123343309608720[weight=10, style=invis]; }
+	node124963939125184:ref0 -> node124963936489152:table [style=solid]
+subgraph { rank=same; node124963934926736 -> node124963935172176[weight=10, style=invis]; }
 }