invocation-tree 0.0.32__tar.gz → 0.0.34__tar.gz

{invocation_tree-0.0.32/invocation_tree.egg-info → invocation_tree-0.0.34}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: invocation_tree
-Version: 0.0.32
+Version: 0.0.34
 Summary: Generates an invocation tree of functions calls.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -67,7 +67,7 @@ ___
 
 # Iteration and Recursion #
 
-Repetion can be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
+Repetition can be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
 
 ``` python
 import math
@@ -119,7 +119,7 @@ factorial(4) = 4 * factorial(3)
              = 24
 ```
 
-To better understand what is going on when we run the program we can use invocation_tree:
+To better understand what is going on when we run the program, we can use invocation_tree:
 
 ```python
 import invocation_tree as ivt
@@ -133,7 +133,7 @@ tree = ivt.blocking()  # block and wait for <Enter> key press
 tree(factorial, 4)     # call function 'factorial' with argument '4'
 ```
 
-to graph the function invocations. Run this program and press &lt;Enter&gt; to step through program execution.
+to graph the function invocations where function calls happen on the way down, and where results combine on the way up when a function returns. Run this program and press &lt;Enter&gt; to step through program execution.
 
 ![factorial](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/factorial.gif)
 
@@ -147,7 +147,7 @@ Each node in the invocation tree represents a function call, and the node's colo
 
 For every function call, the package displays its **local variables** and **return value**. Changes to the values of these variables over time are highlighted using bold text and gray shading to make them easier to track.
 
-With recursion we often use a divide and conquer strategy, spliting the problem in subproblems that are easier to solve. With factorial we split `factorial(4)` in a `4` and `factorial(3)` subproblem.
+With recursion we often use a divide and conquer strategy, splitting the problem in subproblems that are easier to solve. With factorial we split `factorial(4)` in a `4` and `factorial(3)` subproblem.
 
 **exercise1:** Use recursions to compute the sum of all the values in a list (hint: split for example the list `[1, 2, 3, ...]` in head `1` and tail `[2, 3, ...]`).
 ```python
@@ -170,7 +170,7 @@ def binary(decimal):
 print( binary(22) )  # [1, 0, 1, 1, 0]
 ```
 
-Checking that `[1, 0, 1, 1, 0]` is the correct binary repsentation for decimal 22:
+Checking that `[1, 0, 1, 1, 0]` is the correct binary representation for decimal 22:
 
 |       | 2<sup>4</sup> | 2<sup>3</sup> | 2<sup>2</sup> | 2<sup>1</sup> | 2<sup>0</sup> |               |
 |------:|:-------------:|:-------------:|:-------------:|:-------------:|:-------------:|:-------------:|
@@ -187,7 +187,7 @@ We can use recursion to compute all permutation of a number of elements with rep
 
 ![perms_LR3](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/perms_LR3.png)
 
-This can be implemented recursively like:
+This can be implemented recursively, using a divide and conquer strategy, like:
 
 ```python
 import invocation_tree as ivt
@@ -510,6 +510,7 @@ $ python jugs_breadth_first.py 51 3,5,34,107
 # Configuration #
 The Invocation Tree Web Debugger gives examples of the [most important configurations](https://invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/config.py).
 
+
 ## Hidding ##
 It can be useful to hide certian variables or functions to avoid unnecessary complexity. This can be done with:
 
@@ -543,6 +544,26 @@ tree.ignore_calls.add(r're:namespace\..*')
 
 ignores all function of `namespace`.
 
+## Decorator ##
+
+A better way to hide functions is to use the `@ivt.show` decorator on only the functions you want to graph. The decorator uses the global `ivt.decorator_tree`.
+
+```python
+import invocation_tree as ivt
+
+ivt.decorator_tree = ivt.blocking()  # set tree used by decorator
+
+@ivt.show  # use decorator to select which functions to graph
+def permutations(elements, perm, n):
+    if n == 0:
+        print(perm)
+    else:
+        for element in elements:
+            permutations(elements, perm + '\n' + element, n-1)
+
+permutations( 'LR', '', 3)  # all permutations of L and R of length 3
+```
+
 ## Blocking ##
 
 For convenience we provide these functions to set common configurations:
@@ -602,9 +623,9 @@ tree = ivt.Invocation_Tree()
 - **tree.ignore_calls** : set()
   - set of all functions names that are not shown in the tree, including its children
 - **tree.fontname** : str
-  - the font used in the graph, default 'Courier' (as widely available monospace).
+  - the font used in the graph, default 'Times-Roman' (widely available on the web)
 - **tree.fontsize** : str
-  - the font size used in the graph, default '14'.
+  - the font size used in the graph, default '14'
 
 # Troubleshooting #
 - Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'tree.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as the default PDF reader. Another solution is to `render()` the graph to a different output format.

{invocation_tree-0.0.32 → invocation_tree-0.0.34}/README.md

@@ -47,7 +47,7 @@ ___
 
 # Iteration and Recursion #
 
-Repetion can be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
+Repetition can be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
 
 ``` python
 import math
@@ -99,7 +99,7 @@ factorial(4) = 4 * factorial(3)
              = 24
 ```
 
-To better understand what is going on when we run the program we can use invocation_tree:
+To better understand what is going on when we run the program, we can use invocation_tree:
 
 ```python
 import invocation_tree as ivt
