PyPI - memory-graph - Versions diffs - 0.3.77__tar.gz → 0.3.79__tar.gz - Mend

memory-graph 0.3.77tar.gz → 0.3.79tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (41) hide show

{memory_graph-0.3.77 → memory_graph-0.3.79}/PKG-INFO RENAMED Viewed

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.77
+Version: 0.3.79
 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
@@ -27,7 +27,7 @@ Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 # Highlights #
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
-Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#breakpoints=8&continues=1&timestep=1.0&play) 👈 now, no installation required!
+Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#breakpoints=8&continues=1&play) 👈 now, no installation required!
 - learn the right **mental model** to think about Python data (references, mutability, shallow vs deep copy)
 - **visualize the structure of your data** to more easily understand and debug any data structure
@@ -35,7 +35,7 @@ Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph
 An example Binary Tree data structure:
 ![bin_tree_vs.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree_vs.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).
+Or see it in the [Memory Graph 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).
 # Videos #
 | [![Quick Intro](https://img.youtube.com/vi/23_bHcr7hqo/0.jpg)](https://www.youtube.com/watch?v=23_bHcr7hqo) | [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
@@ -102,7 +102,7 @@ a graph showing `a` and `b` share the list
 </td></tr></table>
-The fact that `a` and `b` share the list can not be verified by printing the lists. It can be verified by comparing the identity of both variables using the `id()` function or by using the `is` comparison operator as shown in the program output below, but this quickly becomes impractical for larger programs.
+The fact that `a` and `b` share the list can **not** be verified by printing the lists. It can be verified by comparing the identity of both variables using the `id()` function or by using the `is` comparison operator as shown in the program output below, but this quickly becomes impractical for larger programs.
 ```{verbatim}
 a: 4, 3, 2, 1
 b: 4, 3, 2, 1
@@ -163,7 +163,7 @@ Bas Terwijn
 ## Inspiration ##
 Inspired by [Python Tutor](https://pythontutor.com/).
-The main differences are that by running memory_graph locally we support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) so that it scales to full programs in many environments and IDEs instead of just code snippets in a webbrowser, and by mirroring the data’s hierarchy we improve graph readability for larger graphs.
+The main differences are that by running memory_graph locally we support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) so that it scales to full multi-file programs in many environments and IDEs instead of just code snippets in a webbrowser, and by mirroring the data’s hierarchy we improve graph readability for larger graphs.
 ## Social Media #
 * [LinkedIn](https://www.linkedin.com/groups/13244150/)
@@ -242,7 +242,7 @@ mg.show(locals())
 ![copy_mutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mutable.png)
-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/copies.py&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/copies.py&play).
 ## Custom Copy ##
 We can write our own custom copy function or method in case the three standard "copy" options don't do what we want. For example, in the code below the `custom_copy()` method of My_Class copies the `digits` but shares the `letters` between two objects.
@@ -270,12 +270,16 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
-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/custom_copy.py&breakpoints=15&continues=1&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/custom_copy.py&breakpoints=15&continues=1&play).
 ## Name Rebinding ##
 When `a` and `b` share a mutable value, then changing the value of `b` changes the value of `a` and vice versa. However, reassigning `b` does not change `a`. When you reassign `b`, you only **rebind** the name `b` to another value without affecting any other variable.
-Also note the difference between statement `b += [1]` that changes `b` and `a`, and statement `c = c + [300]` that first creates the new value `c + [300]` and assigns this value to `c` without effecting `b`. This shows that `x += y` is not the same as `x = x + y` for values of mutable type.
+In the example below, also note the difference between expressions:
+- `b += [300]`: that changes both `b` and `a`
+- `c = c + [600]`: that first creates a new value `c + [600]` and then assigns this new value to `c` without affecting `b`
+This shows that `x += y` is not the same as `x = x + y` for a value `x` of mutable type.
 ```python
 import memory_graph as mg
@@ -296,7 +300,7 @@ mg.render(locals(), 'rebinding3.png')
 |:--------------:|:--------------:|:--------------:|
 | rebinding1.png | rebinding2.png | rebinding3.png |
-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/rebind.py&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/rebind.py&play).
 ## Copying Values of Immutable Type ##
 Because a value of immutable type will be copied automatically when it is changed, there is no need to copy it beforehand. Therefore, a shallow or deep copy of a value of immutable type will result in just an assignment to save on the time needed to make the copy and the space (=memory) needed to store the values.
@@ -354,7 +358,7 @@ print(f"a:{a} b:{b} c:{c}")
 ```
 ![add_one.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/add_one.png)
-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/function_call.py&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/function_call.py&play).
 In the printed output we see that only `a` is changed as a result of the function call:
 ```
@@ -383,7 +387,7 @@ print(f"a:{a} b:{b[0]}")
 ```
 a:10 b:11
 ```
-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/wrap.py&breakpoints=5&continues=1&play)
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/wrap.py&breakpoints=5&continues=1&play)
 The effect of calling `add_one()` is that `b[0]` increases by 1, while `a` is unaffected.
@@ -424,7 +428,7 @@ print( factorial(4) )
 and the result is: 1 x 2 x 3 x 4 = 24
-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/factorial.py&timestep=1.0&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/factorial.py&timestep=1.0&play).
 ## Binary Conversion ##
 A more interesting recursive example is function `binary()` that converts a integer from decimal to binary representation.
@@ -448,7 +452,7 @@ print( binary(100) )
 [1, 1, 0, 0, 1, 0, 0]
 ```
-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/binary_convert.py&timestep=1.0&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/binary_convert.py&timestep=1.0&play).
 ## Power Set ##
 A more complex recursive example is function `power_set()` where lists are shared by different function calls. A power set is the set of all subsets of a collection of values.
@@ -480,7 +484,7 @@ print( power_set(['a', 'b', 'c']) )
 [['a', 'b', 'c'], ['a', 'b'], ['a', 'c'], ['a'], ['b', 'c'], ['b'], ['c'], []]
 ```
