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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: memory_graph
-Version: 0.3.8
+Version: 0.3.9
 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' (default value: 'memory_graph.pdf')
 ```
 
 # Chapters #
@@ -250,10 +251,12 @@ 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, and blocks execution until the <Enter> key is pressed. 
+Set `mg.block_shows_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 +339,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 +364,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 +579,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 +598,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

{memory_graph-0.3.8 → memory_graph-0.3.9}/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' (default value: 'memory_graph.pdf')
 ```
 
 # Chapters #
@@ -231,10 +232,12 @@ 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, and blocks execution until the <Enter> key is pressed. 
+Set `mg.block_shows_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 +320,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 +345,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 +560,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 +579,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

{memory_graph-0.3.8 → memory_graph-0.3.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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.9}/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

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/__init__.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.memory_to_nodes as memory_to_nodes
 import memory_graph.config as config
 import memory_graph.config_default
@@ -9,8 +13,11 @@ import sys
 
 import graphviz
 
-__version__ = "0.3.08"
+__version__ = "0.3.09"
 __author__ = 'Bas Terwijn'
+render_filename = 'memory_graph.pdf'
+block_shows_location = True
+press_enter_message = "Press <Enter> to continue..."
 
 def get_source_location(stack_index):
     """ Helper function to get the source location of the stack with 'stack_index' of the call stack. """
@@ -18,27 +25,24 @@ def get_source_location(stack_index):
     filename= frameInfo.filename
     line_nr= frameInfo.lineno
     function = frameInfo.function
-    return f'blocked at {filename}:{line_nr} function:"{function}"'
+    return f'{filename}:{line_nr} function:"{function}"'
 
 def block(fun=None, *args, **kwargs):
     """
     Calls the given function `fun` with specified arguments and keyword arguments,
     waits for the user to press Enter, and returns the result of `fun`.
     """
-    loc=True
-    stack_index=2
-    if 'loc' in kwargs:
-        loc = kwargs['loc']
-        del kwargs['loc']
     if 'stack_index' in kwargs:
         stack_index = kwargs['stack_index']
         del kwargs['stack_index']
     result = None
     if callable(fun):
         result = fun(*args, **kwargs)
-    if loc:
-        print(get_source_location(stack_index),end=', ')
-    input("Press <Enter> to continue...")
+    if memory_graph.block_shows_location:
+        print('blocked at ' + get_source_location(stack_index), end=', ')
+    if memory_graph.press_enter_message:
+        print(memory_graph.press_enter_message)
+    input()
     return result
 
 def block_deprecated_message():
@@ -68,38 +72,96 @@ def render(data, outfile=None, block=False,
                  colors = None,
                  vertical_orientations = None,
                  slicers = None):
-    """ Renders the graph of 'data' to 'output_filename' and optionally blocks. """
+    """ Renders the graph of 'data' to 'outfile' and optionally blocks. """
+    if outfile is None:
+        outfile = memory_graph.render_filename
     graph = create_graph(data, colors, vertical_orientations, slicers)
-    filename = outfile if outfile else graph.filename+".pdf"
-    graph.render(outfile=filename)
+    graph.render(outfile=outfile)
     if block:
         block_deprecated_message()
 
-def l(loc=True, stack_index=2, colors = None, vertical_orientations = None, slicers = None):
+# ------------ aliases
+
+def sl(stack_index=2, colors = None, vertical_orientations = None, slicers = None):
+    """ 
+    Shows the graph of locals() and blocks. 
+    """
+    data = get_locals_from_calling_frame(stack_index=stack_index)
+    memory_graph.show(data, colors=colors, vertical_orientations=vertical_orientations, slicers=slicers)
+    
+def ss(stack_index=2, colors = None, vertical_orientations = None, slicers = None):
+    """ 
+    Shows the graph of mg.get_call_stack() and blocks. 
+    """
+    data = get_call_stack(stack_index=stack_index)
+    memory_graph.show(data, colors=colors, vertical_orientations=vertical_orientations, slicers=slicers)
+
+def bsl(stack_index=2, colors = None, vertical_orientations = None, slicers = None):
+    """ 
+    Shows the graph of locals() and blocks. 
+    """
+    data = get_locals_from_calling_frame(stack_index=stack_index)
+    memory_graph.block(memory_graph.show, data, stack_index=stack_index+1, block=False, 
+                       colors=colors, vertical_orientations=vertical_orientations, slicers=slicers)
+    
+def bss(stack_index=2, colors = None, vertical_orientations = None, slicers = None):
+    """ 
+    Shows the graph of mg.get_call_stack() and blocks. 
+    """
+    data = get_call_stack(stack_index=stack_index)
+    memory_graph.block(memory_graph.show, data, stack_index=stack_index+1, block=False, 
+                       colors=colors, vertical_orientations=vertical_orientations, slicers=slicers)
+
+def rl(stack_index=2, colors = None, vertical_orientations = None, slicers = None):
+    """ 
+    Shows the graph of locals() and blocks. 
+    """
+    data = get_locals_from_calling_frame(stack_index=stack_index)
+    memory_graph.render(data, block=False, colors=colors, vertical_orientations=vertical_orientations, slicers=slicers)
+    
+def rs(stack_index=2, colors = None, vertical_orientations = None, slicers = None):
+    """ 
+    Shows the graph of mg.get_call_stack() and blocks. 
+    """
+    data = get_call_stack(stack_index=stack_index)
+    memory_graph.render(data, block=False, colors=colors, vertical_orientations=vertical_orientations, slicers=slicers)
+
+def brl(stack_index=2, colors = None, vertical_orientations = None, slicers = None):
     """ 
-    Shows the graph of 'data' or the locals of the calling frame, and blocks. 
+    Shows the graph of locals() and blocks. 
     """
     data = get_locals_from_calling_frame(stack_index=stack_index)
