memory-graph 0.3.67__tar.gz → 0.3.69__tar.gz

{memory_graph-0.3.67 → memory_graph-0.3.69}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.67
+Version: 0.3.69
 Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -176,7 +176,7 @@ ___
 # Python Data Model #
 Learn the right **mental model** to think about Python data. The [Python Data Model](https://docs.python.org/3/reference/datamodel.html) makes a distiction between immutable and mutable types:
 
-* **immutable**: bool, int, float, complex, str, tuple, bytes, frozenset
+* **immutable**: bool, int, float, complex, str, tuple, frozenset, frozendict, bytes
 * **mutable**: list, set, dict, classes, ... (most other types)
 
 
@@ -557,6 +557,48 @@ and pressing &lt;Enter&gt; a number of times, results in:
 
 ![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.gif)
 
+## Debugging using Exceptions ##
+
+To get the call stack at the point where exception `e` was thrown use `mg.stack_exception(e)`. This allows you to graph the trace back for easier debugging, for example:
+
+``` python
+import memory_graph as mg
+import traceback;
+
+def fun3():
+    d = [0] * 3
+    for i in range(4):
+        d[i] = i  # throws IndexError when i = 3
+    
+def fun2():
+    fun3()
+    
+def fun1():
+    fun2()
+
+try:
+    fun1()
+except Exception as e:
+    traceback.print_exc()           # print trace back
+    mg.show(mg.stack_exception(e))  # graph trace back
+```
+```
+$ python exception_example.py
+Traceback (most recent call last):
+  File "exception_example.py", line 16, in <module>
+    fun1()
+  File "exception_example.py", line 13, in fun1
+    fun2()
+  File "exception_example.py", line 10, in fun2
+    fun3()
+  File "exception_example.py", line 7, in fun3
+    d[i] = i  # throws IndexError when i = 3
+    ~^^^
+IndexError: list assignment index out of range
+```
+![exception_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/exception_example.png)
+
+
 # Data Structure Examples #
 Package memory_graph can **visualize the structure of your data** to easily understand and debug data structures, some examples:
 
@@ -696,6 +738,8 @@ Visualization of different sorting algorithms in Memory Graph Web Debugger.
 - [insertion sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/insertion_sort.py&breakpoints=13,29&continues=1&timestep=0.2&play)
 - [bubble sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bubble_sort.py&breakpoints=29,38&continues=1&timestep=0.2&play)
 - [cocktail shaker sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/cocktail_sort.py&breakpoints=16,45&continues=1&timestep=0.2&play)
+- [bucket sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bucket_sort.py&timestep=0.2&play)
+- [radix sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/radix_sort.py&timestep=0.2&play)
 
 
 # Bitwise Operators #
@@ -710,7 +754,7 @@ In this configuration example we show the decimal, binary and [two's complement
 
 A sliding puzzle solver as a challenging example showing how memory_graph deals with large amounts of data. Click "Continue" to step through the breadth-first search generations until a solution path is found:
 
-- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=17,27,29,40&continues=1)
+- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=16,26,28,39&continues=1)
 
 ![sliding_puzzle.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/sliding_puzzle.png)
 
@@ -1050,7 +1094,7 @@ import memory_graph as mg
 
 data = []
 x = ['x']
-for i in range(20):
+for i in range(35):
     data.append(x)
 
 mg.show(locals())

{memory_graph-0.3.67 → memory_graph-0.3.69}/README.md