-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/power_set.py&timestep=1.0&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/power_set.py&timestep=1.0&play).
 ## Invocation Tree ##
 The memory_graph package visualizes data at the currect time, but to better understand recursion it can also be helpful to visualize different function calls over time. This is what the [invocation_tree](https://github.com/bterwijn/invocation_tree?tab=readme-ov-file#installation) package does.
@@ -644,7 +648,7 @@ for i in range(n):
 Here we show values being added to a Linked List in Cursor AI. When adding the last value '5' we "Step Into" the code to show more of the details.
 ![linked_list.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.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/linked_list.py&timestep=0.2&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/linked_list.py&timestep=0.2&play).
 ## Binary Tree ##
 ```python
@@ -686,7 +690,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)
-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.
+See it in the [Memory Graph 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
@@ -730,7 +734,7 @@ for i in range(n):
 Here we show values being inserted in a HashSet in PyCharm. When inserting the last value '44' we "Step Into" the code to show more of the details.
 ![images/hash_set.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.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/hash_set.py&breakpoints=32&continues=1&timestep=0.5&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/hash_set.py&breakpoints=32&continues=1&timestep=0.5&play).
 # Sorting Algorithms #
@@ -757,7 +761,7 @@ In this configuration example we show the decimal, binary and [two's complement
 A sliding puzzle solver as a challenging example showing how memory_graph deals with large amounts of data. Click "Continue" to step through the breadth-first search generations until a solution path is found:
-- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=16,26,28,39&continues=1)
+- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=16,26,28,39,136&continues=1)
 ![sliding_puzzle.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/sliding_puzzle.png)
@@ -1245,13 +1249,72 @@ Arguably the visualization is then more clear when we show a List_View object as
 ```python
 mg.config.type_to_node[List_View] = (lambda l: mg.Node_Linear(l,
-    [v if l.begin <= i < l.end else mg.unquoted('') for i, v in enumerate(l.lst)]
+    [v if l.begin <= i < l.end else mg.unquoted_str('') 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)
-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_search.py&breakpoints=32&continues=1&timestep=0.5&play)
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_search.py&breakpoints=38&continues=1&timestep=0.5&play)
+## String Types ##
+For special string formatting different `str` types are available:
+| string type                | format |
+|:--------------------------:|:--------------------:|
+| `str`                      | normal Python `str` type is limited by `config.max_string_length` |
+| `mg.full_str('text')`      | not limited |
+| `mg.unquoted_str('text')`  | not limited and not quoted |
+| `mg.html_str('text')`      | for [Grahviz html-like formatting](https://graphviz.org/doc/info/shapes.html#html) |
+The [Grahviz html-like formatting](https://graphviz.org/doc/info/shapes.html#html) supports a subset of html tags that allow for things like:
+```python
+import memory_graph as mg
+elements = ['<B>bold</B>',
+            '<I>italic</I>',
+            '<S>strikethrough</S>',
+            '<U>under</U><O>over</O>',
+            '<SUB>sub</SUB><SUP>sup</SUP>',
+            '<FONT FACE="Courier">monospaced</FONT>',
+            '<FONT COLOR="red">red</FONT><FONT COLOR="green">green</FONT>',
+            '<FONT POINT-SIZE="20">Large</FONT><FONT POINT-SIZE="10">small</FONT>',
+            '<TABLE BORDER="1"><TR><TD>c1</TD><TD>c2</TD></TR></TABLE>',
+            'line1<BR/>line2<BR/>line3<BR/>']
+normal_str = '<TABLE BORDER="0">\n'
+for element in elements:
+    normal_str += '<TR><TD> ' + mg.utils.html_escape(element) + ' </TD><TD> ' + element+ ' </TD></TR>element\n'
+normal_str += '</TABLE>\n'
+html_example = mg.html_str(normal_str)
+del elements, element, normal_str
+mg.show(locals())
+```
+![html_str_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/html_str_example.png)
+Including the `<IMG>` tag that allows for showing local image files only, but that currently doesn't work in the Memory Graph Web Debugger, that uses 'Viz.js' for graph rendering, unfortunately.
+```python
+import memory_graph as mg
+import matplotlib.pyplot as plt
+import random
+random.seed(0)
+N = 100
+value = 0
+data = [value]
+for i in range(N):
+    value += random.uniform(-1, 1)
+    data.append(value)
+plt.plot(data)
+plt.savefig('plot.png')
+image = {mg.html_str('<IMG SRC="plot.png"/>')}
+mg.show(locals())
+```
+![html_str_image.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/html_str_image.png)
 ## Collapse Type ##
@@ -1384,7 +1447,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
-Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#micropip=numpy&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_numpy.py&continues=1).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#micropip=numpy&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_numpy.py&play).
 ## Pandas ##
 For pandas types `Series` and `DataFrame`, use `mg.extend_pandas()`:
@@ -1405,7 +1468,7 @@ mg.show(locals())
 ```
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
-Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#micropip=pandas&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_pandas.py&continues=1).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#micropip=pandas&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_pandas.py&play).
 ## PyTorch ##
 For torch type `tensor`, use `mg.extend_torch()`:

{memory_graph-0.3.77 → memory_graph-0.3.79}/README.md RENAMED Viewed

@@ -7,7 +7,7 @@ Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 # Highlights #
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
-Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#breakpoints=8&continues=1&timestep=1.0&play) 👈 now, no installation required!
+Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#breakpoints=8&continues=1&play) 👈 now, no installation required!
 - learn the right **mental model** to think about Python data (references, mutability, shallow vs deep copy)
 - **visualize the structure of your data** to more easily understand and debug any data structure
@@ -15,7 +15,7 @@ Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph
 An example Binary Tree data structure:
 ![bin_tree_vs.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree_vs.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).
+Or see it in the [Memory Graph 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).
 # Videos #
 | [![Quick Intro](https://img.youtube.com/vi/23_bHcr7hqo/0.jpg)](https://www.youtube.com/watch?v=23_bHcr7hqo) | [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
@@ -82,7 +82,7 @@ a graph showing `a` and `b` share the list
 </td></tr></table>
-The fact that `a` and `b` share the list can not be verified by printing the lists. It can be verified by comparing the identity of both variables using the `id()` function or by using the `is` comparison operator as shown in the program output below, but this quickly becomes impractical for larger programs.
+The fact that `a` and `b` share the list can **not** be verified by printing the lists. It can be verified by comparing the identity of both variables using the `id()` function or by using the `is` comparison operator as shown in the program output below, but this quickly becomes impractical for larger programs.
 ```{verbatim}
 a: 4, 3, 2, 1
 b: 4, 3, 2, 1
@@ -143,7 +143,7 @@ Bas Terwijn
 ## Inspiration ##
 Inspired by [Python Tutor](https://pythontutor.com/).
-The main differences are that by running memory_graph locally we support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) so that it scales to full programs in many environments and IDEs instead of just code snippets in a webbrowser, and by mirroring the data’s hierarchy we improve graph readability for larger graphs.
+The main differences are that by running memory_graph locally we support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) so that it scales to full multi-file programs in many environments and IDEs instead of just code snippets in a webbrowser, and by mirroring the data’s hierarchy we improve graph readability for larger graphs.
 ## Social Media #
 * [LinkedIn](https://www.linkedin.com/groups/13244150/)
@@ -222,7 +222,7 @@ mg.show(locals())
 ![copy_mutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mutable.png)
-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/copies.py&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/copies.py&play).
 ## Custom Copy ##
 We can write our own custom copy function or method in case the three standard "copy" options don't do what we want. For example, in the code below the `custom_copy()` method of My_Class copies the `digits` but shares the `letters` between two objects.
@@ -250,12 +250,16 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
-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/custom_copy.py&breakpoints=15&continues=1&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/custom_copy.py&breakpoints=15&continues=1&play).
 ## Name Rebinding ##
 When `a` and `b` share a mutable value, then changing the value of `b` changes the value of `a` and vice versa. However, reassigning `b` does not change `a`. When you reassign `b`, you only **rebind** the name `b` to another value without affecting any other variable.
-Also note the difference between statement `b += [1]` that changes `b` and `a`, and statement `c = c + [300]` that first creates the new value `c + [300]` and assigns this value to `c` without effecting `b`. This shows that `x += y` is not the same as `x = x + y` for values of mutable type.
+In the example below, also note the difference between expressions:
+- `b += [300]`: that changes both `b` and `a`
+- `c = c + [600]`: that first creates a new value `c + [600]` and then assigns this new value to `c` without affecting `b`
+This shows that `x += y` is not the same as `x = x + y` for a value `x` of mutable type.
 ```python
 import memory_graph as mg
@@ -276,7 +280,7 @@ mg.render(locals(), 'rebinding3.png')
 |:--------------:|:--------------:|:--------------:|
 | rebinding1.png | rebinding2.png | rebinding3.png |
-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/rebind.py&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/rebind.py&play).
 ## Copying Values of Immutable Type ##
 Because a value of immutable type will be copied automatically when it is changed, there is no need to copy it beforehand. Therefore, a shallow or deep copy of a value of immutable type will result in just an assignment to save on the time needed to make the copy and the space (=memory) needed to store the values.
@@ -334,7 +338,7 @@ print(f"a:{a} b:{b} c:{c}")
 ```
 ![add_one.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/add_one.png)
-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/function_call.py&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/function_call.py&play).
 In the printed output we see that only `a` is changed as a result of the function call:
 ```
@@ -363,7 +367,7 @@ print(f"a:{a} b:{b[0]}")
 ```
 a:10 b:11
 ```
-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/wrap.py&breakpoints=5&continues=1&play)
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/wrap.py&breakpoints=5&continues=1&play)
 The effect of calling `add_one()` is that `b[0]` increases by 1, while `a` is unaffected.
@@ -404,7 +408,7 @@ print( factorial(4) )
 and the result is: 1 x 2 x 3 x 4 = 24
-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/factorial.py&timestep=1.0&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/factorial.py&timestep=1.0&play).
 ## Binary Conversion ##
 A more interesting recursive example is function `binary()` that converts a integer from decimal to binary representation.
@@ -428,7 +432,7 @@ print( binary(100) )
 [1, 1, 0, 0, 1, 0, 0]
 ```
