memory-graph 0.2.3__tar.gz → 0.2.4__tar.gz

{memory_graph-0.2.3 → memory_graph-0.2.4}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.2.3
+Version: 0.2.4
 Summary: Draws a graph of your data to analyze its structure.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
@@ -222,24 +222,22 @@ memory_graph.show(locals(), block=True)
 
 So much so that function `d()` is available as alias for this for easier debugging. Additionally it can optionally log the data by printing them. For example:
 ```python
-from memory_graph import d
+import memory_graph
 
-my_squares = []
-my_squares_ref = my_squares
-for i in range(5):
-    my_squares.append(i**2)
-    d(log=True)
-my_squares_copy = my_squares.copy()
-d(log=True)
+squares = []
+squares_collector = []
+for i in range(1,6):
+    squares.append(i**2)
+    squares_collector.append(squares.copy())
+    memory_graph.d(log=True)
 ```
 which after pressing ENTER a number of times results in:
 
-![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.png)
+![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.gif)
 ```
-my_squares: [0, 1, 4, 9, 16]
-my_squares_ref: [0, 1, 4, 9, 16]
-i: 4
-my_squares_copy: [0, 1, 4, 9, 16]
+squares: [1, 4, 9, 16, 25]
+squares_collector: [[1], [1, 4], [1, 4, 9], [1, 4, 9, 16], [1, 4, 9, 16, 25]]
+i: 5
 ```
 
 Function `d()` has these default arguments:
@@ -306,12 +304,8 @@ def factorial(n):
 
 factorial(3)
 ```
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial1.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial2.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial3.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial4.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial5.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial6.png" /></div>
+![factorial.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial.gif)
+
 and the final result is: 1 x 2 x 3 = 6
 
 ### Call Stack in Watchpoint ###
@@ -339,7 +333,7 @@ Module memory_graph can be very useful in a course about datastructures, some ex
 
 ### Doubly Linked List ###
 ```python
-from memory_graph import d
+import memory_graph
 import random
 random.seed(0) # use same random numbers each run
 
@@ -365,19 +359,19 @@ class LinkedList:
             new_node.next = self.head
             self.head.prev = new_node
             self.head = new_node
+        memory_graph.d() # <--- draw graph
 
 linked_list = LinkedList()
 n = 100
 for i in range(n):
     new_value = random.randrange(n)
     linked_list.add_front(new_value)
-    d() # <--- draw linked list
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
 ### Binary Tree ###
 ```python
-from memory_graph import d
+import memory_graph
 import random
 random.seed(0) # use same random numbers each run
 
@@ -394,7 +388,6 @@ class BinTree:
         self.root = None
 
     def add_recursive(self, new_value, node):
-        d() # <--- draw tree when adding recursively
         if new_value < node.value:
             if node.smaller is None:
                 node.smaller = Node(new_value)
@@ -405,6 +398,7 @@ class BinTree:
                 node.larger = Node(new_value)
             else:
                 self.add_recursive(new_value, node.larger)
+        memory_graph.d() # <--- draw graph
 
     def add(self, value):
         if self.root is None:
@@ -417,27 +411,27 @@ n = 100
 for i in range(n):
     new_value = random.randrange(100)
     tree.add(new_value)
-    d()  # <--- draw tree after adding
 ```
 ![bin_tree.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.png)
 
 ### Hash Set ###
 ```python
-from memory_graph import d
+import memory_graph
 import random
 random.seed(0) # use same random numbers each run
 
 class HashSet:
 
-    def __init__(self, capacity=20):
+    def __init__(self, capacity=15):
         self.buckets = [None] * capacity
 
     def add(self, value):
         index = hash(value) % len(self.buckets)
         if self.buckets[index] is None:
-            self.buckets[index] = [value]
-        else:
-            self.buckets[index].append(value)
+            self.buckets[index] = []
+        bucket = self.buckets[index]
+        bucket.append(value)
+        memory_graph.d() # <--- draw graph
 
     def contains(self, value):
         index = hash(value) % len(self.buckets)
@@ -455,7 +449,6 @@ n = 100
 for i in range(n):
     new_value = random.randrange(n)
     hash_set.add(new_value)
-    d() # <--- draw hash set
 ```
 ![hash_set.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.png)
 
