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

{invocation_tree-0.0.34 → invocation_tree-0.0.35}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: invocation_tree
-Version: 0.0.34
+Version: 0.0.35
 Summary: Generates an invocation tree of functions calls.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -32,6 +32,8 @@ Run a live demo in the 👉 [**Invocation Tree Web Debugger**](https://invocatio
 - shows the invocation tree (call tree) of a program **in real time**
 - helps to **understand recursion** and its depth-first nature
 
+The new `@ivt.show` [decorator interface](#decorator) now allows to scale to application in **production code**.
+
 # Topics #
 
 [Iteration and Recursion](#iteration-and-recursion)
@@ -546,12 +548,12 @@ 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`.
+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` tree.
 
 ```python
 import invocation_tree as ivt
-
-ivt.decorator_tree = ivt.blocking()  # set tree used by decorator
+ivt.decorator_tree = ivt.blocking()               # set tree used by decorator
+#ivt.decorator_tree = ivt.blocking_each_change()  # block at each change, but much slower
 
 @ivt.show  # use decorator to select which functions to graph
 def permutations(elements, perm, n):
@@ -559,9 +561,11 @@ def permutations(elements, perm, n):
         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
+            perm.append(element)
+            permutations(elements, perm, n-1)
+            perm.pop()
+            
+permutations( 'LR', [], 3)  # all permutations of L and R of length 3
 ```
 
 ## Blocking ##

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

@@ -12,6 +12,8 @@ Run a live demo in the 👉 [**Invocation Tree Web Debugger**](https://invocatio
 - shows the invocation tree (call tree) of a program **in real time**
 - helps to **understand recursion** and its depth-first nature
 
+The new `@ivt.show` [decorator interface](#decorator) now allows to scale to application in **production code**.
+
 # Topics #
 
 [Iteration and Recursion](#iteration-and-recursion)
@@ -526,12 +528,12 @@ 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`.
+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` tree.
 
 ```python
 import invocation_tree as ivt
-
-ivt.decorator_tree = ivt.blocking()  # set tree used by decorator
+ivt.decorator_tree = ivt.blocking()               # set tree used by decorator
+#ivt.decorator_tree = ivt.blocking_each_change()  # block at each change, but much slower
 
 @ivt.show  # use decorator to select which functions to graph
 def permutations(elements, perm, n):
@@ -539,9 +541,11 @@ def permutations(elements, perm, n):
         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
+            perm.append(element)
+            permutations(elements, perm, n-1)
+            perm.pop()
+            
+permutations( 'LR', [], 3)  # all permutations of L and R of length 3
 ```
 
 ## Blocking ##

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

@@ -10,7 +10,7 @@ import functools
 
 import invocation_tree.regex_set as regset
 
-__version__ = "0.0.34"
+__version__ = "0.0.35"
 __author__ = 'Bas Terwijn'
 
 def highlight_diff(str1, str2):
@@ -150,7 +150,8 @@ class Invocation_Tree:
         if len(val_str) > self.max_string_len:
             val_str = '...'+val_str[-self.max_string_len:]
         result = html.escape(val_str)
-        result = result.replace('\n', '<BR/>') # use HTML line breaks
+        if '\n' in result:
+            result = '<BR/>' + result.replace('\n', '<BR/>') # use HTML line breaks
         return result
     
     def get_hightlighted_content(self, tree_node, key, value, use_old_content=False):
@@ -399,6 +400,14 @@ def show(fun):
 
         def tracer(frame, event, arg):
             nonlocal active_depth
+
+            if event == "exception":
+                exc_type, exc, tb = arg
+                if exc_type is KeyboardInterrupt:
+                    # ensure we stop tracing before bailing out
+                    sys.settrace(prev_tracer)
+                    raise exc.with_traceback(tb)
+            
             # Check if this is our target function
             if frame.f_code is target_code:
                 if event == "call":

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: invocation_tree
-Version: 0.0.34
+Version: 0.0.35
 Summary: Generates an invocation tree of functions calls.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -32,6 +32,8 @@ Run a live demo in the 👉 [**Invocation Tree Web Debugger**](https://invocatio
 - shows the invocation tree (call tree) of a program **in real time**
 - helps to **understand recursion** and its depth-first nature
 
+The new `@ivt.show` [decorator interface](#decorator) now allows to scale to application in **production code**.
+
 # Topics #
 
 [Iteration and Recursion](#iteration-and-recursion)
@@ -546,12 +548,12 @@ 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`.
+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` tree.
 
 ```python
 import invocation_tree as ivt
-
-ivt.decorator_tree = ivt.blocking()  # set tree used by decorator
+ivt.decorator_tree = ivt.blocking()               # set tree used by decorator
+#ivt.decorator_tree = ivt.blocking_each_change()  # block at each change, but much slower
 
 @ivt.show  # use decorator to select which functions to graph
 def permutations(elements, perm, n):
@@ -559,9 +561,11 @@ def permutations(elements, perm, n):
         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
+            perm.append(element)
+            permutations(elements, perm, n-1)
+            perm.pop()
+            
+permutations( 'LR', [], 3)  # all permutations of L and R of length 3
 ```
 
 ## Blocking ##

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

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