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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.8
+Version: 0.3.10
 Summary: Draws a graph of your data to analyze its structure.
 Home-page: https://github.com/bterwijn/memory_graph
 Author: Bas Terwijn
@@ -91,6 +91,7 @@ mg.render(data, "my_graph.pdf")
 mg.render(data, "my_graph.svg")
 mg.render(data, "my_graph.png")
 mg.render(data, "my_graph.gv") # Graphviz DOT file
+mg.render(data) # renders to 'mg.render_filename' with default value: 'memory_graph.pdf'
 ```
 
 # Chapters #
@@ -111,6 +112,10 @@ mg.render(data, "my_graph.gv") # Graphviz DOT file
 
 [Jupyter Notebook](#jupyter-notebook)
 
+[ipython](#ipython)
+
+[In the Browser](#in-the-browser)
+
 [Troubleshooting](#troubleshooting)
 
 
@@ -151,7 +156,7 @@ mg.render(locals(), 'immutable2.png')
 
 
 ### Mutable Type ###
-With mutable types the result is different. In the code below variable `a` and `b` both reference the same `list` value [4, 3, 2]. A `list` is a mutable type and therefore when we change variable `a` its value **can** be mutated in place and thus `a` and `b` both reference the same new value afterwards. Thus changing `a` also changes `b` and vice versa. Sometimes we want this but other times we don't and then we will have to make a copy so that `b` is independent from `a`.
+With mutable types the result is different. In the code below variable `a` and `b` both reference the same `list` value [4, 3, 2]. A `list` is a mutable type and therefore when we change variable `a` its value **can** be mutated in place and thus `a` and `b` both reference the same new value afterwards. Thus changing `a` also changes `b` and vice versa. Sometimes we want this but other times we don't and then we will have to make a copy so that `a` and `b` are independent.
 
 ```python
 import memory_graph as mg
@@ -166,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 could be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much or are smaller, 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 which makes copying less of a concern.
 
 ### Copying ###
 Python offers three different "copy" options that we will demonstrate using a nested list:
@@ -219,7 +224,7 @@ mg.show(locals())
 
 
 ## Call Stack ##
-The `mg.get_call_stack()` function retrieves the entire call stack, including the local variables for each function on the stack. This enables us to visualize the local variables across all active functions simultaneously. Then by examining the graph, we can determine whether any local variables from different functions on the call stack share data. For instance, consider the function `add_one()` which adds the value `1` to each of its parameters, `a`, `b`, and `c`.
+The `mg.get_call_stack()` function retrieves the entire call stack, including the local variables for each function on the stack. This enables us to visualize the local variables across all active functions simultaneously. Then by examining the graph, we can determine whether any local variables from different functions on the call stack share data. For instance, consider the function `add_one()` which adds the value `1` to each of its parameters `a`, `b`, and `c`.
 
 ```python
 import memory_graph as mg
@@ -250,10 +255,18 @@ This is because `b` is of immutable type 'tuple' so its value gets copied automa
 It is often helpful to temporarily block program execution to inspect the graph. For this, you can use the `mg.block()` function:
 
 ```python
-mg.block(fun, arg1, arg2, ..., loc=True) 
+mg.block(fun, arg1, arg2, ...) 
 ```
 
-This function first executes `fun(arg1, arg2, ...)`, then prints the current source location in the program, and blocks execution until the <Enter> key is pressed. To skip printing the source location, set `loc=False`.
+This function:
+* first executes `fun(arg1, arg2, ...)`
+* then prints the current source location in the program
+* then blocks execution until the <Enter> key is pressed
+* finally returns the value of the `fun()` call
+
+to change it's behavior:
+* Set `mg.block_prints_location = False` to skip printing the source location.
+* Set `mg.press_enter_message = None` to skip printing "Press <Enter> to continue...".
 
 ### Recursion ###
 The call stack is also helpful to visualize how recursion works. Here we use `mg.block()` to show each step of how recursively ```factorial(3)``` is computed:
@@ -336,12 +349,20 @@ mg.get_call_stack_after_up_to(after_function, up_to_function="<module>")
 
 ### Debugging without Debugger Tool ###
 
-To simplify debugging without a debugger tool, we offer these blocking alias functions that you can insert into your code at a specific point to visualize a graph:
+To simplify debugging without a debugger tool, we offer these alias functions that you can insert into your code at the point where you want to visualize a graph:
 
 | alias | purpose | function call |
 |:---|:---|:---|
-| `mg.l()` | graph **l**ocal variables and block | `mg.block(mg.show, locals())` |
-| `mg.s()` | graph the call **s**tack and block | `mg.block(mg.show, mg.get_call_stack())` |
+| `mg.sl()` | **s**how **l**ocal variables | `mg.show(locals())` |
+| `mg.ss()` | **s**how the call **s**tack | `mg.show(mg.get_call_stack())` |
+| `mg.bsl()` | **b**lock after **s**howing **l**ocal variables | `mg.block(mg.show, locals())` |
+| `mg.bss()` | **b**lock after **s**howing the call **s**tack | `mg.block(mg.show, mg.get_call_stack())` |
+| `mg.rl()` | **r**ender **l**ocal variables | `mg.render(locals())` |
+| `mg.rs()` | **r**ender the call **s**tack | `mg.render(mg.get_call_stack())` |
+| `mg.brl()` | **b**lock after **r**endering **l**ocal variables | `mg.block(mg.render, locals())` |
+| `mg.brs()` | **b**lock after **r**endering the call **s**tack | `mg.block(mg.render, mg.get_call_stack())` |
+| `mg.l()` | same as `mg.bsl()` |  |
+| `mg.s()` | same as `mg.bss()` |  |
 
 For example, executing this program:
 
@@ -353,7 +374,7 @@ squares_collector = []
 for i in range(1, 6):
     squares.append(i**2)
     squares_collector.append(squares.copy())
-    mg.l() # graph local variables
+    mg.l() # block after showing local variables
 ```
 and pressing &lt;Enter&gt; a number of times, results in:
 