@@ -512,7 +505,7 @@ Different extensions are available for types from other Python packages.
 Numpy types `arrray` and `matrix` and `ndarray` can be graphed with the "memory_graph.extension_numpy" extension:
 
 ```python
-from memory_graph import d
+import memory_graph
 import numpy as np
 import memory_graph.extension_numpy
 np.random.seed(0) # use same random numbers each run
@@ -520,7 +513,7 @@ np.random.seed(0) # use same random numbers each run
 array = np.array([1.1, 2, 3, 4, 5])
 matrix = np.matrix([[i*20+j for j in range(20)] for i in range(20)])
 ndarray = np.random.rand(20,20)
-d()
+memory_graph.d()
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
 
@@ -528,7 +521,7 @@ d()
 Pandas types `Series` and `DataFrame` can be graphed with the "memory_graph.extension_pandas" extension:
 
 ```python
-from memory_graph import d
+import memory_graph
 import pandas as pd
 import memory_graph.extension_pandas
 
@@ -539,7 +532,7 @@ dataframe2 = pd.DataFrame({  'Name'   : [ 'Tom', 'Anna', 'Steve', 'Lisa'],
                              'Age'    : [    28,     34,      29,     42],
                              'Length' : [  1.70,   1.66,    1.82,   1.73] },
                             index=['one', 'two', 'three', 'four']) # with row names
-d()
+memory_graph.d()
 ```
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
 

{memory_graph-0.2.3 → memory_graph-0.2.4}/README.md

@@ -203,24 +203,22 @@ memory_graph.show(locals(), block=True)
 
 So much so that function `d()` is available as alias for this for easier debugging. Additionally it can optionally log the data by printing them. For example:
 ```python
-from memory_graph import d
+import memory_graph
 
-my_squares = []
-my_squares_ref = my_squares
-for i in range(5):
-    my_squares.append(i**2)
-    d(log=True)
-my_squares_copy = my_squares.copy()
-d(log=True)
+squares = []
+squares_collector = []
+for i in range(1,6):
+    squares.append(i**2)
+    squares_collector.append(squares.copy())
+    memory_graph.d(log=True)
 ```
 which after pressing ENTER a number of times results in:
 
-![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.png)
+![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.gif)
 ```
-my_squares: [0, 1, 4, 9, 16]
-my_squares_ref: [0, 1, 4, 9, 16]
-i: 4
-my_squares_copy: [0, 1, 4, 9, 16]
+squares: [1, 4, 9, 16, 25]
+squares_collector: [[1], [1, 4], [1, 4, 9], [1, 4, 9, 16], [1, 4, 9, 16, 25]]
+i: 5
 ```
 
 Function `d()` has these default arguments:
@@ -287,12 +285,8 @@ def factorial(n):
 
 factorial(3)
 ```
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial1.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial2.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial3.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial4.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial5.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial6.png" /></div>
+![factorial.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial.gif)
+
 and the final result is: 1 x 2 x 3 = 6
 
 ### Call Stack in Watchpoint ###
@@ -320,7 +314,7 @@ Module memory_graph can be very useful in a course about datastructures, some ex
 
 ### Doubly Linked List ###
 ```python
-from memory_graph import d
+import memory_graph
 import random
 random.seed(0) # use same random numbers each run
 
@@ -346,19 +340,19 @@ class LinkedList:
             new_node.next = self.head
             self.head.prev = new_node
             self.head = new_node
+        memory_graph.d() # <--- draw graph
 
 linked_list = LinkedList()
 n = 100
 for i in range(n):
     new_value = random.randrange(n)
     linked_list.add_front(new_value)
-    d() # <--- draw linked list
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
 ### Binary Tree ###
 ```python
-from memory_graph import d
+import memory_graph
 import random
 random.seed(0) # use same random numbers each run
 
@@ -375,7 +369,6 @@ class BinTree:
         self.root = None
 
     def add_recursive(self, new_value, node):
-        d() # <--- draw tree when adding recursively
         if new_value < node.value:
             if node.smaller is None:
                 node.smaller = Node(new_value)
@@ -386,6 +379,7 @@ class BinTree:
                 node.larger = Node(new_value)
             else:
                 self.add_recursive(new_value, node.larger)
+        memory_graph.d() # <--- draw graph
 
     def add(self, value):
         if self.root is None:
@@ -398,27 +392,27 @@ n = 100
 for i in range(n):
     new_value = random.randrange(100)
     tree.add(new_value)
-    d()  # <--- draw tree after adding
 ```
 ![bin_tree.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.png)
 
 ### Hash Set ###
 ```python
