memory-graph 0.3.12__tar.gz → 0.3.13__tar.gz

{memory_graph-0.3.12/memory_graph.egg-info → memory_graph-0.3.13}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.12
+Version: 0.3.13
 Summary: Draws a graph of your data to analyze its structure.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
@@ -534,6 +534,27 @@ Different aspects of memory_graph can be configured. The default configuration i
 - ***mg.config.type_to_slicer*** : dict
   - Maps each type to a Slicer. A slicer determines how many elements of a data type are shown in the graph to prevent the graph from getting too big. 'Slicer()' does no slicing, 'Slicer(1,2,3)' shows just 1 element at the beginning, 2 in the middle, and 3 at the end.
 
+### 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 effect `b`.
+
+The simplification strikes a balance: it is slightly misleading but keeps the graph clean and easy to understand and focuses on the mutable types where unexpected changes can occur. This is why it is the default behavior. If you do want to show separate nodes for `int` values, such as for educational purposes, you can simply remove `int` from the `mg.config.not_node_types` set:
+```python
+import memory_graph as mg
+
+a = [100, 200, 300]
+b = a.copy()
+mg.render(locals(), 'not_node_types1.png')
+
+mg.config.not_node_types.remove(int) # now show separate nodes for int values
+
+mg.render(locals(), 'not_node_types2.png')
+```
+| ![not_node_types1](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/not_node_types1.png) | ![not_node_types2](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/not_node_types2.png) |
+|:-----------------------------------------------------------:|:-------------------------------------------------------------:|
+| not_node_types1.png, simplified | not_node_types2.png, technically correct |
+
+Additionally, the simplification hides the [reuse of small `int` values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1`, the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
+
 ### Temporary Configuration ###
 In addition to the global configuration, a temporary configuration can be set for a single `show()` or `render()` call to change the colors, orientation, and slicer. This example highlights a particular list element in red, gives it a horizontal orientation, and overwrites the default slicer for lists:
 
@@ -545,7 +566,7 @@ data = [ list(range(20)) for i in range(1,5)]
 highlight = data[2]
 
 mg.show( locals(),
-    colors                = {id(highlight): "red"   }, # set color to "red"
+    colors                = {id(highlight): "red"   }, # set color to red
     vertical_orientations = {id(highlight): False   }, # set horizontal orientation
     slicers               = {id(highlight): Slicer()}  # set no slicing 
 )
@@ -736,7 +757,7 @@ display( mg.create_graph(mg.locals_jupyter()) ) # display the local variables in
 mg.block(display, mg.create_graph(mg.locals_jupyter()) ) # the same but blocked
 ```
 
-See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/jupyter_example.ipynb).
+See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwijn/memory_graph/main/src/jupyter_example.ipynb).
 ![jupyter_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/jupyter_example.png)
 
 ## ipython ##

{memory_graph-0.3.12 → memory_graph-0.3.13}/README.md

@@ -515,6 +515,27 @@ Different aspects of memory_graph can be configured. The default configuration i
 - ***mg.config.type_to_slicer*** : dict
   - Maps each type to a Slicer. A slicer determines how many elements of a data type are shown in the graph to prevent the graph from getting too big. 'Slicer()' does no slicing, 'Slicer(1,2,3)' shows just 1 element at the beginning, 2 in the middle, and 3 at the end.
 
