memory-graph 0.3.14__tar.gz → 0.3.15__tar.gz

{memory_graph-0.3.14 → memory_graph-0.3.15}/PKG-INFO

@@ -1,7 +1,7 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.14
-Summary: Generate intuitive graphs of your Python data, perfect for debugging and understanding complex relationships.
+Version: 0.3.15
+Summary: Generate intuitive graphs of your Python data, great for debugging and understanding complex relationships.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
 Author-email: bterwijn@gmail.com
@@ -146,6 +146,7 @@ import memory_graph as mg
 a = (4, 3, 2)
 b = a
 mg.render(locals(), 'immutable1.png')
+
 a += (1,)
 mg.render(locals(), 'immutable2.png')
 ```
@@ -163,6 +164,7 @@ import memory_graph as mg
 a = [4, 3, 2]
 b = a
 mg.render(locals(), 'mutable1.png')
+
 a += [1] # equivalent to:  a.append(1)
 mg.render(locals(), 'mutable2.png')
 ```
@@ -221,6 +223,23 @@ 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 `a` changes the value of `b` and vice versa. However, reassigning the value of `a` does not change `b`. When you reassign `a`, you only rebind the name `a` 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')
+
+a += [1]        # changes the value of 'a' and 'b'
+a = [100, 200]  # rebinds 'a' to a new value, 'b' 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.get_call_stack()` function retrieves the entire call stack, including the local variables for each function on the stack. This enables us to visualize the local variables across all active functions simultaneously. 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`.
@@ -551,7 +570,7 @@ mg.render(locals(), 'not_node_types2.png')
 |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
 | not_node_types1.png — simplified | not_node_types2.png — technically correct |
 
