invocation-tree 0.0.38__tar.gz → 0.0.40__tar.gz

{invocation_tree-0.0.38 → invocation_tree-0.0.40}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: invocation_tree
-Version: 0.0.38
+Version: 0.0.40
 Summary: Generates an invocation tree of functions calls.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -48,9 +48,11 @@ The new `@ivt.show` [decorator interface](#decorator) now allows for **scaling**
 
 [Collecting Results](#collecting-results)
 
+[Mutability](#mutability)
+
 [Quick Sort](#quick-sort)
 
-[Mutability](#mutability)
+[Tower of Hanoi](#tower-of-hanoi)
 
 [Jugs Puzzle](#jugs-puzzle)
 
@@ -73,7 +75,7 @@ ___
 
 # Iteration and Recursion #
 
-Repetition can be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
+Repetition can in Python be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
 
 ``` python
 import math
@@ -147,9 +149,9 @@ Or see it in the [Invocation Tree Web Debugger](https://www.invocation-tree.com/
 
 Each node in the invocation tree represents a function call, and the node's color indicates its state:
 
- - White: The function is currently being executed.
- - Green: The function is paused and will resume execution later.
- - Red: The function has completed execution and has returned.
+ - Green: the function is paused and will resume execution later
+ - White: the function is currently being executed
+ - Red: the function has completed execution and has returned
 
 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.
 
@@ -352,7 +354,7 @@ This would be much harder to implement with iteration and shows the power of rec
 
 ## Debug Prints ##
 
-Adding temporarely debug print statements is in general a good technique to understand code, and is particularly helpful with recursion. Here we added a debug print statement when adding and removing a node from the path. As a result we can now in the output see how all paths are build step by step:
+Adding temporarely debug print statements is in general a good technique to understand code, and is particularly helpful with recursion. Here we added a debug print statement when adding and removing a node from the path. As a result we can now, in the output, see how all paths are build step by step:
 
 See it in the [Invocation Tree Web Debugger](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/print_paths_print_1.py&breakpoints=33&continues=1&timestep=0.2&play)
 
@@ -538,6 +540,19 @@ Add a `key` argument so that we can use the `quick_sort(values, key=None)` funct
 
 Sort the values as normal when `key` is `None`.
 
+# Tower of Hanoi #
+
+Another classic recursion problem is the Tower of Hanoi problem where we need to move all disks from A to C, by moving one disk at a time between any two positions, where a disk may never be on top of a smaller disk.
+
+![jugs.png](images/tower_of_hanoi.png)
+
+Doing this by hand can quickly get confusing, but the recursive solution is beautifully short. To move n disks we:
+- first remove n-1 disks from the largest disk
+- then move the largest disk
+- and then move the n-1 disks back on top
+
+See it in the [Invocation Tree Web Debugger](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/tower_of_hanoi.py&timestep=0.5&play)
+
 # Jugs Puzzle #
 
 In the Jugs Puzzle we have a set of jugs of various capacities. Our goal is to get a jug with a certain amount of liquid in it. In each step we can take one of these actions:
@@ -729,6 +744,8 @@ tree = ivt.Invocation_Tree()
 
 ## Functions ##
 
+- **mg.layout(horizontal: bool = None)**
+  - set tree layout to 'True' for horizontal, 'False' for vertical, or 'None' to toggle.
 - **tree.dark_mode(b: bool = None)**
   - set dark mode to 'True' or 'False', or 'None' to toggle.
 - **tree.transparent_background(b: bool = None)**

{invocation_tree-0.0.38 → invocation_tree-0.0.40}/README.md

@@ -28,9 +28,11 @@ The new `@ivt.show` [decorator interface](#decorator) now allows for **scaling**
 
 [Collecting Results](#collecting-results)
 
+[Mutability](#mutability)
+
 [Quick Sort](#quick-sort)
 
-[Mutability](#mutability)
+[Tower of Hanoi](#tower-of-hanoi)
 
 [Jugs Puzzle](#jugs-puzzle)
 
@@ -53,7 +55,7 @@ ___
 
 # Iteration and Recursion #
 
-Repetition can be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
+Repetition can in Python be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
 
 ``` python
 import math
@@ -127,9 +129,9 @@ Or see it in the [Invocation Tree Web Debugger](https://www.invocation-tree.com/
 
 Each node in the invocation tree represents a function call, and the node's color indicates its state:
 
- - White: The function is currently being executed.
- - Green: The function is paused and will resume execution later.
- - Red: The function has completed execution and has returned.
+ - Green: the function is paused and will resume execution later
+ - White: the function is currently being executed
+ - Red: the function has completed execution and has returned
 
 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.
 
@@ -332,7 +334,7 @@ This would be much harder to implement with iteration and shows the power of rec
 
 ## Debug Prints ##
 
-Adding temporarely debug print statements is in general a good technique to understand code, and is particularly helpful with recursion. Here we added a debug print statement when adding and removing a node from the path. As a result we can now in the output see how all paths are build step by step:
+Adding temporarely debug print statements is in general a good technique to understand code, and is particularly helpful with recursion. Here we added a debug print statement when adding and removing a node from the path. As a result we can now, in the output, see how all paths are build step by step:
 
 See it in the [Invocation Tree Web Debugger](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/print_paths_print_1.py&breakpoints=33&continues=1&timestep=0.2&play)
 
@@ -518,6 +520,19 @@ Add a `key` argument so that we can use the `quick_sort(values, key=None)` funct
 
 Sort the values as normal when `key` is `None`.
 
+# Tower of Hanoi #
+
+Another classic recursion problem is the Tower of Hanoi problem where we need to move all disks from A to C, by moving one disk at a time between any two positions, where a disk may never be on top of a smaller disk.
+
+![jugs.png](images/tower_of_hanoi.png)
+
+Doing this by hand can quickly get confusing, but the recursive solution is beautifully short. To move n disks we:
+- first remove n-1 disks from the largest disk
+- then move the largest disk
+- and then move the n-1 disks back on top
+
+See it in the [Invocation Tree Web Debugger](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/tower_of_hanoi.py&timestep=0.5&play)
+
 # Jugs Puzzle #
 
 In the Jugs Puzzle we have a set of jugs of various capacities. Our goal is to get a jug with a certain amount of liquid in it. In each step we can take one of these actions:
@@ -709,6 +724,8 @@ tree = ivt.Invocation_Tree()
 
 ## Functions ##
 
+- **mg.layout(horizontal: bool = None)**
+  - set tree layout to 'True' for horizontal, 'False' for vertical, or 'None' to toggle.
 - **tree.dark_mode(b: bool = None)**
   - set dark mode to 'True' or 'False', or 'None' to toggle.
 - **tree.transparent_background(b: bool = None)**

{invocation_tree-0.0.38 → invocation_tree-0.0.40}/invocation_tree/__init__.py

@@ -10,7 +10,7 @@ import functools
 
 import invocation_tree.regex_set as regset
 
-__version__ = "0.0.38"
+__version__ = "0.0.40"
 __author__ = 'Bas Terwijn'
 
 # colors dark
@@ -21,11 +21,11 @@ color_active_light = '#ffffff'
 color_returned_light = '#ffcccc'
 
 # colors light
-foreground_color_dark = '#dddddd'
+foreground_color_dark = '#cccccc'
 background_color_dark = '#1d1d1d'
-color_paused_dark = '#779977' 
+color_paused_dark = '#446644'
 color_active_dark = '#1d1d1d'
-color_returned_dark = '#997777'
+color_returned_dark = '#664444'
 
 # color placeholders
 foreground_color_PH = '<foreground_color_PH>'
@@ -71,9 +71,11 @@ def filter_variables(var, val):
     return True
 
 class Tree_Node:
+    node_id = 0
 
-    def __init__(self, node_id, frame, return_value):
-        self.node_id = node_id
+    def __init__(self, frame, return_value):
+        self.node_id = Tree_Node.node_id
+        Tree_Node.node_id += 1
         self.frame = frame
         self.return_value = return_value
         self.is_returned = False
@@ -127,6 +129,7 @@ class Invocation_Tree:
         self.fontsize = '14'
         self.in_dark_mode = False
         self.in_transparent_background = False
+        self.horizontal = False
         self.set_colors()
         # --- core
         self.stack = []
@@ -134,7 +137,6 @@ class Invocation_Tree:
         self.prev_returned = []
         self.paused = []
         self.prev_paused = []
-        self.node_id = 0
         self.node_id_to_table = {}
         self.edges = []
         self.is_highlighted = False
@@ -169,6 +171,12 @@ class Invocation_Tree:
             self.in_dark_mode = dark
         self.set_colors()
 
+    def layout(self, horizontal = None):
+        if horizontal is None:
+            self.horizontal = not self.horizontal
+        else:
+            self.horizontal = horizontal
+
     def transparent_background(self, transparent = None):
         if transparent is None:
             self.in_transparent_background = not self.in_transparent_background
@@ -301,6 +309,7 @@ class Invocation_Tree:
                 graph_attr=graphviz_graph_attr,
                 node_attr=graphviz_node_attr,
                 edge_attr=graphviz_edge_attr)
+        graph.attr(rankdir= "LR" if self.horizontal else "TB")
         return graph
 
     def build_graph_from_nodes(self):
@@ -414,8 +423,7 @@ class Invocation_Tree:
                     self.update_node(previous, active=False)
                     self.paused.append(previous)
                 # create new node
-                self.stack.append(Tree_Node(self.node_id, frame, None))
-                self.node_id += 1
+                self.stack.append(Tree_Node(frame, None))
                 if len(self.stack)>1:
                     self.add_edge(self.stack[-2], self.stack[-1])
                     self.paused.append(self.stack[-2])

{invocation_tree-0.0.38 → invocation_tree-0.0.40}/invocation_tree.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: invocation_tree
-Version: 0.0.38
+Version: 0.0.40
 Summary: Generates an invocation tree of functions calls.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -48,9 +48,11 @@ The new `@ivt.show` [decorator interface](#decorator) now allows for **scaling**
 
 [Collecting Results](#collecting-results)
 
+[Mutability](#mutability)
+
 [Quick Sort](#quick-sort)
 
-[Mutability](#mutability)
+[Tower of Hanoi](#tower-of-hanoi)
 
 [Jugs Puzzle](#jugs-puzzle)
 
@@ -73,7 +75,7 @@ ___
 
 # Iteration and Recursion #
 
-Repetition can be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
+Repetition can in Python be implemented with **iteration** and **recursion**. As an example we compute the factorial of 4.
 
 ``` python
 import math
@@ -147,9 +149,9 @@ Or see it in the [Invocation Tree Web Debugger](https://www.invocation-tree.com/
 
 Each node in the invocation tree represents a function call, and the node's color indicates its state:
 
- - White: The function is currently being executed.
- - Green: The function is paused and will resume execution later.
- - Red: The function has completed execution and has returned.
+ - Green: the function is paused and will resume execution later
+ - White: the function is currently being executed
+ - Red: the function has completed execution and has returned
 
 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.
 
@@ -352,7 +354,7 @@ This would be much harder to implement with iteration and shows the power of rec
 
 ## Debug Prints ##
 
-Adding temporarely debug print statements is in general a good technique to understand code, and is particularly helpful with recursion. Here we added a debug print statement when adding and removing a node from the path. As a result we can now in the output see how all paths are build step by step:
+Adding temporarely debug print statements is in general a good technique to understand code, and is particularly helpful with recursion. Here we added a debug print statement when adding and removing a node from the path. As a result we can now, in the output, see how all paths are build step by step:
 
 See it in the [Invocation Tree Web Debugger](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/print_paths_print_1.py&breakpoints=33&continues=1&timestep=0.2&play)
 
@@ -538,6 +540,19 @@ Add a `key` argument so that we can use the `quick_sort(values, key=None)` funct
 
 Sort the values as normal when `key` is `None`.
 
+# Tower of Hanoi #
+
+Another classic recursion problem is the Tower of Hanoi problem where we need to move all disks from A to C, by moving one disk at a time between any two positions, where a disk may never be on top of a smaller disk.
+
+![jugs.png](images/tower_of_hanoi.png)
+
+Doing this by hand can quickly get confusing, but the recursive solution is beautifully short. To move n disks we:
+- first remove n-1 disks from the largest disk
+- then move the largest disk
+- and then move the n-1 disks back on top
+
+See it in the [Invocation Tree Web Debugger](https://www.invocation-tree.com/#codeurl=https://raw.githubusercontent.com/bterwijn/invocation_tree/refs/heads/main/src/tower_of_hanoi.py&timestep=0.5&play)
+
 # Jugs Puzzle #
 
 In the Jugs Puzzle we have a set of jugs of various capacities. Our goal is to get a jug with a certain amount of liquid in it. In each step we can take one of these actions:
@@ -729,6 +744,8 @@ tree = ivt.Invocation_Tree()
 
 ## Functions ##
 
+- **mg.layout(horizontal: bool = None)**
+  - set tree layout to 'True' for horizontal, 'False' for vertical, or 'None' to toggle.
 - **tree.dark_mode(b: bool = None)**
   - set dark mode to 'True' or 'False', or 'None' to toggle.
 - **tree.transparent_background(b: bool = None)**

{invocation_tree-0.0.38 → invocation_tree-0.0.40}/pyproject.toml

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