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

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

@@ -1,34 +1,9 @@
 Metadata-Version: 2.4
 Name: invocation_tree
-Version: 0.0.31
+Version: 0.0.32
 Summary: Generates an invocation tree of functions calls.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
-License: BSD 2-Clause License
-        
-        Copyright (c) 2017, pyexample
-        All rights reserved.
-        
-        Redistribution and use in source and binary forms, with or without
-        modification, are permitted provided that the following conditions are met:
-        
-        * Redistributions of source code must retain the above copyright notice, this
-          list of conditions and the following disclaimer.
-        
-        * Redistributions in binary form must reproduce the above copyright notice,
-          this list of conditions and the following disclaimer in the documentation
-          and/or other materials provided with the distribution.
-        
-        THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-        AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-        IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-        DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-        FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-        DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-        SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-        CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-        OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-        OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-        
+License-Expression: BSD-2-Clause
 Project-URL: Homepage, https://github.com/bterwijn/invocation_tree
 Project-URL: Repository, https://github.com/bterwijn/invocation_tree.git
 Classifier: Development Status :: 4 - Beta
@@ -626,6 +601,10 @@ tree = ivt.Invocation_Tree()
   - set of all functions names that are not shown in the 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).
+- **tree.fontsize** : str
+  - 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.31 → invocation_tree-0.0.32}/README.md

@@ -581,6 +581,10 @@ tree = ivt.Invocation_Tree()
   - set of all functions names that are not shown in the 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).
+- **tree.fontsize** : str
+  - 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.31 → invocation_tree-0.0.32}/invocation_tree/__init__.py

@@ -9,7 +9,7 @@ import difflib
 
 import invocation_tree.regex_set as regset
 
-__version__ = "0.0.31"
+__version__ = "0.0.32"
 __author__ = 'Bas Terwijn'
 
 def highlight_diff(str1, str2):
@@ -100,6 +100,14 @@ class Invocation_Tree:
             self.hide_vars = hide_vars
         self.cleanup = cleanup
         self.quiet = quiet
+        self.hide_calls = {'Invocation_Tree.__exit__', 'Invocation_Tree.stop_trace', '<genexpr>'}
+        self.ignore_calls = set()
+        self.ignoring_call = None
+        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.fontsize = '14'
         # --- core
         self.stack = []
         self.returned = []
@@ -112,12 +120,7 @@ class Invocation_Tree:
         self.is_highlighted = False
         self.graph = None
         self.prev_global_tracer = None
-        self.hide_calls = {'Invocation_Tree.__exit__', 'Invocation_Tree.stop_trace', '<genexpr>'}
-        self.ignore_calls = set()
-        self.ignoring_call = None
-        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)
+        
 
     def __repr__(self):
         return f'Invocation_Tree(filename={repr(self.filename)}, show={self.show}, block={self.block}, each_line={self.each_line}, gifcount={self.gifcount})'
@@ -218,9 +221,9 @@ class Invocation_Tree:
         return self.filename
         
     def create_graph(self):
-        graphviz_graph_attr = {'fontname': 'Courier', 'fontsize': '14'}
-        graphviz_node_attr = {'fontname': 'Courier', 'fontsize': '14', 'shape':'plaintext'}
-        graphviz_edge_attr = {'fontname': 'Courier', 'fontsize': '14'}
+        graphviz_graph_attr = {'fontname': self.fontname, 'fontsize': str(self.fontsize)}
+        graphviz_node_attr = {'fontname': self.fontname, 'fontsize': str(self.fontsize), 'shape':'plaintext'}
+        graphviz_edge_attr = {'fontname': self.fontname, 'fontsize': str(self.fontsize)}
         graph = Digraph('invocation_tree',
                 graph_attr=graphviz_graph_attr,
                 node_attr=graphviz_node_attr,

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

@@ -1,34 +1,9 @@
 Metadata-Version: 2.4
 Name: invocation_tree
-Version: 0.0.31
+Version: 0.0.32
 Summary: Generates an invocation tree of functions calls.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
-License: BSD 2-Clause License
-        
-        Copyright (c) 2017, pyexample
-        All rights reserved.
-        
-        Redistribution and use in source and binary forms, with or without
-        modification, are permitted provided that the following conditions are met:
-        
-        * Redistributions of source code must retain the above copyright notice, this
-          list of conditions and the following disclaimer.
-        
-        * Redistributions in binary form must reproduce the above copyright notice,
-          this list of conditions and the following disclaimer in the documentation
-          and/or other materials provided with the distribution.
-        
-        THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-        AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-        IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-        DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-        FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-        DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-        SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-        CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-        OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-        OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-        
+License-Expression: BSD-2-Clause
 Project-URL: Homepage, https://github.com/bterwijn/invocation_tree
 Project-URL: Repository, https://github.com/bterwijn/invocation_tree.git
 Classifier: Development Status :: 4 - Beta
@@ -626,6 +601,10 @@ tree = ivt.Invocation_Tree()
   - set of all functions names that are not shown in the 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).
