memory-graph 0.3.56__tar.gz → 0.3.58__tar.gz

{memory_graph-0.3.56/memory_graph.egg-info → memory_graph-0.3.58}/PKG-INFO

@@ -1,34 +1,9 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.56
+Version: 0.3.58
 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: 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/memory_graph
 Project-URL: Repository, https://github.com/bterwijn/memory_graph.git
 Classifier: Development Status :: 4 - Beta
@@ -736,6 +711,12 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.max_missing_edges*** : int
   - Maximum number of missing edges that are shown with default value 2. Dashed references are used to indicate that there are more references to a node than are shown.
 
+- ***mg.config.fontname*** : str
+  - The font used in the graph, default 'Times-Roman' (widely available on the web).
+
+- ***mg.config.fontsize*** : str
+  - The font size used in the graph, default '14'.
+
 
 ## 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` won’t affect `b`) so will never result in bugs.

{memory_graph-0.3.56 → memory_graph-0.3.58}/README.md

@@ -691,6 +691,12 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.max_missing_edges*** : int
   - Maximum number of missing edges that are shown with default value 2. Dashed references are used to indicate that there are more references to a node than are shown.
 
+- ***mg.config.fontname*** : str
+  - The font used in the graph, default 'Times-Roman' (widely available on the web).
+
+- ***mg.config.fontsize*** : str
+  - The font size used in the graph, default '14'.
+
 
 ## 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` won’t affect `b`) so will never result in bugs.

{memory_graph-0.3.56 → memory_graph-0.3.58}/memory_graph/__init__.py

@@ -2,7 +2,7 @@
 # Copyright (c) 2023, Bas Terwijn.
 # SPDX-License-Identifier: BSD-2-Clause
 
-__version__ = "0.3.56"
+__version__ = "0.3.58"
 __author__ = 'Bas Terwijn'
 
 import memory_graph.memory_to_nodes as memory_to_nodes

{memory_graph-0.3.56 → memory_graph-0.3.58}/memory_graph/config.py

@@ -46,3 +46,6 @@ graph_cut_symbol = None
 max_missing_edges = None
 
 type_to_depth = { }
+
+fontname = 'Courier'
+fontsize = '14'

{memory_graph-0.3.56 → memory_graph-0.3.58}/memory_graph/config_default.py

@@ -129,5 +129,8 @@ def reset():
     """ Maximum number of missing edges that are shown. """
     config.max_missing_edges = 2
 
+    """ Font name and size used in the graph. """
+    config.fontname = 'Times-Roman'
+    config.fontsize = '14'
 
 reset()

{memory_graph-0.3.56 → memory_graph-0.3.58}/memory_graph/memory_to_nodes.py

@@ -257,9 +257,9 @@ def memory_to_nodes(data):
     id_to_slices = add_missing_edges(nodes, id_to_slices, config.max_missing_edges)
     #print('id_to_slices:',id_to_slices)
     embed_keys_in_key_value_nodes(nodes, nodes_key_value, id_to_slices)
-    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': config.fontname, 'fontsize': config.fontsize}
+    graphviz_node_attr = {'fontname': config.fontname, 'fontsize': config.fontsize, 'shape': 'plaintext'}
+    graphviz_edge_attr = {'fontname': config.fontname, 'fontsize': config.fontsize}
     graphviz_graph=graphviz.Digraph('memory_graph',
                                     graph_attr=graphviz_graph_attr,
                                     node_attr=graphviz_node_attr,

{memory_graph-0.3.56 → memory_graph-0.3.58/memory_graph.egg-info}/PKG-INFO

@@ -1,34 +1,9 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.56
+Version: 0.3.58
 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: 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/memory_graph
 Project-URL: Repository, https://github.com/bterwijn/memory_graph.git
 Classifier: Development Status :: 4 - Beta
@@ -736,6 +711,12 @@ Different aspects of memory_graph can be configured. The default configuration c
 - ***mg.config.max_missing_edges*** : int
   - Maximum number of missing edges that are shown with default value 2. Dashed references are used to indicate that there are more references to a node than are shown.
 
+- ***mg.config.fontname*** : str
+  - The font used in the graph, default 'Times-Roman' (widely available on the web).
+
+- ***mg.config.fontsize*** : str
+  - The font size used in the graph, default '14'.
+
 
 ## 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` won’t affect `b`) so will never result in bugs.

{memory_graph-0.3.56 → memory_graph-0.3.58}/pyproject.toml

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