@@ -568,7 +589,7 @@ mg.show(locals())
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
 
 ## Introspection ##
-This section is likely to change. Sometimes the introspection fails or is not as desired. For example the `bintrees.avltree.Node` object doesn't show any attributes in the graph below:
+This section is likely to change. Sometimes the introspection fails or is not as desired. For example the `bintrees.avltree.Node` object doesn't show any attributes in the graph below.
 
 ```python
 import memory_graph as mg
@@ -587,7 +608,7 @@ mg.show(locals())
 
 
 ### dir() ###
-A usefull start is to give it some color, show the list of all its attributes using `dir()`, and setting an empty Slicer to see the attribute list in full.
+A useful start is to give it some color, show the list of all its attributes using `dir()`, and setting an empty Slicer to see the attribute list in full.
 
 ```python
 import memory_graph as mg
@@ -609,9 +630,9 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_dir.png)
 
-Next figure out what are the attributes you want to graph and choose a Node type, there are four options.
+Next figure out what are the attributes you want to graph and choose a Node type, there are four options:
 
-### 1 Node_Base ###
+### 1) Node_Base ###
 Node_base is a leaf node (with no children) and shows just a single value.
 ```python
 import memory_graph as mg
@@ -631,7 +652,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_base.png)
 
-### 2 Node_Linear ###
+### 2) Node_Linear ###
 Node_Linear shows all the values in a line like a list.
 ```python
 import memory_graph as mg
@@ -655,7 +676,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_linear.png)
 
-### 3 Node_Key_Value ###
+### 3) Node_Key_Value ###
 Node_Key_Value shows key-value pairs like a dictionary. Note the required `items()` call at the end.
 ```python
 import memory_graph as mg
@@ -679,7 +700,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_key_value.png)
 
-### 4 Node_Table ###
+### 4) Node_Table ###
 Node_Table shows all the values as a table.
 ```python
 import memory_graph as mg
@@ -716,6 +737,19 @@ 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).
 ![jupyter_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/jupyter_example.png)
 
+## 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:
+* Linux/Mac: ~/.ipython/profile_default/startup/
+* Windows: %USERPROFILE%\.ipython\profile_default\startup\
+
+Then after starting 'ipython' call function `mg_switch()` to turn on/off the automatic visualization of local variables after each command.
+![ipyton.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/ipython.png)
+
+## In the Browser ##
+We can run memory_graph in the browser: <a href="https://bterwijn.github.io/memory_graph/src/pyodide.html" target="_blank">Pyodide Example</a>
+![pyodide.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/pyodide.png)
 
 ## Troubleshooting ##
 

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

@@ -72,6 +72,7 @@ mg.render(data, "my_graph.pdf")
 mg.render(data, "my_graph.svg")
 mg.render(data, "my_graph.png")
 mg.render(data, "my_graph.gv") # Graphviz DOT file