+### 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 effect `b`.
+
+The simplification strikes a balance: it is slightly misleading but keeps the graph clean and easy to understand and focuses on the mutable types where unexpected changes can occur. This is why it is the default behavior. If you do want to show separate nodes for `int` values, such as for educational purposes, you can simply remove `int` from the `mg.config.not_node_types` set:
+```python
+import memory_graph as mg
+
+a = [100, 200, 300]
+b = a.copy()
+mg.render(locals(), 'not_node_types1.png')
+
+mg.config.not_node_types.remove(int) # now show separate nodes for int values
+
+mg.render(locals(), 'not_node_types2.png')
+```
+| ![not_node_types1](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/not_node_types1.png) | ![not_node_types2](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/not_node_types2.png) |
+|:-----------------------------------------------------------:|:-------------------------------------------------------------:|
+| not_node_types1.png, simplified | not_node_types2.png, technically correct |
+
+Additionally, the simplification hides the [reuse of small `int` values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1`, the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
+
 ### Temporary Configuration ###
 In addition to the global configuration, a temporary configuration can be set for a single `show()` or `render()` call to change the colors, orientation, and slicer. This example highlights a particular list element in red, gives it a horizontal orientation, and overwrites the default slicer for lists:
 
@@ -526,7 +547,7 @@ data = [ list(range(20)) for i in range(1,5)]
 highlight = data[2]
 
 mg.show( locals(),
-    colors                = {id(highlight): "red"   }, # set color to "red"
+    colors                = {id(highlight): "red"   }, # set color to red
     vertical_orientations = {id(highlight): False   }, # set horizontal orientation
     slicers               = {id(highlight): Slicer()}  # set no slicing 
 )
@@ -717,7 +738,7 @@ display( mg.create_graph(mg.locals_jupyter()) ) # display the local variables in
 mg.block(display, mg.create_graph(mg.locals_jupyter()) ) # the same but blocked
 ```
 
-See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/jupyter_example.ipynb).
+See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwijn/memory_graph/main/src/jupyter_example.ipynb).
 ![jupyter_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/jupyter_example.png)
 
 ## ipython ##

{memory_graph-0.3.12 → memory_graph-0.3.13}/memory_graph/__init__.py

@@ -13,7 +13,7 @@ import sys
 
 import graphviz
 
-__version__ = "0.3.12"
+__version__ = "0.3.13"
 __author__ = 'Bas Terwijn'
 render_filename = 'memory_graph.pdf'
 block_prints_location = True

{memory_graph-0.3.12 → memory_graph-0.3.13}/memory_graph/html_table.py

@@ -4,20 +4,13 @@
 
 from memory_graph.node_base import Node_Base 
 import memory_graph.node_base
-
 import memory_graph.config as config
-
 import html
 
-def outer_html_table(s, border, color):
-    """ Helper function to add the outer HTML table tags to the string s setting the 'border' and 'color'. """
-    return (f'<\n<TABLE BORDER="0" CELLBORDER="{border}" CELLSPACING="0" CELLPADDING="0" BGCOLOR="{color}"><TR><TD PORT="table">\n' +
-            s + '\n</TD></TR></TABLE>\n>')
-
-def inner_html_table(s):
-    """ Helper function to add the innner HTML table tags to the string s. """
-    return ('  <TABLE BORDER="0" CELLBORDER="0" CELLSPACING="5" CELLPADDING="0">\n    <TR>' +
-            s + '</TR>\n  </TABLE>')
+def html_table_frame(s, border, color, spacing=5):
+    """ Helper function to add the HTML table frame to the string s setting the 'border' and 'color'. """
+    return (f'<\n<TABLE BORDER="{border}" CELLBORDER="1" CELLSPACING="{spacing}" CELLPADDING="0" BGCOLOR="{color}" PORT="table">\n    <TR>' +
+            s + '</TR>\n</TABLE>\n>')
 
 def format_string(s):
     """ Helper function to format the string s to be shown in the graph. Setting the max_string_length and escaping html characters. """
