memory-graph 0.3.64__tar.gz → 0.3.65__tar.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
  1. {memory_graph-0.3.64 → memory_graph-0.3.65}/PKG-INFO +3 -3
  2. {memory_graph-0.3.64 → memory_graph-0.3.65}/README.md +2 -2
  3. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/__init__.py +1 -1
  4. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/node_linear.py +6 -6
  5. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph.egg-info/PKG-INFO +3 -3
  6. {memory_graph-0.3.64 → memory_graph-0.3.65}/pyproject.toml +1 -1
  7. {memory_graph-0.3.64 → memory_graph-0.3.65}/LICENSE.txt +0 -0
  8. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/call_stack.py +0 -0
  9. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/config.py +0 -0
  10. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/config_default.py +0 -0
  11. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/config_helpers.py +0 -0
  12. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/extension_numpy.py +0 -0
  13. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/extension_pandas.py +0 -0
  14. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/extension_torch.py +0 -0
  15. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/html_table.py +0 -0
  16. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/list_view.py +0 -0
  17. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/memory_to_nodes.py +0 -0
  18. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/node_base.py +0 -0
  19. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/node_key_value.py +0 -0
  20. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/node_leaf.py +0 -0
  21. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/node_table.py +0 -0
  22. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/sequence.py +0 -0
  23. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/slicer.py +0 -0
  24. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/slices.py +0 -0
  25. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/slices_iterator.py +0 -0
  26. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/slices_table_iterator.py +0 -0
  27. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/test.py +0 -0
  28. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/test_max_graph_depth.py +0 -0
  29. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/test_memory_graph.py +0 -0
  30. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/test_memory_to_nodes.py +0 -0
  31. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/test_sequence.py +0 -0
  32. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/test_slicer.py +0 -0
  33. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/test_slices.py +0 -0
  34. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/test_slices_iterator.py +0 -0
  35. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph/utils.py +0 -0
  36. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph.egg-info/SOURCES.txt +0 -0
  37. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph.egg-info/dependency_links.txt +0 -0
  38. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph.egg-info/requires.txt +0 -0
  39. {memory_graph-0.3.64 → memory_graph-0.3.65}/memory_graph.egg-info/top_level.txt +0 -0
  40. {memory_graph-0.3.64 → memory_graph-0.3.65}/setup.cfg +0 -0
  41. {memory_graph-0.3.64 → memory_graph-0.3.65}/setup.py +0 -0
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: memory_graph
3
- Version: 0.3.64
3
+ Version: 0.3.65
4
4
  Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
5
5
  Author-email: Bas Terwijn <bterwijn@gmail.com>
6
6
  License-Expression: BSD-2-Clause
@@ -161,7 +161,7 @@ Bas Terwijn
161
161
  ## Inspiration ##
162
162
  Inspired by [Python Tutor](https://pythontutor.com/).
163
163
 
164
- The main difference are that running memory_graph locally is a key design choice to support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) and mirroring the data’s hierarchy improves graph readability.
164
+ The main differences are that running memory_graph locally is a key design choice to support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) and mirroring the data’s hierarchy improves graph readability.
165
165
 
166
166
  ## Social Media #
167
167
  * [LinkedIn](https://www.linkedin.com/groups/13244150/)
@@ -773,7 +773,7 @@ Different aspects of memory_graph can be configured. The default configuration c
773
773
 
774
774
 
775
775
  ## Simplified Graph ##
776
- Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a` won’t affect `b`) so will never result in bugs.
776
+ Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a`'s ints won’t affect `b`) so will never result in bugs.
777
777
 
778
778
  The simplification strikes a balance: it is slightly misleading but keeps the graph clean and easy to understand and focuses on the mutable types where unexpected changes can occur. This is why it is the default behavior. If you do want to show separate nodes for `int` values, such as for educational purposes, you can simply remove `int` from the `mg.config.embedded_types` set:
779
779
  ```python
@@ -141,7 +141,7 @@ Bas Terwijn
141
141
  ## Inspiration ##
142
142
  Inspired by [Python Tutor](https://pythontutor.com/).
143
143
 
144
- The main difference are that running memory_graph locally is a key design choice to support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) and mirroring the data’s hierarchy improves graph readability.
144
+ The main differences are that running memory_graph locally is a key design choice to support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) and mirroring the data’s hierarchy improves graph readability.
145
145
 
146
146
  ## Social Media #
147
147
  * [LinkedIn](https://www.linkedin.com/groups/13244150/)
@@ -753,7 +753,7 @@ Different aspects of memory_graph can be configured. The default configuration c
753
753
 
754
754
 
755
755
  ## Simplified Graph ##
756
- Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a` won’t affect `b`) so will never result in bugs.
756
+ Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a`'s ints won’t affect `b`) so will never result in bugs.
757
757
 
758
758
  The simplification strikes a balance: it is slightly misleading but keeps the graph clean and easy to understand and focuses on the mutable types where unexpected changes can occur. This is why it is the default behavior. If you do want to show separate nodes for `int` values, such as for educational purposes, you can simply remove `int` from the `mg.config.embedded_types` set:
759
759
  ```python