-from memory_graph import d
+import memory_graph
 import random
 random.seed(0) # use same random numbers each run
 
 class HashSet:
 
-    def __init__(self, capacity=20):
+    def __init__(self, capacity=15):
         self.buckets = [None] * capacity
 
     def add(self, value):
         index = hash(value) % len(self.buckets)
         if self.buckets[index] is None:
-            self.buckets[index] = [value]
-        else:
-            self.buckets[index].append(value)
+            self.buckets[index] = []
+        bucket = self.buckets[index]
+        bucket.append(value)
+        memory_graph.d() # <--- draw graph
 
     def contains(self, value):
         index = hash(value) % len(self.buckets)
@@ -436,7 +430,6 @@ n = 100
 for i in range(n):
     new_value = random.randrange(n)
     hash_set.add(new_value)
-    d() # <--- draw hash set
 ```
 ![hash_set.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.png)
 
@@ -493,7 +486,7 @@ Different extensions are available for types from other Python packages.
 Numpy types `arrray` and `matrix` and `ndarray` can be graphed with the "memory_graph.extension_numpy" extension:
 
 ```python
-from memory_graph import d
+import memory_graph
 import numpy as np
 import memory_graph.extension_numpy
 np.random.seed(0) # use same random numbers each run
@@ -501,7 +494,7 @@ np.random.seed(0) # use same random numbers each run
 array = np.array([1.1, 2, 3, 4, 5])
 matrix = np.matrix([[i*20+j for j in range(20)] for i in range(20)])
 ndarray = np.random.rand(20,20)
-d()
+memory_graph.d()
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
 
@@ -509,7 +502,7 @@ d()
 Pandas types `Series` and `DataFrame` can be graphed with the "memory_graph.extension_pandas" extension:
 
 ```python
-from memory_graph import d
+import memory_graph
 import pandas as pd
 import memory_graph.extension_pandas
 
@@ -520,7 +513,7 @@ dataframe2 = pd.DataFrame({  'Name'   : [ 'Tom', 'Anna', 'Steve', 'Lisa'],
                              'Age'    : [    28,     34,      29,     42],
                              'Length' : [  1.70,   1.66,    1.82,   1.73] },
                             index=['one', 'two', 'three', 'four']) # with row names
-d()
+memory_graph.d()
 ```
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
 

{memory_graph-0.2.3 → memory_graph-0.2.4}/memory_graph/__init__.py

@@ -6,7 +6,7 @@ import memory_graph.utils as utils
 import inspect
 import sys
 
-__version__ = "0.2.03"
+__version__ = "0.2.04"
 __author__ = 'Bas Terwijn'
 
 log_file=sys.stdout

{memory_graph-0.2.3 → memory_graph-0.2.4}/memory_graph.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory-graph
-Version: 0.2.3
+Version: 0.2.4
 Summary: Draws a graph of your data to analyze its structure.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
@@ -222,24 +222,22 @@ memory_graph.show(locals(), block=True)
 
 So much so that function `d()` is available as alias for this for easier debugging. Additionally it can optionally log the data by printing them. For example:
 ```python
-from memory_graph import d
+import memory_graph
 
-my_squares = []
-my_squares_ref = my_squares
-for i in range(5):
-    my_squares.append(i**2)
-    d(log=True)
-my_squares_copy = my_squares.copy()
-d(log=True)
+squares = []
+squares_collector = []
+for i in range(1,6):
+    squares.append(i**2)
+    squares_collector.append(squares.copy())
+    memory_graph.d(log=True)
 ```
 which after pressing ENTER a number of times results in:
 
-![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.png)
+![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.gif)
 ```
-my_squares: [0, 1, 4, 9, 16]
-my_squares_ref: [0, 1, 4, 9, 16]
-i: 4
-my_squares_copy: [0, 1, 4, 9, 16]
+squares: [1, 4, 9, 16, 25]
+squares_collector: [[1], [1, 4], [1, 4, 9], [1, 4, 9, 16], [1, 4, 9, 16, 25]]
+i: 5
 ```
 
 Function `d()` has these default arguments:
@@ -306,12 +304,8 @@ def factorial(n):
 
 factorial(3)
 ```
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial1.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial2.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial3.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial4.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial5.png" /></div>
-  <div><img src="https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial6.png" /></div>
+![factorial.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/factorial.gif)
+
 and the final result is: 1 x 2 x 3 = 6
 
 ### Call Stack in Watchpoint ###
@@ -339,7 +333,7 @@ Module memory_graph can be very useful in a course about datastructures, some ex
 
 ### Doubly Linked List ###
 ```python