-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/binary_convert.py&timestep=1.0&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/binary_convert.py&timestep=1.0&play).
 ## Power Set ##
 A more complex recursive example is function `power_set()` where lists are shared by different function calls. A power set is the set of all subsets of a collection of values.
@@ -460,7 +464,7 @@ print( power_set(['a', 'b', 'c']) )
 [['a', 'b', 'c'], ['a', 'b'], ['a', 'c'], ['a'], ['b', 'c'], ['b'], ['c'], []]
 ```
-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/power_set.py&timestep=1.0&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/power_set.py&timestep=1.0&play).
 ## Invocation Tree ##
 The memory_graph package visualizes data at the currect time, but to better understand recursion it can also be helpful to visualize different function calls over time. This is what the [invocation_tree](https://github.com/bterwijn/invocation_tree?tab=readme-ov-file#installation) package does.
@@ -624,7 +628,7 @@ for i in range(n):
 Here we show values being added to a Linked List in Cursor AI. When adding the last value '5' we "Step Into" the code to show more of the details.
 ![linked_list.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.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/linked_list.py&timestep=0.2&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/linked_list.py&timestep=0.2&play).
 ## Binary Tree ##
 ```python
@@ -666,7 +670,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)
-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.
+See it in the [Memory Graph 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
@@ -710,7 +714,7 @@ for i in range(n):
 Here we show values being inserted in a HashSet in PyCharm. When inserting the last value '44' we "Step Into" the code to show more of the details.
 ![images/hash_set.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.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/hash_set.py&breakpoints=32&continues=1&timestep=0.5&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/hash_set.py&breakpoints=32&continues=1&timestep=0.5&play).
 # Sorting Algorithms #
@@ -737,7 +741,7 @@ In this configuration example we show the decimal, binary and [two's complement
 A sliding puzzle solver as a challenging example showing how memory_graph deals with large amounts of data. Click "Continue" to step through the breadth-first search generations until a solution path is found:
-- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=16,26,28,39&continues=1)
+- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=16,26,28,39,136&continues=1)
 ![sliding_puzzle.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/sliding_puzzle.png)