@@ -113,7 +113,7 @@ tree = ivt.blocking()  # block and wait for <Enter> key press
 tree(factorial, 4)     # call function 'factorial' with argument '4'
 ```
 
-to graph the function invocations. Run this program and press &lt;Enter&gt; to step through program execution.
+to graph the function invocations where function calls happen on the way down, and where results combine on the way up when a function returns. Run this program and press &lt;Enter&gt; to step through program execution.
 
 ![factorial](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/factorial.gif)
 
@@ -127,7 +127,7 @@ Each node in the invocation tree represents a function call, and the node's colo
 
 For every function call, the package displays its **local variables** and **return value**. Changes to the values of these variables over time are highlighted using bold text and gray shading to make them easier to track.
 
-With recursion we often use a divide and conquer strategy, spliting the problem in subproblems that are easier to solve. With factorial we split `factorial(4)` in a `4` and `factorial(3)` subproblem.
+With recursion we often use a divide and conquer strategy, splitting the problem in subproblems that are easier to solve. With factorial we split `factorial(4)` in a `4` and `factorial(3)` subproblem.
 
 **exercise1:** Use recursions to compute the sum of all the values in a list (hint: split for example the list `[1, 2, 3, ...]` in head `1` and tail `[2, 3, ...]`).
 ```python
@@ -150,7 +150,7 @@ def binary(decimal):
 print( binary(22) )  # [1, 0, 1, 1, 0]
 ```
 
-Checking that `[1, 0, 1, 1, 0]` is the correct binary repsentation for decimal 22:
+Checking that `[1, 0, 1, 1, 0]` is the correct binary representation for decimal 22:
 
 |       | 2<sup>4</sup> | 2<sup>3</sup> | 2<sup>2</sup> | 2<sup>1</sup> | 2<sup>0</sup> |               |
 |------:|:-------------:|:-------------:|:-------------:|:-------------:|:-------------:|:-------------:|
@@ -167,7 +167,7 @@ We can use recursion to compute all permutation of a number of elements with rep
 
 ![perms_LR3](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/perms_LR3.png)
 
-This can be implemented recursively like:
+This can be implemented recursively, using a divide and conquer strategy, like:
 
 ```python
 import invocation_tree as ivt
