memory-graph 0.3.1__tar.gz → 0.3.3__tar.gz

{memory_graph-0.3.1 → memory_graph-0.3.3}/PKG-INFO

@@ -1,12 +1,11 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.1
+Version: 0.3.3
 Summary: Draws a graph of your data to analyze its structure.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
 Author-email: bterwijn@gmail.com
 License: BSD 2-clause
-Platform: UNKNOWN
 Classifier: Development Status :: 4 - Beta
 Classifier: Intended Audience :: Education
 Classifier: Intended Audience :: Developers
@@ -16,6 +15,7 @@ Classifier: Topic :: Education
 Classifier: Topic :: Software Development :: Debuggers
 Description-Content-Type: text/markdown
 License-File: LICENSE.txt
+Requires-Dist: graphviz
 
 # Installation #
 Install (or upgrade) `memory_graph` using pip:
@@ -131,7 +131,7 @@ The [Python Data Model](https://docs.python.org/3/reference/datamodel.html) make
 In the code below variable `a` and `b` both reference the same `int` value 10. An `int` is an immutable type and therefore when we change variable `a` its value can **not** be mutated in place, and thus a copy is made and `a` and `b` reference a different value afterwards.
 ```python
 import memory_graph
-memory_graph.config.not_node_types.remove(int) # show references to ints
+memory_graph.config.not_node_types.remove(int) # show nodes for ints
 
 a = 10
 b = a
@@ -462,8 +462,8 @@ Different aspects of memory_graph can be configured. The default configuration i
 - ***memory_graph.config.max_string_length*** : int
   - The maximum length of strings shown in the graph. Longer strings will be truncated.
 
-- ***memory_graph.config.no_reference_types*** : dict
-  - Holds all types for which no seperate node is drawn but that instead are shown as elements in their parent Node. It maps each type to a function that determines how it is visualized.
+- ***memory_graph.config.not_node_types*** : set
+  - Holds all types for which no seperate node is drawn but that instead are shown as elements in their parent Node.
 
 - ***memory_graph.config.no_child_references_types*** : set
   - The set of key_value types that don't draw references to their direct childeren but have their children shown as elements of their node.
@@ -550,5 +550,3 @@ See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwi
 
 - When graph edges overlap it can be hard to distinguish them. Using an interactive graphviz viewer, such as [xdot](https://github.com/jrfonseca/xdot.py), on a '*.gv' DOT output file will help.
 
-
-

{memory_graph-0.3.1 → memory_graph-0.3.3}/README.md

@@ -112,7 +112,7 @@ The [Python Data Model](https://docs.python.org/3/reference/datamodel.html) make
 In the code below variable `a` and `b` both reference the same `int` value 10. An `int` is an immutable type and therefore when we change variable `a` its value can **not** be mutated in place, and thus a copy is made and `a` and `b` reference a different value afterwards.
 ```python
 import memory_graph
-memory_graph.config.not_node_types.remove(int) # show references to ints
+memory_graph.config.not_node_types.remove(int) # show nodes for ints
 
 a = 10
 b = a
@@ -443,8 +443,8 @@ Different aspects of memory_graph can be configured. The default configuration i
 - ***memory_graph.config.max_string_length*** : int
   - The maximum length of strings shown in the graph. Longer strings will be truncated.
 
-- ***memory_graph.config.no_reference_types*** : dict
-  - Holds all types for which no seperate node is drawn but that instead are shown as elements in their parent Node. It maps each type to a function that determines how it is visualized.
+- ***memory_graph.config.not_node_types*** : set
+  - Holds all types for which no seperate node is drawn but that instead are shown as elements in their parent Node.
 
 - ***memory_graph.config.no_child_references_types*** : set
   - The set of key_value types that don't draw references to their direct childeren but have their children shown as elements of their node.

{memory_graph-0.3.1 → memory_graph-0.3.3}/memory_graph/__init__.py

@@ -9,7 +9,7 @@ import sys
 
 import graphviz
 
-__version__ = "0.3.01"
+__version__ = "0.3.03"
 __author__ = 'Bas Terwijn'
 
 log_file=sys.stdout

{memory_graph-0.3.1 → memory_graph-0.3.3}/memory_graph/extension_numpy.py

@@ -8,8 +8,8 @@ import numpy as np
 
 config.not_node_types |= {
     np.int8, np.int16, np.int32, np.int64, np.uint8, np.uint16, np.uint32, np.uint64, 
-    np.float16, np.float32, np.float64, np.float_, 
-    np.complex64, np.complex128, np.complex_, 
+    np.float16, np.float32, np.float64,
+    np.complex64, np.complex128,
     np.bool_, np.bytes_, np.str_, np.datetime64, np.timedelta64
 }
 

{memory_graph-0.3.1 → memory_graph-0.3.3}/memory_graph/memory_to_nodes.py

@@ -31,7 +31,8 @@ def read_nodes(data):
                 for index in node.get_children().indices_all():
                     child = node.get_children()[index]
                     memory_to_nodes_recursive(nodes, child, node, index)
-            node.add_parent_index(parent, parent_index)
+            if not parent is None:
+                node.add_parent_index(parent, parent_index)
 
     nodes = {}
     memory_to_nodes_recursive(nodes, data, None, None)
@@ -135,7 +136,7 @@ def add_to_graphviz_graph(graphviz_graph, nodes, node, slices, id_to_slices, sub
     html_table = node.get_html_table(nodes, slices, id_to_slices)
     edges = html_table.get_edges()
     color = config_helpers.get_color(node)
-    border = 1 #3 if node.is_root() else 1 # TODO
+    border = 3 if node.is_root() else 1
     graphviz_graph.node(node.get_name(),
                         html_table.to_string(border, color),
                         xlabel=node.get_label(slices))

{memory_graph-0.3.1 → memory_graph-0.3.3}/memory_graph/node_base.py

@@ -30,6 +30,12 @@ class Node_Base:
             self.parent_indices[parent] = []
         self.parent_indices[parent].append(parent_index)
 
+    def is_root(self):
+        """
+        Return if the node is the root node.
+        """
+        return len(self.parent_indices) == 0
+
     def get_parent_indices(self):
         return self.parent_indices
 

{memory_graph-0.3.1 → memory_graph-0.3.3}/memory_graph.egg-info/PKG-INFO

@@ -1,12 +1,11 @@
 Metadata-Version: 2.1
-Name: memory-graph
-Version: 0.3.1
+Name: memory_graph
+Version: 0.3.3
 Summary: Draws a graph of your data to analyze its structure.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
 Author-email: bterwijn@gmail.com
 License: BSD 2-clause
-Platform: UNKNOWN
 Classifier: Development Status :: 4 - Beta
 Classifier: Intended Audience :: Education
 Classifier: Intended Audience :: Developers
@@ -16,6 +15,7 @@ Classifier: Topic :: Education
 Classifier: Topic :: Software Development :: Debuggers
 Description-Content-Type: text/markdown
 License-File: LICENSE.txt
+Requires-Dist: graphviz
 
 # Installation #
 Install (or upgrade) `memory_graph` using pip:
@@ -131,7 +131,7 @@ The [Python Data Model](https://docs.python.org/3/reference/datamodel.html) make
 In the code below variable `a` and `b` both reference the same `int` value 10. An `int` is an immutable type and therefore when we change variable `a` its value can **not** be mutated in place, and thus a copy is made and `a` and `b` reference a different value afterwards.
 ```python
 import memory_graph
-memory_graph.config.not_node_types.remove(int) # show references to ints
+memory_graph.config.not_node_types.remove(int) # show nodes for ints
 
 a = 10
 b = a
@@ -462,8 +462,8 @@ Different aspects of memory_graph can be configured. The default configuration i
 - ***memory_graph.config.max_string_length*** : int
   - The maximum length of strings shown in the graph. Longer strings will be truncated.
 
-- ***memory_graph.config.no_reference_types*** : dict
-  - Holds all types for which no seperate node is drawn but that instead are shown as elements in their parent Node. It maps each type to a function that determines how it is visualized.
+- ***memory_graph.config.not_node_types*** : set
+  - Holds all types for which no seperate node is drawn but that instead are shown as elements in their parent Node.
 
 - ***memory_graph.config.no_child_references_types*** : set
   - The set of key_value types that don't draw references to their direct childeren but have their children shown as elements of their node.
@@ -550,5 +550,3 @@ See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwi
 
 - When graph edges overlap it can be hard to distinguish them. Using an interactive graphviz viewer, such as [xdot](https://github.com/jrfonseca/xdot.py), on a '*.gv' DOT output file will help.
 
-
-

{memory_graph-0.3.1 → memory_graph-0.3.3}/setup.py

@@ -7,7 +7,7 @@ long_description_from_readme = (this_directory / "README.md").read_text()
 
 setup(
     name = 'memory_graph',
-    version = '0.3.01',
+    version = '0.3.03',
     description = 'Draws a graph of your data to analyze its structure.',
     long_description = long_description_from_readme,
     long_description_content_type = 'text/markdown',