@@ -1225,13 +1229,72 @@ Arguably the visualization is then more clear when we show a List_View object as
 ```python
 mg.config.type_to_node[List_View] = (lambda l: mg.Node_Linear(l,
-    [v if l.begin <= i < l.end else mg.unquoted('') for i, v in enumerate(l.lst)]
+    [v if l.begin <= i < l.end else mg.unquoted_str('') 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)
-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_search.py&breakpoints=32&continues=1&timestep=0.5&play)
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_search.py&breakpoints=38&continues=1&timestep=0.5&play)
+## String Types ##
+For special string formatting different `str` types are available:
+| string type                | format |
+|:--------------------------:|:--------------------:|
+| `str`                      | normal Python `str` type is limited by `config.max_string_length` |
+| `mg.full_str('text')`      | not limited |
+| `mg.unquoted_str('text')`  | not limited and not quoted |
+| `mg.html_str('text')`      | for [Grahviz html-like formatting](https://graphviz.org/doc/info/shapes.html#html) |
+The [Grahviz html-like formatting](https://graphviz.org/doc/info/shapes.html#html) supports a subset of html tags that allow for things like:
+```python
+import memory_graph as mg
+elements = ['<B>bold</B>',
+            '<I>italic</I>',
+            '<S>strikethrough</S>',
+            '<U>under</U><O>over</O>',
+            '<SUB>sub</SUB><SUP>sup</SUP>',
+            '<FONT FACE="Courier">monospaced</FONT>',
+            '<FONT COLOR="red">red</FONT><FONT COLOR="green">green</FONT>',
+            '<FONT POINT-SIZE="20">Large</FONT><FONT POINT-SIZE="10">small</FONT>',
+            '<TABLE BORDER="1"><TR><TD>c1</TD><TD>c2</TD></TR></TABLE>',
+            'line1<BR/>line2<BR/>line3<BR/>']
+normal_str = '<TABLE BORDER="0">\n'
+for element in elements:
+    normal_str += '<TR><TD> ' + mg.utils.html_escape(element) + ' </TD><TD> ' + element+ ' </TD></TR>element\n'
+normal_str += '</TABLE>\n'
+html_example = mg.html_str(normal_str)
+del elements, element, normal_str
+mg.show(locals())
+```
+![html_str_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/html_str_example.png)
+Including the `<IMG>` tag that allows for showing local image files only, but that currently doesn't work in the Memory Graph Web Debugger, that uses 'Viz.js' for graph rendering, unfortunately.
+```python
+import memory_graph as mg
+import matplotlib.pyplot as plt
+import random
+random.seed(0)
+N = 100
+value = 0
+data = [value]
+for i in range(N):
+    value += random.uniform(-1, 1)
+    data.append(value)
+plt.plot(data)
+plt.savefig('plot.png')
+image = {mg.html_str('<IMG SRC="plot.png"/>')}
+mg.show(locals())
+```
+![html_str_image.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/html_str_image.png)
 ## Collapse Type ##
@@ -1364,7 +1427,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
-Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#micropip=numpy&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_numpy.py&continues=1).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#micropip=numpy&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_numpy.py&play).
 ## Pandas ##
 For pandas types `Series` and `DataFrame`, use `mg.extend_pandas()`:
@@ -1385,7 +1448,7 @@ mg.show(locals())
 ```
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
-Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#micropip=pandas&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_pandas.py&continues=1).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#micropip=pandas&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_pandas.py&play).
 ## PyTorch ##
 For torch type `tensor`, use `mg.extend_torch()`:

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/__init__.py RENAMED Viewed

@@ -2,7 +2,7 @@
 # Copyright (c) 2023, Bas Terwijn.
 # SPDX-License-Identifier: BSD-2-Clause
-__version__ = "0.3.77"
+__version__ = "0.3.79"
 __author__ = 'Bas Terwijn'
 import memory_graph.memory_to_nodes as memory_to_nodes
@@ -26,6 +26,7 @@ if not hasattr(builtins, "mg"):
     builtins.mg = mg
 # re-exports for shorter names
+from .config_default  import dark_mode, transparent_background
 from .slicer          import Slicer
 from .node_leaf       import Node_Leaf
 from .node_linear     import Node_Linear

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/config.py RENAMED Viewed

@@ -29,6 +29,11 @@ type_to_string = { }
 type_to_node = { }
+color_mode_dark = False
+transparent_background = False
+foreground_color = None
+index_color = None
+background_color = None
 type_to_color = { }
 type_to_horizontal = { }

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/config_default.py RENAMED Viewed

@@ -17,8 +17,98 @@ import memory_graph.utils as utils
 import types
