memory-graph 0.3.62__tar.gz → 0.3.64__tar.gz

{memory_graph-0.3.62/memory_graph.egg-info → memory_graph-0.3.64}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.62
+Version: 0.3.64
 Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -117,6 +117,10 @@ A better way to understand what values are shared is to draw a graph using [memo
 
 [Call Stack](#call-stack)
 
+[Data Model Exercises](#data-model-exercises)
+
+[Block](#block)
+
 [Debugging](#debugging)
 
 [Data Structure Examples](#data-structure-examples)
@@ -375,11 +379,11 @@ Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=ht
 
 The effect of calling `add_one()` is that `b[0]` increases by 1, while `a` is unaffected.
 
-## Exercises ##
+# Data Model Exercises #
 
 Now is a good time to practice with Python Data Model concepts. Here are [some exercises](https://github.com/bterwijn/memory_graph_videos/blob/main/exercises/exercises.md) on references, mutability, copies, and function calls.
 
-## Block ##
+# Block #
 It is often helpful to temporarily block program execution to inspect the graph. For this we can use the `mg.block()` function:
 
 ```python
@@ -629,7 +633,7 @@ for i in range(n):
 Here we show values being inserted in a Binary Tree in Visual Studio Code. When inserting the last value '29' we "Step Into" the code to show the recursive implementation.
 ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
 
-Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play).
+See it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play) or see the more advanced [Multiway Tree](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/multiway_tree.py&breakpoints=19,33&continues=1&timestep=0.2&play) with more than two children per node, making the tree less deep and more efficient.
 
 ## Hash Set ##
 ```python
@@ -969,9 +973,10 @@ print('index:', index, 'data[index]:', data[index])
 Arguably the visualization is then more clear when we show a List_View object as an actual sublist using a Node_linear node:
 
 ```python
-mg.config.type_to_color[List_View] = 'hotpink'
-mg.config.type_to_node[List_View] = lambda data: mg.Node_Linear(data,
-                                                    data.lst[data.begin:data.end])
+mg.config.type_to_node[List_View] = (lambda l: mg.Node_Linear(l,
+    [v if l.begin <= i < l.end else '' for i, v in enumerate(l.lst)]
+    if hasattr(l, 'end') else [])
+)
 ```
 ![bin_search_linear.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_search_linear.png)
 

{memory_graph-0.3.62 → memory_graph-0.3.64}/README.md

@@ -97,6 +97,10 @@ A better way to understand what values are shared is to draw a graph using [memo
 
 [Call Stack](#call-stack)
 
+[Data Model Exercises](#data-model-exercises)
+
+[Block](#block)
+
 [Debugging](#debugging)
 
 [Data Structure Examples](#data-structure-examples)
@@ -355,11 +359,11 @@ Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=ht
 
 The effect of calling `add_one()` is that `b[0]` increases by 1, while `a` is unaffected.
 
-## Exercises ##
+# Data Model Exercises #
 
 Now is a good time to practice with Python Data Model concepts. Here are [some exercises](https://github.com/bterwijn/memory_graph_videos/blob/main/exercises/exercises.md) on references, mutability, copies, and function calls.
 
-## Block ##
+# Block #
 It is often helpful to temporarily block program execution to inspect the graph. For this we can use the `mg.block()` function:
 
 ```python
@@ -609,7 +613,7 @@ for i in range(n):
 Here we show values being inserted in a Binary Tree in Visual Studio Code. When inserting the last value '29' we "Step Into" the code to show the recursive implementation.
 ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
 
-Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play).
+See it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play) or see the more advanced [Multiway Tree](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/multiway_tree.py&breakpoints=19,33&continues=1&timestep=0.2&play) with more than two children per node, making the tree less deep and more efficient.
 
 ## Hash Set ##
 ```python
@@ -949,9 +953,10 @@ print('index:', index, 'data[index]:', data[index])
 Arguably the visualization is then more clear when we show a List_View object as an actual sublist using a Node_linear node:
 
 ```python
-mg.config.type_to_color[List_View] = 'hotpink'
-mg.config.type_to_node[List_View] = lambda data: mg.Node_Linear(data,
-                                                    data.lst[data.begin:data.end])
+mg.config.type_to_node[List_View] = (lambda l: mg.Node_Linear(l,
+    [v if l.begin <= i < l.end else '' for i, v in enumerate(l.lst)]
+    if hasattr(l, 'end') else [])
+)
 ```
 ![bin_search_linear.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_search_linear.png)
 

{memory_graph-0.3.62 → memory_graph-0.3.64}/memory_graph/__init__.py

@@ -2,7 +2,7 @@
 # Copyright (c) 2023, Bas Terwijn.
 # SPDX-License-Identifier: BSD-2-Clause
 
-__version__ = "0.3.62"
+__version__ = "0.3.64"
 __author__ = 'Bas Terwijn'
 
 import memory_graph.memory_to_nodes as memory_to_nodes

{memory_graph-0.3.62 → memory_graph-0.3.64/memory_graph.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.62
+Version: 0.3.64
 Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
 Author-email: Bas Terwijn <bterwijn@gmail.com>
 License-Expression: BSD-2-Clause
@@ -117,6 +117,10 @@ A better way to understand what values are shared is to draw a graph using [memo
 
 [Call Stack](#call-stack)
 
+[Data Model Exercises](#data-model-exercises)
+
+[Block](#block)
+
 [Debugging](#debugging)
 
 [Data Structure Examples](#data-structure-examples)
@@ -375,11 +379,11 @@ Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=ht
 
 The effect of calling `add_one()` is that `b[0]` increases by 1, while `a` is unaffected.
 
-## Exercises ##
+# Data Model Exercises #
 
 Now is a good time to practice with Python Data Model concepts. Here are [some exercises](https://github.com/bterwijn/memory_graph_videos/blob/main/exercises/exercises.md) on references, mutability, copies, and function calls.
 
-## Block ##
+# Block #
 It is often helpful to temporarily block program execution to inspect the graph. For this we can use the `mg.block()` function:
 
 ```python
@@ -629,7 +633,7 @@ for i in range(n):
 Here we show values being inserted in a Binary Tree in Visual Studio Code. When inserting the last value '29' we "Step Into" the code to show the recursive implementation.
 ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
 
-Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play).
+See it in the [Memory Grah Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_tree.py&timestep=0.2&play) or see the more advanced [Multiway Tree](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/multiway_tree.py&breakpoints=19,33&continues=1&timestep=0.2&play) with more than two children per node, making the tree less deep and more efficient.
 
 ## Hash Set ##
 ```python
@@ -969,9 +973,10 @@ print('index:', index, 'data[index]:', data[index])
 Arguably the visualization is then more clear when we show a List_View object as an actual sublist using a Node_linear node:
 
 ```python
-mg.config.type_to_color[List_View] = 'hotpink'
-mg.config.type_to_node[List_View] = lambda data: mg.Node_Linear(data,
-                                                    data.lst[data.begin:data.end])
+mg.config.type_to_node[List_View] = (lambda l: mg.Node_Linear(l,
+    [v if l.begin <= i < l.end else '' for i, v in enumerate(l.lst)]
+    if hasattr(l, 'end') else [])
+)
 ```
 ![bin_search_linear.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_search_linear.png)
 

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

@@ -0,0 +1,39 @@
+LICENSE.txt
+README.md
+pyproject.toml
+setup.py
+memory_graph/__init__.py
+memory_graph/call_stack.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/extension_torch.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_leaf.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.62 → memory_graph-0.3.64}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "memory_graph"
-version = "0.3.62"
+version = "0.3.64"
 description = "Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy."
 authors = [
     {name = "Bas Terwijn", email = "bterwijn@gmail.com"}

memory_graph-0.3.62/MANIFEST.in

@@ -1 +0,0 @@
-recursive-include images/ *

memory_graph-0.3.62/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.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.62/images/avltree.py

@@ -1,42 +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(data, dir(data))
-mg.config.type_to_slicer[bintrees.avltree.Node] = mg.Slicer()
-# mg.render(locals(), 'avltree_dir.png') # stuff changes
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.Node_Leaf(data, f"key:{data.key} value:{data.value}")
-mg.render(locals(), 'avltree_leaf.png')
-
-mg.config.type_to_node[bintrees.avltree.Node] = lambda data: mg.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(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(data,
-                                                                           [[data.key, data.value],
-                                                                            [data.left, data.right]])
-mg.render(locals(), 'avltree_table.png')

memory_graph-0.3.62/images/bin_search.py

@@ -1,40 +0,0 @@
-import memory_graph as mg
-import random
-random.seed(2) # same random numbers each run
-
-class List_View:
-
-    def __init__(self, lst, begin, end):
-        self.lst = lst
-        self.begin = begin
-        self.end = end
-
-    def __getitem__(self, index):
-        return self.lst[index]
-        
-    def get_mid(self):
-        return (self.begin + self.end) // 2
-
-def bin_search(view, value):
-    mid = view.get_mid()
-    if view.begin == mid:
-        mg.render(mg.stack(), 'bin_search.png')
-        mg.config.type_to_color[List_View] = 'hotpink'
-        mg.config.type_to_node[List_View] = lambda data: mg.node_linear.Node_Linear(data,
-                                                            data.lst[data.begin:data.end] )
-        mg.render(mg.stack(), 'bin_search_linear.png')
-        return view.begin
-    if value < view[mid]:
-        return bin_search(List_View(view.lst, view.begin, mid), value)
-    else:
-        return bin_search(List_View(view.lst, mid, view.end), value)
-
-# create sorted list
-n = 15
-data = [random.randrange(1000) for _ in range(n)]
-data.sort()
-
-# search 'value'
-value = data[random.randrange(n)]
-index = bin_search(List_View(data, 0, len(data)), value)
-print('index:', index, 'data[index]:', data[index])

memory_graph-0.3.62/images/bin_tree.py

@@ -1,38 +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 BinTree:
-
-    def __init__(self, value=None, smaller=None, larger=None):
-        self.smaller = smaller
-        self.value = value
-        self.larger = larger
-
-    def add(self, value):
-        if self.value is None:
-            self.value = value
-        elif value < self.value:
-            if self.smaller is None:
-                self.smaller = BinTree(value)
-            else:
-                self.smaller.add(value)
-        else:
-            if self.larger is None:
-                self.larger = BinTree(value)
-            else:
-                self.larger.add(value)
-        if value == 51:
-            mg.render(mg.stack(), f"bin_tree.png")
-            exit(0)
-
-tree = BinTree()
-n = 100
-for i in range(n):
-    value = random.randrange(n)
-    tree.add(value)
-

memory_graph-0.3.62/images/binary.py

@@ -1,14 +0,0 @@
-import memory_graph as mg
-import typing
-mg.config.type_to_horizontal[list] = True  # horizontal lists
-
-def binary(value: int) -> typing.List[int]:
-    mg.render(mg.stack(), 'binary.png', numbered=True)
-    if value == 0:
-        return []
-    quotient, remainder = divmod(value, 2)
-    result = binary(quotient) + [remainder]
-    mg.render(mg.stack(), 'binary.png', numbered=True)
-    return result
-
-print( binary(100) )

memory_graph-0.3.62/images/bitwise_operators.py

@@ -1,39 +0,0 @@
-import memory_graph as mg
-
-class Bits(dict):
-   """ Dictionary subclass that we will configure to show binary representations. """
-
-def twos_complement(x: int, bits: int) -> str:
-    """Return the two's complement bit string of x in `bits` bits."""
-    mask = (1 << bits) - 1
-    return format(x & mask, f"0{bits}b")
-
-# configure memory_graph to show binary representations of values of type Bits
-mg.config.type_to_node[Bits] = lambda x : mg.Node_Table(x,
-   [ ["expression", "decimal", "bin(expression)", "16bit two's complement"] ] +
-   [ [k, f'{v:>10}', f'{bin(v):>19}', twos_complement(v,16)] for k, v in x.items()] )
-mg.config.type_to_slicer[Bits] = (mg.Slicer(), mg.Slicer())  # no slicing
-mg.config.type_to_color[Bits] = 'gold'
-mg.config.fontname = 'Courier' # monospace font
-
-bits = Bits()
-
-# now add some some variables and expressions
-bits['a'] = 1
-bits['b'] = 48
-bits['c'] = 127
-bits['a << 3'] = bits['a'] << 3         # bit shift left by 3
-bits['b >> 3'] = bits['b'] >> 3         # bit shift right by 3
-bits['a | b']  = bits['a'] | bits['b']  # bitwise or
-bits['b & c']  = bits['b'] & bits['c']  # bitwise and
-bits['b ^ c']  = bits['b'] ^ bits['c']  # bitwise exclusive or
-
-# negative numbers, inverse, and two's complement
-bits['d'] = 240
-bits['e'] = -240
-bits['f'] = -241                        # -(d+1)
-bits['~d'] = ~ bits['d']                # inverse -(x+1)
-bits['~e'] = ~ bits['e']                # inverse -(x+1)
-bits['~f'] = ~ bits['f']                # inverse -(x+1)
-
-mg.render(locals(), 'bitwise_operators.png')

memory_graph-0.3.62/images/copy_immutable.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 tuple
-
-# three different ways to make a "copy" of 'a':
-c1 = a
-c2 = copy.copy(a)
-c3 = copy.deepcopy(a)
-
-mg.render(locals(), 'copy_immutable.png')

memory_graph-0.3.62/images/copy_method.py

@@ -1,23 +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 custom_copy(self):
-        """ Copies 'digits' but shares 'letters'. """
-        c = copy.copy(self)
-        c.digits = copy.copy(self.digits)
-        return c
-
-a = My_Class()
-b = a.custom_copy()
-
-mg.render(locals(), 'copy_method.png')

memory_graph-0.3.62/images/copy_mix.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') ) # mix of mutable and immutable
-
-# three different ways to make a "copy" of 'a':
-c1 = a
-c2 = copy.copy(a)
-c3 = copy.deepcopy(a)
-
-mg.render(locals(), 'copy_mix.png')

memory_graph-0.3.62/images/copy_mutable.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(), 'copy_mutable.png')

memory_graph-0.3.62/images/create_gif.sh

@@ -1,27 +0,0 @@
-#!/bin/bash
-#
-# install:
-#
-#   sudo apt install imagemagick
-
-name="$1"
-files=$(ls -v $name*.png | tr '\n' ' ')
-files_gv=$(ls -v $name*.gv | tr '\n' ' ')
-echo "creating gif with:"
-echo "$files"
-
-largest_size=$(identify -format "%H %Wx%H %f\n" $name*.png | sort -nr | head -n1| awk '{print $2}')
-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 -dither None -loop 0 $files $name.gif
-
-if [ "$2" = "-d" ]; then
-    echo "deleting: $files $files_gv"
-    rm $files $files_gv
-fi
-
-echo "done"

memory_graph-0.3.62/images/create_images.sh

@@ -1,47 +0,0 @@
-# intro
-python many_types.py
-
-# debugging
-python debugging.py
-bash create_gif.sh debugging -d
-
-# data model
-python immutable.py
-python mutable.py
-python copy_mutable.py
-python copy_method.py
-python copy_immutable.py
-python copy_mix.py
-python name_rebinding.py
-
-# call stack
-python add_one.py
-python wrap_int.py
-python factorial.py
-bash create_gif.sh factorial -d
-python binary.py
-bash create_gif.sh binary -d
-python power_set.py
-bash create_gif.sh power_set -d
-
-# datastructures
-python linked_list.py
-python bin_tree.py
-python hash_set.py
-
-# configuration
-python not_node_types.py
-
-# introspection
-python avltree.py
-python bin_search.py
-python bitwise_operators.py
-python introspect_depth.py
-python hidden_edges.py
-
-# extensions
-python extension_numpy.py
-python extension_pandas.py
-
-# clean up the graphviz files
-rm *.gv

memory_graph-0.3.62/images/debugging.py

@@ -1,13 +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
-
-squares = []
-squares_collector = []
-for i in range(1,6):
-    squares.append(i**2)
-    squares_collector.append(squares.copy())
-    mg.render(locals(), 'debugging.png', numbered=True)
-mg.render(locals(), 'debugging.png', numbered=True)