memory-graph 0.3.16__tar.gz → 0.3.17__tar.gz

{memory_graph-0.3.16/memory_graph.egg-info → memory_graph-0.3.17}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.16
+Version: 0.3.17
 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
@@ -430,7 +430,7 @@ class LinkedList:
             new_node.next = self.head
             self.head.prev = new_node
             self.head = new_node
-        mg.block(mg.show, locals()) # <--- draw graph
+        mg.block(mg.show, locals()) # <--- draw locals
 
 linked_list = LinkedList()
 n = 100
@@ -446,42 +446,33 @@ import memory_graph as mg
 import random
 random.seed(0) # use same random numbers each run
 
-class Node:
-
-    def __init__(self, value):
-        self.smaller = None
-        self.value = value
-        self.larger = None
-
 class BinTree:
 
-    def __init__(self):
-        self.root = None
+    def __init__(self, value=None, smaller=None, larger=None):
+        self.smaller = smaller
+        self.value = value
+        self.larger = larger
 
-    def add_recursive(self, new_value, node):
-        if new_value < node.value:
-            if node.smaller is None:
-                node.smaller = Node(new_value)
+    def add(self, value):
+        if self.value is None:
+            self.value = value
+        elif value < self.value:
+            if self.smaller is None:
+                self.smaller = BinTree(value)
             else:
-                self.add_recursive(new_value, node.smaller)
+                self.smaller.add(value)
         else:
-            if node.larger is None:
-                node.larger = Node(new_value)
+            if self.larger is None:
+                self.larger = BinTree(value)
             else:
-                self.add_recursive(new_value, node.larger)
-        mg.block(mg.show, locals()) # <--- draw graph
-
-    def add(self, value):
-        if self.root is None:
-            self.root = Node(value)
-        else:
-            self.add_recursive(value, self.root)
+                self.larger.add(value)
+        mg.block(mg.show, mg.stack()) # <--- draw stack
 
 tree = BinTree()
 n = 100
 for i in range(n):
-    new_value = random.randrange(n)
-    tree.add(new_value)
+    value = random.randrange(n)
+    tree.add(value)
 ```
 ![bin_tree.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.png)
 
@@ -502,7 +493,7 @@ class HashSet:
             self.buckets[index] = []
         bucket = self.buckets[index]
         bucket.append(value)
-        mg.block(mg.show, locals()) # <--- draw graph
+        mg.block(mg.show, locals()) # <--- draw locals
 
     def contains(self, value):
         index = hash(value) % len(self.buckets)

{memory_graph-0.3.16 → memory_graph-0.3.17}/README.md

@@ -411,7 +411,7 @@ class LinkedList:
             new_node.next = self.head
             self.head.prev = new_node
             self.head = new_node
-        mg.block(mg.show, locals()) # <--- draw graph
+        mg.block(mg.show, locals()) # <--- draw locals
 
 linked_list = LinkedList()
 n = 100
@@ -427,42 +427,33 @@ import memory_graph as mg
 import random
 random.seed(0) # use same random numbers each run
 
-class Node:
-
-    def __init__(self, value):
-        self.smaller = None
-        self.value = value
-        self.larger = None
-
 class BinTree:
 
-    def __init__(self):
-        self.root = None
+    def __init__(self, value=None, smaller=None, larger=None):
+        self.smaller = smaller
+        self.value = value
+        self.larger = larger
 
-    def add_recursive(self, new_value, node):
-        if new_value < node.value:
-            if node.smaller is None:
-                node.smaller = Node(new_value)
+    def add(self, value):
+        if self.value is None:
+            self.value = value
+        elif value < self.value:
+            if self.smaller is None:
+                self.smaller = BinTree(value)
             else:
-                self.add_recursive(new_value, node.smaller)
+                self.smaller.add(value)
         else:
-            if node.larger is None:
-                node.larger = Node(new_value)
+            if self.larger is None:
+                self.larger = BinTree(value)
             else:
-                self.add_recursive(new_value, node.larger)
-        mg.block(mg.show, locals()) # <--- draw graph
-
-    def add(self, value):
-        if self.root is None:
-            self.root = Node(value)
-        else:
-            self.add_recursive(value, self.root)
+                self.larger.add(value)
+        mg.block(mg.show, mg.stack()) # <--- draw stack
 
 tree = BinTree()
 n = 100
 for i in range(n):
-    new_value = random.randrange(n)
-    tree.add(new_value)
+    value = random.randrange(n)
+    tree.add(value)
 ```
 ![bin_tree.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.png)
 
