memory-graph 0.3.26__tar.gz → 0.3.27__tar.gz

{memory_graph-0.3.26/memory_graph.egg-info → memory_graph-0.3.27}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.26
+Version: 0.3.27
 Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
@@ -410,37 +410,37 @@ and pressing <Enter> a number of times, results in:
 # Data Structure Examples #
 Module memory_graph can be very useful in a course about data structures, some examples:
 
-## Doubly Linked List ##
+## Circular Doubly Linked List ##
 ```python
 import memory_graph as mg
 import random
 random.seed(0) # use same random numbers each run
 
 class Linked_List:
+    """ Circular doubly linked list """
 
-    def __init__(self, value=None, prev=None, next=None):
-        self.prev = prev
+    def __init__(self, value=None, 
+                 prev=None, next=None):
+        self.prev = prev if prev else self
         self.value = value
-        self.next = next
+        self.next = next if next else self
 
-    def add_front(self, value):
+    def add_back(self, value):
         if self.value == None:
             self.value = value 
-        elif self.next is None:
-            new_node = Linked_List(value)
-            self.prev = new_node
-            self.next = new_node
         else:
-            new_node = Linked_List(value, self.next)
-            self.next.next = new_node
-            self.next = new_node
+            new_node = Linked_List(value,
+                                   prev=self.prev,
+                                   next=self)
+            self.prev.next = new_node
+            self.prev = new_node
 
 linked_list = Linked_List()
 n = 100
 for i in range(n):
     value = random.randrange(n)
-    linked_list.add_front(value)
-	mg.show(locals())
+    linked_list.add_back(value)
+    mg.block(mg.show, locals()) # <--- draw locals
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 

{memory_graph-0.3.26 → memory_graph-0.3.27}/README.md

@@ -391,37 +391,37 @@ and pressing <Enter> a number of times, results in:
 # Data Structure Examples #
 Module memory_graph can be very useful in a course about data structures, some examples:
 
-## Doubly Linked List ##
+## Circular Doubly Linked List ##
 ```python
 import memory_graph as mg
 import random
 random.seed(0) # use same random numbers each run
 
 class Linked_List:
+    """ Circular doubly linked list """
 
-    def __init__(self, value=None, prev=None, next=None):
-        self.prev = prev
+    def __init__(self, value=None, 
+                 prev=None, next=None):
+        self.prev = prev if prev else self
         self.value = value
-        self.next = next
+        self.next = next if next else self
 
-    def add_front(self, value):
+    def add_back(self, value):
         if self.value == None:
             self.value = value 
-        elif self.next is None:
-            new_node = Linked_List(value)
-            self.prev = new_node
-            self.next = new_node
         else:
-            new_node = Linked_List(value, self.next)
-            self.next.next = new_node
-            self.next = new_node
+            new_node = Linked_List(value,
+                                   prev=self.prev,
+                                   next=self)
+            self.prev.next = new_node
+            self.prev = new_node
 
 linked_list = Linked_List()
 n = 100
 for i in range(n):
     value = random.randrange(n)
-    linked_list.add_front(value)
-	mg.show(locals())
+    linked_list.add_back(value)
+    mg.block(mg.show, locals()) # <--- draw locals
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 

memory_graph-0.3.27/images/cmp.sh

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

memory_graph-0.3.27/images/cmp.sh~

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

{memory_graph-0.3.26 → memory_graph-0.3.27}/images/linked_list.py

@@ -7,29 +7,29 @@ import random
 random.seed(0) # use same random numbers each run
 
 class Linked_List:
+    """ Circular doubly linked list """
 
-    def __init__(self, value=None, prev=None, next=None):
-        self.prev = prev
+    def __init__(self, value=None, 
+                 prev=None, next=None):
+        self.prev = prev if prev else self
         self.value = value
-        self.next = next
+        self.next = next if next else self
 
-    def add_front(self, value):
+    def add_back(self, value):
         if self.value == None:
             self.value = value 
-        elif self.next is None:
-            new_node = Linked_List(value)
-            self.prev = new_node
-            self.next = new_node
         else:
-            new_node = Linked_List(value, self.next)
-            self.next.next = new_node
-            self.next = new_node
+            new_node = Linked_List(value,
+                                   prev=self.prev,
+                                   next=self)
+            self.prev.next = new_node
+            self.prev = new_node
 
 linked_list = Linked_List()
 n = 100
 for i in range(n):
     value = random.randrange(n)
-    linked_list.add_front(value)
+    linked_list.add_back(value)
     if value == 33:
         mg.render(locals(), "linked_list.png")
         exit()

memory_graph-0.3.27/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.26 → memory_graph-0.3.27}/memory_graph/__init__.py

@@ -10,11 +10,12 @@ import memory_graph.utils as utils
 
 import inspect
 import sys
+import itertools as it
 from memory_graph.call_stack import call_stack
 
 import graphviz
 
