memory-graph 0.3.51__tar.gz → 0.3.52__tar.gz

{memory_graph-0.3.51/memory_graph.egg-info → memory_graph-0.3.52}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.51
+Version: 0.3.52
 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
@@ -52,7 +52,7 @@ Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 
 # Highlights #
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
-Or run a live demo in the 👉[**Memory Graph Web Debugger**](https://memory-graph.com/#play)👈 now, no installation required!!!
+Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#play) 👈 now, no installation required!
 
 - learn the right **mental model** to think about Python data (references, mutability, shallow vs deep copy)
 - **visualize the structure of your data** to easily understand and debug any data structure
@@ -663,6 +663,9 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.embedding_types*** : set[type]
   - Holds all dictionary types that embed their key-value tuple children.
 
+- ***mg.config.no_index_types*** : set[type]
+  - Holds all types like 'set' and 'frozenset' that should not have indices as Node_Linear.
+
 - ***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.
 
@@ -676,7 +679,7 @@ Different aspects of memory_graph can be configured. The default configuration c
   - Maps a type to a Slicer. A slicer determines how many elements of a data type are shown in the graph to prevent the graph from getting too big. 'Slicer()' does no slicing, 'Slicer(1,2,3)' shows just 1 element at the beginning, 2 in the middle, and 3 at the end.
 
 - ***mg.config.max_graph_depth*** : int
-  - The maxium depth of the graph with default value 12.
+  - The maxium depth of the graph with default value 1000.
 
 - ***mg.config.graph_cut_symbol*** : str
   - The symbol indicating where the graph is cut short with default `✂`.

{memory_graph-0.3.51 → memory_graph-0.3.52}/README.md

@@ -7,7 +7,7 @@ Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 
 # Highlights #
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
-Or run a live demo in the 👉[**Memory Graph Web Debugger**](https://memory-graph.com/#play)👈 now, no installation required!!!
+Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#play) 👈 now, no installation required!
 
 - learn the right **mental model** to think about Python data (references, mutability, shallow vs deep copy)
 - **visualize the structure of your data** to easily understand and debug any data structure
@@ -618,6 +618,9 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.embedding_types*** : set[type]
   - Holds all dictionary types that embed their key-value tuple children.
 
+- ***mg.config.no_index_types*** : set[type]
+  - Holds all types like 'set' and 'frozenset' that should not have indices as Node_Linear.
+
 - ***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.
 
@@ -631,7 +634,7 @@ Different aspects of memory_graph can be configured. The default configuration c
   - Maps a type to a Slicer. A slicer determines how many elements of a data type are shown in the graph to prevent the graph from getting too big. 'Slicer()' does no slicing, 'Slicer(1,2,3)' shows just 1 element at the beginning, 2 in the middle, and 3 at the end.
 
 - ***mg.config.max_graph_depth*** : int
-  - The maxium depth of the graph with default value 12.
+  - The maxium depth of the graph with default value 1000.
 
 - ***mg.config.graph_cut_symbol*** : str
   - The symbol indicating where the graph is cut short with default `✂`.

{memory_graph-0.3.51 → memory_graph-0.3.52}/images/create_gif.sh

@@ -5,7 +5,8 @@
 #   sudo apt install imagemagick
 
 name="$1"
-files=$(ls -v $name*.png)
+files=$(ls -v $name*.png | tr '\n' ' ')
+files_gv=$(ls -v $name*.gv | tr '\n' ' ')
 echo "creating gif with:"
 echo "$files"
 
@@ -17,4 +18,10 @@ mogrify -resize $largest_size -background white -gravity center -extent $largest
 
 echo "creating file: $name.gif"
 convert -delay 150 -dither None -loop 0 $files $name.gif
+
+if [ "$2" = "-d" ]; then
+    echo "deleting: $files $files_gv"
+    rm $files $files_gv
+fi
+
 echo "done"

{memory_graph-0.3.51 → memory_graph-0.3.52}/images/create_images.sh

@@ -3,7 +3,7 @@ python many_types.py
 
 # debugging
 python debugging.py
-bash create_gif.sh debugging
+bash create_gif.sh debugging -d
 
 # data model
 python immutable.py
@@ -17,11 +17,11 @@ python name_rebinding.py
 # call stack
 python add_one.py
 python factorial.py
-bash create_gif.sh factorial
+bash create_gif.sh factorial -d
 python binary.py
-bash create_gif.sh binary
+bash create_gif.sh binary -d
 python power_set.py
-bash create_gif.sh power_set
+bash create_gif.sh power_set -d
 
 # datastructures
 python linked_list.py
@@ -40,3 +40,6 @@ python hidden_edges.py
 # extensions
 python extension_numpy.py
 python extension_pandas.py
+
+# clean up the graphviz files
+rm *.gv

{memory_graph-0.3.51 → memory_graph-0.3.52}/images/hidden_edges.py

@@ -2,7 +2,7 @@ import memory_graph as mg
 
 data = []
 x = ['x']
-for i in range(20):
+for i in range(35):
     data.append(x)
 
 mg.render(locals(), 'hidden_edges.png')

{memory_graph-0.3.51 → memory_graph-0.3.52}/memory_graph/__init__.py

@@ -21,7 +21,7 @@ import builtins
 if not hasattr(builtins, "mg"):
     builtins.mg = mg
 
-__version__ = "0.3.51"
+__version__ = "0.3.52"
 __author__ = 'Bas Terwijn'
 
 last_show_filename = None

{memory_graph-0.3.51 → memory_graph-0.3.52}/memory_graph/config.py

@@ -21,6 +21,8 @@ embedded_key_types = {}
 embedding_types = set()
 no_child_references_types = embedding_types # deprecated
 
+no_index_types = {}
+
 type_to_string = { }
 
 def to_string(data):

{memory_graph-0.3.51 → memory_graph-0.3.52}/memory_graph/config_default.py

@@ -52,7 +52,10 @@ def reset():
     """ Types that will embed their children. """
     config.embedding_types = {dict, types.MappingProxyType}
 
-    """ Types that need an special conversion """
+    """ Types that should not show an index """
+    config.no_index_types = {set, frozenset}
+
+    """ Types that need a special conversion """
     config.type_to_string = {
         types.FunctionType: lambda data: data.__qualname__,
         types.MethodType: lambda data: data.__qualname__,
@@ -107,13 +110,13 @@ def reset():
     
     """ Slicer objects for different types. """
     config.type_to_slicer = {
-        Node_Linear: Slicer(5,3,5),
-        Node_Key_Value: Slicer(5,3,5),
-        Node_Table: (Slicer(3,2,3), Slicer(3,2,3)),
+        Node_Linear: Slicer(10, 5, 10),
+        Node_Key_Value: Slicer(10, 5, 10),
+        Node_Table: (Slicer(3, 2, 3), Slicer(3, 2, 3)),
     }
 
     """ The maximum depth of nodes in the graph. When the graph gets too big set this to a small positive number. A `✂` symbol indictes where the graph is cut short. """
-    config.max_graph_depth = 12
+    config.max_graph_depth = 1000
     config.graph_cut_symbol = '✂'
     
 

{memory_graph-0.3.51 → memory_graph-0.3.52}/memory_graph/memory_to_nodes.py

@@ -149,8 +149,12 @@ def add_missing_edges(nodes, id_to_slices, max_missing_edges=3):
             for index in indices:
                 if parent_slices is None or not parent_slices.has_index(index):
                     type_to_parent_indices.setdefault(parent_type, [])
+                    #if not parent_type in type_to_parent_indices:
+                    #    type_to_parent_indices[parent_type] = []
                     parent_indices = type_to_parent_indices[parent_type]
-                    if len(parent_indices) < max_missing_edges:
+                    if len(parent_indices) > max_missing_edges:
+                        break
+                    else:
                         parent_indices.append((parent, index))
         add_parent_indices(nodes, type_to_parent_indices, id_to_slices, max_missing_edges)    
     

{memory_graph-0.3.51 → memory_graph-0.3.52}/memory_graph/node_linear.py

@@ -6,6 +6,7 @@ from memory_graph.node_base import Node_Base
 from memory_graph.sequence import Sequence1D
 
 import memory_graph.config_helpers as config_helpers
+import memory_graph.config as config
 
 class Node_Linear(Node_Base):
     """
@@ -56,9 +57,11 @@ class Node_Linear(Node_Base):
         """
         Helper function to fill the html_table with the children of the Node_Base in vertical orientation.
         """
+        show_index = not self.get_type() in config.no_index_types
         for index in slices.table_iter(self.children.size()):
             if index>=0:
-                html_table.add_index(index)
+                if show_index:
+                    html_table.add_index(index)
                 child = self.children[index]
                 html_table.add_entry(self, nodes, child, id_to_slices, dashed=slices.is_dashed(index))
                 html_table.add_new_line()
@@ -71,9 +74,11 @@ class Node_Linear(Node_Base):
         """
         Helper function to fill the html_table with the children of the Node_Base in horizontal orientation.
         """
+        show_index = not self.get_type() in config.no_index_types
         for index in slices.table_iter(self.children.size()):
             if index>=0:
-                html_table.add_index(index)
+                if show_index:
+                    html_table.add_index(index)
             else:
                 html_table.add_value('', border=0)
         html_table.add_new_line()

{memory_graph-0.3.51 → memory_graph-0.3.52/memory_graph.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.51
+Version: 0.3.52
 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
@@ -52,7 +52,7 @@ Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 
 # Highlights #
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
-Or run a live demo in the 👉[**Memory Graph Web Debugger**](https://memory-graph.com/#play)👈 now, no installation required!!!
+Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#play) 👈 now, no installation required!
 
 - learn the right **mental model** to think about Python data (references, mutability, shallow vs deep copy)
 - **visualize the structure of your data** to easily understand and debug any data structure
@@ -663,6 +663,9 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.embedding_types*** : set[type]
   - Holds all dictionary types that embed their key-value tuple children.
 
+- ***mg.config.no_index_types*** : set[type]
+  - Holds all types like 'set' and 'frozenset' that should not have indices as Node_Linear.
+
 - ***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.
 
@@ -676,7 +679,7 @@ Different aspects of memory_graph can be configured. The default configuration c
   - Maps a type to a Slicer. A slicer determines how many elements of a data type are shown in the graph to prevent the graph from getting too big. 'Slicer()' does no slicing, 'Slicer(1,2,3)' shows just 1 element at the beginning, 2 in the middle, and 3 at the end.
 
 - ***mg.config.max_graph_depth*** : int
-  - The maxium depth of the graph with default value 12.
+  - The maxium depth of the graph with default value 1000.
 
 - ***mg.config.graph_cut_symbol*** : str
   - The symbol indicating where the graph is cut short with default `✂`.

memory_graph-0.3.52/memory_graph.egg-info/SOURCES.txt

@@ -0,0 +1,117 @@
+LICENSE.txt
+MANIFEST.in
+README.md
+pyproject.toml
+setup.py
+images/add_one.png
+images/add_one.py
+images/avltree.py
+images/avltree_dir.png
+images/avltree_fail.png
+images/avltree_key_value.png
+images/avltree_leaf.png
+images/avltree_linear.png
+images/avltree_table.png
+images/bin_search.png
+images/bin_search.py
+images/bin_search_linear.png
+images/bin_tree.gif
+images/bin_tree.png
+images/bin_tree.py
+images/binary.gif
+images/binary.py
+images/colab_example.png
+images/copies.png
+images/copies_immutable.png
+images/copies_mix.png
+images/copy_immutable.png
+images/copy_immutable.py
+images/copy_method.png
+images/copy_method.py
+images/copy_mix.png
+images/copy_mix.py
+images/copy_mutable.png
+images/copy_mutable.py
+images/create_gif.sh
+images/create_images.sh
+images/debug_vscode.png
+images/debugging.gif
+images/debugging.py
+images/depth.png
+images/embedded1.png
+images/embedded2.png
+images/extension_numpy.png
+images/extension_numpy.py
+images/extension_pandas.png
+images/extension_pandas.py
+images/extension_torch.png
+images/extension_torch.py
+images/factorial.gif
+images/factorial.py
+images/hash_set.gif
+images/hash_set.png
+images/hash_set.py
+images/hidden_edges.png
+images/hidden_edges.py
+images/hidden_edges2.png
+images/immutable.py
+images/immutable1.png
+images/immutable2.png
+images/introspect_depth.png
+images/introspect_depth.py
+images/ipython.png
+images/jupyter_example.png
+images/linked_list.gif
+images/linked_list.png
+images/linked_list.py
+images/many_types.png
+images/many_types.py
+images/marimo_example.png
+images/memory_graph.gv.pdf
+images/memory_graph_web_debugger.png
+images/mutable.py
+images/mutable1.png
+images/mutable2.png
+images/name_rebinding.py
+images/not_node_types.py
+images/power_set.gif
+images/power_set.py
+images/rebinding1.png
+images/rebinding2.png
+images/uva.png
+images/vscode_copying.gif
+memory_graph/__init__.py
+memory_graph/call_stack.py
+memory_graph/config.py
+memory_graph/config_default.py
+memory_graph/config_helpers.py
+memory_graph/extension_numpy.py
+memory_graph/extension_pandas.py
+memory_graph/extension_torch.py
+memory_graph/html_table.py
+memory_graph/list_view.py
+memory_graph/memory_to_nodes.py
+memory_graph/node_base.py
+memory_graph/node_key_value.py
+memory_graph/node_leaf.py
+memory_graph/node_linear.py
+memory_graph/node_table.py
+memory_graph/sequence.py
+memory_graph/slicer.py
+memory_graph/slices.py
+memory_graph/slices_iterator.py
+memory_graph/slices_table_iterator.py
+memory_graph/test.py
+memory_graph/test_max_graph_depth.py
+memory_graph/test_memory_graph.py
+memory_graph/test_memory_to_nodes.py
+memory_graph/test_sequence.py
+memory_graph/test_slicer.py
+memory_graph/test_slices.py
+memory_graph/test_slices_iterator.py
+memory_graph/utils.py
+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

{memory_graph-0.3.51 → memory_graph-0.3.52}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "memory_graph"
-version = "0.3.51"
+version = "0.3.52"
 description = "Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy."
 authors = [
     {name = "Bas Terwijn", email = "bterwijn@gmail.com"}

memory_graph-0.3.51/images/add_one.gv

@@ -1,69 +0,0 @@
-digraph memory_graph {
-	node [shape=plaintext]
-	node139894338702912 [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>
-    <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
-</TABLE>
-> xlabel=list]
-	node139894328041856 [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]
-	node139894327354560 [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]
-	node139894327914240 [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]
-	node139894327914240:ref0 -> node139894338702912:table [style=solid]
-	node139894327914240:ref1 -> node139894328041856:table [style=solid]
-	node139894327914240:ref2 -> node139894327354560:table [style=solid]
-	node139894328059728 [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>
-    <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
-</TABLE>
-> xlabel=tuple]
-	node139894328042240 [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>
-    <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
-</TABLE>
-> xlabel=list]
-	node139894323520576 [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]
-	node139894323520576:ref0 -> node139894338702912:table [style=solid]
-	node139894323520576:ref1 -> node139894328059728:table [style=solid]
-	node139894323520576:ref2 -> node139894328042240:table [style=solid]
-	node139894323574128 [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]
-	node139894323574128:ref0 -> node139894327914240:table [style=solid]
-	node139894323574128:ref1 -> node139894323520576:table [style=solid]
-subgraph { rank=same; node139894327914240 -> node139894323520576[weight=10, style=invis]; }
-subgraph { rank=same; node139894338702912 -> node139894328041856 -> node139894327354560 -> node139894328059728 -> node139894328042240[weight=10, style=invis]; }
-}

memory_graph-0.3.51/images/avltree_dir.gv

@@ -1,57 +0,0 @@
-digraph memory_graph {
-	node [shape=plaintext]
-	node140717000093552 [label=<
-<TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
-    <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> __class__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> __delattr__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="1"> __dir__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> __doc__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">4</font></TD><TD BORDER="1"> __eq__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">5</font></TD><TD BORDER="1"> __firstlineno__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">6</font></TD><TD BORDER="1"> __format__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">7</font></TD><TD BORDER="1"> __ge__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">8</font></TD><TD BORDER="1"> __getattribute__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">9</font></TD><TD BORDER="1"> __getitem__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">10</font></TD><TD BORDER="1"> __getstate__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">11</font></TD><TD BORDER="1"> __gt__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">12</font></TD><TD BORDER="1"> __hash__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">13</font></TD><TD BORDER="1"> __init__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">14</font></TD><TD BORDER="1"> __init_subclass__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">15</font></TD><TD BORDER="1"> __le__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">16</font></TD><TD BORDER="1"> __lt__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">17</font></TD><TD BORDER="1"> __module__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">18</font></TD><TD BORDER="1"> __ne__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">19</font></TD><TD BORDER="1"> __new__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">20</font></TD><TD BORDER="1"> __reduce__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">21</font></TD><TD BORDER="1"> __reduce_ex__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">22</font></TD><TD BORDER="1"> __repr__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">23</font></TD><TD BORDER="1"> __setattr__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">24</font></TD><TD BORDER="1"> __setitem__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">25</font></TD><TD BORDER="1"> __sizeof__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">26</font></TD><TD BORDER="1"> __slots__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">27</font></TD><TD BORDER="1"> __static_attributes__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">28</font></TD><TD BORDER="1"> __str__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">29</font></TD><TD BORDER="1"> __subclasshook__ </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">30</font></TD><TD BORDER="1"> balance </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">31</font></TD><TD BORDER="1"> free </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">32</font></TD><TD BORDER="1"> key </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">33</font></TD><TD BORDER="1"> left </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">34</font></TD><TD BORDER="1"> right </TD></TR>
-    <TR><TD BORDER="0"><font color="#505050">35</font></TD><TD BORDER="1"> value </TD></TR>
-</TABLE>
-> xlabel="Node"]
-	node140716987336416 [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]
-	node140716987336416:ref0 -> node140717000093552:table [style=solid]
-	node140716989974400 [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]
-	node140716989974400:ref0 -> node140716987336416:table [style=solid]
-}

memory_graph-0.3.51/images/avltree_fail.gv

@@ -1,22 +0,0 @@
-digraph memory_graph {
-	node [shape=plaintext]
-	node124172493692400 [label=<
-<TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="white" PORT="table">
-    <TR><TD BORDER="1"> &lt;bintrees.avltree.Node object at 0x70ef296... </TD></TR>
-</TABLE>
-> xlabel="Node"]
-	node124172492521984 [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]
-	node124172492521984:ref0 -> node124172493692400:table [style=solid]
-	node124172495724224 [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]
-	node124172495724224:ref0 -> node124172492521984:table [style=solid]
-}

memory_graph-0.3.51/images/avltree_key_value.gv

@@ -1,49 +0,0 @@
-digraph memory_graph {
-	node [shape=plaintext]
-	node129575228425776 [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>
-    <TR><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1"> five </TD></TR>
-    <TR><TD BORDER="1" STYLE="ROUNDED"> right </TD><TD BORDER="1"> None </TD></TR>
-</TABLE>
-> xlabel="Node"]
-	node129575228539984 [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>
-    <TR><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1"> fifteen </TD></TR>
-    <TR><TD BORDER="1" STYLE="ROUNDED"> right </TD><TD BORDER="1"> None </TD></TR>
-</TABLE>
-> xlabel="Node"]
-	node129575228540064 [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"]
-	node129575228540064:ref0 -> node129575228539984:table [style=solid]
-	node129575242854256 [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"]
-	node129575242854256:ref0 -> node129575228425776:table [style=solid]
-	node129575242854256:ref1 -> node129575228540064:table [style=solid]
-	node129575229722976 [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]
-	node129575229722976:ref0 -> node129575242854256:table [style=solid]
-	node129575232423936 [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]
-	node129575232423936:ref0 -> node129575229722976:table [style=solid]
-subgraph { rank=same; node129575228425776 -> node129575228540064[weight=10, style=invis]; }
-}

memory_graph-0.3.51/images/avltree_leaf.gv

@@ -1,22 +0,0 @@
-digraph memory_graph {
-	node [shape=plaintext]
-	node129575242854256 [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"]
-	node129575229722976 [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]
-	node129575229722976:ref0 -> node129575242854256:table [style=solid]
-	node129575232423936 [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]
-	node129575232423936:ref0 -> node129575229722976:table [style=solid]
-}