+mg.render(data) # renders to 'mg.render_filename' with default value: 'memory_graph.pdf'
 ```
 
 # Chapters #
@@ -92,6 +93,10 @@ mg.render(data, "my_graph.gv") # Graphviz DOT file
 
 [Jupyter Notebook](#jupyter-notebook)
 
+[ipython](#ipython)
+
+[In the Browser](#in-the-browser)
+
 [Troubleshooting](#troubleshooting)
 
 
@@ -132,7 +137,7 @@ mg.render(locals(), 'immutable2.png')
 
 
 ### Mutable Type ###
-With mutable types the result is different. In the code below variable `a` and `b` both reference the same `list` value [4, 3, 2]. A `list` is a mutable type and therefore when we change variable `a` its value **can** be mutated in place and thus `a` and `b` both reference the same new value afterwards. Thus changing `a` also changes `b` and vice versa. Sometimes we want this but other times we don't and then we will have to make a copy so that `b` is independent from `a`.
+With mutable types the result is different. In the code below variable `a` and `b` both reference the same `list` value [4, 3, 2]. A `list` is a mutable type and therefore when we change variable `a` its value **can** be mutated in place and thus `a` and `b` both reference the same new value afterwards. Thus changing `a` also changes `b` and vice versa. Sometimes we want this but other times we don't and then we will have to make a copy so that `a` and `b` are independent.
 
 ```python
 import memory_graph as mg
@@ -147,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 could be large, making it inefficient to copy each time we change it. Immutable values generally don't need to change as much or are smaller, 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 which makes copying less of a concern.
 
 ### Copying ###
 Python offers three different "copy" options that we will demonstrate using a nested list:
@@ -200,7 +205,7 @@ mg.show(locals())
 
 
 ## Call Stack ##
-The `mg.get_call_stack()` function retrieves the entire call stack, including the local variables for each function on the stack. This enables us to visualize the local variables across all active functions simultaneously. Then by examining the graph, we can determine whether any local variables from different functions on the call stack share data. For instance, consider the function `add_one()` which adds the value `1` to each of its parameters, `a`, `b`, and `c`.
+The `mg.get_call_stack()` function retrieves the entire call stack, including the local variables for each function on the stack. This enables us to visualize the local variables across all active functions simultaneously. Then by examining the graph, we can determine whether any local variables from different functions on the call stack share data. For instance, consider the function `add_one()` which adds the value `1` to each of its parameters `a`, `b`, and `c`.
 
 ```python
 import memory_graph as mg
@@ -231,10 +236,18 @@ This is because `b` is of immutable type 'tuple' so its value gets copied automa
 It is often helpful to temporarily block program execution to inspect the graph. For this, you can use the `mg.block()` function:
 
 ```python
-mg.block(fun, arg1, arg2, ..., loc=True) 
+mg.block(fun, arg1, arg2, ...) 
 ```
 
-This function first executes `fun(arg1, arg2, ...)`, then prints the current source location in the program, and blocks execution until the <Enter> key is pressed. To skip printing the source location, set `loc=False`.
+This function:
+* first executes `fun(arg1, arg2, ...)`
+* then prints the current source location in the program
+* then blocks execution until the <Enter> key is pressed
+* finally returns the value of the `fun()` call
+
+to change it's behavior:
+* Set `mg.block_prints_location = False` to skip printing the source location.
+* Set `mg.press_enter_message = None` to skip printing "Press <Enter> to continue...".
 
 ### Recursion ###
 The call stack is also helpful to visualize how recursion works. Here we use `mg.block()` to show each step of how recursively ```factorial(3)``` is computed:
@@ -317,12 +330,20 @@ mg.get_call_stack_after_up_to(after_function, up_to_function="<module>")
 
 ### Debugging without Debugger Tool ###
 
-To simplify debugging without a debugger tool, we offer these blocking alias functions that you can insert into your code at a specific point to visualize a graph:
+To simplify debugging without a debugger tool, we offer these alias functions that you can insert into your code at the point where you want to visualize a graph:
 
 | alias | purpose | function call |
 |:---|:---|:---|
-| `mg.l()` | graph **l**ocal variables and block | `mg.block(mg.show, locals())` |
-| `mg.s()` | graph the call **s**tack and block | `mg.block(mg.show, mg.get_call_stack())` |
+| `mg.sl()` | **s**how **l**ocal variables | `mg.show(locals())` |
+| `mg.ss()` | **s**how the call **s**tack | `mg.show(mg.get_call_stack())` |
+| `mg.bsl()` | **b**lock after **s**howing **l**ocal variables | `mg.block(mg.show, locals())` |
+| `mg.bss()` | **b**lock after **s**howing the call **s**tack | `mg.block(mg.show, mg.get_call_stack())` |
+| `mg.rl()` | **r**ender **l**ocal variables | `mg.render(locals())` |
+| `mg.rs()` | **r**ender the call **s**tack | `mg.render(mg.get_call_stack())` |
+| `mg.brl()` | **b**lock after **r**endering **l**ocal variables | `mg.block(mg.render, locals())` |
+| `mg.brs()` | **b**lock after **r**endering the call **s**tack | `mg.block(mg.render, mg.get_call_stack())` |
+| `mg.l()` | same as `mg.bsl()` |  |
+| `mg.s()` | same as `mg.bss()` |  |
 
 For example, executing this program:
 
@@ -334,7 +355,7 @@ squares_collector = []
 for i in range(1, 6):
     squares.append(i**2)
     squares_collector.append(squares.copy())
-    mg.l() # graph local variables
+    mg.l() # block after showing local variables
 ```
 and pressing &lt;Enter&gt; a number of times, results in:
 