-    memory_graph.block(memory_graph.show, data, loc=loc, stack_index=stack_index+1, block=False, 
+    memory_graph.block(memory_graph.render, data, stack_index=stack_index+1, block=False, 
                        colors=colors, vertical_orientations=vertical_orientations, slicers=slicers)
     
-def s(loc=True, stack_index=2, colors = None, vertical_orientations = None, slicers = None):
+def brs(stack_index=2, colors = None, vertical_orientations = None, slicers = None):
     """ 
-    Shows the graph of and optionally prints the call stack, and optionally blocks.
+    Shows the graph of mg.get_call_stack() and blocks. 
     """
     data = get_call_stack(stack_index=stack_index)
-    memory_graph.block(memory_graph.show, data, loc=loc, stack_index=stack_index+1, block=False, 
+    memory_graph.block(memory_graph.render, data, stack_index=stack_index+1, block=False, 
                        colors=colors, vertical_orientations=vertical_orientations, slicers=slicers)
 
-# ------------ locals
+def l(stack_index=2, colors = None, vertical_orientations = None, slicers = None):
+    """ 
+    Shows the graph of locals() and blocks. 
+    """
+    bsl(stack_index=stack_index+1, colors=colors, vertical_orientations=vertical_orientations, slicers=slicers)
+    
+def s(stack_index=2, colors = None, vertical_orientations = None, slicers = None):
+    """ 
+    Shows the graph of mg.get_call_stack() and blocks. 
+    """
+    bss(stack_index=stack_index+1, colors=colors, vertical_orientations=vertical_orientations, slicers=slicers)
+
+
+# ------------ call stack
 
 def get_locals_from_calling_frame(stack_index=1):
     """ Helper function to get locals of the stack with 'stack_inex' of the call stack. """
     frameInfo = inspect.stack()[stack_index] # get frameInfo of calling frame
     return frameInfo.frame.f_locals
 
-# ------------ call stack
-
 def stack_frames_to_dict(frames):
     """ Returns a dictionary representing the data on the call stack. 
     Each key is the stack level and function name, each value is the locals of the frame at that level. 

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/config.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 """ Configuration file for the graph visualizer. The configuration values are set later by the 'config_default.py' file. """
 
 max_tree_depth = None

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/config_default.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 """ Sets the default configuration values for the memory graph. """
 from memory_graph.node_base      import Node_Base
 from memory_graph.node_linear    import Node_Linear

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/config_helpers.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 """ This module provides helper functions to access the configuration of the memory graph. """
 from memory_graph.slicer import Slicer
 

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/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
+
 """ Extension to add the memory graph configuration for Numpy types. """
 from memory_graph.node_linear import Node_Linear
 from memory_graph.node_table import Node_Table

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/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
+
 """ Extension to add the memory graph configuration for Pandas type. """
 from memory_graph.node_linear import Node_Linear
 from memory_graph.node_table import Node_Table

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/html_table.py

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

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/list_view.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 
 class List_View:
     def __init__(self, base_list, begin, end):

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/memory_to_nodes.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 from memory_graph.node_base import Node_Base
 from memory_graph.node_linear import Node_Linear
 from memory_graph.node_key_value import Node_Key_Value

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/node_base.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.utils as utils
 import memory_graph.config as config
 import memory_graph.config_helpers as config_helpers

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/node_key_value.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 from memory_graph.node_base import Node_Base
 from memory_graph.sequence import Sequence1D
 

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/node_linear.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 from memory_graph.node_base import Node_Base
 from memory_graph.sequence import Sequence1D
 

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/node_table.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 from memory_graph.node_base import Node_Base
 from memory_graph.sequence import Sequence2D
 from memory_graph.list_view import List_View

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/sequence.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 from abc import ABC, abstractmethod
 
 from memory_graph.slices import Slices1D, Slices2D

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/slicer.py

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

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/slices.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 from abc import ABC, abstractmethod
 
 import bisect

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/slices_iterator.py

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

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/slices_table_iterator.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 from abc import ABC, abstractmethod
 
 class Slices_Table_Iterator(ABC):

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/test.py

@@ -1,3 +1,7 @@
+# This file is part of memory_graph.
+# Copyright (c) 2023, Bas Terwijn.
+# SPDX-License-Identifier: BSD-2-Clause
+
 """ Some test data to make memory graph of for test purposes. """
 import memory_graph.utils as utils
 import memory_graph.config as config

{memory_graph-0.3.8 → memory_graph-0.3.9}/memory_graph/test_memory_graph.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
 
 import memory_graph.test as test