@@ -490,6 +490,7 @@ $ python jugs_breadth_first.py 51 3,5,34,107
 # Configuration #
 The Invocation Tree Web Debugger gives examples of the [most important configurations](https://invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/config.py).
 
+
 ## Hidding ##
 It can be useful to hide certian variables or functions to avoid unnecessary complexity. This can be done with:
 
@@ -523,6 +524,26 @@ tree.ignore_calls.add(r're:namespace\..*')
 
 ignores all function of `namespace`.
 
+## Decorator ##
+
+A better way to hide functions is to use the `@ivt.show` decorator on only the functions you want to graph. The decorator uses the global `ivt.decorator_tree`.
+
+```python
+import invocation_tree as ivt
+
+ivt.decorator_tree = ivt.blocking()  # set tree used by decorator
+
+@ivt.show  # use decorator to select which functions to graph
+def permutations(elements, perm, n):
+    if n == 0:
+        print(perm)
+    else:
+        for element in elements:
+            permutations(elements, perm + '\n' + element, n-1)
+
+permutations( 'LR', '', 3)  # all permutations of L and R of length 3
+```
+
 ## Blocking ##
 
 For convenience we provide these functions to set common configurations:
@@ -582,9 +603,9 @@ tree = ivt.Invocation_Tree()
 - **tree.ignore_calls** : set()
   - set of all functions names that are not shown in the tree, including its children
 - **tree.fontname** : str
-  - the font used in the graph, default 'Courier' (as widely available monospace).
+  - the font used in the graph, default 'Times-Roman' (widely available on the web)
 - **tree.fontsize** : str
-  - the font size used in the graph, default '14'.
+  - the font size used in the graph, default '14'
 
 # Troubleshooting #
 - Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'tree.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as the default PDF reader. Another solution is to `render()` the graph to a different output format.

{invocation_tree-0.0.32 → invocation_tree-0.0.34}/invocation_tree/__init__.py

@@ -6,10 +6,11 @@ from graphviz import Digraph
 import html
 import sys
 import difflib 
+import functools
 
 import invocation_tree.regex_set as regset
 
-__version__ = "0.0.32"
+__version__ = "0.0.34"
 __author__ = 'Bas Terwijn'
 
 def highlight_diff(str1, str2):
@@ -106,7 +107,7 @@ class Invocation_Tree:
         self.regset_hide_vars = regset.Regex_Set(self.hide_vars)
         self.regset_hide_calls = regset.Regex_Set(self.hide_calls)
         self.regset_ignore_calls = regset.Regex_Set(self.ignore_calls)
-        self.fontname = 'Courier'
+        self.fontname = 'Times-Roman'
         self.fontsize = '14'
         # --- core
         self.stack = []
@@ -134,7 +135,7 @@ class Invocation_Tree:
             sys.settrace(self.prev_global_tracer)
         return result
 
-    def value_to_string(self, key, value, use_repr=False):
+    def value_to_string(self, key, value):
         try:
             if id(value) in self.to_string:
                 val_str = self.to_string[id(value)](value)
@@ -143,18 +144,20 @@ class Invocation_Tree:
             elif type(value) in self.to_string:
                 val_str = self.to_string[type(value)](value)
             else:
-                val_str = repr(value) if use_repr else str(value)
+                val_str = str(value)
         except Exception as e:
             val_str = '<not-string-convertable>'
         if len(val_str) > self.max_string_len:
             val_str = '...'+val_str[-self.max_string_len:]
-        return html.escape(val_str)
-
-    def get_hightlighted_content(self, tree_node, key, value, use_old_content=False, use_repr=False):
+        result = html.escape(val_str)
+        result = result.replace('\n', '<BR/>') # use HTML line breaks
+        return result
+    
+    def get_hightlighted_content(self, tree_node, key, value, use_old_content=False):
         if use_old_content and key in tree_node.strings:
             return tree_node.strings[key]
         is_highlighted = False
-        content = self.value_to_string(key, value, use_repr=use_repr)
+        content = self.value_to_string(key, value)
         if key in tree_node.strings:
             use_old_content = tree_node.strings[key]
             hightlighted_content, is_highlighted = highlight_diff(use_old_content, content)
@@ -192,14 +195,14 @@ class Invocation_Tree:
             if filter_variables(var,val) and not self.regset_hide_vars.match(val_name, self.hide_vars):
                 table += '</TR>\n  <TR>'
                 hightlighted_var = self.get_hightlighted_content(tree_node, var_name, var, use_old_content)
-                hightlighted_val = self.get_hightlighted_content(tree_node, val_name, val, use_old_content, use_repr=True)
+                hightlighted_val = self.get_hightlighted_content(tree_node, val_name, val, use_old_content)
                 hightlighted_content = self.indent + hightlighted_var + ': ' + hightlighted_val
                 table += '<TD ALIGN="left">'+ hightlighted_content  +'</TD>'
         if is_returned:
             return_name = class_fun_name+'.return'
             if not self.regset_hide_vars.match(return_name, self.hide_vars):
                 table += '</TR>\n  <TR>'
-                hightlighted_content = self.get_hightlighted_content(tree_node, return_name, return_value, use_old_content, use_repr=True)
+                hightlighted_content = self.get_hightlighted_content(tree_node, return_name, return_value, use_old_content)
                 table += '<TD ALIGN="left">'+ 'return ' + hightlighted_content +'</TD>'
         table += '</TR>\n</TABLE>>'
         return table
@@ -349,6 +352,11 @@ class Invocation_Tree:
                    return None # stop tracing if debugger stopped tracing
             return local_multiplexer
 
+        # Optimize: disable line tracing if not needed
+        if not self.each_line:
+            frame.f_trace_lines = False
+            frame.f_trace_opcodes = False
+
         return local_multiplexer
 
 def blocking(filename='tree.pdf'):
@@ -371,3 +379,85 @@ def gif_each_change(filename='tree.png'):
 
 def non_blocking(filename='tree.pdf'):
     return Invocation_Tree(filename=filename, block=False)
+
+
+# ------ decorator ------
+
+decorator_tree = None
+
+def show(fun):
+    """ decorate a function with @ivt.show to visualize its invocation tree """
+    target_code = fun.__code__
+
+    @functools.wraps(fun)
+    def wrapper_ivt_deco(*args, **kwargs):
+        global decorator_tree
+        if decorator_tree is None:
+            return fun(*args, **kwargs)
+        prev_tracer = sys.gettrace()
+        active_depth = 0  # handles recursion of fun
+
+        def tracer(frame, event, arg):
+            nonlocal active_depth
+            # Check if this is our target function
+            if frame.f_code is target_code:
+                if event == "call":
+                    active_depth += 1
+                    if active_depth == 1:
+                        decorator_tree.trace(frame, event, None)
+                    # Optimize: disable line tracing if not needed
+                    if not getattr(decorator_tree, "each_line", False):
+                        frame.f_trace_lines = False
+                        frame.f_trace_opcodes = False
+                elif event == "line":
+                    if active_depth == 1 and getattr(decorator_tree, "each_line", False):
+                        decorator_tree.trace(frame, event, None)
+                elif event == "return":
+                    if active_depth == 1:
+                        decorator_tree.trace(frame, event, arg)
+                    active_depth -= 1
+                return tracer
+            
+            # Not our target: chain to previous tracer or return None to stop tracing this frame
+            if prev_tracer is not None:
+                return prev_tracer(frame, event, arg)
+            
+            return None  # Don't trace non-target frames
+
+        sys.settrace(tracer)
+        try:
+            return fun(*args, **kwargs)
+        finally:
+            sys.settrace(prev_tracer)
+    return wrapper_ivt_deco
+
+# faster decorator but no 'line' events
+def decorate_profile(fun): 
+    target_code = fun.__code__
+
+    @functools.wraps(fun)
+    def wrapper_ivt_deco(*args, **kwargs):
+        global decorator_tree
+        if decorator_tree is None:
+            return fun(*args, **kwargs)
+        prev_profiler = sys.getprofile()
+        active_depth = 0  # handles recursion of fun
+        
+        def profiler(frame, event, arg):
+            nonlocal active_depth
+            if frame.f_code is target_code:
+                if event == "call":
+                    active_depth += 1
+                    if active_depth == 1:
+                        decorator_tree.trace(frame, event, None)
+                elif event == "return":
+                    if active_depth == 1:
+                        decorator_tree.trace(frame, event, arg)
+                    active_depth -= 1
+
+        sys.setprofile(profiler)
+        try:
+            return fun(*args, **kwargs)
+        finally:
+            sys.setprofile(prev_profiler)
+    return wrapper_ivt_deco

{invocation_tree-0.0.32 → invocation_tree-0.0.34/invocation_tree.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: invocation_tree
-Version: 0.0.32
+Version: 0.0.34
 Summary: Generates an invocation tree of functions calls.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -67,7 +67,7 @@ ___
 
 # Iteration and Recursion #
 
-Repetion can be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
+Repetition can be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
 
 ``` python
 import math
@@ -119,7 +119,7 @@ factorial(4) = 4 * factorial(3)
              = 24
 ```
 
-To better understand what is going on when we run the program we can use invocation_tree:
+To better understand what is going on when we run the program, we can use invocation_tree:
 
 ```python
 import invocation_tree as ivt
@@ -133,7 +133,7 @@ tree = ivt.blocking()  # block and wait for <Enter> key press
 tree(factorial, 4)     # call function 'factorial' with argument '4'
 ```
 
-to graph the function invocations. Run this program and press &lt;Enter&gt; to step through program execution.
+to graph the function invocations where function calls happen on the way down, and where results combine on the way up when a function returns. Run this program and press &lt;Enter&gt; to step through program execution.
 
 ![factorial](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/factorial.gif)
 
@@ -147,7 +147,7 @@ Each node in the invocation tree represents a function call, and the node's colo
 
 For every function call, the package displays its **local variables** and **return value**. Changes to the values of these variables over time are highlighted using bold text and gray shading to make them easier to track.
 
-With recursion we often use a divide and conquer strategy, spliting the problem in subproblems that are easier to solve. With factorial we split `factorial(4)` in a `4` and `factorial(3)` subproblem.
+With recursion we often use a divide and conquer strategy, splitting the problem in subproblems that are easier to solve. With factorial we split `factorial(4)` in a `4` and `factorial(3)` subproblem.
 
 **exercise1:** Use recursions to compute the sum of all the values in a list (hint: split for example the list `[1, 2, 3, ...]` in head `1` and tail `[2, 3, ...]`).
 ```python
@@ -170,7 +170,7 @@ def binary(decimal):
 print( binary(22) )  # [1, 0, 1, 1, 0]
 ```
 
-Checking that `[1, 0, 1, 1, 0]` is the correct binary repsentation for decimal 22:
+Checking that `[1, 0, 1, 1, 0]` is the correct binary representation for decimal 22:
 
 |       | 2<sup>4</sup> | 2<sup>3</sup> | 2<sup>2</sup> | 2<sup>1</sup> | 2<sup>0</sup> |               |
 |------:|:-------------:|:-------------:|:-------------:|:-------------:|:-------------:|:-------------:|
@@ -187,7 +187,7 @@ We can use recursion to compute all permutation of a number of elements with rep
 
 ![perms_LR3](https://raw.githubusercontent.com/bterwijn/invocation_tree/main/images/perms_LR3.png)
 
-This can be implemented recursively like:
+This can be implemented recursively, using a divide and conquer strategy, like:
 
 ```python
 import invocation_tree as ivt
@@ -510,6 +510,7 @@ $ python jugs_breadth_first.py 51 3,5,34,107
 # Configuration #
 The Invocation Tree Web Debugger gives examples of the [most important configurations](https://invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/config.py).
 
+
 ## Hidding ##
 It can be useful to hide certian variables or functions to avoid unnecessary complexity. This can be done with:
 
@@ -543,6 +544,26 @@ tree.ignore_calls.add(r're:namespace\..*')
 
 ignores all function of `namespace`.
 
+## Decorator ##
+
+A better way to hide functions is to use the `@ivt.show` decorator on only the functions you want to graph. The decorator uses the global `ivt.decorator_tree`.
+
+```python
+import invocation_tree as ivt
+
+ivt.decorator_tree = ivt.blocking()  # set tree used by decorator
+
+@ivt.show  # use decorator to select which functions to graph
+def permutations(elements, perm, n):
+    if n == 0:
+        print(perm)
+    else:
+        for element in elements:
+            permutations(elements, perm + '\n' + element, n-1)
+
+permutations( 'LR', '', 3)  # all permutations of L and R of length 3
+```
+
 ## Blocking ##
 
 For convenience we provide these functions to set common configurations:
@@ -602,9 +623,9 @@ tree = ivt.Invocation_Tree()
 - **tree.ignore_calls** : set()
   - set of all functions names that are not shown in the tree, including its children
 - **tree.fontname** : str
-  - the font used in the graph, default 'Courier' (as widely available monospace).
+  - the font used in the graph, default 'Times-Roman' (widely available on the web)
 - **tree.fontsize** : str
-  - the font size used in the graph, default '14'.
+  - the font size used in the graph, default '14'
 
 # Troubleshooting #
 - Adobe Acrobat Reader [doesn't refresh a PDF file](https://community.adobe.com/t5/acrobat-reader-discussions/reload-refresh-pdfs/td-p/9632292) when it changes on disk and blocks updates which results in an `Could not open 'tree.pdf' for writing : Permission denied` error. One solution is to install a PDF reader that does refresh ([SumatraPDF](https://www.sumatrapdfreader.org/), [Okular](https://okular.kde.org/),  ...) and set it as the default PDF reader. Another solution is to `render()` the graph to a different output format.

invocation_tree-0.0.34/invocation_tree.egg-info/SOURCES.txt

@@ -0,0 +1,10 @@
+LICENSE.txt
+README.md
+pyproject.toml
+invocation_tree/__init__.py
+invocation_tree/regex_set.py
+invocation_tree.egg-info/PKG-INFO
+invocation_tree.egg-info/SOURCES.txt
+invocation_tree.egg-info/dependency_links.txt
+invocation_tree.egg-info/requires.txt
+invocation_tree.egg-info/top_level.txt

{invocation_tree-0.0.32 → invocation_tree-0.0.34}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "invocation_tree"
-version = "0.0.32"
+version = "0.0.34"
 description = "Generates an invocation tree of functions calls."
 authors = [
     {name = "Bas Terwijn", email = "bterwijn@gmail.com"}

invocation_tree-0.0.32/MANIFEST.in

@@ -1 +0,0 @@
-recursive-include images/ *

invocation_tree-0.0.32/images/compute.py

@@ -1,22 +0,0 @@
-import invocation_tree as ivt
-
-def main():
-    a = 1
-    a = expression(a)
-    return multiply(a, 6)
-    
-def expression(a):
-    a = subtract(a, 3)
-    return add(a, 9)
-    
-def subtract(a, b):
-    return a - b
-
-def add(a, b):
-    return a + b
-
-def multiply(a, b):
-    return a * b
-
-tree = ivt.gif('compute.png')
-print( tree(main) )

invocation_tree-0.0.32/images/create_gif.sh

@@ -1,25 +0,0 @@
-#!/bin/bash
-#
-# install:
-#
-#   sudo apt install imagemagick
-
-name="$1"
-files=$(ls -v $name*.png | tr '\n' ' ')
-echo "creating gif with:"
-echo "$files"
-
-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 North -extent $largest_size $files
-echo "creating file: $name.gif"
-convert -delay 150 -dither None -loop 0 $files $name.gif
-
-if [ "$2" = "-d" ]; then
-    echo "deleting: $files"
-    rm $files
-fi
-
-echo "done"

invocation_tree-0.0.32/images/create_images.sh

@@ -1,47 +0,0 @@
-
-#rm -f compute*.png
-#python compute.py
-#rm -f compute0.png
-#bash create_gif.sh compute -d
-
-#rm -f students*.png
-#python students.py
-#rm -f students0.png
-#bash create_gif.sh students -d
-
-rm -f factorial*.png
-python factorial.py
-rm -f factorial0.png
-bash create_gif.sh factorial -d
-
-python permutations_dot.py perms_LR3.png LR 3
-
-rm -f permutations*.png
-python permutations.py
-rm -f permutations0.png
-bash create_gif.sh permutations -d
-
-rm -f permutations_neighbor*.png
-python permutations_neighbor.py
-rm -f permutations_neighbor0.png
-bash create_gif.sh permutations_neighbor -d
-
-python draw_graph.py 10 2 graph_small 2 > edges_small.out
-python draw_graph.py 26 3 graph_big 1 > edges_big.out
-python draw_graph_d_x.py 26 3 graph_big_d_x 1 > edges_big_d_x.out
-
-rm -f permutations_return*.png
-python permutations_return.py
-rm -f permutations_return0.png
-bash create_gif.sh permutations_return -d
-
-rm -f permutations_collect*.png
-python permutations_collect.py
-rm -f permutations_collect0.png
-bash create_gif.sh permutations_collect -d
-
-rm -f quick_sort*.png
-python quick_sort.py
-rm -f quick_sort0.png
-bash create_gif.sh quick_sort -d
-

invocation_tree-0.0.32/images/draw_graph.py

@@ -1,32 +0,0 @@
-import sys
-import graph
-import graphviz
-
-def draw_graph(nodes, edges, filename='graph.png'):
-    dot = graphviz.Graph(
-        format='png',
-    )
-    for node in nodes:
-        # Color specific nodes
-        if node == 'a':
-            dot.node(node, fillcolor='green', style='filled')
-        elif node == 'b':
-            dot.node(node, fillcolor='red', style='filled')
-        else:
-            dot.node(node)
-    for edge in edges:
-        dot.edge(edge[0], edge[1])
-    dot.render(filename, cleanup=True)
-    print('edges = ', edges)
-
-if __name__ == "__main__":
-    if len(sys.argv) != 5:
-        print("Usage: python draw_graph.py <n> <max_edges> <output_file> <seed>")
-        sys.exit(1)
-    n = int(sys.argv[1])
-    max_edges = int(sys.argv[2])
-    output_file = sys.argv[3]
-    seed = int(sys.argv[4])
-
-    nodes, edges = graph.generate(n, max_edges, seed)
-    draw_graph(nodes, edges, output_file)

invocation_tree-0.0.32/images/draw_graph_d_x.py

@@ -1,36 +0,0 @@
-import sys
-import graph
-import graphviz
-
-def draw_graph(nodes, edges, filename='graph.png'):
-    dot = graphviz.Graph(
-        format='png',
-    )
-    for node in nodes:
-        # Color specific nodes
-        if node == 'a':
-            dot.node(node, fillcolor='green', style='filled')
-        elif node == 'b':
-            dot.node(node, fillcolor='red', style='filled')
-        elif node == 'd':
-            dot.node(node, fillcolor='orange', style='filled')
-        elif node == 'x':
-            dot.node(node, fillcolor='gray', style='filled')
-        else:
-            dot.node(node)
-    for edge in edges:
-        dot.edge(edge[0], edge[1])
-    dot.render(filename, cleanup=True)
-    print('edges = ', edges)
-
-if __name__ == "__main__":
-    if len(sys.argv) != 5:
-        print("Usage: python draw_graph.py <n> <max_edges> <output_file> <seed>")
-        sys.exit(1)
-    n = int(sys.argv[1])
-    max_edges = int(sys.argv[2])
-    output_file = sys.argv[3]
-    seed = int(sys.argv[4])
-
-    nodes, edges = graph.generate(n, max_edges, seed)
-    draw_graph(nodes, edges, output_file)

invocation_tree-0.0.32/images/edges_big.out

@@ -1 +0,0 @@
-edges =  [('a', 's'), ('i', 'z'), ('c', 'p'), ('d', 'p'), ('d', 'u'), ('b', 'e'), ('b', 'g'), ('f', 'p'), ('g', 'm'), ('h', 't'), ('h', 'y'), ('i', 'w'), ('i', 'j'), ('i', 'x'), ('k', 's'), ('k', 'l'), ('a', 'm'), ('n', 'u'), ('a', 'o'), ('a', 'v'), ('n', 'p'), ('a', 'q'), ('a', 'h'), ('p', 'r'), ('l', 's'), ('t', 'v'), ('u', 'y'), ('j', 'v'), ('a', 'j'), ('r', 'w'), ('r', 'u'), ('f', 'x'), ('x', 'y'), ('j', 'x'), ('d', 'j'), ('b', 'k'), ('b', 'x'), ('b', 'w')]

invocation_tree-0.0.32/images/edges_big_d_x.out

@@ -1 +0,0 @@
-edges =  [('a', 's'), ('i', 'z'), ('c', 'p'), ('d', 'p'), ('d', 'u'), ('b', 'e'), ('b', 'g'), ('f', 'p'), ('g', 'm'), ('h', 't'), ('h', 'y'), ('i', 'w'), ('i', 'j'), ('i', 'x'), ('k', 's'), ('k', 'l'), ('a', 'm'), ('n', 'u'), ('a', 'o'), ('a', 'v'), ('n', 'p'), ('a', 'q'), ('a', 'h'), ('p', 'r'), ('l', 's'), ('t', 'v'), ('u', 'y'), ('j', 'v'), ('a', 'j'), ('r', 'w'), ('r', 'u'), ('f', 'x'), ('x', 'y'), ('j', 'x'), ('d', 'j'), ('b', 'k'), ('b', 'x'), ('b', 'w')]

invocation_tree-0.0.32/images/edges_small.out

@@ -1 +0,0 @@
-edges =  [('a', 'j'), ('f', 'j'), ('c', 'e'), ('b', 'd'), ('b', 'e'), ('f', 'g'), ('g', 'i'), ('h', 'i'), ('e', 'h'), ('a', 'i'), ('b', 'h'), ('b', 'f')]

invocation_tree-0.0.32/images/factorial.py

@@ -1,9 +0,0 @@
-import invocation_tree as ivt
-
-def factorial(n):
-    if n <= 1:
-        return 1
-    return n * factorial(n - 1)
-
-tree = ivt.gif('factorial.png')
-print(tree(factorial, 4))

invocation_tree-0.0.32/images/graph.py

@@ -1,35 +0,0 @@
-import random
-import string
-
-def get_name(i):
-    name = ''
-    while True:
-        i, remainder = divmod(i, 26)
-        name = string.ascii_lowercase[remainder] + name
-        if i == 0:
-            break
-        i -= 1
-    return name
-
-def generate(n, max_edge, seed=0):
-    random.seed(seed)
-    nodes = [get_name(i) for i in range(n)]
-    if len(nodes) > 2:
-        nodes[1], nodes[-1] = nodes[-1], nodes[1]
-    edges = []
-    for node1 in nodes:
-        nr_edges = random.randint(1, max_edge)
-        for _ in range(nr_edges):
-            node2 = random.choice(nodes)
-            if node1 != node2:
-                if node1 > node2:
-                    node1 , node2 = node2, node1
-                edge = (node1, node2)
-                if edge not in edges:
-                    edges.append(edge)
-    return nodes, edges
-
-if __name__ == '__main__':
-    nodes, edges = generate(10, 3)
-    print('nodes =', nodes)
-    print('edges =', edges)

invocation_tree-0.0.32/images/jugs_depth_first.py

@@ -1,38 +0,0 @@
-import invocation_tree as ivt
-import jugs as jg
-
-def solver_depth_first(jugs, goal):
-
-    def solver_depth_first_recursive(jugs, goal, jugs_hist, action_hist):
-        actions = jugs.all_actions()
-        for action in actions:
-            goal_reached = jugs.do_action(action, goal)
-            if jugs not in jugs_hist:
-                jugs_hist.add(jugs.copy())
-                action_hist.append(action)
-                if goal_reached:
-                    return action_hist
-                result = solver_depth_first_recursive(jugs, goal, jugs_hist, action_hist)   
-                if result:
-                    return result
-                action_hist.pop()
-                jugs_hist.remove(jugs)
-            jugs.undo_action(action)
-        return None 
-
-    jugs_hist = {jugs}
-    action_hist = []
-    return solver_depth_first_recursive(jugs.copy(), goal, jugs_hist, action_hist)
-
-if __name__ == '__main__':
-    goal = 4
-    print('Goal is to get a jug with', goal, 'liters')
-    jugs = jg.Jugs((3, 5))
-    print('We start with jugs:',jugs)
-    tree = ivt.blocking()
-    tree.hide_vars.add('solver_depth_first_recursive.jugs_hist')
-    tree.hide_vars.add('solver_depth_first_recursive.action_hist')
-    tree.ignore_calls.add('re:Jugs.*')
-    solution_actions = tree(solver_depth_first, jugs, goal)
-    #solution_actions = solver_depth_first( jugs, goal)
-    jg.print_solution(jugs, solution_actions)

invocation_tree-0.0.32/images/permutations.py

@@ -1,11 +0,0 @@
-import invocation_tree as ivt
-
-def permutations(elements, perm, n):
-    if n == 0:
-        print(perm)
-    else:
-        for element in elements:
-            permutations(elements, perm + element, n-1)
-
-tree = ivt.gif('permutations.png')
-result = tree(permutations, 'LR', '', 3)

invocation_tree-0.0.32/images/permutations_collect.py

@@ -1,13 +0,0 @@
-import invocation_tree as ivt
-
-def permutations(elements, perm, n, results):
-    if n == 0:
-        results.append(perm)
-    else:
-        for element in elements:
-            permutations(elements, perm + element, n-1, results)
-
-tree = ivt.gif('permutations_collect.png')
-results = []
-tree(permutations, 'LR', '', 3, results)
-print(results)

invocation_tree-0.0.32/images/permutations_dot.py

@@ -1,30 +0,0 @@
-import sys
-
-from graphviz import Digraph
-
-def add_permute_nodes(dot, elements, perm, n, parent_id=None, node_id=[0]):
-    if n < 0:
-        return
-
-    my_id = node_id[0]
-    node_id[0] += 1
-    dot.node(str(my_id), perm)
-
-    
-    if parent_id is not None:
-        dot.edge(str(parent_id), str(my_id))
-    
-    for i, ch in enumerate(elements):
-        add_permute_nodes(dot, elements, perm + ch, n-1, parent_id=my_id, node_id=node_id)
-
-def make_permutation_tree(outfile, elements, n):
-    dot = Digraph()
-    dot.attr(rankdir='TB')  # top to bottom    
-    add_permute_nodes(dot, elements, "", n)
-    splits = outfile.split('.')
-    dot.format = splits[-1]
-    dot.render(filename=''.join(splits[:-1]), cleanup=True)
-    print(f"Generated graph: {outfile}")
-
-if __name__ == "__main__":
-    make_permutation_tree(sys.argv[1], sys.argv[2], int(sys.argv[3]))

invocation_tree-0.0.32/images/permutations_neighbor.py

@@ -1,12 +0,0 @@
-import invocation_tree as ivt
-
-def permutations(elems, perm, n):
-    if n == 0:
-        print(perm)
-    else:
-        for element in elems:
-            if len(perm) == 0 or not perm[-1] == element:  # test neighbor
-                permutations(elems, perm + element, n-1)  
-
-tree = ivt.gif('permutations_neighbor.png')
-tree(permutations, 'ABC', '', 3)  # permutations of A, B, C of length 3

invocation_tree-0.0.32/images/permutations_return.py

@@ -1,13 +0,0 @@
-import invocation_tree as ivt
-
-def permutations(elements, perm, n):
-    if n == 0:
-        return [perm]
-    else:
-        results = []
-        for element in elements:
-            results += permutations(elements, perm + element, n-1)
-        return results
-
-tree = ivt.gif('permutations_return.png')
-print(tree(permutations, 'LR', '', 3))

invocation_tree-0.0.32/images/print_all_paths.py

@@ -1,26 +0,0 @@
-edges =  [('a', 'j'), ('f', 'j'), ('c', 'e'), ('b', 'd'), ('b', 'e'), ('f', 'g'), ('g', 'i'), ('h', 'i'), ('e', 'h'), ('a', 'i'), ('b', 'h'), ('b', 'f')]
-
-def edges_to_steps(edges: list[tuple[str, str]]) -> dict[str,list[str]]:
-    """ Returns a dict with for each node the nodes it is connected with. """ 
-    steps = {}
-    for n1, n2 in edges:
-        if not n1 in steps:
-            steps[n1] = []
-        steps[n1].append(n2)
-        if not n2 in steps:
-            steps[n2] = []
-        steps[n2].append(n1)
-    return steps
-
-def print_all_paths(steps, path, goal):
-    current = path[-1]
-    if current == goal:
-        print(path)
-    else:
-        valid_steps = steps[current]
-        for s in valid_steps:
-            if s not in path:
-                print_all_paths(steps, path+s, goal)
-
-steps = edges_to_steps(edges)
-print_all_paths(steps, 'a', 'b')

invocation_tree-0.0.32/images/print_all_paths_of_length.py

@@ -1,27 +0,0 @@
-edges =  [('a', 's'), ('i', 'z'), ('c', 'p'), ('d', 'p'), ('d', 'u'), ('b', 'e'), ('b', 'g'), ('f', 'p'), ('g', 'm'), ('h', 't'), ('h', 'y'), ('i', 'w'), ('i', 'j'), ('i', 'x'), ('k', 's'), ('k', 'l'), ('a', 'm'), ('n', 'u'), ('a', 'o'), ('a', 'v'), ('n', 'p'), ('a', 'q'), ('a', 'h'), ('p', 'r'), ('l', 's'), ('t', 'v'), ('u', 'y'), ('j', 'v'), ('a', 'j'), ('r', 'w'), ('r', 'u'), ('f', 'x'), ('x', 'y'), ('j', 'x'), ('d', 'j'), ('b', 'k'), ('b', 'x'), ('b', 'w')]
-
-def edges_to_steps(edges: list[tuple[str, str]]) -> dict[str,list[str]]:
-    """ Returns a dict with for each node the nodes it is connected with. """ 
-    steps = {}
-    for n1, n2 in edges:
-        if not n1 in steps:
-            steps[n1] = []
-        steps[n1].append(n2)
-        if not n2 in steps:
-            steps[n2] = []
-        steps[n2].append(n1)
-    return steps
-
-def print_all_paths(steps, path, goal, length):
-    current = path[-1]
-    length_path = len(path)
-    if length_path >= length:
-        if length_path == length and current == goal:
-            print(path)
-    else:
-        valid_steps = steps[current]
-        for s in valid_steps:
-            print_all_paths(steps, path+s, goal, length)
-
-steps = edges_to_steps(edges)
-print_all_paths(steps, 'a', 'b', 7)

invocation_tree-0.0.32/images/print_all_paths_via.py

@@ -1,32 +0,0 @@
-edges =  [('a', 's'), ('i', 'z'), ('c', 'p'), ('d', 'p'), ('d', 'u'), ('b', 'e'), ('b', 'g'), ('f', 'p'), ('g', 'm'), ('h', 't'), ('h', 'y'), ('i', 'w'), ('i', 'j'), ('i', 'x'), ('k', 's'), ('k', 'l'), ('a', 'm'), ('n', 'u'), ('a', 'o'), ('a', 'v'), ('n', 'p'), ('a', 'q'), ('a', 'h'), ('p', 'r'), ('l', 's'), ('t', 'v'), ('u', 'y'), ('j', 'v'), ('a', 'j'), ('r', 'w'), ('r', 'u'), ('f', 'x'), ('x', 'y'), ('j', 'x'), ('d', 'j'), ('b', 'k'), ('b', 'x'), ('b', 'w')]
-
-def edges_to_steps(edges: list[tuple[str, str]]) -> dict[str,list[str]]:
-    """ Returns a dict with for each node the nodes it is connected with. """ 
-    steps = {}
-    for n1, n2 in edges:
-        if not n1 in steps:
-            steps[n1] = []
-        steps[n1].append(n2)
-        if not n2 in steps:
-            steps[n2] = []
-        steps[n2].append(n1)
-    return steps
-
-def print_all_paths(steps, path, goal, length, results):
-    current = path[-1]
-    length_path = len(path)
-    if length_path >= length:
-        if length_path == length and current == goal:
-            if 'd' in path:
-                results.append(path)
-    else:
-        valid_steps = steps[current]
-        for s in valid_steps:
-            if not s == 'x':
-                print_all_paths(steps, path+s, goal, length, results)
-
-steps = edges_to_steps(edges)
-results = []
-print_all_paths(steps, 'a', 'b', 10, results)
-print('results:', results)
-print(len(results))

invocation_tree-0.0.32/images/quick_sort.py

@@ -1,16 +0,0 @@
-import invocation_tree as ivt
-
-def quick_sort(values):
-    if len(values) <= 1:
-        return values
-    pivot = values[0]
-    smaller = [x for x in values if x  < pivot]
-    equal   = [x for x in values if x == pivot]
-    larger  = [x for x in values if x  > pivot]
-    return quick_sort(smaller) + equal + quick_sort(larger)
-
-values = [7, 4, 10, 11, 2, 6, 9, 1, 5, 3, 8, 12]
-print('unsorted values:',values)
-tree = ivt.gif('quick_sort.png')
-values = tree(quick_sort, values)
-print('  sorted values:',values)

invocation_tree-0.0.32/images/students.py

@@ -1,28 +0,0 @@
-import invocation_tree as ivt
-from decimal import Decimal, ROUND_HALF_UP
-
-def main():
-    students = {'Ann':[7.5, 8.0], 
-                'Bob':[4.5, 6.0], 
-                'Coy':[7.5, 6.0]}
-    averages = {student:compute_average(grades)
-                for student, grades in students.items()}
-    passing = passing_students(averages)
-    print(passing)
-
-def compute_average(grades):
-    average = sum(grades)/len(grades)
-    return half_up_round(average, 1)
-    
-def half_up_round(value, digits=0):
-    """ High-precision half-up rounding of 'value' to a specified number of 'digits'. """
-    return float(Decimal(str(value)).quantize(Decimal(f"1e-{digits}"),
-                                              rounding=ROUND_HALF_UP))
-
-def passing_students(avg):
-    return [student 
-            for student, average in avg.items() 
-            if average >= 5.5]
-
-if __name__ == '__main__':
-    ivt.gif(filename="students.png")(main)

invocation_tree-0.0.32/invocation_tree.egg-info/SOURCES.txt

@@ -1,48 +0,0 @@
-LICENSE.txt
-MANIFEST.in
-README.md
-pyproject.toml
-images/compute.gif
-images/compute.py
-images/create_gif.sh
-images/create_images.sh
-images/draw_graph.py
-images/draw_graph_d_x.py
-images/edges_big.out
-images/edges_big_d_x.out
-images/edges_small.out
-images/factorial.gif
-images/factorial.py
-images/graph.py
-images/graph_big.png
-images/graph_big_d_x.png
-images/graph_small.png
-images/jugs.png
-images/jugs_depth_first.py
-images/perms_LR3.png
-images/permutations.gif
-images/permutations.py
-images/permutations_collect.gif
-images/permutations_collect.py
-images/permutations_dot.py
-images/permutations_neighbor.gif
-images/permutations_neighbor.py
-images/permutations_return.gif
-images/permutations_return.py
-images/permutations_vscode.gif
-images/print_all_paths.py
-images/print_all_paths_of_length.py
-images/print_all_paths_via.py
-images/quick_sort.gif
-images/quick_sort.py
-images/students.gif
-images/students.py
-images/vscode.png
-images/__pycache__/graph.cpython-313.pyc
-invocation_tree/__init__.py
-invocation_tree/regex_set.py
-invocation_tree.egg-info/PKG-INFO
-invocation_tree.egg-info/SOURCES.txt
-invocation_tree.egg-info/dependency_links.txt
-invocation_tree.egg-info/requires.txt
-invocation_tree.egg-info/top_level.txt