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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.45
+Version: 0.3.47
 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: BSD 2-Clause License
@@ -105,7 +105,7 @@ b.append(1) # changing 'b' changes 'a'
 print('a:', a)
 print('b:', b)
 
-# check if 'a' and 'b' share data
+# check if 'a' and 'b' share values
 print('ids:', id(a), id(b))
 print('identical?:', a is b)
 
@@ -117,18 +117,18 @@ mg.show( locals() )
 
 ![mutable2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/mutable2.png)
 
-a graph showing `a` and `b` share data
+a graph showing `a` and `b` share values
 
 </td></tr></table>
 
-The fact that `a` and `b` share data can not be verified by printing the lists. It can be verified by comparing the identity of both variables using the `id()` function or by using the `is` comparison operator as shown in the program output below, but this quickly becomes impractical for larger programs. 
+The fact that `a` and `b` share values can not be verified by printing the lists. It can be verified by comparing the identity of both variables using the `id()` function or by using the `is` comparison operator as shown in the program output below, but this quickly becomes impractical for larger programs.
 ```{verbatim}
 a: 4, 3, 2, 1
 b: 4, 3, 2, 1
 ids: 126432214913216 126432214913216
 identical?: True
 ```
-A better way to understand what data is shared is to draw a graph using [memory_graph](https://pypi.org/project/memory-graph/).
+A better way to understand what values are shared is to draw a graph using [memory_graph](https://pypi.org/project/memory-graph/).
 
 # Chapters #
 
@@ -160,6 +160,9 @@ A better way to understand what data is shared is to draw a graph using [memory_
 
 [Troubleshooting](#troubleshooting)
 
+[Social Media](#social-media)
+
+[Other Packages](#other-packages)
 
 ## Author ##
 Bas Terwijn
@@ -235,14 +238,14 @@ mg.show(locals())
 ```
 
 * `c1` is an **assignment**, nothing is copied, all the values are shared
-* `c2` is a **shallow copy**, only the value referenced by the first reference is copied, all the underlying values are shared
+* `c2` is a **shallow copy**, only the first value is copied, all the underlying values are shared
 * `c3` is a **deep copy**, all the values are copied, nothing is shared
 
 ![copy_mutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mutable.png)
 
 
 ## Custom Copy ##
-We can write our own custom copy function or method in case the three standard "copy" options don't do what we want. For example, in the code below the copy() method of My_Class copies the `digits` but shares the `letters` between two objects.
+We can write our own custom copy function or method in case the three standard "copy" options don't do what we want. For example, in the code below the `custom_copy()` method of My_Class copies the `digits` but shares the `letters` between two objects.
 
 ```python
 import memory_graph as mg
@@ -267,6 +270,24 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
 
+## Name Rebinding ##
+When `a` and `b` share a mutable value, then changing the value of `b` changes the value of `a` and vice versa. However, reassigning `b` does not change `a`. When you reassign `b`, you only rebind the name `b` to another value without effecting any other variables.
+
+```python
+import memory_graph as mg
+
+a = [4, 3, 2]
+b = a
+mg.render(locals(), 'rebinding1.png')
+
+b += [1]        # changes the value of 'b' and 'a'
+b = [100, 200]  # rebinds 'b' to another value, 'a' is uneffected
+mg.render(locals(), 'rebinding2.png')
+```
+| ![rebinding1.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/rebinding1.png) | ![rebinding2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/rebinding2.png) |
+|:-----------------------------------------------------------:|:-------------------------------------------------------------:|
+| rebinding1.png | rebinding2.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 result in just an assignment to save on the time needed to make the copy and the space (=memory) needed to store the values.
 
@@ -302,24 +323,6 @@ mg.show(locals())
 ```
 ![copy_mix.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mix.png)
 
-## Name Rebinding ##
-When `a` and `b` share a mutable value, then changing the value of `b` changes the value of `a` and vice versa. However, reassigning `b` does not change `a`. When you reassign `b`, you only rebind the name `b` to a new value without effecting any other variables.
-
-```python
-import memory_graph as mg
-
-a = [4, 3, 2]
-b = a
-mg.render(locals(), 'rebinding1.png')
-
-b += [1]        # changes the value of 'b' and 'a'
-b = [100, 200]  # rebinds 'b' to a new value, 'a' is uneffected
-mg.render(locals(), 'rebinding2.png')
-```
-| ![rebinding1.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/rebinding1.png) | ![rebinding2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/rebinding2.png) |
-|:-----------------------------------------------------------:|:-------------------------------------------------------------:|
-| rebinding1.png | rebinding2.png |
-
 # Call Stack #
 The `mg.stack()` function retrieves the entire call stack, including the local variables for each function on the stack. This enables us to understand function calls, variable scope, and the **complete program state** through call stack visualization. By examining the graph, we can determine whether any local variables from different functions share data. For instance, consider the function `add_one()` which adds the value `1` to each of its parameters `a`, `b`, and `c`.
 
@@ -335,8 +338,8 @@ def add_one(a, b, c):
 a = [4, 3, 2]
 b = (4, 3, 2)
 c = [4, 3, 2]
-
 add_one(a, b, c.copy())
+
 print(f"a:{a} b:{b} c:{c}")
 ```
 ![add_one.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/add_one.png)
@@ -647,11 +650,14 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.max_string_length*** : int
   - The maximum length of strings shown in the graph. Longer strings will be truncated.
 
-- ***mg.config.not_node_types*** : set[type]
-  - Holds all types for which no separate node is drawn but that instead are shown as elements in their parent Node.
+- ***mg.config.embedded_types*** : set[type]
+  - Holds all types for which no separate node is drawn but that are embedded in their parent Node.
 
-- ***mg.config.no_child_references_types*** : set[type]
-  - The set of key_value types that don't draw references to their direct childeren but have their children shown as elements of their node.
+- ***mg.config.embedded_key_types*** : set[type]
+  - Holds all types that are embedded as key in a Node_Key_Value node, even when not in 'embedded_types'.
+
+- ***mg.config.embedding_types*** : set[type]
+  - Holds all dictionary types that embed their key-value tuple children.
 
 - ***mg.config.type_to_node*** : dict[type, fun(data) -> Node]
   - Determines how a data type is converted to a Node subclass for visualization in the graph.
@@ -681,26 +687,26 @@ Different aspects of memory_graph can be configured. The default configuration c
 ## Simplified Graph ##
 Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a` won’t affect `b`) so will never result in bugs.
 
-The simplification strikes a balance: it is slightly misleading but keeps the graph clean and easy to understand and focuses on the mutable types where unexpected changes can occur. This is why it is the default behavior. If you do want to show separate nodes for `int` values, such as for educational purposes, you can simply remove `int` from the `mg.config.not_node_types` set:
+The simplification strikes a balance: it is slightly misleading but keeps the graph clean and easy to understand and focuses on the mutable types where unexpected changes can occur. This is why it is the default behavior. If you do want to show separate nodes for `int` values, such as for educational purposes, you can simply remove `int` from the `mg.config.embedded_types` set:
 ```python
 import memory_graph as mg
 
 a = [100, 200, 300]
 b = a.copy()
-mg.render(locals(), 'not_node_types1.png')
+mg.render(locals(), 'embedded1.png')
 
-mg.config.not_node_types.remove(int)  # now show separate nodes for int values
+mg.config.embedded_types.remove(int)  # now show separate nodes for int values
 
-mg.render(locals(), 'not_node_types2.png')
+mg.render(locals(), 'embedded2.png')
 ```
-| ![not_node_types1](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/not_node_types1.png) | ![not_node_types2](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/not_node_types2.png) |
+| ![embedded1](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/embedded1.png) | ![embedded2](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/embedded2.png) |
 |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
-| not_node_types1.png — simplified | not_node_types2.png — technically correct |
+| embedded1.png — simplified | embedded2.png — technically correct |
 
-Additionally, the simplification hides away the [reuse of small int values \[-5, 256\]](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
+Additionally, the simplification hides away the [reuse of small int values \[-5, 256\]](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value. Similarly CPython uses [String Interning](https://python-reference.readthedocs.io/en/latest/docs/functions/intern.html) to reuse small strings.
 
 # 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.
+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.
 
 ```python
 import memory_graph as mg
@@ -873,7 +879,7 @@ data.sort()
 # search 'value'
 value = data[random.randrange(n)]
 index = bin_search(List_View(data, 0, len(data)), value)
-print(f'{index=} {data[index]=}')
+print('index:', index, 'data[index]:', data[index])
 ```
 ![bin_search.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_search.png)
 
@@ -1067,5 +1073,9 @@ $ bash create_gif.sh animated
 
 - 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.
 
-## Invocation_Tree Package ##
+# Social Media #
+* LinkedIn: https://www.linkedin.com/groups/13244150/
+* Reddit: https://www.reddit.com/r/Python_memory_graph/
+
+# Other Packages #
 The [memory_graph](https://pypi.org/project/memory-graph/) package visualizes your data. If instead you want to visualize function calls, check out the [invocation_tree](https://pypi.org/project/invocation-tree/) package.

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

@@ -60,7 +60,7 @@ b.append(1) # changing 'b' changes 'a'
 print('a:', a)
 print('b:', b)
 
-# check if 'a' and 'b' share data
+# check if 'a' and 'b' share values
 print('ids:', id(a), id(b))
 print('identical?:', a is b)
 
@@ -72,18 +72,18 @@ mg.show( locals() )
 
 ![mutable2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/mutable2.png)
 
-a graph showing `a` and `b` share data
+a graph showing `a` and `b` share values
 
 </td></tr></table>
 
-The fact that `a` and `b` share data can not be verified by printing the lists. It can be verified by comparing the identity of both variables using the `id()` function or by using the `is` comparison operator as shown in the program output below, but this quickly becomes impractical for larger programs. 
+The fact that `a` and `b` share values can not be verified by printing the lists. It can be verified by comparing the identity of both variables using the `id()` function or by using the `is` comparison operator as shown in the program output below, but this quickly becomes impractical for larger programs.
 ```{verbatim}
 a: 4, 3, 2, 1
 b: 4, 3, 2, 1
 ids: 126432214913216 126432214913216
 identical?: True
 ```
-A better way to understand what data is shared is to draw a graph using [memory_graph](https://pypi.org/project/memory-graph/).
+A better way to understand what values are shared is to draw a graph using [memory_graph](https://pypi.org/project/memory-graph/).
 
 # Chapters #
 
@@ -115,6 +115,9 @@ A better way to understand what data is shared is to draw a graph using [memory_
 
 [Troubleshooting](#troubleshooting)
 
+[Social Media](#social-media)
+
+[Other Packages](#other-packages)
 
 ## Author ##
 Bas Terwijn
@@ -190,14 +193,14 @@ mg.show(locals())
 ```
 
 * `c1` is an **assignment**, nothing is copied, all the values are shared
-* `c2` is a **shallow copy**, only the value referenced by the first reference is copied, all the underlying values are shared
+* `c2` is a **shallow copy**, only the first value is copied, all the underlying values are shared
 * `c3` is a **deep copy**, all the values are copied, nothing is shared
 
 ![copy_mutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mutable.png)
 
 
 ## Custom Copy ##
-We can write our own custom copy function or method in case the three standard "copy" options don't do what we want. For example, in the code below the copy() method of My_Class copies the `digits` but shares the `letters` between two objects.
+We can write our own custom copy function or method in case the three standard "copy" options don't do what we want. For example, in the code below the `custom_copy()` method of My_Class copies the `digits` but shares the `letters` between two objects.
 
 ```python
 import memory_graph as mg
@@ -222,6 +225,24 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
 
+## Name Rebinding ##
+When `a` and `b` share a mutable value, then changing the value of `b` changes the value of `a` and vice versa. However, reassigning `b` does not change `a`. When you reassign `b`, you only rebind the name `b` to another value without effecting any other variables.
+
+```python
+import memory_graph as mg
+
+a = [4, 3, 2]
+b = a
+mg.render(locals(), 'rebinding1.png')
+
+b += [1]        # changes the value of 'b' and 'a'
+b = [100, 200]  # rebinds 'b' to another value, 'a' is uneffected
+mg.render(locals(), 'rebinding2.png')
+```
+| ![rebinding1.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/rebinding1.png) | ![rebinding2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/rebinding2.png) |
+|:-----------------------------------------------------------:|:-------------------------------------------------------------:|
+| rebinding1.png | rebinding2.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 result in just an assignment to save on the time needed to make the copy and the space (=memory) needed to store the values.
 
@@ -257,24 +278,6 @@ mg.show(locals())
 ```
 ![copy_mix.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mix.png)
 
-## Name Rebinding ##
-When `a` and `b` share a mutable value, then changing the value of `b` changes the value of `a` and vice versa. However, reassigning `b` does not change `a`. When you reassign `b`, you only rebind the name `b` to a new value without effecting any other variables.
-
-```python
-import memory_graph as mg
-
-a = [4, 3, 2]
-b = a
-mg.render(locals(), 'rebinding1.png')
-
-b += [1]        # changes the value of 'b' and 'a'
-b = [100, 200]  # rebinds 'b' to a new value, 'a' is uneffected
-mg.render(locals(), 'rebinding2.png')
-```
-| ![rebinding1.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/rebinding1.png) | ![rebinding2.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/rebinding2.png) |
-|:-----------------------------------------------------------:|:-------------------------------------------------------------:|
-| rebinding1.png | rebinding2.png |
-
 # Call Stack #
 The `mg.stack()` function retrieves the entire call stack, including the local variables for each function on the stack. This enables us to understand function calls, variable scope, and the **complete program state** through call stack visualization. By examining the graph, we can determine whether any local variables from different functions share data. For instance, consider the function `add_one()` which adds the value `1` to each of its parameters `a`, `b`, and `c`.
 
@@ -290,8 +293,8 @@ def add_one(a, b, c):
 a = [4, 3, 2]
 b = (4, 3, 2)
 c = [4, 3, 2]
-
 add_one(a, b, c.copy())
+
 print(f"a:{a} b:{b} c:{c}")
 ```
 ![add_one.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/add_one.png)
@@ -602,11 +605,14 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.max_string_length*** : int
   - The maximum length of strings shown in the graph. Longer strings will be truncated.
 
-- ***mg.config.not_node_types*** : set[type]
-  - Holds all types for which no separate node is drawn but that instead are shown as elements in their parent Node.
+- ***mg.config.embedded_types*** : set[type]
+  - Holds all types for which no separate node is drawn but that are embedded in their parent Node.
 
-- ***mg.config.no_child_references_types*** : set[type]
-  - The set of key_value types that don't draw references to their direct childeren but have their children shown as elements of their node.
+- ***mg.config.embedded_key_types*** : set[type]
+  - Holds all types that are embedded as key in a Node_Key_Value node, even when not in 'embedded_types'.
+
+- ***mg.config.embedding_types*** : set[type]
+  - Holds all dictionary types that embed their key-value tuple children.
 
 - ***mg.config.type_to_node*** : dict[type, fun(data) -> Node]
   - Determines how a data type is converted to a Node subclass for visualization in the graph.
@@ -636,26 +642,26 @@ Different aspects of memory_graph can be configured. The default configuration c
 ## Simplified Graph ##
 Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a` won’t affect `b`) so will never result in bugs.
 
-The simplification strikes a balance: it is slightly misleading but keeps the graph clean and easy to understand and focuses on the mutable types where unexpected changes can occur. This is why it is the default behavior. If you do want to show separate nodes for `int` values, such as for educational purposes, you can simply remove `int` from the `mg.config.not_node_types` set:
+The simplification strikes a balance: it is slightly misleading but keeps the graph clean and easy to understand and focuses on the mutable types where unexpected changes can occur. This is why it is the default behavior. If you do want to show separate nodes for `int` values, such as for educational purposes, you can simply remove `int` from the `mg.config.embedded_types` set:
 ```python
 import memory_graph as mg
 
 a = [100, 200, 300]
 b = a.copy()
-mg.render(locals(), 'not_node_types1.png')
+mg.render(locals(), 'embedded1.png')
 
-mg.config.not_node_types.remove(int)  # now show separate nodes for int values
+mg.config.embedded_types.remove(int)  # now show separate nodes for int values
 
-mg.render(locals(), 'not_node_types2.png')
+mg.render(locals(), 'embedded2.png')
 ```
-| ![not_node_types1](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/not_node_types1.png) | ![not_node_types2](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/not_node_types2.png) |
+| ![embedded1](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/embedded1.png) | ![embedded2](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/embedded2.png) |
 |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
-| not_node_types1.png — simplified | not_node_types2.png — technically correct |
+| embedded1.png — simplified | embedded2.png — technically correct |
 
-Additionally, the simplification hides away the [reuse of small int values \[-5, 256\]](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
+Additionally, the simplification hides away the [reuse of small int values \[-5, 256\]](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value. Similarly CPython uses [String Interning](https://python-reference.readthedocs.io/en/latest/docs/functions/intern.html) to reuse small strings.
 
 # 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.
+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.
 
 ```python
 import memory_graph as mg
@@ -828,7 +834,7 @@ data.sort()
 # search 'value'
 value = data[random.randrange(n)]
 index = bin_search(List_View(data, 0, len(data)), value)
-print(f'{index=} {data[index]=}')
+print('index:', index, 'data[index]:', data[index])
 ```
 ![bin_search.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_search.png)
 
@@ -1022,5 +1028,9 @@ $ bash create_gif.sh animated
 
 - 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.
 
-## Invocation_Tree Package ##
+# Social Media #
+* LinkedIn: https://www.linkedin.com/groups/13244150/
+* Reddit: https://www.reddit.com/r/Python_memory_graph/
+
+# Other Packages #
 The [memory_graph](https://pypi.org/project/memory-graph/) package visualizes your data. If instead you want to visualize function calls, check out the [invocation_tree](https://pypi.org/project/invocation-tree/) package.

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

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node127655305006656 [label=<
+	node134158269386304 [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]
-	node127655294509888 [label=<
+	node134158258758592 [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]
-	node127655293772928 [label=<
+	node134158258021504 [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]
-	node127655294332544 [label=<
+	node134158258580928 [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]
-	node127655294332544:ref0 -> node127655305006656:table [style=solid]
-	node127655294332544:ref1 -> node127655294509888:table [style=solid]
-	node127655294332544:ref2 -> node127655293772928:table [style=solid]
-	node127655294474960 [label=<
+	node134158258580928:ref0 -> node134158269386304:table [style=solid]
+	node134158258580928:ref1 -> node134158258758592:table [style=solid]
+	node134158258580928:ref2 -> node134158258021504:table [style=solid]
+	node134158258723536 [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]
-	node127655294510272 [label=<
+	node134158258758976 [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]
-	node127655289932736 [label=<
+	node134158254184256 [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]
-	node127655289932736:ref0 -> node127655305006656:table [style=solid]
-	node127655289932736:ref1 -> node127655294474960:table [style=solid]
-	node127655289932736:ref2 -> node127655294510272:table [style=solid]
-	node127655290005664 [label=<
+	node134158254184256:ref0 -> node134158269386304:table [style=solid]
+	node134158254184256:ref1 -> node134158258723536:table [style=solid]
+	node134158254184256:ref2 -> node134158258758976:table [style=solid]
+	node134158254254080 [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]
-	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]; }
+	node134158254254080:ref0 -> node134158258580928:table [style=solid]
+	node134158254254080:ref1 -> node134158254184256:table [style=solid]
+subgraph { rank=same; node134158258580928 -> node134158254184256[weight=10, style=invis]; }
+subgraph { rank=same; node134158269386304 -> node134158258758592 -> node134158258021504 -> node134158258723536 -> node134158258758976[weight=10, style=invis]; }
 }

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

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134196776614496 [label=<
+	node129652369896160 [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"]
-	node134196776859856 [label=<
+	node129652370126816 [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"]
-	node134196776859936 [label=<
+	node129652370126896 [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"]
-	node134196776859936:ref0 -> node134196776859856:table [style=solid]
-	node134196791832432 [label=<
+	node129652370126896:ref0 -> node129652370126816:table [style=solid]
+	node129652385165168 [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"]
-	node134196791832432:ref0 -> node134196776614496:table [style=solid]
-	node134196791832432:ref1 -> node134196776859936:table [style=solid]
-	node134196778143760 [label=<
+	node129652385165168:ref0 -> node129652369896160:table [style=solid]
+	node129652385165168:ref1 -> node129652370126896:table [style=solid]
+	node129652371410960 [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]
-	node134196778143760:ref0 -> node134196791832432:table [style=solid]
-	node134196780812224 [label=<
+	node129652371410960:ref0 -> node129652385165168:table [style=solid]
+	node129652374079360 [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]
-	node134196780812224:ref0 -> node134196778143760:table [style=solid]
-subgraph { rank=same; node134196776614496 -> node134196776859936[weight=10, style=invis]; }
+	node129652374079360:ref0 -> node129652371410960:table [style=solid]
+subgraph { rank=same; node129652369896160 -> node129652370126896[weight=10, style=invis]; }
 }

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

@@ -1,22 +1,22 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node134196791832432 [label=<
+	node129652385165168 [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"]
-	node134196778143760 [label=<
+	node129652371410960 [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]
-	node134196778143760:ref0 -> node134196791832432:table [style=solid]
-	node134196780812224 [label=<
+	node129652371410960:ref0 -> node129652385165168:table [style=solid]
+	node129652374079360 [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]
-	node134196780812224:ref0 -> node134196778143760:table [style=solid]
+	node129652374079360:ref0 -> node129652371410960:table [style=solid]
 }