memory-graph 0.3.10__tar.gz → 0.3.11__tar.gz

{memory_graph-0.3.10/memory_graph.egg-info → memory_graph-0.3.11}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.10
+Version: 0.3.11
 Summary: Draws a graph of your data to analyze its structure.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
@@ -171,7 +171,7 @@ mg.render(locals(), 'mutable2.png')
 |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
 | mutable1.png | mutable2.png |
 
-One practical reason why Python makes the distinction between mutable and immutable types is that a value of a mutable type can be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much, or are small which makes copying less of a concern.
+One practical reason why Python makes the distinction between mutable and immutable types is that a value of a mutable type can be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much, or are small making copying less of a concern.
 
 ### Copying ###
 Python offers three different "copy" options that we will demonstrate using a nested list:
@@ -337,6 +337,8 @@ The ```mg.get_call_stack()``` doesn't work well in *watch* context in most debug
 | **Visual Studio Code** | `mg.get_call_stack_vscode()` |
 | **Pycharm** | `mg.get_call_stack_pycharm()` |
 
+![debug_vscode.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debug_vscode.png)
+
 #### Other Debuggers ####
 For other debuggers, invoke this function within the *watch* context. Then, in the "call_stack.txt" file, identify the slice of functions you wish to include in the call stack.
 ```
@@ -508,8 +510,8 @@ for i in range(n):
 ## Configuration ##
 Different aspects of memory_graph can be configured. The default configuration is reset by importing 'memory_graph.config_default'.
 
-- ***mg.config.max_tree_depth*** : int
-  - The maxium depth of the graph. A `★` symbol indictes where the graph is cut short.
+- ***mg.config.max_graph_depth*** : int
+  - The maxium depth of the graph with default value 12. A `✂` (scissor) symbol indicates where the graph is cut short.
 
 - ***mg.config.max_string_length*** : int
   - The maximum length of strings shown in the graph. Longer strings will be truncated.
@@ -554,7 +556,7 @@ mg.show( locals(),
 Different extensions are available for types from other Python packages. 
 
 ### Numpy ###
-Numpy types `arrray` and `matrix` and `ndarray` can be graphed with "memory_graph.extension_numpy":
+Numpy types `array` and `matrix` and `ndarray` can be graphed with "memory_graph.extension_numpy":
 
 ```python
 import memory_graph as mg
@@ -740,7 +742,7 @@ See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwi
 ## ipython ##
 In ipython `locals()` has additional variables that cause problems in the graph, use `mg.locals_ipython()` to get the local variables with these problematic variables filtered out. Use `mg.get_call_stack_ipython()` to get the whole call stack with these variables filtered out.
 