@@ -2,7 +2,7 @@
2
2
  # Copyright (c) 2023, Bas Terwijn.
3
3
  # SPDX-License-Identifier: BSD-2-Clause
4
4
 
5
- __version__ = "0.3.64"
5
+ __version__ = "0.3.65"
6
6
  __author__ = 'Bas Terwijn'
7
7
 
8
8
  import memory_graph.memory_to_nodes as memory_to_nodes
@@ -75,13 +75,13 @@ class Node_Linear(Node_Base):
75
75
  Helper function to fill the html_table with the children of the Node_Base in horizontal orientation.
76
76
  """
77
77
  show_index = not self.get_type() in config.no_index_types
78
- for index in slices.table_iter(self.children.size()):
79
- if index>=0:
80
- if show_index:
78
+ if show_index:
79
+ for index in slices.table_iter(self.children.size()):
80
+ if index>=0:
81
81
  html_table.add_index(index)
82
- else:
83
- html_table.add_value('', border=0)
84
- html_table.add_new_line()
82
+ else:
83
+ html_table.add_value('', border=0)
84
+ html_table.add_new_line()
85
85
  for index in slices.table_iter(self.children.size()):
86
86
  if index>=0:
87
87
  child = self.children[index]
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: memory_graph
3
- Version: 0.3.64
3
+ Version: 0.3.65
4
4
  Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
5
5
  Author-email: Bas Terwijn <bterwijn@gmail.com>
6
6
  License-Expression: BSD-2-Clause
@@ -161,7 +161,7 @@ Bas Terwijn
161
161
  ## Inspiration ##
162
162
  Inspired by [Python Tutor](https://pythontutor.com/).
163
163
 
164
- The main difference are that running memory_graph locally is a key design choice to support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) and mirroring the data’s hierarchy improves graph readability.
164
+ The main differences are that running memory_graph locally is a key design choice to support Python Tutor’s [unsupported features](https://github.com/pythontutor-dev/pythontutor/blob/master/unsupported-features.md#unsupported-features) and mirroring the data’s hierarchy improves graph readability.
165
165
 
166
166
  ## Social Media #
167
167
  * [LinkedIn](https://www.linkedin.com/groups/13244150/)
@@ -773,7 +773,7 @@ Different aspects of memory_graph can be configured. The default configuration c
773
773
 
774
774
 
775
775
  ## Simplified Graph ##
776
- Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a` won’t affect `b`) so will never result in bugs.
776
+ Memory_graph simplifies the visualization (and the viewer's mental model) by **not** showing separate nodes for immutable types like `bool`, `int`, `float`, `complex`, and `str` by default. This simplification can sometimes be slightly misleading. As in the example below, after a shallow copy, lists `a` and `b` technically share their `int` values, but the graph makes it appear as though `a` and `b` each have their own copies. However, since `int` is immutable, this simplification will never lead to unexpected changes (changing `a`'s ints won’t affect `b`) so will never result in bugs.
777
777
 
778
778
  The simplification strikes a balance: it is slightly misleading but keeps the graph clean and easy to understand and focuses on the mutable types where unexpected changes can occur. This is why it is the default behavior. If you do want to show separate nodes for `int` values, such as for educational purposes, you can simply remove `int` from the `mg.config.embedded_types` set:
779
779
  ```python
@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
4
4
 
5
5
  [project]
6
6
  name = "memory_graph"
7
- version = "0.3.64"
7
+ version = "0.3.65"
8
8
  description = "Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy."
9
9
  authors = [
10
10
  {name = "Bas Terwijn", email = "bterwijn@gmail.com"}
File without changes
File without changes
File without changes