@@ -483,7 +474,7 @@ class HashSet:
             self.buckets[index] = []
         bucket = self.buckets[index]
         bucket.append(value)
-        mg.block(mg.show, locals()) # <--- draw graph
+        mg.block(mg.show, locals()) # <--- draw locals
 
     def contains(self, value):
         index = hash(value) % len(self.buckets)

memory_graph-0.3.17/images/bin_tree.py

@@ -0,0 +1,38 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
+import memory_graph as mg
+import random
+random.seed(0) # use same random numbers each run
+
+class BinTree:
+
+    def __init__(self, value=None, smaller=None, larger=None):
+        self.smaller = smaller
+        self.value = value
+        self.larger = larger
+
+    def add(self, value):
+        if self.value is None:
+            self.value = value
+        elif value < self.value:
+            if self.smaller is None:
+                self.smaller = BinTree(value)
+            else:
+                self.smaller.add(value)
+        else:
+            if self.larger is None:
+                self.larger = BinTree(value)
+            else:
+                self.larger.add(value)
+        if value == 51:
+            mg.render(mg.stack(), f"bin_tree.png")
+            exit(0)
+
+tree = BinTree()
+n = 100
+for i in range(n):
+    value = random.randrange(n)
+    tree.add(value)
+

memory_graph-0.3.17/images/bin_tree2.py

@@ -0,0 +1,31 @@
+import memory_graph as mg
+import random
+random.seed(0) # use same random numbers each run
+
+class BinTree:
+
+    def __init__(self, value=None, smaller=None, larger=None):
+        self.smaller = smaller
+        self.value = value
+        self.larger = larger
+
+    def add(self, value):
+        if self.value is None:
+            self.value = value
+        elif value < self.value:
+            if self.smaller is None:
+                self.smaller = BinTree(value)
+            else:
+                self.smaller.add(value)
+        else:
+            if self.larger is None:
+                self.larger = BinTree(value)
+            else:
+                self.larger.add(value)
+        mg.block(mg.show, mg.stack())
+
+tree = BinTree()
+n = 100
+for i in range(n):
+    value = random.randrange(n)
+    tree.add(value)

memory_graph-0.3.17/images/bin_tree2.py~

@@ -0,0 +1,31 @@
+import memory_graph as mg
+import random
+random.seed(0) # use same random numbers each run
+
+class BinTree:
+
+    def __init__(self, value=None, smaller=None, larger=None):
+        self.smaller = smaller
+        self.value = value
+        self.larger = larger
+
+    def add(self, value):
+        if self.value is None:
+            self.value = value
+        elif value < self.value:
+            if self.smaller is None:
+                self.smaller = BinTree(value)
+            else:
+                self.smaller.add(value)
+        else:
+            if self.larger is None:
+                self.larger = BinTree(value)
+            else:
+                self.larger.add(value)
+	mg.block(mg.render, mg.stack(), f"bin_tree.png")
+
+tree = BinTree()
+n = 100
+for i in range(n):
+    value = random.randrange(n)
+    tree.add(value)

{memory_graph-0.3.16 → memory_graph-0.3.17}/memory_graph/__init__.py

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

