invocation-tree 0.0.2__tar.gz → 0.0.4__tar.gz

{invocation_tree-0.0.2/invocation_tree.egg-info → invocation_tree-0.0.4}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: invocation_tree
-Version: 0.0.2
+Version: 0.0.4
 Summary: Generate an invocation tree of functions calls.
 Home-page: https://github.com/bterwijn/invocation_tree
 Author: Bas Terwijn
@@ -67,7 +67,7 @@ Each node in the tree represents a function call, and node's color indicates its
 
 For every function, the package displays its **local variables** and **return value**. Changes to these values over time are highlighted using bold text and gray shading to make them easy to track.
 
-The [invocation_tree](https://pypi.org/project/invocation-tree/) package visualizes function calls at different moments in time. If you want a more detailed visualization of your data at a specific moment in time, check out the [memory_graph](https://pypi.org/project/memory-graph/) package.
+The [invocation_tree](https://pypi.org/project/invocation-tree/) package visualizes function calls at different moments in time. If you want a more detailed visualization of your data at the current time, check out the [memory_graph](https://pypi.org/project/memory-graph/) package.
 
 ## Blocking ##
 The program blocks execution at every function call and return statement, printing the current location in the source code. Press the <Enter> key to continue execution. To block at every line of the program (like in a debugger tool) where a change of value occured, use instead:
@@ -98,7 +98,7 @@ def factorial(n):
     return n * factorial(n - 1)
 
 tree = invo_tree.blocking()
-tree(factorial, 4) # calls factorial(4)
+tree(factorial, 4) # show invocation tree of calling factorial(4)
 ```
 ![factorial](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/factorial.gif)
 
@@ -116,8 +116,8 @@ def permutations(elements, perm, n):
     return all_perms
 
 tree = invo_tree.blocking()
-result = tree(permutations, ['L','R'], '', 3)
-print(result) # all permutations of going Left and Right of length 3
+result = tree(permutations, ['L','R'], '', 2)
+print(result) # all permutations of going Left and Right of length 2
 ```
 ![permutations](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/permutations.gif)
 

{invocation_tree-0.0.2 → invocation_tree-0.0.4}/README.md

@@ -48,7 +48,7 @@ Each node in the tree represents a function call, and node's color indicates its
 
 For every function, the package displays its **local variables** and **return value**. Changes to these values over time are highlighted using bold text and gray shading to make them easy to track.
 
-The [invocation_tree](https://pypi.org/project/invocation-tree/) package visualizes function calls at different moments in time. If you want a more detailed visualization of your data at a specific moment in time, check out the [memory_graph](https://pypi.org/project/memory-graph/) package.
+The [invocation_tree](https://pypi.org/project/invocation-tree/) package visualizes function calls at different moments in time. If you want a more detailed visualization of your data at the current time, check out the [memory_graph](https://pypi.org/project/memory-graph/) package.
 
 ## Blocking ##
 The program blocks execution at every function call and return statement, printing the current location in the source code. Press the <Enter> key to continue execution. To block at every line of the program (like in a debugger tool) where a change of value occured, use instead:
@@ -79,7 +79,7 @@ def factorial(n):
     return n * factorial(n - 1)
 
 tree = invo_tree.blocking()
-tree(factorial, 4) # calls factorial(4)
+tree(factorial, 4) # show invocation tree of calling factorial(4)
 ```
 ![factorial](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/factorial.gif)
 
@@ -97,8 +97,8 @@ def permutations(elements, perm, n):
     return all_perms
 
 tree = invo_tree.blocking()
-result = tree(permutations, ['L','R'], '', 3)
-print(result) # all permutations of going Left and Right of length 3
+result = tree(permutations, ['L','R'], '', 2)
+print(result) # all permutations of going Left and Right of length 2
 ```
 ![permutations](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/permutations.gif)
 

{invocation_tree-0.0.2 → invocation_tree-0.0.4}/images/create_gif.sh

@@ -9,11 +9,11 @@ files=$(ls -v $name*.png)
 echo "creating gif with:"
 echo "$files"
 
-largest_size=$(identify -format "%Wx%H %f\n" $name*.png | sort -nr | head -n1)
+largest_size=$(identify -format "%H %Wx%H %f\n" $name*.png | sort -nr | head -n1| awk '{print $2}')
 echo "largest_size: $largest_size"
 
 echo "resizing images"
-mogrify -resize $largest_size -background white -gravity center -extent $largest_size $files
+mogrify -resize $largest_size -background white -gravity North -extent $largest_size $files
 echo "creating file: $name.gif"
 convert -delay 150 -loop 0 $files $name.gif
 echo "done"

{invocation_tree-0.0.2 → invocation_tree-0.0.4}/images/permutations.py

@@ -9,5 +9,5 @@ def permutations(elements, perm, n):
     return all_perms
 
 tree = invo_tree.gif('permutations.png')
-result = tree(permutations, ['L','R'], '', 3)
+result = tree(permutations, ['L','R'], '', 2)
 print(result)

{invocation_tree-0.0.2 → invocation_tree-0.0.4}/invocation_tree/__init__.py

@@ -7,7 +7,7 @@ import html
 import sys
 import difflib 
 
-__version__ = "0.0.2"
+__version__ = "0.0.4"
 __author__ = 'Bas Terwijn'
 
 def highlight_diff(str1, str2):
@@ -112,6 +112,7 @@ class Invocation_Tree:
             result = fun(*args, **kwargs)
         finally:
             sys.settrace(None)
+        return result
 
     def value_to_string(self, key, value, use_repr=False):
         try:

{invocation_tree-0.0.2 → invocation_tree-0.0.4/invocation_tree.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: invocation_tree
-Version: 0.0.2
+Version: 0.0.4
 Summary: Generate an invocation tree of functions calls.
 Home-page: https://github.com/bterwijn/invocation_tree
 Author: Bas Terwijn
@@ -67,7 +67,7 @@ Each node in the tree represents a function call, and node's color indicates its
 
 For every function, the package displays its **local variables** and **return value**. Changes to these values over time are highlighted using bold text and gray shading to make them easy to track.
 
-The [invocation_tree](https://pypi.org/project/invocation-tree/) package visualizes function calls at different moments in time. If you want a more detailed visualization of your data at a specific moment in time, check out the [memory_graph](https://pypi.org/project/memory-graph/) package.
+The [invocation_tree](https://pypi.org/project/invocation-tree/) package visualizes function calls at different moments in time. If you want a more detailed visualization of your data at the current time, check out the [memory_graph](https://pypi.org/project/memory-graph/) package.
 
 ## Blocking ##
 The program blocks execution at every function call and return statement, printing the current location in the source code. Press the <Enter> key to continue execution. To block at every line of the program (like in a debugger tool) where a change of value occured, use instead:
@@ -98,7 +98,7 @@ def factorial(n):
     return n * factorial(n - 1)
 
 tree = invo_tree.blocking()
-tree(factorial, 4) # calls factorial(4)
+tree(factorial, 4) # show invocation tree of calling factorial(4)
 ```
 ![factorial](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/factorial.gif)
 
@@ -116,8 +116,8 @@ def permutations(elements, perm, n):
     return all_perms
 
 tree = invo_tree.blocking()
-result = tree(permutations, ['L','R'], '', 3)
-print(result) # all permutations of going Left and Right of length 3
+result = tree(permutations, ['L','R'], '', 2)
+print(result) # all permutations of going Left and Right of length 2
 ```
 ![permutations](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/permutations.gif)
 

{invocation_tree-0.0.2 → invocation_tree-0.0.4}/invocation_tree.egg-info/SOURCES.txt

@@ -28,24 +28,8 @@ images/permutations10.png
 images/permutations11.png
 images/permutations12.png
 images/permutations13.png
-images/permutations14.png
-images/permutations15.png
-images/permutations16.png
-images/permutations17.png
-images/permutations18.png
-images/permutations19.png
 images/permutations2.png
-images/permutations20.png
-images/permutations21.png
-images/permutations22.png
 images/permutations22.png~
-images/permutations23.png
-images/permutations24.png
-images/permutations25.png
-images/permutations26.png
-images/permutations27.png
-images/permutations28.png
-images/permutations29.png
 images/permutations3.png
 images/permutations4.png
 images/permutations5.png

{invocation_tree-0.0.2 → invocation_tree-0.0.4}/setup.py

@@ -11,7 +11,7 @@ long_description_from_readme = (this_directory / "README.md").read_text()
 
 setup(
     name = 'invocation_tree',
-    version = '0.0.2',
+    version = '0.0.4',
     description = 'Generate an invocation tree of functions calls.',
     long_description = long_description_from_readme,
     long_description_content_type = 'text/markdown',