-Additionally, the simplification hides the [reuse of small int values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
+Additionally, the simplification hides away the [reuse of small int values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
 
 ### Temporary Configuration ###
 In addition to the global configuration, a temporary configuration can be set for a single `show()` or `render()` call to change the colors, orientation, and slicer. This example highlights a particular list element in red, gives it a horizontal orientation, and overwrites the default slicer for lists:

memory_graph-0.3.14/memory_graph.egg-info/PKG-INFO → memory_graph-0.3.15/README.md

@@ -1,22 +1,3 @@
-Metadata-Version: 2.1
-Name: memory_graph
-Version: 0.3.14
-Summary: Generate intuitive graphs of your Python data, perfect for debugging and understanding complex relationships.
-Home-page: https://github.com/bterwijn/memory_graph
-Author: Bas Terwijn
-Author-email: bterwijn@gmail.com
-License: BSD 2-clause
-Classifier: Development Status :: 4 - Beta
-Classifier: Intended Audience :: Education
-Classifier: Intended Audience :: Developers
-Classifier: License :: OSI Approved :: BSD License
-Classifier: Programming Language :: Python :: 3
-Classifier: Topic :: Education
-Classifier: Topic :: Software Development :: Debuggers
-Description-Content-Type: text/markdown
-License-File: LICENSE.txt
-Requires-Dist: graphviz
-
 # Installation #
 Install (or upgrade) `memory_graph` using pip:
 ```
@@ -146,6 +127,7 @@ import memory_graph as mg
 a = (4, 3, 2)
 b = a
 mg.render(locals(), 'immutable1.png')
+
 a += (1,)
 mg.render(locals(), 'immutable2.png')
 ```
@@ -163,6 +145,7 @@ import memory_graph as mg
 a = [4, 3, 2]
 b = a
 mg.render(locals(), 'mutable1.png')
+
 a += [1] # equivalent to:  a.append(1)
 mg.render(locals(), 'mutable2.png')
 ```
@@ -221,6 +204,23 @@ 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 `a` changes the value of `b` and vice versa. However, reassigning the value of `a` does not change `b`. When you reassign `a`, you only rebind the name `a` 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')
+
+a += [1]        # changes the value of 'a' and 'b'
+a = [100, 200]  # rebinds 'a' to a new value, 'b' 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.get_call_stack()` function retrieves the entire call stack, including the local variables for each function on the stack. This enables us to visualize the local variables across all active functions simultaneously. 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`.
@@ -551,7 +551,7 @@ mg.render(locals(), 'not_node_types2.png')
 |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
 | not_node_types1.png — simplified | not_node_types2.png — technically correct |
 
-Additionally, the simplification hides the [reuse of small int values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
+Additionally, the simplification hides away the [reuse of small int values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
 
 ### Temporary Configuration ###
 In addition to the global configuration, a temporary configuration can be set for a single `show()` or `render()` call to change the colors, orientation, and slicer. This example highlights a particular list element in red, gives it a horizontal orientation, and overwrites the default slicer for lists:

memory_graph-0.3.15/images/cmp.sh

@@ -0,0 +1,3 @@
+xdg-open $1
+sleep 0.3
+xdg-open ../images_old/$1

memory_graph-0.3.15/images/cmp.sh~

@@ -0,0 +1 @@
+o $1 && sleep 0.3 && o ../images_old/$1

{memory_graph-0.3.14 → memory_graph-0.3.15}/images/create_images.sh

@@ -10,6 +10,7 @@ python immutable.py
 python mutable.py
 python copies.py
 python copy_method.py
+python name_rebinding.py
 
 # call stack
 python add_one.py

memory_graph-0.3.15/images/name_rebinding.py

@@ -0,0 +1,9 @@
+import memory_graph as mg
+
+a = [4, 3, 2]
+b = a
+mg.render(locals(), 'rebinding1.png')
+
+a += [1]        # changes value of 'a' and 'b'
+a = [100, 200]  # rebinds 'a' to a new value, 'b' is uneffected
+mg.render(locals(), 'rebinding2.png')

memory_graph-0.3.15/images/name_rebinding.py~

@@ -0,0 +1,7 @@
+import memory_graph as mg
+
+a = [4, 3, 2]
+b = a
+mg.render(locals(), 'mutable1.png')
+a += [1] # equivalent to:  a.append(1)
+mg.render(locals(), 'mutable2.png')

{memory_graph-0.3.14 → memory_graph-0.3.15}/memory_graph/__init__.py

@@ -13,7 +13,7 @@ import sys
 
 import graphviz
 
-__version__ = "0.3.14"
+__version__ = "0.3.15"
 __author__ = 'Bas Terwijn'
 render_filename = 'memory_graph.pdf'
 last_show_filename = None

memory_graph-0.3.15/memory_graph/t.py

@@ -0,0 +1,6 @@
+import memory_graph as mg
+
+a= [0,10000,5]
+
+mg.render(a, 'value.svg')
+

memory_graph-0.3.14/README.md → memory_graph-0.3.15/memory_graph.egg-info/PKG-INFO

@@ -1,3 +1,22 @@
+Metadata-Version: 2.1
+Name: memory_graph
+Version: 0.3.15
+Summary: Generate intuitive graphs of your Python data, great for debugging and understanding complex relationships.
+Home-page: https://github.com/bterwijn/memory_graph
+Author: Bas Terwijn
+Author-email: bterwijn@gmail.com
+License: BSD 2-clause
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Education
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: BSD License
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Education
+Classifier: Topic :: Software Development :: Debuggers
+Description-Content-Type: text/markdown
+License-File: LICENSE.txt
+Requires-Dist: graphviz
+
 # Installation #
 Install (or upgrade) `memory_graph` using pip:
 ```
@@ -127,6 +146,7 @@ import memory_graph as mg
 a = (4, 3, 2)
 b = a
 mg.render(locals(), 'immutable1.png')
+
 a += (1,)
 mg.render(locals(), 'immutable2.png')
 ```
@@ -144,6 +164,7 @@ import memory_graph as mg
 a = [4, 3, 2]
 b = a
 mg.render(locals(), 'mutable1.png')
+
 a += [1] # equivalent to:  a.append(1)
 mg.render(locals(), 'mutable2.png')
 ```
@@ -202,6 +223,23 @@ 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 `a` changes the value of `b` and vice versa. However, reassigning the value of `a` does not change `b`. When you reassign `a`, you only rebind the name `a` 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')
+
+a += [1]        # changes the value of 'a' and 'b'
+a = [100, 200]  # rebinds 'a' to a new value, 'b' 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.get_call_stack()` function retrieves the entire call stack, including the local variables for each function on the stack. This enables us to visualize the local variables across all active functions simultaneously. 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`.
@@ -532,7 +570,7 @@ mg.render(locals(), 'not_node_types2.png')
 |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
 | not_node_types1.png — simplified | not_node_types2.png — technically correct |
 
-Additionally, the simplification hides the [reuse of small int values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
+Additionally, the simplification hides away the [reuse of small int values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
 
 ### Temporary Configuration ###
 In addition to the global configuration, a temporary configuration can be set for a single `show()` or `render()` call to change the colors, orientation, and slicer. This example highlights a particular list element in red, gives it a horizontal orientation, and overwrites the default slicer for lists:

{memory_graph-0.3.14 → memory_graph-0.3.15}/memory_graph.egg-info/SOURCES.txt

@@ -1,22 +1,20 @@
 LICENSE.txt
 MANIFEST.in
 README.md
-TODO.txt
-install.txt
 setup.py
 images/add_one.png
 images/add_one.py
 images/avltree.py
-images/avltree.py~
 images/avltree_base.png
 images/avltree_dir.png
-images/avltree_fail.gv
 images/avltree_fail.png
 images/avltree_key_value.png
 images/avltree_linear.png
 images/avltree_table.png
 images/bin_tree.png
 images/bin_tree.py
+images/cmp.sh
+images/cmp.sh~
 images/copies.png
 images/copies.py
 images/copy_method.png
@@ -58,15 +56,12 @@ images/linked_list.png
 images/linked_list.py
 images/many_types.png
 images/many_types.py
-images/memory_graph.gv
-images/memory_graph.gv.pdf
 images/mutable.py
 images/mutable1.png
 images/mutable2.png
-images/my_graph.gv
-images/my_graph.pdf
+images/name_rebinding.py
+images/name_rebinding.py~
 images/not_node_types.py
-images/not_node_types.py~
 images/not_node_types1.png
 images/not_node_types2.png
 images/power_set.gif
@@ -94,8 +89,9 @@ images/power_set7.png
 images/power_set8.png
 images/power_set9.png
 images/pyodide.png
+images/rebinding1.png
+images/rebinding2.png
 images/uva.png
-images/.ipynb_checkpoints/jupyter_example-checkpoint.ipynb
 memory_graph/__init__.py
 memory_graph/config.py
 memory_graph/config_default.py
@@ -114,6 +110,7 @@ memory_graph/slicer.py
 memory_graph/slices.py
 memory_graph/slices_iterator.py
 memory_graph/slices_table_iterator.py
+memory_graph/t.py
 memory_graph/test.py
 memory_graph/test_max_graph_depth.py
 memory_graph/test_memory_graph.py
@@ -127,8 +124,4 @@ memory_graph.egg-info/PKG-INFO
 memory_graph.egg-info/SOURCES.txt
 memory_graph.egg-info/dependency_links.txt
 memory_graph.egg-info/requires.txt
-memory_graph.egg-info/top_level.txt
-src/auto_memory_graph.py
-src/jupyter_example.ipynb
-src/pyodide.html
-uml/memory_graph.uxf
+memory_graph.egg-info/top_level.txt

{memory_graph-0.3.14 → memory_graph-0.3.15}/setup.py

@@ -11,8 +11,8 @@ long_description_from_readme = (this_directory / "README.md").read_text()
 
 setup(
     name = 'memory_graph',
-    version = '0.3.14',
-    description = 'Generate intuitive graphs of your Python data, perfect for debugging and understanding complex relationships.',
+    version = '0.3.15',
+    description = 'Generate intuitive graphs of your Python data, great for debugging and understanding complex relationships.',
     long_description = long_description_from_readme,
     long_description_content_type = 'text/markdown',
     readme = 'README.md',

memory_graph-0.3.14/TODO.txt

@@ -1,9 +0,0 @@
-
-mg.block(fun, print_loc=True), update docs, stack-overflow posts
-
-Jupyter Notebook inline render using display()
-
-webassembly inline render
-
-optional max introspect depth for each type/id
-https://discuss.python.org/t/request-for-feedback-memory-graph-a-python-visualization-tool-for-education/78347

memory_graph-0.3.14/images/.ipynb_checkpoints/jupyter_example-checkpoint.ipynb

@@ -1,85 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "23f6d43f-dd17-4020-971e-5bb8a5b1e30b",
-   "metadata": {},
-   "source": [
-    "# test: locals_jupyter()\n",
-    "Show a graph build with the filtered Jupyter locals using function `mg.locals_jupyter()`. Just adding integers to a list:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "id": "e8913787-bbef-4adb-b027-ac0f28500233",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "import memory_graph as mg\n",
-    "\n",
-    "data = []\n",
-    "for i in range(5):\n",
-    "    data.append(i)\n",
-    "    display(mg.create_graph(mg.locals_jupyter())) # display in jupyter notebook\n",
-    "    mg.block(mg.show, mg.locals_jupyter()) # display in PDF reader\n",
-    "    "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f66d9b8d-0937-4ad0-97b4-a7459e84c4f2",
-   "metadata": {},
-   "source": [
-    "# test: get_call_stack_jupyter()\n",
-    "Show a graph build the filterd Jupyter call stack from function `mg.get_call_stack_jupyter()`. Recursively filling a list with all permutation of elements with resampling:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "id": "15d0c443-7cc6-4b4f-a9db-598aaf261364",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "import memory_graph as mg\n",
-    "\n",
-    "def get_all_permutations(permutations, elements, data, max_length):\n",
-    "    if len(data) == max_length: # recursive stop condition\n",
-    "        permutations.append(data.copy())\n",
-    "    else:\n",
-    "        for i in elements:\n",
-    "            data.append(i)\n",
-    "            mg.block(mg.show, mg.get_call_stack_jupyter())\n",
-    "            get_all_permutations(permutations, elements, data, max_length)\n",
-    "            data.pop()\n",
-    "            mg.block(mg.show, mg.get_call_stack_jupyter())\n",
-    "\n",
-    "permutations = []\n",
-    "get_all_permutations(permutations, ['L','R'], [], 3)\n",
-    "print(permutations)"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python 3 (ipykernel)",
-   "language": "python",
-   "name": "python3"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.12.3"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}

memory_graph-0.3.14/images/avltree.py~

@@ -1,41 +0,0 @@
-import memory_graph as mg
-import bintrees
-
-# Create an AVL tree
-tree = bintrees.AVLTree()
-tree.insert(10, "ten")
-tree.insert(5, "five")
-tree.insert(20, "twenty")
-tree.insert(15, "fifteen")
-
-mg.render(locals(), 'avltree_fail.png')
-
-mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.render(locals(), 'avltree_color.png')
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data, dir(data))
-mg.config.type_to_slicer[bintrees.avltree.Node] = mg.slicer.Slicer()
-mg.render(locals(), 'avltree_dir.png')
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_base.Node_Base(f"key:{data.key} value:{data.value}")
-mg.render(locals(), 'avltree_base.png')
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data,
-                                                                                        ['left', data.left,
-                                                                                         'key', data.key,
-                                                                                         'value', data.value,
-                                                                                         'right', data.right])
-mg.render(locals(), 'avltree_linear.png')
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_key_value.Node_Key_Value(data,
-                                                                                              {'left': data.left,
-                                                                                               'key': data.key,
-                                                                                               'value': data.value,
-                                                                                               'right': data.right}.items())
-mg.render(locals(), 'avltree_key_value.png')
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_table.Node_Table(data,
-                                                                                      [[data.key, data.value],
-                                                                                       [data.left, data.right]]
-                                                                                      )
-mg.render(locals(), 'avltree_table.png')

memory_graph-0.3.14/images/avltree_fail.gv

@@ -1,26 +0,0 @@
-digraph memory_graph {
-	node [shape=plaintext]
-	node130513740275104 [label=<
-<TABLE BORDER="0" CELLBORDER="1" CELLSPACING="0" CELLPADDING="0" BGCOLOR="white"><TR><TD PORT="table">
-&lt;bintrees.avltree.Node object at 0x76b3992...
-</TD></TR></TABLE>
-> xlabel="Node"]
-	node130513740453920 [label=<
-<TABLE BORDER="0" CELLBORDER="1" CELLSPACING="0" CELLPADDING="0" BGCOLOR="seagreen1"><TR><TD PORT="table">
-  <TABLE BORDER="0" CELLBORDER="0" CELLSPACING="5" CELLPADDING="0">
-    <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>
-</TD></TR></TABLE>
-> xlabel=AVLTree]
-	node130513740453920:ref0 -> node130513740275104:table [style=solid]
-	node130513742307200 [label=<
-<TABLE BORDER="0" CELLBORDER="3" CELLSPACING="0" CELLPADDING="0" BGCOLOR="dodgerblue1"><TR><TD PORT="table">
-  <TABLE BORDER="0" CELLBORDER="0" CELLSPACING="5" CELLPADDING="0">
-    <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
-    <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
-  </TABLE>
-</TD></TR></TABLE>
-> xlabel=dict]
-	node130513742307200:ref0 -> node130513740453920:table [style=solid]
-}

memory_graph-0.3.14/images/memory_graph.gv

@@ -1,20 +0,0 @@
-digraph memory_graph {
-	node [shape=plaintext]
-	node126810958314944 [label=<
-<TABLE BORDER="0" CELLBORDER="1" CELLSPACING="0" CELLPADDING="0" BGCOLOR="lightcoral"><TR><TD PORT="table">
-  <TABLE BORDER="0" CELLBORDER="0" CELLSPACING="5" CELLPADDING="0">
-    <TR><TD><font color="#505050">0</font></TD><TD BORDER="1"> 0 </TD></TR>
-    <TR><TD><font color="#505050">1</font></TD><TD BORDER="1"> 1 </TD></TR>
-  </TABLE>
-</TD></TR></TABLE>
-> xlabel=list]
-	node126810936962048 [label=<
-<TABLE BORDER="0" CELLBORDER="3" CELLSPACING="0" CELLPADDING="0" BGCOLOR="dodgerblue1"><TR><TD PORT="table">
-  <TABLE BORDER="0" CELLBORDER="0" CELLSPACING="5" CELLPADDING="0">
-    <TR><TD BORDER="1" STYLE="ROUNDED"> data </TD><TD BORDER="1" STYLE="ROUNDED"> i </TD></TR>
-    <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 1 </TD></TR>
-  </TABLE>
-</TD></TR></TABLE>
-> xlabel=dict]
-	node126810936962048:ref0 -> node126810958314944:table [style=solid]
-}