-__version__ = "0.3.26"
+__version__ = "0.3.27"
 __author__ = 'Bas Terwijn'
 render_filename = 'memory_graph.pdf'
 render_filename_count = 0
@@ -224,12 +225,13 @@ def get_call_stack(up_to_function="<module>",stack_index=0):
 
 def stack_after_up_to(after_function,up_to_function="<module>"):
     return get_call_stack_after_up_to(after_function, up_to_function)
-def get_call_stack_after_up_to(after_function,up_to_function="<module>"):
-    """ Gets the call stack after the function 'after_function' up to the function 'up_to_function'."""
-    frames = reversed(list(
+def get_call_stack_after_up_to(after_function,up_to_function="<module>", drop=0):
+    """ Gets the call stack after the function 'after_function' up to the function 'up_to_function'
+        and drop the first 'drop' stack frames. """
+    frames = reversed(list(it.islice(
             utils.take_up_to(lambda i: i.function == up_to_function,
             utils.take_after(lambda i: i.function == after_function, inspect.stack()))
-            ))
+            , 1, None)))
     return stack_frames_to_dict(frames)
 
 def stack_pdb(after_function="trace_dispatch",up_to_function="<module>"):
@@ -244,11 +246,11 @@ def get_call_stack_vscode(after_function="do_wait_suspend",up_to_function="<modu
     """ Get the call stack in a 'vscode' debugger session, filtering out the 'vscode' functions that polute the graph. """
     return get_call_stack_after_up_to(after_function,up_to_function)
 
-def stack_pycharm(after_function="trace_dispatch",up_to_function="<module>"):
+def stack_pycharm(after_function="do_wait_suspend",up_to_function="<module>"):
     return get_call_stack_pycharm(after_function, up_to_function)
-def get_call_stack_pycharm(after_function="trace_dispatch",up_to_function="<module>"):
-    """ Get the call stack in a 'pycharm' debugger session, filtering out the 'pycharm' functions that polute the graph. """
-    return get_call_stack_after_up_to(after_function,up_to_function)
+def get_call_stack_pycharm(after_function="do_wait_suspend",up_to_function="<module>"):
+    """ Get the call stack in a 'vscode' debugger session, filtering out the 'vscode' functions that polute the graph. """
+    return get_call_stack_after_up_to(after_function,up_to_function, 1)
 
 def save_call_stack(filename):
     """ Saves the call stack to 'filename' for inspection to see what functions need to be 

memory_graph-0.3.27/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.26 → memory_graph-0.3.27/memory_graph.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.26
+Version: 0.3.27
 Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
@@ -410,37 +410,37 @@ and pressing <Enter> a number of times, results in:
 # Data Structure Examples #
 Module memory_graph can be very useful in a course about data structures, some examples:
 
-## Doubly Linked List ##
+## Circular Doubly Linked List ##
 ```python
 import memory_graph as mg
 import random
 random.seed(0) # use same random numbers each run
 
 class Linked_List:
+    """ Circular doubly linked list """
 
-    def __init__(self, value=None, prev=None, next=None):
-        self.prev = prev
+    def __init__(self, value=None, 
+                 prev=None, next=None):
+        self.prev = prev if prev else self
         self.value = value
-        self.next = next
+        self.next = next if next else self
 
-    def add_front(self, value):
+    def add_back(self, value):
         if self.value == None:
             self.value = value 
-        elif self.next is None:
-            new_node = Linked_List(value)
-            self.prev = new_node
-            self.next = new_node
         else:
-            new_node = Linked_List(value, self.next)
-            self.next.next = new_node
-            self.next = new_node
+            new_node = Linked_List(value,
+                                   prev=self.prev,
+                                   next=self)
+            self.prev.next = new_node
+            self.prev = new_node
 
 linked_list = Linked_List()
 n = 100
 for i in range(n):
     value = random.randrange(n)
-    linked_list.add_front(value)
-	mg.show(locals())
+    linked_list.add_back(value)
+    mg.block(mg.show, locals()) # <--- draw locals
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 

{memory_graph-0.3.26 → memory_graph-0.3.27}/memory_graph.egg-info/SOURCES.txt

@@ -1,34 +1,22 @@
 LICENSE.txt
 MANIFEST.in
 README.md
-install.txt
 setup.py
-images/add_one.gv
 images/add_one.png
 images/add_one.py
 images/avltree.py
-images/avltree.py~
-images/avltree_dir.gv
 images/avltree_dir.png
-images/avltree_fail.gv
 images/avltree_fail.png
-images/avltree_key_value.gv
 images/avltree_key_value.png
-images/avltree_leaf.gv
 images/avltree_leaf.png
-images/avltree_linear.gv
 images/avltree_linear.png
-images/avltree_table.gv
 images/avltree_table.png
-images/bin_tree.gv
 images/bin_tree.png
 images/bin_tree.py
-images/bin_tree2.py
-images/bin_tree2.py~
-images/copies.gv
+images/cmp.sh
+images/cmp.sh~
 images/copies.png
 images/copies.py
-images/copy_method.gv
 images/copy_method.png
 images/copy_method.py
 images/create_gif.sh
@@ -36,152 +24,78 @@ images/create_images.sh
 images/debug_vscode.png
 images/debugging.gif
 images/debugging.py
-images/debugging01.gv
 images/debugging01.png
-images/debugging02.gv
 images/debugging02.png
-images/debugging03.gv
 images/debugging03.png
-images/debugging04.gv
 images/debugging04.png
-images/debugging05.gv
 images/debugging05.png
-images/debugging06.gv
 images/debugging06.png
-images/depth.gv
-images/depth.png
-images/extension_numpy.gv
 images/extension_numpy.png
 images/extension_numpy.py
-images/extension_pandas.gv
 images/extension_pandas.png
 images/extension_pandas.py
 images/factorial.gif
 images/factorial.py
-images/factorial0.gv
-images/factorial0.png
-images/factorial01.gv
-images/factorial02.gv
-images/factorial03.gv
-images/factorial04.gv
-images/factorial05.gv
-images/factorial06.gv
-images/factorial07.gv
-images/factorial1.gv
-images/factorial1.png
-images/factorial2.gv
-images/factorial2.png
-images/factorial3.gv
-images/factorial3.png
-images/factorial4.gv
-images/factorial4.png
-images/factorial5.gv
-images/factorial5.png
-images/factorial6.gv
-images/factorial6.png
-images/hash_set.gv
+images/factorial01.png
+images/factorial02.png
+images/factorial03.png
+images/factorial04.png
+images/factorial05.png
+images/factorial06.png
+images/factorial07.png
 images/hash_set.png
 images/hash_set.py
-images/hidden_edges.gv
 images/hidden_edges.png
-images/hidden_edges.py
-images/hidden_edges.py~
-images/highlight.gv
 images/highlight.png
 images/highlight.py
 images/immutable.py
-images/immutable1.gv
 images/immutable1.png
-images/immutable2.gv
 images/immutable2.png
-images/introspect_depth.gv
 images/introspect_depth.png
 images/introspect_depth.py
-images/introspect_depth.py~
 images/ipython.png
 images/jupyter_example.png
-images/linked_list.gv
 images/linked_list.png
 images/linked_list.py
-images/log.txt
-images/many_types.gv
 images/many_types.png
 images/many_types.py
-images/memory_graph.gv
-images/memory_graph.gv.pdf
-images/memory_graph.pdf
 images/mutable.py
-images/mutable1.gv
 images/mutable1.png
-images/mutable2.gv
 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.gv
 images/not_node_types1.png
-images/not_node_types2.gv
 images/not_node_types2.png
 images/power_set.gif
 images/power_set.py
-images/power_set0.gv
-images/power_set0.png
-images/power_set1.gv
 images/power_set1.png
-images/power_set10.gv
 images/power_set10.png
-images/power_set11.gv
 images/power_set11.png
-images/power_set12.gv
 images/power_set12.png
-images/power_set13.gv
 images/power_set13.png
-images/power_set14.gv
 images/power_set14.png
-images/power_set15.gv
 images/power_set15.png
-images/power_set16.gv
 images/power_set16.png
-images/power_set17.gv
 images/power_set17.png
-images/power_set18.gv
 images/power_set18.png
-images/power_set19.gv
 images/power_set19.png
-images/power_set2.gv
 images/power_set2.png
-images/power_set20.gv
 images/power_set20.png
-images/power_set21.gv
 images/power_set21.png
-images/power_set22.gv
 images/power_set22.png
-images/power_set23.gv
-images/power_set23.png
-images/power_set3.gv
 images/power_set3.png
-images/power_set4.gv
 images/power_set4.png
-images/power_set5.gv
 images/power_set5.png
-images/power_set6.gv
 images/power_set6.png
-images/power_set7.gv
 images/power_set7.png
-images/power_set8.gv
 images/power_set8.png
-images/power_set9.gv
 images/power_set9.png
 images/pyodide.png
-images/rebinding1.gv
 images/rebinding1.png
-images/rebinding2.gv
 images/rebinding2.png
 images/uva.png
 images/vscode_copying.gif
-images/.ipynb_checkpoints/jupyter_example-checkpoint.ipynb
 memory_graph/__init__.py
 memory_graph/call_stack.py
 memory_graph/config.py
@@ -202,6 +116,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
@@ -215,8 +130,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.26 → memory_graph-0.3.27}/setup.py

@@ -11,7 +11,7 @@ long_description_from_readme = (this_directory / "README.md").read_text()
 
 setup(
     name = 'memory_graph',
-    version = '0.3.26',
+    version = '0.3.27',
     description = 'Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.',
     long_description = long_description_from_readme,
     long_description_content_type = 'text/markdown',