@@ -156,7 +156,7 @@ ___
 # Python Data Model #
 Learn the right **mental model** to think about Python data. The [Python Data Model](https://docs.python.org/3/reference/datamodel.html) makes a distiction between immutable and mutable types:
 
-* **immutable**: bool, int, float, complex, str, tuple, bytes, frozenset
+* **immutable**: bool, int, float, complex, str, tuple, frozenset, frozendict, bytes
 * **mutable**: list, set, dict, classes, ... (most other types)
 
 
@@ -537,6 +537,48 @@ and pressing <Enter> a number of times, results in:
 
 ![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.gif)
 
+## Debugging using Exceptions ##
+
+To get the call stack at the point where exception `e` was thrown use `mg.stack_exception(e)`. This allows you to graph the trace back for easier debugging, for example:
+
+``` python
+import memory_graph as mg
+import traceback;
+
+def fun3():
+    d = [0] * 3
+    for i in range(4):
+        d[i] = i  # throws IndexError when i = 3
+    
+def fun2():
+    fun3()
+    
+def fun1():
+    fun2()
+
+try:
+    fun1()
+except Exception as e:
+    traceback.print_exc()           # print trace back
+    mg.show(mg.stack_exception(e))  # graph trace back
+```
+```
+$ python exception_example.py
+Traceback (most recent call last):
+  File "exception_example.py", line 16, in <module>
+    fun1()
+  File "exception_example.py", line 13, in fun1
+    fun2()
+  File "exception_example.py", line 10, in fun2
+    fun3()
+  File "exception_example.py", line 7, in fun3
+    d[i] = i  # throws IndexError when i = 3
+    ~^^^
+IndexError: list assignment index out of range
+```
+![exception_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/exception_example.png)
+
+
 # Data Structure Examples #
 Package memory_graph can **visualize the structure of your data** to easily understand and debug data structures, some examples:
 
@@ -676,6 +718,8 @@ Visualization of different sorting algorithms in Memory Graph Web Debugger.
 - [insertion sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/insertion_sort.py&breakpoints=13,29&continues=1&timestep=0.2&play)
 - [bubble sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bubble_sort.py&breakpoints=29,38&continues=1&timestep=0.2&play)
 - [cocktail shaker sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/cocktail_sort.py&breakpoints=16,45&continues=1&timestep=0.2&play)
+- [bucket sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bucket_sort.py&timestep=0.2&play)
+- [radix sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/radix_sort.py&timestep=0.2&play)
 
 
 # Bitwise Operators #
@@ -690,7 +734,7 @@ In this configuration example we show the decimal, binary and [two's complement
 
 A sliding puzzle solver as a challenging example showing how memory_graph deals with large amounts of data. Click "Continue" to step through the breadth-first search generations until a solution path is found:
 
-- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=17,27,29,40&continues=1)
+- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=16,26,28,39&continues=1)
 
 ![sliding_puzzle.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/sliding_puzzle.png)
 
@@ -1030,7 +1074,7 @@ import memory_graph as mg
 
 data = []
 x = ['x']
-for i in range(20):
+for i in range(35):
     data.append(x)
 
 mg.show(locals())

{memory_graph-0.3.67 → memory_graph-0.3.69}/memory_graph/__init__.py

@@ -2,7 +2,7 @@
 # Copyright (c) 2023, Bas Terwijn.
 # SPDX-License-Identifier: BSD-2-Clause
 
-__version__ = "0.3.67"
+__version__ = "0.3.69"
 __author__ = 'Bas Terwijn'
 
 import memory_graph.memory_to_nodes as memory_to_nodes
@@ -13,6 +13,7 @@ import memory_graph.utils as utils
 import inspect
 import sys
 import itertools as it
+import types
 from memory_graph.call_stack import call_stack
 
 import graphviz