-Additionally install file [auto_memory_graph.py](https://raw.githubusercontent.com/bterwijn/memory_graph/main/sc/auto_memory_graph.py) in the ipython startup directory:
+Additionally install file [auto_memory_graph.py](https://raw.githubusercontent.com/bterwijn/memory_graph/main/src/auto_memory_graph.py) in the ipython startup directory:
 * Linux/Mac: ~/.ipython/profile_default/startup/
 * Windows: %USERPROFILE%\.ipython\profile_default\startup\
 

{memory_graph-0.3.10 → memory_graph-0.3.11}/README.md

@@ -152,7 +152,7 @@ mg.render(locals(), 'mutable2.png')
 |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
 | mutable1.png | mutable2.png |
 
-One practical reason why Python makes the distinction between mutable and immutable types is that a value of a mutable type can be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much, or are small which makes copying less of a concern.
+One practical reason why Python makes the distinction between mutable and immutable types is that a value of a mutable type can be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much, or are small making copying less of a concern.
 
 ### Copying ###
 Python offers three different "copy" options that we will demonstrate using a nested list:
@@ -318,6 +318,8 @@ The ```mg.get_call_stack()``` doesn't work well in *watch* context in most debug
 | **Visual Studio Code** | `mg.get_call_stack_vscode()` |
 | **Pycharm** | `mg.get_call_stack_pycharm()` |
 
+![debug_vscode.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debug_vscode.png)
+
 #### Other Debuggers ####
 For other debuggers, invoke this function within the *watch* context. Then, in the "call_stack.txt" file, identify the slice of functions you wish to include in the call stack.
 ```
@@ -489,8 +491,8 @@ for i in range(n):
 ## Configuration ##
 Different aspects of memory_graph can be configured. The default configuration is reset by importing 'memory_graph.config_default'.
 
-- ***mg.config.max_tree_depth*** : int
-  - The maxium depth of the graph. A `★` symbol indictes where the graph is cut short.
+- ***mg.config.max_graph_depth*** : int
+  - The maxium depth of the graph with default value 12. A `✂` (scissor) symbol indicates where the graph is cut short.
 
 - ***mg.config.max_string_length*** : int
   - The maximum length of strings shown in the graph. Longer strings will be truncated.
@@ -535,7 +537,7 @@ mg.show( locals(),
 Different extensions are available for types from other Python packages. 
 
 ### Numpy ###
-Numpy types `arrray` and `matrix` and `ndarray` can be graphed with "memory_graph.extension_numpy":
+Numpy types `array` and `matrix` and `ndarray` can be graphed with "memory_graph.extension_numpy":
 
 ```python
 import memory_graph as mg
@@ -721,7 +723,7 @@ See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwi
 ## ipython ##
 In ipython `locals()` has additional variables that cause problems in the graph, use `mg.locals_ipython()` to get the local variables with these problematic variables filtered out. Use `mg.get_call_stack_ipython()` to get the whole call stack with these variables filtered out.
 
-Additionally install file [auto_memory_graph.py](https://raw.githubusercontent.com/bterwijn/memory_graph/main/sc/auto_memory_graph.py) in the ipython startup directory:
+Additionally install file [auto_memory_graph.py](https://raw.githubusercontent.com/bterwijn/memory_graph/main/src/auto_memory_graph.py) in the ipython startup directory:
 * Linux/Mac: ~/.ipython/profile_default/startup/
 * Windows: %USERPROFILE%\.ipython\profile_default\startup\
 

{memory_graph-0.3.10 → memory_graph-0.3.11}/memory_graph/__init__.py

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

{memory_graph-0.3.10 → memory_graph-0.3.11}/memory_graph/config.py

@@ -4,7 +4,8 @@
 
 """ Configuration file for the graph visualizer. The configuration values are set later by the 'config_default.py' file. """
 
-max_tree_depth = None
+max_graph_depth = None
+graph_cut_symbol = None
 max_missing_edges = None
 max_string_length = None
 graph_stability = None

{memory_graph-0.3.10 → memory_graph-0.3.11}/memory_graph/config_default.py

@@ -16,8 +16,8 @@ import memory_graph.utils as utils
 import types
 
 """ The maximum depth of nodes in the graph. When the graph gets too big set this to a small positive number. A `✂` symbol indictes where the graph is cut short. """
-config.max_tree_depth = -1
-
+config.max_graph_depth = 12
+config.graph_cut_symbol = '✂'
 config.max_missing_edges = 3
 
 """ The maximum length of strings shown in the graph. Longer strings will be truncated. """

{memory_graph-0.3.10 → memory_graph-0.3.11}/memory_graph/html_table.py

@@ -80,7 +80,7 @@ class HTML_Table:
             if child_id in id_to_slices:
                 self.add_reference(node, child, rounded, border, dashed)
             else:
-                self.add_value("✂", rounded, border)
+                self.add_value(config.graph_cut_symbol, rounded, border)
         else:
             self.add_value(child, rounded, border)
 

{memory_graph-0.3.10 → memory_graph-0.3.11}/memory_graph/memory_to_nodes.py

@@ -45,10 +45,10 @@ def read_nodes(data):
 
 # --------------------------------------------------------------------------------------------
 
-def slice_nodes(nodes, root_id, max_tree_depth):
+def slice_nodes(nodes, root_id, max_graph_depth):
 
-    def slice_nodes_recursive(nodes, node_id, id_to_slices, max_tree_depth):
-        if max_tree_depth == 0 or node_id in id_to_slices:
+    def slice_nodes_recursive(nodes, node_id, id_to_slices, max_graph_depth):
+        if max_graph_depth == 0 or node_id in id_to_slices:
             return
         if node_id in nodes:
             node = nodes[node_id]
@@ -60,11 +60,11 @@ def slice_nodes(nodes, root_id, max_tree_depth):
                 slices = children.slice(slicer)
                 id_to_slices[node_id] = slices
                 if not node.is_hidden_node():
-                    max_tree_depth -= 1
+                    max_graph_depth -= 1
                 for index in slices:
-                    slice_nodes_recursive(nodes, id(children[index]), id_to_slices, max_tree_depth)
+                    slice_nodes_recursive(nodes, id(children[index]), id_to_slices, max_graph_depth)
     id_to_slices = {}
-    slice_nodes_recursive(nodes, root_id, id_to_slices, max_tree_depth)
+    slice_nodes_recursive(nodes, root_id, id_to_slices, max_graph_depth)
     return id_to_slices
 
 # --------------------------------------------------------------------------------------------
@@ -175,7 +175,7 @@ def build_graph(graphviz_graph, nodes, root_id, id_to_slices):
 def memory_to_nodes(data):
     nodes, root_id = read_nodes(data)
     #print('nodes:',nodes,'root_id:',root_id)
-    id_to_slices = slice_nodes(nodes, root_id, config.max_tree_depth)
+    id_to_slices = slice_nodes(nodes, root_id, config.max_graph_depth)
     #print('id_to_slices:',id_to_slices)
     id_to_slices = add_missing_edges(nodes, id_to_slices, config.max_missing_edges)
     #print('id_to_slices:',id_to_slices)

{memory_graph-0.3.10 → memory_graph-0.3.11}/memory_graph/test.py

@@ -214,7 +214,7 @@ class BinTree:
 
 def test_missing_edges(fun):
     random.seed(0)
-    config.max_tree_depth = 7
+    config.max_graph_depth = 7
     config.max_missing_edges = 5
     tree = BinTree()
     last_node = None

memory_graph-0.3.11/memory_graph/test_max_graph_depth.py

@@ -0,0 +1,27 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
+import memory_graph as mg
+
+def build_nested_list(depth = 15):
+    first = [1,2]
+    last = first
+    if depth>0:
+        first2, last = build_nested_list(depth-1)
+        first.append(first2)
+    return first, last
+
+first,last = build_nested_list(15)
+for i in range(20):
+    last.append('X')
+
+child = ('who', 'are', 'my', 'parents?')
+last[4] = child
+last[5] = child
+last[6] = child
+last[7] = child
+last[8] = child
+
+mg.show([first,child])
+#mg.show([first])

{memory_graph-0.3.10 → memory_graph-0.3.11/memory_graph.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.10
+Version: 0.3.11
 Summary: Draws a graph of your data to analyze its structure.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
@@ -171,7 +171,7 @@ mg.render(locals(), 'mutable2.png')
 |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
 | mutable1.png | mutable2.png |
 
-One practical reason why Python makes the distinction between mutable and immutable types is that a value of a mutable type can be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much, or are small which makes copying less of a concern.
+One practical reason why Python makes the distinction between mutable and immutable types is that a value of a mutable type can be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much, or are small making copying less of a concern.
 
 ### Copying ###
 Python offers three different "copy" options that we will demonstrate using a nested list:
@@ -337,6 +337,8 @@ The ```mg.get_call_stack()``` doesn't work well in *watch* context in most debug
 | **Visual Studio Code** | `mg.get_call_stack_vscode()` |
 | **Pycharm** | `mg.get_call_stack_pycharm()` |
 
+![debug_vscode.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debug_vscode.png)
+
 #### Other Debuggers ####
 For other debuggers, invoke this function within the *watch* context. Then, in the "call_stack.txt" file, identify the slice of functions you wish to include in the call stack.
 ```
@@ -508,8 +510,8 @@ for i in range(n):
 ## Configuration ##
 Different aspects of memory_graph can be configured. The default configuration is reset by importing 'memory_graph.config_default'.
 
-- ***mg.config.max_tree_depth*** : int
-  - The maxium depth of the graph. A `★` symbol indictes where the graph is cut short.
+- ***mg.config.max_graph_depth*** : int
+  - The maxium depth of the graph with default value 12. A `✂` (scissor) symbol indicates where the graph is cut short.
 
 - ***mg.config.max_string_length*** : int
   - The maximum length of strings shown in the graph. Longer strings will be truncated.
@@ -554,7 +556,7 @@ mg.show( locals(),
 Different extensions are available for types from other Python packages. 
 
 ### Numpy ###
-Numpy types `arrray` and `matrix` and `ndarray` can be graphed with "memory_graph.extension_numpy":
+Numpy types `array` and `matrix` and `ndarray` can be graphed with "memory_graph.extension_numpy":
 
 ```python
 import memory_graph as mg
@@ -740,7 +742,7 @@ See for example [jupyter_example.ipynb](https://raw.githubusercontent.com/bterwi
 ## ipython ##
 In ipython `locals()` has additional variables that cause problems in the graph, use `mg.locals_ipython()` to get the local variables with these problematic variables filtered out. Use `mg.get_call_stack_ipython()` to get the whole call stack with these variables filtered out.
 
-Additionally install file [auto_memory_graph.py](https://raw.githubusercontent.com/bterwijn/memory_graph/main/sc/auto_memory_graph.py) in the ipython startup directory:
+Additionally install file [auto_memory_graph.py](https://raw.githubusercontent.com/bterwijn/memory_graph/main/src/auto_memory_graph.py) in the ipython startup directory:
 * Linux/Mac: ~/.ipython/profile_default/startup/
 * Windows: %USERPROFILE%\.ipython\profile_default\startup\
 

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

@@ -0,0 +1,36 @@
+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/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.10 → memory_graph-0.3.11}/setup.py

@@ -11,7 +11,7 @@ long_description_from_readme = (this_directory / "README.md").read_text()
 
 setup(
     name = 'memory_graph',
-    version = '0.3.10',
+    version = '0.3.11',
     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.10/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.10/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.10/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.10/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.10/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.10/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.10/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.10/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.10/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.10/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")

memory_graph-0.3.10/images/extension_pandas.py

@@ -1,17 +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 pandas as pd
-import memory_graph.extension_pandas
-
-series = pd.Series( [i for i in range(20)] )
-dataframe1 = pd.DataFrame({  "calories": [420, 380, 390],
-                             "duration": [50, 40, 45] })
-dataframe2 = pd.DataFrame({  'Name'   : [ 'Tom', 'Anna', 'Steve', 'Lisa'],
-                             'Age'    : [    28,     34,      29,     42],
-                             'Length' : [  1.70,   1.66,    1.82,   1.73] },
-                            index=['one', 'two', 'three', 'four']) # with row names
-
-mg.render( locals(), "extension_pandas.png")