+- **tree.fontsize** : str
+  - 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.31 → invocation_tree-0.0.32}/invocation_tree.egg-info/SOURCES.txt

@@ -11,10 +11,8 @@ images/draw_graph_d_x.py
 images/edges_big.out
 images/edges_big_d_x.out
 images/edges_small.out
-images/edges_to_dict.py
 images/factorial.gif
 images/factorial.py
-images/graph.png.png
 images/graph.py
 images/graph_big.png
 images/graph_big_d_x.png
@@ -35,16 +33,12 @@ images/permutations_vscode.gif
 images/print_all_paths.py
 images/print_all_paths_of_length.py
 images/print_all_paths_via.py
-images/puz.txt
 images/quick_sort.gif
 images/quick_sort.py
 images/students.gif
 images/students.py
-images/test.pdf
-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.egg-info/PKG-INFO

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

@@ -4,13 +4,13 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "invocation_tree"
-version = "0.0.31"
+version = "0.0.32"
 description = "Generates an invocation tree of functions calls."
 authors = [
     {name = "Bas Terwijn", email = "bterwijn@gmail.com"}
 ]
-#license = { text = "BSD-2-Clause" } # needed for python <=3.8
-license = { file = "LICENSE.txt" }
+license = "BSD-2-Clause"
+license-files = ["LICENSE.txt"]
 readme = "README.md"
 requires-python = ">=3.7"
 classifiers = [

invocation_tree-0.0.31/images/edges_to_dict.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]   # last node in path is the current
-    if current == goal:  # stop condition
-        print(path)
-    else:
-        valid_steps = steps[current]
-        for s in valid_steps:
-            if s not in path:  # don't use same node twice
-                print_all_paths(steps, path+s, goal)
-
-steps = edges_to_steps(edges)
-print_all_paths(steps, 'a', 'b')

invocation_tree-0.0.31/images/puz.txt

@@ -1 +0,0 @@
-python jugs_breadth_first.py 51 3,5,34,107

invocation_tree-0.0.31/images/test.py

@@ -1,22 +0,0 @@
-import invocation_tree as ivt
-
-def funB():
-    b = -1
-    b = 100
-    return b
-
-def funA():
-    a = -1
-    a = funB()
-    a = funB()
-    return a
-
-def funX():
-    x = -1
-    x = funA()
-    x = funA()
-    return x
-
-tree = ivt.blocking()
-#tree.ignore_calls.add('funB')
-tree(funX)

invocation_tree-0.0.31/images/tree_problem.gv