@@ -289,6 +290,15 @@ def stack_multi_slice(drop_functions : List[Tuple[str, int]] = [],
 def stack(end_functions=["<module>"], stack_index=0):
     return stack_slice([], end_functions, stack_index+2)
 
+def stack_exception(exception, stack_index=0):
+    """ Get the call stack at the point 'exception' was thrown. """
+    tb = exception.__traceback__
+    frame_infos = []
+    while tb is not None:
+        frame_infos.append(types.SimpleNamespace(frame=tb.tb_frame))
+        tb = tb.tb_next
+    return stack_frames_to_dict(frame_infos[stack_index:])
+
 def stack_pdb(begin_functions=[("trace_dispatch",1)],
               end_functions=["<module>"],
               stack_index=0):

{memory_graph-0.3.67 → memory_graph-0.3.69}/memory_graph.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.67
+Version: 0.3.69
 Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -176,7 +176,7 @@ ___
 # Python Data Model #
 Learn the right **mental model** to think about Python data. The [Python Data Model](https://docs.python.org/3/reference/datamodel.html) makes a distiction between immutable and mutable types:
 
-* **immutable**: bool, int, float, complex, str, tuple, bytes, frozenset
+* **immutable**: bool, int, float, complex, str, tuple, frozenset, frozendict, bytes
 * **mutable**: list, set, dict, classes, ... (most other types)
 
 
@@ -557,6 +557,48 @@ and pressing &lt;Enter&gt; a number of times, results in:
 
 ![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.gif)
 
+## Debugging using Exceptions ##
+
+To get the call stack at the point where exception `e` was thrown use `mg.stack_exception(e)`. This allows you to graph the trace back for easier debugging, for example:
+
+``` python
+import memory_graph as mg
+import traceback;
+
+def fun3():
+    d = [0] * 3
+    for i in range(4):
+        d[i] = i  # throws IndexError when i = 3
+    
+def fun2():
+    fun3()
+    
+def fun1():
+    fun2()
+
+try:
+    fun1()
+except Exception as e:
+    traceback.print_exc()           # print trace back
+    mg.show(mg.stack_exception(e))  # graph trace back
+```
+```
+$ python exception_example.py
+Traceback (most recent call last):
+  File "exception_example.py", line 16, in <module>
+    fun1()
+  File "exception_example.py", line 13, in fun1
+    fun2()
+  File "exception_example.py", line 10, in fun2
+    fun3()
+  File "exception_example.py", line 7, in fun3
+    d[i] = i  # throws IndexError when i = 3
+    ~^^^
+IndexError: list assignment index out of range
+```
+![exception_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/exception_example.png)
+
+
 # Data Structure Examples #
 Package memory_graph can **visualize the structure of your data** to easily understand and debug data structures, some examples:
 
@@ -696,6 +738,8 @@ Visualization of different sorting algorithms in Memory Graph Web Debugger.
 - [insertion sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/insertion_sort.py&breakpoints=13,29&continues=1&timestep=0.2&play)
 - [bubble sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bubble_sort.py&breakpoints=29,38&continues=1&timestep=0.2&play)
 - [cocktail shaker sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/cocktail_sort.py&breakpoints=16,45&continues=1&timestep=0.2&play)
+- [bucket sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bucket_sort.py&timestep=0.2&play)
+- [radix sort](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/radix_sort.py&timestep=0.2&play)
 
 
 # Bitwise Operators #
@@ -710,7 +754,7 @@ In this configuration example we show the decimal, binary and [two's complement
 
 A sliding puzzle solver as a challenging example showing how memory_graph deals with large amounts of data. Click "Continue" to step through the breadth-first search generations until a solution path is found:
 
-- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=17,27,29,40&continues=1)
+- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=16,26,28,39&continues=1)
 
 ![sliding_puzzle.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/sliding_puzzle.png)
 
@@ -1050,7 +1094,7 @@ import memory_graph as mg
 
 data = []
 x = ['x']
-for i in range(20):
+for i in range(35):
     data.append(x)
 
 mg.show(locals())

{memory_graph-0.3.67 → memory_graph-0.3.69}/memory_graph.egg-info/SOURCES.txt

@@ -1,6 +1,7 @@
 LICENSE.txt
 README.md
 pyproject.toml
+setup.py
 memory_graph/__init__.py
 memory_graph/call_stack.py
 memory_graph/config.py

{memory_graph-0.3.67 → memory_graph-0.3.69}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "memory_graph"
-version = "0.3.67"
+version = "0.3.69"
 description = "Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy."
 authors = [
     {name = "Bas Terwijn", email = "bterwijn@gmail.com"}

memory_graph-0.3.69/setup.py

@@ -0,0 +1,7 @@
+from setuptools import setup
+
+setup(
+    name="memory-graph",
+    version="0.3.30",
+    packages=["memory_graph"],
+)