@@ -37,6 +30,7 @@ class HTML_Table:
         """
         self.html = ''
         self.add_new_line_flag = False
+        self.is_empty = True
         self.col_count = 0
         self.row_count = 0
         self.ref_count = 0
@@ -61,18 +55,19 @@ class HTML_Table:
             self.html += '</TR>\n    <TR>'
             self.add_new_line_flag = False
 
-    def add_string(self, s):
-        """ Add a string s to the outer table. """
-        self.html += format_string(s)
+    def add_string(self, s, border=0):
+        """ Add a string s to the table. """
+        self.html += f'<TD BORDER="{border}">'+format_string(s)+'</TD>'
+        self.is_empty = False
 
     def add_index(self, s):
-        """ Add an index s to the inner table. """
+        """ Add an index s to the table. """
         self.check_add_new_line()
-        self.html += f'<TD><font color="#505050">{str(s)}</font></TD>'
+        self.html += f'<TD BORDER="0"><font color="#505050">{str(s)}</font></TD>'
         self.col_count += 1
 
     def add_entry(self, node, nodes, child, id_to_slices, rounded=False, border=1, dashed=False):
-        """ Add child to the inner table either as reference if it is a Node_Base or as a value otherwise. """
+        """ Add child to the table either as reference if it is a Node_Base or as a value otherwise. """
         #print('child:', child)
         child_id = id(child)
         if child_id in nodes:
@@ -85,14 +80,14 @@ class HTML_Table:
             self.add_value(child, rounded, border)
 
     def add_value(self, s, rounded=False, border=1):
-        """ Helper function to add a value s to the inner table. """
+        """ Helper function to add a value s to the table. """
         self.check_add_new_line()
         r = ' STYLE="ROUNDED"' if rounded else ''
         self.html += f'<TD BORDER="{border}"{r}> {format_string(s)} </TD>'
         self.col_count += 1
 
     def add_reference(self, node, child, rounded=False, border=1, dashed=False):
-        """ Helper function to add a reference to the inner table. """
+        """ Helper function to add a reference to the table. """
         self.check_add_new_line()
         r = ' STYLE="ROUNDED"' if rounded else ''
         self.html += f'<TD BORDER="{border}" PORT="ref{self.ref_count}"{r}> </TD>'
@@ -102,7 +97,7 @@ class HTML_Table:
         self.col_count += 1
 
     def add_dots(self, rounded=False, border=1):
-        """ Helper function to add dots to the inner table. """
+        """ Helper function to add dots to the table. """
         self.check_add_new_line()
         r = 'STYLE="ROUNDED"' if rounded else ''
         self.html += f'<TD BORDER="{border}" {r}>...</TD>'
@@ -110,26 +105,26 @@ class HTML_Table:
 
     def to_string(self, border=1, color='white'):
         """ Construct the HTML table string with the 'border' and 'color' settings. """
-        if self.col_count != 0 or self.row_count != 0:
-            self.html = inner_html_table(self.html)
-        if len(self.html) == 0:
-            self.html = ' '
-        return outer_html_table(self.html, border, color)
+        if self.col_count == 0 and self.row_count == 0:
+            if self.is_empty:
+                self.add_string(' ')
+            return html_table_frame(self.html, border, color, spacing=0)
+        return html_table_frame(self.html, border, color)
     
     def get_column(self):
-        """ Get the number of columns in the inner table. """
+        """ Get the number of columns in the table. """
         return self.col_count
     
     def get_max_column(self):
-        """ Get the maximum value of the number of columns of rows in the inner tables. """
+        """ Get the maximum value of the number of columns of rows in the table. """
         return self.max_col_count
     
     def get_row(self):
-        """ Get the number of rows in the inner table. """
+        """ Get the number of rows in the table. """
         return self.row_count
 
     def get_edges(self):
-        """ Get the edges that need to be acced t connect the table to other tables in the graph. """
+        """ Get the edges that need to be added to connect the table to other tables in the graph. """
         return self.edges
 
 if __name__ == '__main__':
@@ -138,6 +133,6 @@ if __name__ == '__main__':
     columns = 5
     for r in range(rows):
         for c in range(columns):
-            table.add_column(f'{c},{r}')
+            table.add_value(f'{c},{r}')
         table.add_new_line()
-    print(table)
+    print(table.to_string())

memory_graph-0.3.13/memory_graph/t.py

@@ -0,0 +1,6 @@
+import memory_graph as mg
+
+a= [0,10000,5]
+
+mg.render(a, 'value.svg')
+

{memory_graph-0.3.12 → memory_graph-0.3.13/memory_graph.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.12
+Version: 0.3.13
 Summary: Draws a graph of your data to analyze its structure.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
@@ -534,6 +534,27 @@ Different aspects of memory_graph can be configured. The default configuration i
 - ***mg.config.type_to_slicer*** : dict
   - Maps each type to a Slicer. A slicer determines how many elements of a data type are shown in the graph to prevent the graph from getting too big. 'Slicer()' does no slicing, 'Slicer(1,2,3)' shows just 1 element at the beginning, 2 in the middle, and 3 at the end.
 
+### 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 effect `b`.
+
+The simplification strikes a balance: it is slightly misleading but keeps the graph clean and easy to understand and focuses on the mutable types where unexpected changes can occur. This is why it is the default behavior. If you do want to show separate nodes for `int` values, such as for educational purposes, you can simply remove `int` from the `mg.config.not_node_types` set:
+```python
+import memory_graph as mg
+
+a = [100, 200, 300]
+b = a.copy()
+mg.render(locals(), 'not_node_types1.png')
+
+mg.config.not_node_types.remove(int) # now show separate nodes for int values
+
+mg.render(locals(), 'not_node_types2.png')
+```
+| ![not_node_types1](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/not_node_types1.png) | ![not_node_types2](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/not_node_types2.png) |
+|:-----------------------------------------------------------:|:-------------------------------------------------------------:|
+| not_node_types1.png, simplified | not_node_types2.png, technically correct |
+
+Additionally, the simplification hides the [reuse of small `int` values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1`, the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
+
 ### Temporary Configuration ###
 In addition to the global configuration, a temporary configuration can be set for a single `show()` or `render()` call to change the colors, orientation, and slicer. This example highlights a particular list element in red, gives it a horizontal orientation, and overwrites the default slicer for lists:
 
@@ -545,7 +566,7 @@ data = [ list(range(20)) for i in range(1,5)]
 highlight = data[2]
 
 mg.show( locals(),
-    colors                = {id(highlight): "red"   }, # set color to "red"
+    colors                = {id(highlight): "red"   }, # set color to red
     vertical_orientations = {id(highlight): False   }, # set horizontal orientation
     slicers               = {id(highlight): Slicer()}  # set no slicing 
 )
@@ -736,7 +757,7 @@ display( mg.create_graph(mg.locals_jupyter()) ) # display the local variables in
 mg.block(display, mg.create_graph(mg.locals_jupyter()) ) # the same but blocked
 ```
 
-See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/jupyter_example.ipynb).
+See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwijn/memory_graph/main/src/jupyter_example.ipynb).
 ![jupyter_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/jupyter_example.png)
 
 ## ipython ##

memory_graph-0.3.13/memory_graph.egg-info/SOURCES.txt

@@ -0,0 +1,37 @@
+LICENSE.txt
+MANIFEST.in
+README.md
+setup.py
+memory_graph/__init__.py
+memory_graph/config.py
+memory_graph/config_default.py
+memory_graph/config_helpers.py
+memory_graph/extension_numpy.py
+memory_graph/extension_pandas.py
+memory_graph/html_table.py
+memory_graph/list_view.py
+memory_graph/memory_to_nodes.py
+memory_graph/node_base.py
+memory_graph/node_key_value.py
+memory_graph/node_linear.py
+memory_graph/node_table.py
+memory_graph/sequence.py
+memory_graph/slicer.py
+memory_graph/slices.py
+memory_graph/slices_iterator.py
+memory_graph/slices_table_iterator.py
+memory_graph/t.py
+memory_graph/test.py
+memory_graph/test_max_graph_depth.py
+memory_graph/test_memory_graph.py
+memory_graph/test_memory_to_nodes.py
+memory_graph/test_sequence.py
+memory_graph/test_slicer.py
+memory_graph/test_slices.py
+memory_graph/test_slices_iterator.py
+memory_graph/utils.py
+memory_graph.egg-info/PKG-INFO
+memory_graph.egg-info/SOURCES.txt
+memory_graph.egg-info/dependency_links.txt
+memory_graph.egg-info/requires.txt
+memory_graph.egg-info/top_level.txt

{memory_graph-0.3.12 → memory_graph-0.3.13}/setup.py

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

memory_graph-0.3.12/TODO.txt

@@ -1,9 +0,0 @@
-
-mg.block(fun, print_loc=True), update docs, stack-overflow posts
-
-Jupyter Notebook inline render using display()
-
-webassembly inline render
-
-optional max introspect depth for each type/id
-https://discuss.python.org/t/request-for-feedback-memory-graph-a-python-visualization-tool-for-education/78347

memory_graph-0.3.12/images/add_one.py

@@ -1,18 +0,0 @@
-# This file is part of memory_graph.
-# Copyright (c) 2023, Bas Terwijn.
-# SPDX-License-Identifier: BSD-2-Clause
-
-import memory_graph as mg
-
-def add_one(a, b, c):
-    a += [1]
-    b += (1,)
-    c += [1]
-    mg.render( mg.get_call_stack(), "add_one.png")
-
-a = [4, 3, 2]
-b = (4, 3, 2)
-c = [4, 3, 2]
-
-add_one(a, b, c.copy())
-print(f"a:{a} b:{b} c:{c}")

memory_graph-0.3.12/images/avltree.py

@@ -1,43 +0,0 @@
-# This file is part of memory_graph.
-# Copyright (c) 2023, Bas Terwijn.
-# SPDX-License-Identifier: BSD-2-Clause
-
-import memory_graph as mg
-import bintrees
-
-# Create an AVL tree
-tree = bintrees.AVLTree()
-tree.insert(10, "ten")
-tree.insert(5, "five")
-tree.insert(20, "twenty")
-tree.insert(15, "fifteen")
-
-# mg.render(locals(), 'avltree_fail.png') # id keeps changing
-
-mg.config.type_to_color[bintrees.avltree.Node] = "sandybrown"
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data, dir(data))
-mg.config.type_to_slicer[bintrees.avltree.Node] = mg.slicer.Slicer()
-mg.render(locals(), 'avltree_dir.png')
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_base.Node_Base(f"key:{data.key} value:{data.value}")
-mg.render(locals(), 'avltree_base.png')
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_linear.Node_Linear(data,
-                                                                                        ['left:', data.left,
-                                                                                         'key:', data.key,
-                                                                                         'value:', data.value,
-                                                                                         'right:', data.right])
-mg.render(locals(), 'avltree_linear.png')
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_key_value.Node_Key_Value(data,
-                                                                                              {'left': data.left,
-                                                                                               'key': data.key,
-                                                                                               'value': data.value,
-                                                                                               'right': data.right}.items())
-mg.render(locals(), 'avltree_key_value.png')
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.node_table.Node_Table(data,
-                                                                                      [[data.key, data.value],
-                                                                                       [data.left, data.right]]
-                                                                                      )
-mg.render(locals(), 'avltree_table.png')

memory_graph-0.3.12/images/bin_tree.py

@@ -1,47 +0,0 @@
-# This file is part of memory_graph.
-# Copyright (c) 2023, Bas Terwijn.
-# SPDX-License-Identifier: BSD-2-Clause
-
-import memory_graph as mg
-import random
-random.seed(0) # use same random numbers each run
-
-class Node:
-
-    def __init__(self, value):
-        self.smaller = None
-        self.value = value
-        self.larger = None
-
-class BinTree:
-
-    def __init__(self):
-        self.root = None
-
-    def add_recursive(self, new_value, node):
-        if new_value < node.value:
-            if node.smaller is None:
-                node.smaller = Node(new_value)
-            else:
-                self.add_recursive(new_value, node.smaller)
-        else:
-            if node.larger is None:
-                node.larger = Node(new_value)
-            else:
-                self.add_recursive(new_value, node.larger)
-        if new_value == 51:
-            mg.render(locals(), f"bin_tree.png")
-            exit(0)
-
-    def add(self, value):
-        if self.root is None:
-            self.root = Node(value)
-        else:
-            self.add_recursive(value, self.root)
-
-tree = BinTree()
-n = 100
-for i in range(n):
-    new_value = random.randrange(n)
-    tree.add(new_value)
-

memory_graph-0.3.12/images/copies.py

@@ -1,15 +0,0 @@
-# This file is part of memory_graph.
-# Copyright (c) 2023, Bas Terwijn.
-# SPDX-License-Identifier: BSD-2-Clause
-
-import memory_graph as mg
-import copy
-
-a = [ [1, 2], ['x', 'y'] ] # a nested list (a list containing lists)
-
-# three different ways to make a "copy" of 'a':
-c1 = a
-c2 = copy.copy(a) # equivalent to:  a.copy() a[:] list(a)
-c3 = copy.deepcopy(a)
-
-mg.render(locals(), 'copies.png')

memory_graph-0.3.12/images/copy_method.py

@@ -1,22 +0,0 @@
-# This file is part of memory_graph.
-# Copyright (c) 2023, Bas Terwijn.
-# SPDX-License-Identifier: BSD-2-Clause
-
-import memory_graph as mg
-import copy
-
-class My_Class:
-
-    def __init__(self):
-        self.digits = [1, 2]
-        self.letters = ['x', 'y']
-
-    def copy(self): # custom copy method copies the digits but shares the letters
-        c = copy.copy(self)
-        c.digits = copy.copy(self.digits)
-        return c
-
-a = My_Class()
-b = a.copy()
-
-mg.render(locals(), 'copy_method.png')

memory_graph-0.3.12/images/create_gif.sh

@@ -1,19 +0,0 @@
-#!/bin/bash
-#
-# install:
-#
-#   sudo apt install imagemagick
-
-name="$1"
-files=$(ls -v $name*.png)
-echo "creating gif with:"
-echo "$files"
-
-largest_size=$(identify -format "%Wx%H %f\n" $name*.png | sort -nr | head -n1)
-echo "largest_size: $largest_size"
-
-echo "resizing images"
-mogrify -resize $largest_size -background white -gravity center -extent $largest_size $files
-echo "creating file: $name.gif"
-convert -delay 150 -loop 0 $files $name.gif
-echo "done"

memory_graph-0.3.12/images/create_images.sh

@@ -1,34 +0,0 @@
-# intro
-python many_types.py
-
-# debugging
-python debugging.py
-bash create_gif.sh debugging
-
-# data model
-python immutable.py
-python mutable.py
-python copies.py
-python copy_method.py
-
-# call stack
-python add_one.py
-python factorial.py
-bash create_gif.sh factorial
-python power_set.py
-bash create_gif.sh power_set
-
-# datastructures
-python linked_list.py
-python bin_tree.py
-python hash_set.py
-
-# configuration
-python highlight.py
-
-# extensions
-python extension_numpy.py
-python extension_pandas.py
-
-# introspection
-python avltree.py

memory_graph-0.3.12/images/debugging.py

@@ -1,19 +0,0 @@
-# This file is part of memory_graph.
-# Copyright (c) 2023, Bas Terwijn.
-# SPDX-License-Identifier: BSD-2-Clause
-
-import memory_graph as mg
-
-image=0
-def get_fac_name():
-    global image
-    image+=1
-    return f"debugging{image:02d}.png"
-
-squares = []
-squares_collector = []
-for i in range(1,6):
-    squares.append(i**2)
-    squares_collector.append(squares.copy())
-    mg.render(locals(), get_fac_name())
-mg.render(locals(), get_fac_name())

memory_graph-0.3.12/images/extension_numpy.py

@@ -1,14 +0,0 @@
-# This file is part of memory_graph.
-# Copyright (c) 2023, Bas Terwijn.
-# SPDX-License-Identifier: BSD-2-Clause
-
-import memory_graph as mg
-import numpy as np
-import memory_graph.extension_numpy
-np.random.seed(0) # use same random numbers each run
-
-array = np.array([1.1, 2, 3, 4, 5])
-matrix = np.matrix([[i*20+j for j in range(20)] for i in range(20)])
-ndarray = np.random.rand(20,20)
-
-mg.render( locals(), "extension_numpy.png")