memory-graph 0.3.79__tar.gz → 0.3.80__tar.gz

{memory_graph-0.3.79 → memory_graph-0.3.80}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.79
+Version: 0.3.80
 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
@@ -690,7 +690,7 @@ for i in range(n):
 Here we show values being inserted in a Binary Tree in Visual Studio Code. When inserting the last value '29' we "Step Into" the code to show the recursive implementation.
 ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
 
-See it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play) or see the more advanced [Multiway Tree](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/multiway_tree.py&breakpoints=19,33&continues=1&timestep=0.2&play) with more than two children per node, making the tree less deep and more efficient.
+See it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play) or see the more advanced [Multiway Tree](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/multiway_tree.py&breakpoints=20,34&continues=1&timestep=0.2&play) with more than two children per node, making the tree less deep and more efficient.
 
 ## Hash Set ##
 ```python
@@ -1046,6 +1046,13 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.fontsize*** : str
   - The font size used in the graph, default '14'.
 
+## Functions ##
+
+- **mg.dark_mode(b: bool = None)**
+  - Set dark mode to 'True' or 'False', or 'None' to toggle.
+
+- **mg.transparent_background(b: bool = None)**
+  - Set transparent_background to 'True' or 'False', or 'None' to toggle.
 
 ## Simplified Graph ##
 Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a`'s ints won’t affect `b`) so will never result in bugs.

{memory_graph-0.3.79 → memory_graph-0.3.80}/README.md

@@ -670,7 +670,7 @@ for i in range(n):
 Here we show values being inserted in a Binary Tree in Visual Studio Code. When inserting the last value '29' we "Step Into" the code to show the recursive implementation.
 ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
 
-See it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play) or see the more advanced [Multiway Tree](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/multiway_tree.py&breakpoints=19,33&continues=1&timestep=0.2&play) with more than two children per node, making the tree less deep and more efficient.
+See it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play) or see the more advanced [Multiway Tree](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/multiway_tree.py&breakpoints=20,34&continues=1&timestep=0.2&play) with more than two children per node, making the tree less deep and more efficient.
 
 ## Hash Set ##
 ```python
@@ -1026,6 +1026,13 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.fontsize*** : str
   - The font size used in the graph, default '14'.
 
+## Functions ##
+
+- **mg.dark_mode(b: bool = None)**
+  - Set dark mode to 'True' or 'False', or 'None' to toggle.
+
+- **mg.transparent_background(b: bool = None)**
+  - Set transparent_background to 'True' or 'False', or 'None' to toggle.
 
 ## Simplified Graph ##
 Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a`'s ints won’t affect `b`) so will never result in bugs.

{memory_graph-0.3.79 → memory_graph-0.3.80}/memory_graph/__init__.py

@@ -2,7 +2,7 @@
 # Copyright (c) 2023, Bas Terwijn.
 # SPDX-License-Identifier: BSD-2-Clause
 
-__version__ = "0.3.79"
+__version__ = "0.3.80"
 __author__ = 'Bas Terwijn'
 
 import memory_graph.memory_to_nodes as memory_to_nodes
@@ -26,7 +26,7 @@ if not hasattr(builtins, "mg"):
     builtins.mg = mg
 
 # re-exports for shorter names
-from .config_default  import dark_mode, transparent_background
+from .config_default  import dark_mode, transparent_background, set_colors
 from .slicer          import Slicer
 from .node_leaf       import Node_Leaf
 from .node_linear     import Node_Linear

{memory_graph-0.3.79 → memory_graph-0.3.80}/memory_graph/config_default.py

@@ -77,7 +77,11 @@ type_to_color_dark = {
     BaseException : "#a52e37",
 }
 
-def set_colors(dark, transparent):
+def set_colors(dark=None, transparent=None):
+    if dark is None:
+        dark = config.color_mode_dark
+    if transparent is None:
+        transparent = config.transparent_background
     if dark:
         config.foreground_color = foreground_color_dark
         config.index_color = index_color_dark

{memory_graph-0.3.79 → memory_graph-0.3.80}/memory_graph.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.79
+Version: 0.3.80
 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
@@ -690,7 +690,7 @@ for i in range(n):
 Here we show values being inserted in a Binary Tree in Visual Studio Code. When inserting the last value '29' we "Step Into" the code to show the recursive implementation.
 ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
 
-See it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play) or see the more advanced [Multiway Tree](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/multiway_tree.py&breakpoints=19,33&continues=1&timestep=0.2&play) with more than two children per node, making the tree less deep and more efficient.
+See it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play) or see the more advanced [Multiway Tree](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/multiway_tree.py&breakpoints=20,34&continues=1&timestep=0.2&play) with more than two children per node, making the tree less deep and more efficient.
 
 ## Hash Set ##
 ```python
@@ -1046,6 +1046,13 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.fontsize*** : str
   - The font size used in the graph, default '14'.
 
+## Functions ##
+
+- **mg.dark_mode(b: bool = None)**
+  - Set dark mode to 'True' or 'False', or 'None' to toggle.
+
+- **mg.transparent_background(b: bool = None)**
+  - Set transparent_background to 'True' or 'False', or 'None' to toggle.
 
 ## Simplified Graph ##
 Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a`'s ints won’t affect `b`) so will never result in bugs.

{memory_graph-0.3.79 → memory_graph-0.3.80}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "memory_graph"
-version = "0.3.79"
+version = "0.3.80"
 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"}