+""" Colors of the graph. """
+foreground_color_light = 'black'
+index_color_light = '#505050'
+background_color_light = 'white'
+""" Colors of different types in the graph. """
+type_to_color_light = {
+    # ================= singular
+    type(None) : "gray",
+    bool : "pink",
+    int : "darkolivegreen1",
+    float : "plum",
+    complex : "yellow",
+    str : "cyan",
+    # ================= linear
+    tuple : "orange",
+    list : "lightcoral",
+    set : "orchid1",
+    frozenset : "orchid2",
+    bytes : "khaki1",
+    bytearray : "khaki2",
+    # ================= key_value
+    Node_Key_Value : "seagreen1", # for classes
+    call_stack : 'khaki',
+    type: "seagreen3",            # where class variables are stored
+    dict : "#60a5ff",
+    types.MappingProxyType : "dodgerblue2", # not used
+    range : "cornsilk2",
+    # ================= exception
+    BaseException : "#ff6666",
+}
+background_color_dark = "#1d1d1d"
+foreground_color_dark = "#cccccc"
+index_color_dark = "#999999"
+type_to_color_dark = {
+    # ================= singular
+    type(None) : "#646464",
+    bool : "#8d646d",
+    int : "#507835",
+    float : "#7e4974",
+    complex : "#707500",
+    str : "#006f6f",
+    # ================= linear
+    tuple : "#956200",
+    list : "#783438",
+    set : "#811b7d",
+    frozenset : "#6a1666",
+    bytes : "#73753f",
+    bytearray : "#6a6c3b",
+    # ================= key_value
+    Node_Key_Value : "#00905d",
+    call_stack : '#7e8148',
+    type: "#00784e",
+    dict : "#355393",
+    types.MappingProxyType : "#304a84",
+    range : "#7e7d6c",
+    # ================= exception
+    BaseException : "#a52e37",
+}
+def set_colors(dark, transparent):
+    if dark:
+        config.foreground_color = foreground_color_dark
+        config.index_color = index_color_dark
+        config.background_color = background_color_dark
+        config.type_to_color = type_to_color_dark
+    else:
+        config.foreground_color = foreground_color_light
+        config.index_color = index_color_light
+        config.background_color = background_color_light
+        config.type_to_color = type_to_color_light
+    if transparent:
+        config.background_color = "transparent"
+def transparent_background(transparent = None):
+    if transparent is None:
+        config.transparent_background = not config.transparent_background
+    else:
+        config.transparent_background = transparent
+    set_colors(config.color_mode_dark, config.transparent_background)
+def dark_mode(dark = None):
+    if dark is None:
+        config.color_mode_dark = not config.color_mode_dark
+    else:
+        config.color_mode_dark = dark
+    set_colors(config.color_mode_dark, config.transparent_background)
 def reset():
+    set_colors(config.color_mode_dark, config.transparent_background)
     """ Reopen viewer each time show() is called, this might change window focus. """
     config.reopen_viewer = True
@@ -42,7 +132,8 @@ def reset():
     """ Types that by default will be embedded in the node of their parent. """
     config.embedded_types = {
-        type(None), bool, int, float, complex, str, unquoted_str, html_str,
+        type(None), bool, int, float, complex,
+        str, full_str, unquoted_str, html_str,
         types.FunctionType,
         types.MethodType,
         classmethod,
@@ -85,34 +176,6 @@ def reset():
         ),
         BaseException: lambda data: Node_Leaf(data, data),
     }
