invocation-tree 0.0.28__tar.gz → 0.0.29__tar.gz

{invocation_tree-0.0.28/invocation_tree.egg-info → invocation_tree-0.0.29}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: invocation_tree
-Version: 0.0.28
+Version: 0.0.29
 Summary: Generates an invocation tree of functions calls.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License: BSD 2-Clause License
@@ -520,7 +520,9 @@ The breadth-first algorithm works and gives us the shortest path to a goal state
 - A solution may not have the same jugs state multiple times (this also avoids infinite loops).
 - It is not necessary to find the shortest path to a goal state (like breadth-first does).
 
-**solution exercise6:** First try it yourself, but we give the [solution](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/jugs_depth_first.py&breakpoints=136&continues=1) here for comparison.
+You can use [configurations](https://invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/config.py) to keep the tree small and readable.
+
+**solution exercise6:** First try it yourself, we give the [solution](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/jugs_depth_first.py&breakpoints=136&continues=1) here for comparison.
 
 A harder more fun instance of this puzzle is with jugs with capacity 3, 5, 34 and 107 liter and the goal of getting to a jug with 51 liters.
 
@@ -529,6 +531,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:

{invocation_tree-0.0.28 → invocation_tree-0.0.29}/README.md

@@ -475,7 +475,9 @@ The breadth-first algorithm works and gives us the shortest path to a goal state
 - A solution may not have the same jugs state multiple times (this also avoids infinite loops).
 - It is not necessary to find the shortest path to a goal state (like breadth-first does).
 
-**solution exercise6:** First try it yourself, but we give the [solution](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/jugs_depth_first.py&breakpoints=136&continues=1) here for comparison.
+You can use [configurations](https://invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/config.py) to keep the tree small and readable.
+
+**solution exercise6:** First try it yourself, we give the [solution](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/jugs_depth_first.py&breakpoints=136&continues=1) here for comparison.
 
 A harder more fun instance of this puzzle is with jugs with capacity 3, 5, 34 and 107 liter and the goal of getting to a jug with 51 liters.
 
@@ -484,6 +486,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:

{invocation_tree-0.0.28 → invocation_tree-0.0.29}/invocation_tree/__init__.py

@@ -9,7 +9,7 @@ import difflib
 
 import invocation_tree.regex_set as regset
 
-__version__ = "0.0.28"
+__version__ = "0.0.29"
 __author__ = 'Bas Terwijn'
 
 def highlight_diff(str1, str2):
@@ -293,17 +293,17 @@ class Invocation_Tree:
         if self.is_external(frame):
             return
         class_fun_name = get_class_function_name(frame)
-        if not self.regset_hide_calls.match(class_fun_name, self.hide_calls):
-            if event == 'return':
-                if class_fun_name == self.ignoring_call:
-                    self.ignoring_call = None
-                    return
-            if self.ignoring_call is not None:
+        if event == 'return':
+            if class_fun_name == self.ignoring_call:
+                self.ignoring_call = None
                 return
-            if event == 'call':
-                if self.regset_ignore_calls.match(class_fun_name, self.ignore_calls):
-                    self.ignoring_call = class_fun_name
-                    return
+        if self.ignoring_call is not None:
+            return
+        if event == 'call':
+            if self.regset_ignore_calls.match(class_fun_name, self.ignore_calls):
+                self.ignoring_call = class_fun_name
+                return
+        if not self.regset_hide_calls.match(class_fun_name, self.hide_calls):
             if event == 'call':
                 # update previous active node with its current frame now
                 if len(self.stack)>0:

{invocation_tree-0.0.28 → invocation_tree-0.0.29/invocation_tree.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: invocation_tree
-Version: 0.0.28
+Version: 0.0.29
 Summary: Generates an invocation tree of functions calls.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License: BSD 2-Clause License
@@ -520,7 +520,9 @@ The breadth-first algorithm works and gives us the shortest path to a goal state
 - A solution may not have the same jugs state multiple times (this also avoids infinite loops).
 - It is not necessary to find the shortest path to a goal state (like breadth-first does).
 
-**solution exercise6:** First try it yourself, but we give the [solution](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/jugs_depth_first.py&breakpoints=136&continues=1) here for comparison.
+You can use [configurations](https://invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/config.py) to keep the tree small and readable.
+
+**solution exercise6:** First try it yourself, we give the [solution](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/jugs_depth_first.py&breakpoints=136&continues=1) here for comparison.
 
 A harder more fun instance of this puzzle is with jugs with capacity 3, 5, 34 and 107 liter and the goal of getting to a jug with 51 liters.
 
@@ -529,6 +531,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:

{invocation_tree-0.0.28 → invocation_tree-0.0.29}/invocation_tree.egg-info/SOURCES.txt

@@ -2,6 +2,21 @@ LICENSE.txt
 MANIFEST.in
 README.md
 pyproject.toml
+images/bdsmlr-123210-XatifIR7GC.jpg
+images/bdsmlr-137085-6shuc85rzp.jpg
+images/bdsmlr-137085-BgIaVabSuO.jpg
+images/bdsmlr-137085-EbOCN2t7pK.jpg
+images/bdsmlr-137085-G7VfslodUg.jpg
+images/bdsmlr-137085-bECkK7Tmrl.jpg
+images/bdsmlr-137085-dwKgKQW44r.jpg
+images/bdsmlr-137085-k3Cc6Y1Czs.jpg
+images/bdsmlr-137085-lG052p8RGk.jpg
+images/bdsmlr-13874-OSFOTjkp0j.jpg
+images/bdsmlr-193150-3cpmNpHLOn.jpg
+images/bdsmlr-193150-DTYC3stBX0.jpg
+images/bdsmlr-193150-FqlVlDXAoY.jpg
+images/bdsmlr-193150-hdbOxh4o7w.jpg
+images/bdsmlr-193150-i64En9zgET.jpg
 images/compute.gif
 images/compute.py
 images/create_gif.sh
@@ -45,6 +60,7 @@ images/test.py
 images/tree.pdf
 images/tree_problem.gv
 images/vscode.png
+images/__pycache__/graph.cpython-313.pyc
 invocation_tree/__init__.py
 invocation_tree/regex_set.py
 invocation_tree/test_regex_fix.py

{invocation_tree-0.0.28 → invocation_tree-0.0.29}/pyproject.toml

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