@@ -549,7 +570,7 @@ mg.show(locals())
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
 
 ## Introspection ##
-This section is likely to change. Sometimes the introspection fails or is not as desired. For example the `bintrees.avltree.Node` object doesn't show any attributes in the graph below:
+This section is likely to change. Sometimes the introspection fails or is not as desired. For example the `bintrees.avltree.Node` object doesn't show any attributes in the graph below.
 
 ```python
 import memory_graph as mg
@@ -568,7 +589,7 @@ mg.show(locals())
 
 
 ### dir() ###
-A usefull start is to give it some color, show the list of all its attributes using `dir()`, and setting an empty Slicer to see the attribute list in full.
+A useful start is to give it some color, show the list of all its attributes using `dir()`, and setting an empty Slicer to see the attribute list in full.
 
 ```python
 import memory_graph as mg
@@ -590,9 +611,9 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_dir.png)
 
-Next figure out what are the attributes you want to graph and choose a Node type, there are four options.
+Next figure out what are the attributes you want to graph and choose a Node type, there are four options:
 
-### 1 Node_Base ###
+### 1) Node_Base ###
 Node_base is a leaf node (with no children) and shows just a single value.
 ```python
 import memory_graph as mg
@@ -612,7 +633,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_base.png)
 
-### 2 Node_Linear ###
+### 2) Node_Linear ###
 Node_Linear shows all the values in a line like a list.
 ```python
 import memory_graph as mg
@@ -636,7 +657,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_linear.png)
 
-### 3 Node_Key_Value ###
+### 3) Node_Key_Value ###
 Node_Key_Value shows key-value pairs like a dictionary. Note the required `items()` call at the end.
 ```python
 import memory_graph as mg
@@ -660,7 +681,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/avltree_key_value.png)
 
-### 4 Node_Table ###
+### 4) Node_Table ###
 Node_Table shows all the values as a table.
 ```python
 import memory_graph as mg
@@ -697,6 +718,19 @@ 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).
 ![jupyter_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/jupyter_example.png)
 
+## 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:
+* Linux/Mac: ~/.ipython/profile_default/startup/
+* Windows: %USERPROFILE%\.ipython\profile_default\startup\
+
+Then after starting 'ipython' call function `mg_switch()` to turn on/off the automatic visualization of local variables after each command.
+![ipyton.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/ipython.png)
+
+## In the Browser ##
+We can run memory_graph in the browser: <a href="https://bterwijn.github.io/memory_graph/src/pyodide.html" target="_blank">Pyodide Example</a>
+![pyodide.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/pyodide.png)
 
 ## Troubleshooting ##
 

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/add_one.py

@@ -1,3 +1,7 @@
+# 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):

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/avltree.py

@@ -1,3 +1,7 @@
+# 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
 

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/bin_tree.py

@@ -1,3 +1,7 @@
+# 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

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/copies.py

@@ -1,3 +1,7 @@
+# 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
 

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/copy_method.py

@@ -1,3 +1,7 @@
+# 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
 

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/debugging.py

@@ -1,3 +1,7 @@
+# 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

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/extension_numpy.py

@@ -1,3 +1,7 @@
+# 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

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/extension_pandas.py

@@ -1,3 +1,7 @@
+# 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

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/factorial.py

@@ -1,3 +1,7 @@
+# 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

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/hash_set.py

@@ -1,3 +1,7 @@
+# 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

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/highlight.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 import memory_graph as mg
 from memory_graph.slicer import Slicer
 

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/immutable.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 import memory_graph as mg
 
 a = (4, 3, 2)

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/linked_list.py

@@ -1,3 +1,7 @@
+# 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

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/many_types.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 import memory_graph as mg
 
 class MyClass:

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/mutable.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 import memory_graph as mg
 
 a = [4, 3, 2]

{memory_graph-0.3.8 → memory_graph-0.3.10}/images/power_set.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 import memory_graph as mg
 
 image = 1

{memory_graph-0.3.8 → memory_graph-0.3.10}/install.txt

@@ -14,10 +14,10 @@ pip install --upgrade .
 
 
 # ===== prepare packages for upload
-# - increase version number in setup.py and memory_graph/__init__.py before each upload
+# - increase version number in: setup.py memory_graph/__init__.py 
 # - update images:
 cd images; bash create_images.sh; cd ..
-# - git commit -am "version X.X.X"
+# - git commit -am "version X.X.X" && git push
 rm -f ./dist/*
 python setup.py check
 python setup.py sdist