-    """ Colors of different types in the graph. """
-    config.type_to_color = {
-        # ================= singular
-        type(None) : "gray",
-        bool : "pink",
-        int : "darkolivegreen1",
-        float : "plum",
-        complex : "yellow",
-        str : "cyan",
-        # ================= linear
-        tuple : "orange",
-        list : "lightcoral",
-        set : "orchid1",
-        frozenset : "orchid2",
-        bytes : "khaki1",
-        bytearray : "khaki2",
-        # ================= key_value
-        Node_Key_Value : "seagreen1", # for classes
-        call_stack : 'khaki',
-        type: "seagreen3",            # where class variables are stored
-        dict : "#60a5ff",
-        types.MappingProxyType : "dodgerblue2", # not used
-        range : "cornsilk2",
-        # ================= exception
-        BaseException : "#ff5555",
-    }
     """ Types that will be visualized in horizontal or vertical orientation based on a True/False value.
     The 'type_to_horizontal' takes precedence over 'type_to_vertical'.

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/html_table.py RENAMED Viewed

@@ -6,17 +6,19 @@ import memory_graph.config as config
 import memory_graph.config_helpers as config_helpers
 import memory_graph.utils as utils
-def html_table_frame(s, border, color, spacing=5):
+def html_table_frame(s, border, color, line_color='black', spacing=5):
     """ Helper function to add the HTML table frame to the string s setting the 'border' and 'color'. """
-    return (f'<\n<TABLE BORDER="{border}" CELLBORDER="1" CELLSPACING="{spacing}" CELLPADDING="0" BGCOLOR="{color}" PORT="table">\n    <TR>' +
+    return (f'<\n<TABLE BORDER="{border}" CELLBORDER="1" CELLSPACING="{spacing}" CELLPADDING="0" BGCOLOR="{color}" COLOR="{line_color}" PORT="table">\n    <TR>' +
             s + '</TR>\n</TABLE>\n>')
 def format_string(value, quote_str):
     """ Helper function to format 'value' to be shown in the graph. We escape html characters and convert newlines to <BR/> tags. """
     to_string = config_helpers.get_to_string(value)
     s = to_string(value)
-    if quote_str and isinstance(value, str) or isinstance(value, utils.full_str):
+    if quote_str and isinstance(value, (str, utils.full_str)):
         s = utils.quote_string(s)
+    if not isinstance(value, utils.html_str): # <IMG> can't have padding in Graphviz
+        s = utils.pad_string(s)
     return s
 class HTML_Table:
@@ -58,7 +60,7 @@ class HTML_Table:
     def add_index(self, s):
         """ Add an index s to the table. """
         self.check_add_new_line()
-        self.html += f'<TD BORDER="0"><font color="#505050">{str(s)}</font></TD>'
+        self.html += f'<TD BORDER="0"><font color="{config.index_color}">{str(s)}</font></TD>'
         self.col_count += 1
     def add_entry(self, node, nodes, child, id_to_slices, rounded=False, border=1, dashed=False, embed=False):
@@ -77,7 +79,7 @@ class HTML_Table:
         """ Helper function to add 'value' to the table. """
         self.check_add_new_line()
         r = ' STYLE="ROUNDED"' if rounded else ''
-        self.html += f'<TD BORDER="{border}"{r}> {format_string(value, not rounded)} </TD>'
+        self.html += f'<TD BORDER="{border}"{r}>{format_string(value, not rounded)}</TD>'
         self.is_empty = False
         self.col_count += 1
@@ -98,13 +100,13 @@ class HTML_Table:
         self.html += f'<TD BORDER="{border}" {r}>...</TD>'
         self.col_count += 1
-    def to_string(self, border=1, color='white'):
+    def to_string(self, border=1, color='white', line_color='black'):
         """ Construct the HTML table string with the 'border' and 'color' settings. """
         if self.col_count == 0 and self.row_count == 0:
             if self.is_empty:
                 self.add_value(utils.unquoted_str(''), border=0)
-            return html_table_frame(self.html, border, color, spacing=0)
-        return html_table_frame(self.html, border, color)
+            return html_table_frame(self.html, border, color, line_color, spacing=0)
+        return html_table_frame(self.html, border, color, line_color)
     def get_column(self):
         """ Get the number of columns in the table. """

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/memory_to_nodes.py RENAMED Viewed

@@ -218,11 +218,11 @@ def build_graph(graphviz_graph, nodes, root_id, id_to_slices):
         border = 3 if node.is_root() else 1
         if config.type_labels:
             graphviz_graph.node(node.get_name(),
-                                html_table.to_string(border, color),
+                                html_table.to_string(border, color, config.foreground_color),
                                 xlabel=node.get_label(slices))
         else:
             graphviz_graph.node(node.get_name(),
-                                html_table.to_string(border, color))
+                                html_table.to_string(border, color, config.foreground_color))
             # ------------ edges
         for parent,child,dashed in edges:
             graphviz_graph.edge(parent, child+':table', style='dashed' if dashed else 'solid')
@@ -261,9 +261,9 @@ def memory_to_nodes(data):
     id_to_slices = add_missing_edges(nodes, id_to_slices, config.max_missing_edges)
     #print('id_to_slices:',id_to_slices)
     embed_keys_in_key_value_nodes(nodes, nodes_key_value, id_to_slices)
-    graphviz_graph_attr = {'fontname': config.fontname, 'fontsize': config.fontsize}
-    graphviz_node_attr = {'fontname': config.fontname, 'fontsize': config.fontsize, 'shape': 'plaintext'}
-    graphviz_edge_attr = {'fontname': config.fontname, 'fontsize': config.fontsize}
+    graphviz_graph_attr = {'fontname': config.fontname, 'fontsize': config.fontsize, 'fontcolor': config.foreground_color, 'bgcolor': config.background_color}
+    graphviz_node_attr = {'fontname': config.fontname, 'fontsize': config.fontsize, 'shape': 'plaintext', 'fontcolor': config.foreground_color}
+    graphviz_edge_attr = {'fontname': config.fontname, 'fontsize': config.fontsize, 'fontcolor': config.foreground_color, 'color': config.foreground_color}
     graphviz_graph=graphviz.Digraph('memory_graph',
                                     graph_attr=graphviz_graph_attr,
                                     node_attr=graphviz_node_attr,

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/utils.py RENAMED Viewed

@@ -45,9 +45,13 @@ def prep_str(s):
     return newlines_to_br(html_escape(limit_string(s)))
 def quote_string(s):
-    """ Quote 's' if it is a string. """
+    """ Quote string 's'. """
     return "'" + s + "'"
+def pad_string(s):
+    """ Pad string 's'. """
+    return " " + s + " "
 def exception_to_string(e):
     """ Helper function to convert the traceback of an exception to a string. """
     return ''.join(traceback.format_exception(type(e), e, e.__traceback__)).strip()

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph.egg-info/PKG-INFO RENAMED Viewed

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.77
+Version: 0.3.79
 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
@@ -27,7 +27,7 @@ Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 # Highlights #
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
-Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#breakpoints=8&continues=1&timestep=1.0&play) 👈 now, no installation required!
+Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph.com/#breakpoints=8&continues=1&play) 👈 now, no installation required!
 - learn the right **mental model** to think about Python data (references, mutability, shallow vs deep copy)
 - **visualize the structure of your data** to more easily understand and debug any data structure
@@ -35,7 +35,7 @@ Run a live demo in the 👉 [**Memory Graph Web Debugger**](https://memory-graph
 An example Binary Tree data structure:
 ![bin_tree_vs.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree_vs.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).
+Or see it in the [Memory Graph 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).
 # Videos #
 | [![Quick Intro](https://img.youtube.com/vi/23_bHcr7hqo/0.jpg)](https://www.youtube.com/watch?v=23_bHcr7hqo) | [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
@@ -102,7 +102,7 @@ a graph showing `a` and `b` share the list
 </td></tr></table>
-The fact that `a` and `b` share the list can not be verified by printing the lists. It can be verified by comparing the identity of both variables using the `id()` function or by using the `is` comparison operator as shown in the program output below, but this quickly becomes impractical for larger programs.
+The fact that `a` and `b` share the list can **not** be verified by printing the lists. It can be verified by comparing the identity of both variables using the `id()` function or by using the `is` comparison operator as shown in the program output below, but this quickly becomes impractical for larger programs.
 ```{verbatim}
 a: 4, 3, 2, 1
 b: 4, 3, 2, 1
@@ -163,7 +163,7 @@ Bas Terwijn
 ## Inspiration ##
 Inspired by [Python Tutor](https://pythontutor.com/).
-The main differences are that by running memory_graph locally we support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) so that it scales to full programs in many environments and IDEs instead of just code snippets in a webbrowser, and by mirroring the data’s hierarchy we improve graph readability for larger graphs.
+The main differences are that by running memory_graph locally we support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) so that it scales to full multi-file programs in many environments and IDEs instead of just code snippets in a webbrowser, and by mirroring the data’s hierarchy we improve graph readability for larger graphs.
 ## Social Media #
 * [LinkedIn](https://www.linkedin.com/groups/13244150/)
@@ -242,7 +242,7 @@ mg.show(locals())
 ![copy_mutbale.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_mutable.png)
-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/copies.py&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/copies.py&play).
 ## Custom Copy ##
 We can write our own custom copy function or method in case the three standard "copy" options don't do what we want. For example, in the code below the `custom_copy()` method of My_Class copies the `digits` but shares the `letters` between two objects.
@@ -270,12 +270,16 @@ mg.show(locals())
 ```
 ![copy_method.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/copy_method.png)
-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/custom_copy.py&breakpoints=15&continues=1&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/custom_copy.py&breakpoints=15&continues=1&play).
 ## Name Rebinding ##
 When `a` and `b` share a mutable value, then changing the value of `b` changes the value of `a` and vice versa. However, reassigning `b` does not change `a`. When you reassign `b`, you only **rebind** the name `b` to another value without affecting any other variable.
-Also note the difference between statement `b += [1]` that changes `b` and `a`, and statement `c = c + [300]` that first creates the new value `c + [300]` and assigns this value to `c` without effecting `b`. This shows that `x += y` is not the same as `x = x + y` for values of mutable type.
+In the example below, also note the difference between expressions:
+- `b += [300]`: that changes both `b` and `a`
+- `c = c + [600]`: that first creates a new value `c + [600]` and then assigns this new value to `c` without affecting `b`
+This shows that `x += y` is not the same as `x = x + y` for a value `x` of mutable type.
 ```python
 import memory_graph as mg
@@ -296,7 +300,7 @@ mg.render(locals(), 'rebinding3.png')
 |:--------------:|:--------------:|:--------------:|
 | rebinding1.png | rebinding2.png | rebinding3.png |
-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/rebind.py&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/rebind.py&play).
 ## Copying Values of Immutable Type ##
 Because a value of immutable type will be copied automatically when it is changed, there is no need to copy it beforehand. Therefore, a shallow or deep copy of a value of immutable type will result in just an assignment to save on the time needed to make the copy and the space (=memory) needed to store the values.
@@ -354,7 +358,7 @@ print(f"a:{a} b:{b} c:{c}")
 ```
 ![add_one.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/add_one.png)
-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/function_call.py&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/function_call.py&play).
 In the printed output we see that only `a` is changed as a result of the function call:
 ```
@@ -383,7 +387,7 @@ print(f"a:{a} b:{b[0]}")
 ```
 a:10 b:11
 ```
-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/wrap.py&breakpoints=5&continues=1&play)
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/wrap.py&breakpoints=5&continues=1&play)
 The effect of calling `add_one()` is that `b[0]` increases by 1, while `a` is unaffected.
@@ -424,7 +428,7 @@ print( factorial(4) )
 and the result is: 1 x 2 x 3 x 4 = 24
-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/factorial.py&timestep=1.0&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/factorial.py&timestep=1.0&play).
 ## Binary Conversion ##
 A more interesting recursive example is function `binary()` that converts a integer from decimal to binary representation.
@@ -448,7 +452,7 @@ print( binary(100) )
 [1, 1, 0, 0, 1, 0, 0]
 ```
-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/binary_convert.py&timestep=1.0&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/binary_convert.py&timestep=1.0&play).
 ## Power Set ##
 A more complex recursive example is function `power_set()` where lists are shared by different function calls. A power set is the set of all subsets of a collection of values.
@@ -480,7 +484,7 @@ print( power_set(['a', 'b', 'c']) )
 [['a', 'b', 'c'], ['a', 'b'], ['a', 'c'], ['a'], ['b', 'c'], ['b'], ['c'], []]
 ```
-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/power_set.py&timestep=1.0&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/power_set.py&timestep=1.0&play).
 ## Invocation Tree ##
 The memory_graph package visualizes data at the currect time, but to better understand recursion it can also be helpful to visualize different function calls over time. This is what the [invocation_tree](https://github.com/bterwijn/invocation_tree?tab=readme-ov-file#installation) package does.
@@ -644,7 +648,7 @@ for i in range(n):
 Here we show values being added to a Linked List in Cursor AI. When adding the last value '5' we "Step Into" the code to show more of the details.
 ![linked_list.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.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/linked_list.py&timestep=0.2&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/linked_list.py&timestep=0.2&play).
 ## Binary Tree ##
 ```python
@@ -686,7 +690,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)
-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.
+See it in the [Memory Graph 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
@@ -730,7 +734,7 @@ for i in range(n):
 Here we show values being inserted in a HashSet in PyCharm. When inserting the last value '44' we "Step Into" the code to show more of the details.
 ![images/hash_set.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.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/hash_set.py&breakpoints=32&continues=1&timestep=0.5&play).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/hash_set.py&breakpoints=32&continues=1&timestep=0.5&play).
 # Sorting Algorithms #
@@ -757,7 +761,7 @@ In this configuration example we show the decimal, binary and [two's complement
 A sliding puzzle solver as a challenging example showing how memory_graph deals with large amounts of data. Click "Continue" to step through the breadth-first search generations until a solution path is found:
-- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=16,26,28,39&continues=1)
+- [sliding puzzle solver](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/sliding_puzzle.py&breakpoints=16,26,28,39,136&continues=1)
 ![sliding_puzzle.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/sliding_puzzle.png)
@@ -1245,13 +1249,72 @@ Arguably the visualization is then more clear when we show a List_View object as
 ```python
 mg.config.type_to_node[List_View] = (lambda l: mg.Node_Linear(l,
-    [v if l.begin <= i < l.end else mg.unquoted('') for i, v in enumerate(l.lst)]
+    [v if l.begin <= i < l.end else mg.unquoted_str('') 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)
-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_search.py&breakpoints=32&continues=1&timestep=0.5&play)
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/bin_search.py&breakpoints=38&continues=1&timestep=0.5&play)
+## String Types ##
+For special string formatting different `str` types are available:
+| string type                | format |
+|:--------------------------:|:--------------------:|
+| `str`                      | normal Python `str` type is limited by `config.max_string_length` |
+| `mg.full_str('text')`      | not limited |
+| `mg.unquoted_str('text')`  | not limited and not quoted |
+| `mg.html_str('text')`      | for [Grahviz html-like formatting](https://graphviz.org/doc/info/shapes.html#html) |
+The [Grahviz html-like formatting](https://graphviz.org/doc/info/shapes.html#html) supports a subset of html tags that allow for things like:
+```python
+import memory_graph as mg
+elements = ['<B>bold</B>',
+            '<I>italic</I>',
+            '<S>strikethrough</S>',
+            '<U>under</U><O>over</O>',
+            '<SUB>sub</SUB><SUP>sup</SUP>',
+            '<FONT FACE="Courier">monospaced</FONT>',
+            '<FONT COLOR="red">red</FONT><FONT COLOR="green">green</FONT>',
+            '<FONT POINT-SIZE="20">Large</FONT><FONT POINT-SIZE="10">small</FONT>',
+            '<TABLE BORDER="1"><TR><TD>c1</TD><TD>c2</TD></TR></TABLE>',
+            'line1<BR/>line2<BR/>line3<BR/>']
+normal_str = '<TABLE BORDER="0">\n'
+for element in elements:
+    normal_str += '<TR><TD> ' + mg.utils.html_escape(element) + ' </TD><TD> ' + element+ ' </TD></TR>element\n'
+normal_str += '</TABLE>\n'
+html_example = mg.html_str(normal_str)
+del elements, element, normal_str
+mg.show(locals())
+```
+![html_str_example.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/html_str_example.png)
+Including the `<IMG>` tag that allows for showing local image files only, but that currently doesn't work in the Memory Graph Web Debugger, that uses 'Viz.js' for graph rendering, unfortunately.
+```python
+import memory_graph as mg
+import matplotlib.pyplot as plt
+import random
+random.seed(0)
+N = 100
+value = 0
+data = [value]
+for i in range(N):
+    value += random.uniform(-1, 1)
+    data.append(value)
+plt.plot(data)
+plt.savefig('plot.png')
+image = {mg.html_str('<IMG SRC="plot.png"/>')}
+mg.show(locals())
+```
+![html_str_image.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/html_str_image.png)
 ## Collapse Type ##
@@ -1384,7 +1447,7 @@ mg.show(locals())
 ```
 ![extension_numpy.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_numpy.png)
-Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#micropip=numpy&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_numpy.py&continues=1).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#micropip=numpy&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_numpy.py&play).
 ## Pandas ##
 For pandas types `Series` and `DataFrame`, use `mg.extend_pandas()`:
@@ -1405,7 +1468,7 @@ mg.show(locals())
 ```
 ![extension_pandas.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/extension_pandas.png)
-Or see it in the [Memory Grah Web Debugger](https://memory-graph.com/#micropip=pandas&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_pandas.py&continues=1).
+Or see it in the [Memory Graph Web Debugger](https://memory-graph.com/#micropip=pandas&codeurl=https://raw.githubusercontent.com/bterwijn/memory_graph/refs/heads/main/src/mg_pandas.py&play).
 ## PyTorch ##
 For torch type `tensor`, use `mg.extend_torch()`:

{memory_graph-0.3.77 → memory_graph-0.3.79}/pyproject.toml RENAMED Viewed

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 [project]
 name = "memory_graph"
-version = "0.3.77"
+version = "0.3.79"
 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.77 → memory_graph-0.3.79}/LICENSE.txt RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/call_stack.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/config_helpers.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/extension_numpy.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/extension_pandas.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/extension_torch.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/list_view.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/node_base.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/node_key_value.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/node_leaf.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/node_linear.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/node_table.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/sequence.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/slicer.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/slices.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/slices_iterator.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/slices_table_iterator.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/test.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/test_max_graph_depth.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/test_memory_graph.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/test_memory_to_nodes.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/test_sequence.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/test_slicer.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/test_slices.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph/test_slices_iterator.py RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph.egg-info/SOURCES.txt RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph.egg-info/dependency_links.txt RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph.egg-info/requires.txt RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/memory_graph.egg-info/top_level.txt RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/setup.cfg RENAMED Viewed

File without changes

{memory_graph-0.3.77 → memory_graph-0.3.79}/setup.py RENAMED Viewed

File without changes

memory-graph 0.3.77__tar.gz → 0.3.79__tar.gz

memory-graph 0.3.77tar.gz → 0.3.79tar.gz