{memory_graph-0.3.16 → memory_graph-0.3.17/memory_graph.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.16
+Version: 0.3.17
 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
@@ -430,7 +430,7 @@ class LinkedList:
             new_node.next = self.head
             self.head.prev = new_node
             self.head = new_node
-        mg.block(mg.show, locals()) # <--- draw graph
+        mg.block(mg.show, locals()) # <--- draw locals
 
 linked_list = LinkedList()
 n = 100
@@ -446,42 +446,33 @@ import memory_graph as mg
 import random
 random.seed(0) # use same random numbers each run
 
-class Node:
-
-    def __init__(self, value):
-        self.smaller = None
-        self.value = value
-        self.larger = None
-
 class BinTree:
 
-    def __init__(self):
-        self.root = None
+    def __init__(self, value=None, smaller=None, larger=None):
+        self.smaller = smaller
+        self.value = value
+        self.larger = larger
 
-    def add_recursive(self, new_value, node):
-        if new_value < node.value:
-            if node.smaller is None:
-                node.smaller = Node(new_value)
+    def add(self, value):
+        if self.value is None:
+            self.value = value
+        elif value < self.value:
+            if self.smaller is None:
+                self.smaller = BinTree(value)
             else:
-                self.add_recursive(new_value, node.smaller)
+                self.smaller.add(value)
         else:
-            if node.larger is None:
-                node.larger = Node(new_value)
+            if self.larger is None:
+                self.larger = BinTree(value)
             else:
-                self.add_recursive(new_value, node.larger)
-        mg.block(mg.show, locals()) # <--- draw graph
-
-    def add(self, value):
-        if self.root is None:
-            self.root = Node(value)
-        else:
-            self.add_recursive(value, self.root)
+                self.larger.add(value)
+        mg.block(mg.show, mg.stack()) # <--- draw stack
 
 tree = BinTree()
 n = 100
 for i in range(n):
-    new_value = random.randrange(n)
-    tree.add(new_value)
+    value = random.randrange(n)
+    tree.add(value)
 ```
 ![bin_tree.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.png)
 
@@ -502,7 +493,7 @@ class HashSet:
             self.buckets[index] = []
         bucket = self.buckets[index]
         bucket.append(value)
-        mg.block(mg.show, locals()) # <--- draw graph
+        mg.block(mg.show, locals()) # <--- draw locals
 
     def contains(self, value):
         index = hash(value) % len(self.buckets)

{memory_graph-0.3.16 → memory_graph-0.3.17}/memory_graph.egg-info/SOURCES.txt

@@ -17,6 +17,8 @@ images/avltree_linear.png
 images/avltree_table.png
 images/bin_tree.png
 images/bin_tree.py
+images/bin_tree2.py
+images/bin_tree2.py~
 images/copies.png
 images/copies.py
 images/copy_method.png
@@ -58,8 +60,8 @@ 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/memory_graph.pdf
 images/mutable.py
 images/mutable1.png
 images/mutable2.png

{memory_graph-0.3.16 → memory_graph-0.3.17}/setup.py

@@ -11,7 +11,7 @@ long_description_from_readme = (this_directory / "README.md").read_text()
 
 setup(
     name = 'memory_graph',
-    version = '0.3.16',
+    version = '0.3.17',
     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',

memory_graph-0.3.16/images/bin_tree.py

@@ -1,47 +0,0 @@
-# This file is part of memory_graph.
-# Copyright (c) 2023, Bas Terwijn.
-# SPDX-License-Identifier: BSD-2-Clause
-
-import memory_graph as mg
-import random
-random.seed(0) # use same random numbers each run
-
-class Node:
-
-    def __init__(self, value):
-        self.smaller = None
-        self.value = value
-        self.larger = None
-
-class BinTree:
-
-    def __init__(self):
-        self.root = None
-
-    def add_recursive(self, new_value, node):
-        if new_value < node.value:
-            if node.smaller is None:
-                node.smaller = Node(new_value)
-            else:
-                self.add_recursive(new_value, node.smaller)
-        else:
-            if node.larger is None:
-                node.larger = Node(new_value)
-            else:
-                self.add_recursive(new_value, node.larger)
-        if new_value == 51:
-            mg.render(locals(), f"bin_tree.png")
-            exit(0)
-
-    def add(self, value):
-        if self.root is None:
-            self.root = Node(value)
-        else:
-            self.add_recursive(value, self.root)
-
-tree = BinTree()
-n = 100
-for i in range(n):
-    new_value = random.randrange(n)
-    tree.add(new_value)
-

memory_graph-0.3.16/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]
-}