@@ -1,395 +0,0 @@
-digraph invocation_tree {
-	node [shape=plaintext]
-	0 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ccffcc">
-  <TR><TD ALIGN="left">➤solver_depth_first</TD></TR>
-  <TR><TD ALIGN="left">   jugs: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   goal: 4</TD></TR>
-  <TR><TD ALIGN="left">   jugs_hist: {3/3 0/5, 0/3 0/5}</TD></TR>
-  <TR><TD ALIGN="left">   action_hist: [(0, 3)<FONT COLOR="#ff6666"><B>[-]</B></FONT>]</TD></TR>
-</TABLE>>]
-	1 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.copy</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 0/3 0/5</TD></TR>
-</TABLE>>]
-	2 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ccffcc">
-  <TR><TD ALIGN="left">➤solver_depth_first_recursive</TD></TR>
-  <TR><TD ALIGN="left">   jugs: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   goal: 4</TD></TR>
-  <TR><TD ALIGN="left">   jugs_hist: {3/3 0/5, 0/3 0/5}</TD></TR>
-  <TR><TD ALIGN="left">   action_hist: [(0, 3)<FONT COLOR="#ff6666"><B>[-]</B></FONT>]</TD></TR>
-  <TR><TD ALIGN="left">   actions: [(0, 3), (1, 5)]</TD></TR>
-  <TR><TD ALIGN="left">   action: (0, 3)</TD></TR>
-  <TR><TD ALIGN="left">   goal_reached: False</TD></TR>
-</TABLE>>]
-	3 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__hash__</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return -8458139203682520985</TD></TR>
-</TABLE>>]
-	4 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.copy</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 0/3 0/5</TD></TR>
-</TABLE>>]
-	5 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__hash__</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return -8458139203682520985</TD></TR>
-</TABLE>>]
-	6 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.all_actions</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   actions: [(0, 3), (1, 5)]</TD></TR>
-  <TR><TD ALIGN="left">   i: 1</TD></TR>
-  <TR><TD ALIGN="left">   a: None</TD></TR>
-  <TR><TD ALIGN="left">   j: 1</TD></TR>
-  <TR><TD ALIGN="left">return [(0, 3), (1, 5)]</TD></TR>
-</TABLE>>]
-	7 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__len__</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2</TD></TR>
-</TABLE>>]
-	8 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.fill_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   jug_index: 0</TD></TR>
-  <TR><TD ALIGN="left">   delta: 3</TD></TR>
-  <TR><TD ALIGN="left">return (0, 3)</TD></TR>
-</TABLE>>]
-	9 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.empty_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   jug_index: 0</TD></TR>
-  <TR><TD ALIGN="left">   delta: 0</TD></TR>
-  <TR><TD ALIGN="left">return None</TD></TR>
-</TABLE>>]
-	10 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__len__</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2</TD></TR>
-</TABLE>>]
-	11 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.pour_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   from_jug: 0</TD></TR>
-  <TR><TD ALIGN="left">   to_jug: 1</TD></TR>
-  <TR><TD ALIGN="left">   delta: 0</TD></TR>
-  <TR><TD ALIGN="left">return None</TD></TR>
-</TABLE>>]
-	12 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.fill_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   jug_index: 1</TD></TR>
-  <TR><TD ALIGN="left">   delta: 5</TD></TR>
-  <TR><TD ALIGN="left">return (1, 5)</TD></TR>
-</TABLE>>]
-	13 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.empty_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   jug_index: 1</TD></TR>
-  <TR><TD ALIGN="left">   delta: 0</TD></TR>
-  <TR><TD ALIGN="left">return None</TD></TR>
-</TABLE>>]
-	14 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__len__</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2</TD></TR>
-</TABLE>>]
-	15 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.pour_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   from_jug: 1</TD></TR>
-  <TR><TD ALIGN="left">   to_jug: 0</TD></TR>
-  <TR><TD ALIGN="left">   delta: 0</TD></TR>
-  <TR><TD ALIGN="left">return None</TD></TR>
-</TABLE>>]
-	16 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.do_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   action: (0, 3)</TD></TR>
-  <TR><TD ALIGN="left">   goal: 4</TD></TR>
-  <TR><TD ALIGN="left">return False</TD></TR>
-</TABLE>>]
-	17 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.action_helper</TD></TR>
-  <TR><TD ALIGN="left">   jug_index: 0</TD></TR>
-  <TR><TD ALIGN="left">   delta: 3</TD></TR>
-  <TR><TD ALIGN="left">   goal: 4</TD></TR>
-  <TR><TD ALIGN="left">   goal_reached: False</TD></TR>
-  <TR><TD ALIGN="left">   content: 3</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return False</TD></TR>
-</TABLE>>]
-	18 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ccffcc">
-  <TR><TD ALIGN="left">➤solver_depth_first_recursive</TD></TR>
-  <TR><TD ALIGN="left">   jugs: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   goal: 4</TD></TR>
-  <TR><TD ALIGN="left">   jugs_hist: {3/3 0/5, 0/3 0/5}</TD></TR>
-  <TR><TD ALIGN="left">   action_hist: [(0, 3)<FONT COLOR="#ff6666"><B>[-]</B></FONT>]</TD></TR>
-  <TR><TD ALIGN="left">   actions: [(0, -3), (0, 1, 3), (1, 5)]</TD></TR>
-  <TR><TD ALIGN="left">   action: (0, <B>1, &#8203;</B>&#8203;3)</TD></TR>
-  <TR><TD ALIGN="left">   goal_reached: False</TD></TR>
-  <TR><TD ALIGN="left">   result: False</TD></TR>
-</TABLE>>]
-	19 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__hash__</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2248468952609198383</TD></TR>
-</TABLE>>]
-	20 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.copy</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 3/3 0/5</TD></TR>
-</TABLE>>]
-	21 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__hash__</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2248468952609198383</TD></TR>
-</TABLE>>]
-	22 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.all_actions</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   actions: [(0, -3), (0, 1, 3), (1, 5)]</TD></TR>
-  <TR><TD ALIGN="left">   i: 1</TD></TR>
-  <TR><TD ALIGN="left">   a: None</TD></TR>
-  <TR><TD ALIGN="left">   j: 1</TD></TR>
-  <TR><TD ALIGN="left">return [(0, -3), (0, 1, 3), (1, 5)]</TD></TR>
-</TABLE>>]
-	23 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__len__</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2</TD></TR>
-</TABLE>>]
-	24 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.fill_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   jug_index: 0</TD></TR>
-  <TR><TD ALIGN="left">   delta: 0</TD></TR>
-  <TR><TD ALIGN="left">return None</TD></TR>
-</TABLE>>]
-	25 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.empty_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   jug_index: 0</TD></TR>
-  <TR><TD ALIGN="left">   delta: -3</TD></TR>
-  <TR><TD ALIGN="left">return (0, -3)</TD></TR>
-</TABLE>>]
-	26 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__len__</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2</TD></TR>
-</TABLE>>]
-	27 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.pour_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   from_jug: 0</TD></TR>
-  <TR><TD ALIGN="left">   to_jug: 1</TD></TR>
-  <TR><TD ALIGN="left">   delta: 3</TD></TR>
-  <TR><TD ALIGN="left">return (0, 1, 3)</TD></TR>
-</TABLE>>]
-	28 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.fill_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   jug_index: 1</TD></TR>
-  <TR><TD ALIGN="left">   delta: 5</TD></TR>
-  <TR><TD ALIGN="left">return (1, 5)</TD></TR>
-</TABLE>>]
-	29 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.empty_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   jug_index: 1</TD></TR>
-  <TR><TD ALIGN="left">   delta: 0</TD></TR>
-  <TR><TD ALIGN="left">return None</TD></TR>
-</TABLE>>]
-	30 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__len__</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2</TD></TR>
-</TABLE>>]
-	31 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.pour_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   from_jug: 1</TD></TR>
-  <TR><TD ALIGN="left">   to_jug: 0</TD></TR>
-  <TR><TD ALIGN="left">   delta: 0</TD></TR>
-  <TR><TD ALIGN="left">return None</TD></TR>
-</TABLE>>]
-	32 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.do_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   action: (0, -3)</TD></TR>
-  <TR><TD ALIGN="left">   goal: 4</TD></TR>
-  <TR><TD ALIGN="left">return False</TD></TR>
-</TABLE>>]
-	33 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.action_helper</TD></TR>
-  <TR><TD ALIGN="left">   jug_index: 0</TD></TR>
-  <TR><TD ALIGN="left">   delta: -3</TD></TR>
-  <TR><TD ALIGN="left">   goal: 4</TD></TR>
-  <TR><TD ALIGN="left">   goal_reached: False</TD></TR>
-  <TR><TD ALIGN="left">   content: 0</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return False</TD></TR>
-</TABLE>>]
-	34 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤solver_depth_first_recursive</TD></TR>
-  <TR><TD ALIGN="left">   jugs: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   goal: 4</TD></TR>
-  <TR><TD ALIGN="left">   jugs_hist: {3/3 0/5, 0/3 0/5}</TD></TR>
-  <TR><TD ALIGN="left">   action_hist: [(0, 3), (0, -3)]</TD></TR>
-  <TR><TD ALIGN="left">return False</TD></TR>
-</TABLE>>]
-	35 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__hash__</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return -8458139203682520985</TD></TR>
-</TABLE>>]
-	36 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__eq__</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   other: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return True</TD></TR>
-</TABLE>>]
-	37 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__len__</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2</TD></TR>
-</TABLE>>]
-	38 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__len__</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2</TD></TR>
-</TABLE>>]
-	39 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.__len__</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return 2</TD></TR>
-</TABLE>>]
-	40 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.&lt;genexpr&gt;</TD></TR>
-  <TR><TD ALIGN="left">   .0: &lt;range_iterator object at 0x75aae8b8f570&gt;</TD></TR>
-  <TR><TD ALIGN="left">   i: 0</TD></TR>
-  <TR><TD ALIGN="left">   other: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return True</TD></TR>
-</TABLE>>]
-	41 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.&lt;genexpr&gt;</TD></TR>
-  <TR><TD ALIGN="left">   .0: &lt;range_iterator object at 0x75aae8b8f570&gt;</TD></TR>
-  <TR><TD ALIGN="left">   i: 1</TD></TR>
-  <TR><TD ALIGN="left">   other: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return True</TD></TR>
-</TABLE>>]
-	42 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.&lt;genexpr&gt;</TD></TR>
-  <TR><TD ALIGN="left">   .0: &lt;range_iterator object at 0x75aae8b8f570&gt;</TD></TR>
-  <TR><TD ALIGN="left">   i: 1</TD></TR>
-  <TR><TD ALIGN="left">   other: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   self: 0/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">return None</TD></TR>
-</TABLE>>]
-	43 [label=<
-<TABLE BORDER="1" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffcccc">
-  <TR><TD ALIGN="left">➤Jugs.undo_action</TD></TR>
-  <TR><TD ALIGN="left">   self: 3/3 0/5</TD></TR>
-  <TR><TD ALIGN="left">   action: (0, -3)</TD></TR>
-  <TR><TD ALIGN="left">return None</TD></TR>
-</TABLE>>]
-	44 [label=<
-<TABLE BORDER="3" CELLBORDER="0" CELLSPACING="0" BGCOLOR="#ffffff">
-  <TR><TD ALIGN="left">➤<B>Jugs.do_action</B></TD></TR>
-  <TR><TD ALIGN="left">   <B>self</B>: <B>3/3 0/5</B></TD></TR>
-  <TR><TD ALIGN="left">   <B>action</B>: <B>(0, 1, 3)</B></TD></TR>
-  <TR><TD ALIGN="left">   <B>goal</B>: <B>4</B></TD></TR>
-</TABLE>>]
-	0 -> 1
-	0 -> 2
-	2 -> 3
-	2 -> 4
-	2 -> 5
-	2 -> 6
-	6 -> 7
-	6 -> 8
-	6 -> 9
-	6 -> 10
-	6 -> 11
-	6 -> 12
-	6 -> 13
-	6 -> 14
-	6 -> 15
-	2 -> 16
-	16 -> 17
-	2 -> 18
-	18 -> 19
-	18 -> 20
-	18 -> 21
-	18 -> 22
-	22 -> 23
-	22 -> 24
-	22 -> 25
-	22 -> 26
-	22 -> 27
-	22 -> 28
-	22 -> 29
-	22 -> 30
-	22 -> 31
-	18 -> 32
-	32 -> 33
-	18 -> 34
-	34 -> 35
-	34 -> 36
-	36 -> 37
-	36 -> 38
-	36 -> 39
-	36 -> 40
-	36 -> 41
-	36 -> 42
-	18 -> 43
-	18 -> 44
-}