-from memory_graph import d
+import memory_graph
 import random
 random.seed(0) # use same random numbers each run
 
@@ -365,19 +359,19 @@ class LinkedList:
             new_node.next = self.head
             self.head.prev = new_node
             self.head = new_node
+        memory_graph.d() # <--- draw graph
 
 linked_list = LinkedList()
 n = 100
 for i in range(n):
     new_value = random.randrange(n)
     linked_list.add_front(new_value)
-    d() # <--- draw linked list
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
 ### Binary Tree ###
 ```python
-from memory_graph import d
+import memory_graph
 import random
 random.seed(0) # use same random numbers each run
 
@@ -394,7 +388,6 @@ class BinTree:
         self.root = None
 
     def add_recursive(self, new_value, node):
-        d() # <--- draw tree when adding recursively
         if new_value < node.value:
             if node.smaller is None:
                 node.smaller = Node(new_value)
@@ -405,6 +398,7 @@ class BinTree:
                 node.larger = Node(new_value)
             else:
                 self.add_recursive(new_value, node.larger)
+        memory_graph.d() # <--- draw graph
 
     def add(self, value):
         if self.root is None:
@@ -417,27 +411,27 @@ n = 100
 for i in range(n):
     new_value = random.randrange(100)
     tree.add(new_value)
-    d()  # <--- draw tree after adding
 ```
 ![bin_tree.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.png)
 
 ### Hash Set ###
 ```python
-from memory_graph import d
+import memory_graph
 import random
 random.seed(0) # use same random numbers each run
 
 class HashSet:
 
-    def __init__(self, capacity=20):
+    def __init__(self, capacity=15):
         self.buckets = [None] * capacity
 
     def add(self, value):
         index = hash(value) % len(self.buckets)
         if self.buckets[index] is None:
-            self.buckets[index] = [value]
-        else:
-            self.buckets[index].append(value)
+            self.buckets[index] = []
+        bucket = self.buckets[index]
+        bucket.append(value)
+        memory_graph.d() # <--- draw graph
 
     def contains(self, value):
         index = hash(value) % len(self.buckets)
@@ -455,7 +449,6 @@ n = 100
 for i in range(n):
     new_value = random.randrange(n)
     hash_set.add(new_value)
-    d() # <--- draw hash set
 ```
 ![hash_set.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.png)
 
@@ -512,7 +505,7 @@ Different extensions are available for types from other Python packages.
 Numpy types `arrray` and `matrix` and `ndarray` can be graphed with the "memory_graph.extension_numpy" extension:
 
 ```python
-from memory_graph import d
+import memory_graph
 import numpy as np
 import memory_graph.extension_numpy
 np.random.seed(0) # use same random numbers each run
@@ -520,7 +513,7 @@ np.random.seed(0) # use same random numbers each run
 array = np.array([1.1, 2, 3, 4, 5])
 matrix = np.matrix([[i*20+j for j in range(20)] for i in range(20)])
 ndarray = np.random.rand(20,20)
-d()
+memory_graph.d()
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
 
@@ -528,7 +521,7 @@ d()
 Pandas types `Series` and `DataFrame` can be graphed with the "memory_graph.extension_pandas" extension:
 
 ```python
-from memory_graph import d
+import memory_graph
 import pandas as pd
 import memory_graph.extension_pandas
 
@@ -539,7 +532,7 @@ dataframe2 = pd.DataFrame({  'Name'   : [ 'Tom', 'Anna', 'Steve', 'Lisa'],
                              'Age'    : [    28,     34,      29,     42],
                              'Length' : [  1.70,   1.66,    1.82,   1.73] },
                             index=['one', 'two', 'three', 'four']) # with row names
-d()
+memory_graph.d()
 ```
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
 

{memory_graph-0.2.3 → memory_graph-0.2.4}/setup.py

@@ -7,7 +7,7 @@ long_description_from_readme = (this_directory / "README.md").read_text()
 
 setup(
     name = 'memory_graph',
-    version = '0.2.03',
+    version = '0.2.04',
     description = 'Draws a graph of your data to analyze its structure.',
     long_description = long_description_from_readme,
     long_description_content_type = 'text/markdown',