memory-graph 0.3.33__tar.gz → 0.3.35__tar.gz

{memory_graph-0.3.33/memory_graph.egg-info → memory_graph-0.3.35}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
-Name: memory-graph
-Version: 0.3.33
+Name: memory_graph
+Version: 0.3.35
 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
@@ -25,10 +25,13 @@ pip install --upgrade memory_graph
 ```
 Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 
+# Highlight #
+![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
+
 # 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) |
 |:--:|:--:|
-| [Quick Intro](https://www.youtube.com/watch?v=23_bHcr7hqo) | [Mutability](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
+| [Quick Intro (3:49)](https://www.youtube.com/watch?v=23_bHcr7hqo) | [Mutability (17:29)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
 
 # Memory Graph #
 For program understanding and debugging, the [memory_graph](https://pypi.org/project/memory-graph/) package can visualize your data, supporting many different data types, including but not limited to:
@@ -365,11 +368,11 @@ The ```mg.stack()``` doesn't work well in *watch* context in most debuggers beca
 
 | debugger | function to get the call stack |
 |:---|:---|
-| **pdb, pudb** | `mg.stack_pdb()` |
-| **Visual Studio Code** | `mg.stack_vscode()` |
-| **Cursor AI** | `mg.stack_cursor()` |
-| **PyCharm** | `mg.stack_pycharm()` |
-| **Wing** | `mg.stack_wing()` |
+| [pdb](https://docs.python.org/3/library/pdb.html), [pudb](https://pypi.org/project/pudb/) | `mg.stack_pdb()` |
+| [Visual Studio Code](https://code.visualstudio.com/docs/languages/python) | `mg.stack_vscode()` |
+| [Cursor AI](https://www.cursor.com/) | `mg.stack_cursor()` |
+| [PyCharm](https://www.jetbrains.com/pycharm/) | `mg.stack_pycharm()` |
+| [Wing](https://wingware.com/) | `mg.stack_wing()` |
 
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
 
@@ -378,12 +381,16 @@ For other debuggers, invoke this function within the *watch* context. Then, in t
 ```
 mg.save_call_stack("call_stack.txt")
 ```
-Choose the list of `after_functions` after any of which the slice start. Then choose the `through_function` at which the slice ends. The optional `drop` argument can be used to drop a number of stack frames at the start:
+Then to get the call stack use:
 ```
-mg.stack_after_through(after_functions : list[str],
-                       through_function : str = "<module>",
-					   drop : int = 0)
+mg.stack_after_through(after_functions : list[(str,int)],
+                       through_functions : list[str] = ["<module>"],
+                       stack_index: int = 0)
 ```
+with parameters:
+* after_functions: list of (function-name, offset), begins at the index of the first 'function-name' that is found in the call stack with additional 'offset'
+* through_functions: list of function-names, ends at the index of the first 'function-name' that is found in the call stack after begin index, inclusive
+* stack_index: number of frames removed at the beginning
 
 ## Debugging without Debugger Tool ##
 
@@ -419,7 +426,7 @@ and pressing &lt;Enter&gt; a number of times, results in:
 ![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.gif)
 
 # Data Structure Examples #
-Module memory_graph can be very useful in a course about data structures, some examples:
+Package memory_graph can be very useful in a data structures course, some examples:
 
 ## Circular Doubly Linked List ##
 ```python

{memory_graph-0.3.33 → memory_graph-0.3.35}/README.md

@@ -5,10 +5,13 @@ pip install --upgrade memory_graph
 ```
 Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
 
+# Highlight #
+![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
+
 # 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) |
 |:--:|:--:|
-| [Quick Intro](https://www.youtube.com/watch?v=23_bHcr7hqo) | [Mutability](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
+| [Quick Intro (3:49)](https://www.youtube.com/watch?v=23_bHcr7hqo) | [Mutability (17:29)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
 
 # Memory Graph #
 For program understanding and debugging, the [memory_graph](https://pypi.org/project/memory-graph/) package can visualize your data, supporting many different data types, including but not limited to:
@@ -345,11 +348,11 @@ The ```mg.stack()``` doesn't work well in *watch* context in most debuggers beca
 
 | debugger | function to get the call stack |
 |:---|:---|
-| **pdb, pudb** | `mg.stack_pdb()` |
-| **Visual Studio Code** | `mg.stack_vscode()` |
-| **Cursor AI** | `mg.stack_cursor()` |
-| **PyCharm** | `mg.stack_pycharm()` |
-| **Wing** | `mg.stack_wing()` |
+| [pdb](https://docs.python.org/3/library/pdb.html), [pudb](https://pypi.org/project/pudb/) | `mg.stack_pdb()` |
+| [Visual Studio Code](https://code.visualstudio.com/docs/languages/python) | `mg.stack_vscode()` |
+| [Cursor AI](https://www.cursor.com/) | `mg.stack_cursor()` |
+| [PyCharm](https://www.jetbrains.com/pycharm/) | `mg.stack_pycharm()` |
+| [Wing](https://wingware.com/) | `mg.stack_wing()` |
 
 ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
 
@@ -358,12 +361,16 @@ For other debuggers, invoke this function within the *watch* context. Then, in t
 ```
 mg.save_call_stack("call_stack.txt")
 ```
-Choose the list of `after_functions` after any of which the slice start. Then choose the `through_function` at which the slice ends. The optional `drop` argument can be used to drop a number of stack frames at the start:
+Then to get the call stack use:
 ```
-mg.stack_after_through(after_functions : list[str],
-                       through_function : str = "<module>",
-					   drop : int = 0)
+mg.stack_after_through(after_functions : list[(str,int)],
+                       through_functions : list[str] = ["<module>"],
+                       stack_index: int = 0)
 ```
+with parameters:
+* after_functions: list of (function-name, offset), begins at the index of the first 'function-name' that is found in the call stack with additional 'offset'
+* through_functions: list of function-names, ends at the index of the first 'function-name' that is found in the call stack after begin index, inclusive
+* stack_index: number of frames removed at the beginning
 
 ## Debugging without Debugger Tool ##
 
@@ -399,7 +406,7 @@ and pressing &lt;Enter&gt; a number of times, results in:
 ![debugging.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debugging.gif)
 
 # Data Structure Examples #
-Module memory_graph can be very useful in a course about data structures, some examples:
+Package memory_graph can be very useful in a data structures course, some examples:
 
 ## Circular Doubly Linked List ##
 ```python

{memory_graph-0.3.33 → memory_graph-0.3.35}/images/add_one.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node137466735742528 [label=<
+	node126282060615232 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="lightcoral" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
@@ -8,30 +8,30 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
 </TABLE>
 > xlabel=list]
-	node137466725676288 [label=<
+	node126282059347520 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="orange" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="1"> 2 </TD></TR>
 </TABLE>
 > xlabel=tuple]
-	node137466725033024 [label=<
+	node126282058704000 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="lightcoral" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="1"> 2 </TD></TR>
 </TABLE>
 > xlabel=list]
-	node137466725795136 [label=<
+	node126282059262656 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> a </TD><TD BORDER="1" STYLE="ROUNDED"> b </TD><TD BORDER="1" STYLE="ROUNDED"> c </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD><TD BORDER="1" PORT="ref2"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node137466725795136:ref0 -> node137466735742528:table [style=solid]
-	node137466725795136:ref1 -> node137466725676288:table [style=solid]
-	node137466725795136:ref2 -> node137466725033024:table [style=solid]
-	node137466735685488 [label=<
+	node126282059262656:ref0 -> node126282060615232:table [style=solid]
+	node126282059262656:ref1 -> node126282059347520:table [style=solid]
+	node126282059262656:ref2 -> node126282058704000:table [style=solid]
+	node126282054174976 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="orange" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
@@ -39,7 +39,7 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
 </TABLE>
 > xlabel=tuple]
-	node137466721103040 [label=<
+	node126282059346752 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="lightcoral" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
@@ -47,23 +47,23 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
 </TABLE>
 > xlabel=list]
-	node137466725590528 [label=<
+	node126282059717312 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> a </TD><TD BORDER="1" STYLE="ROUNDED"> b </TD><TD BORDER="1" STYLE="ROUNDED"> c </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD><TD BORDER="1" PORT="ref2"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node137466725590528:ref0 -> node137466735742528:table [style=solid]
-	node137466725590528:ref1 -> node137466735685488:table [style=solid]
-	node137466725590528:ref2 -> node137466721103040:table [style=solid]
-	node137466721135792 [label=<
+	node126282059717312:ref0 -> node126282060615232:table [style=solid]
+	node126282059717312:ref1 -> node126282054174976:table [style=solid]
+	node126282059717312:ref2 -> node126282059346752:table [style=solid]
+	node126282054399184 [label=<
 <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="khaki" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> 0: &lt;module&gt; </TD><TD BORDER="1" STYLE="ROUNDED"> 1: add_one </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
 </TABLE>
 > xlabel=call_stack]
-	node137466721135792:ref0 -> node137466725795136:table [style=solid]
-	node137466721135792:ref1 -> node137466725590528:table [style=solid]
-subgraph { rank=same; node137466725795136 -> node137466725590528[weight=10, style=invis]; }
-subgraph { rank=same; node137466735742528 -> node137466725676288 -> node137466725033024 -> node137466735685488 -> node137466721103040[weight=10, style=invis]; }
+	node126282054399184:ref0 -> node126282059262656:table [style=solid]
+	node126282054399184:ref1 -> node126282059717312:table [style=solid]
+subgraph { rank=same; node126282059262656 -> node126282059717312[weight=10, style=invis]; }
+subgraph { rank=same; node126282060615232 -> node126282059347520 -> node126282058704000 -> node126282054174976 -> node126282059346752[weight=10, style=invis]; }
 }

{memory_graph-0.3.33 → memory_graph-0.3.35}/images/avltree_key_value.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node132871625148672 [label=<
+	node126062163823168 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> left </TD><TD BORDER="1"> None </TD></TR>
     <TR><TD BORDER="1" STYLE="ROUNDED"> key </TD><TD BORDER="1"> 5 </TD></TR>
@@ -8,7 +8,7 @@ digraph memory_graph {
     <TR><TD BORDER="1" STYLE="ROUNDED"> right </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node132871625361264 [label=<
+	node126062164002992 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> left </TD><TD BORDER="1"> None </TD></TR>
     <TR><TD BORDER="1" STYLE="ROUNDED"> key </TD><TD BORDER="1"> 15 </TD></TR>
@@ -16,34 +16,34 @@ digraph memory_graph {
     <TR><TD BORDER="1" STYLE="ROUNDED"> right </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node132871625361344 [label=<
+	node126062164003072 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> left </TD><TD BORDER="1" STYLE="ROUNDED"> key </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> right </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 20 </TD><TD BORDER="1"> twenty </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node132871625361344:ref0 -> node132871625361264:table [style=solid]
-	node132871630909296 [label=<
+	node126062164003072:ref0 -> node126062164002992:table [style=solid]
+	node126062169976688 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> left </TD><TD BORDER="1" STYLE="ROUNDED"> key </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> right </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 10 </TD><TD BORDER="1"> ten </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node132871630909296:ref0 -> node132871625148672:table [style=solid]
-	node132871630909296:ref1 -> node132871625361344:table [style=solid]
-	node132871626542112 [label=<
+	node126062169976688:ref0 -> node126062163823168:table [style=solid]
+	node126062169976688:ref1 -> node126062164003072:table [style=solid]
+	node126062165609504 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
 </TABLE>
 > xlabel=AVLTree]
-	node132871626542112:ref0 -> node132871630909296:table [style=solid]
-	node132871629260608 [label=<
+	node126062165609504:ref0 -> node126062169976688:table [style=solid]
+	node126062168328064 [label=<
 <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node132871629260608:ref0 -> node132871626542112:table [style=solid]
-subgraph { rank=same; node132871625148672 -> node132871625361344[weight=10, style=invis]; }
+	node126062168328064:ref0 -> node126062165609504:table [style=solid]
+subgraph { rank=same; node126062163823168 -> node126062164003072[weight=10, style=invis]; }
 }

{memory_graph-0.3.33 → memory_graph-0.3.35}/images/avltree_leaf.gv

@@ -1,22 +1,22 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node132871630909296 [label=<
+	node126062169976688 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="1"> key:10 value:ten </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node132871626542112 [label=<
+	node126062165609504 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
 </TABLE>
 > xlabel=AVLTree]
-	node132871626542112:ref0 -> node132871630909296:table [style=solid]
-	node132871629260608 [label=<
+	node126062165609504:ref0 -> node126062169976688:table [style=solid]
+	node126062168328064 [label=<
 <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node132871629260608:ref0 -> node132871626542112:table [style=solid]
+	node126062168328064:ref0 -> node126062165609504:table [style=solid]
 }

{memory_graph-0.3.33 → memory_graph-0.3.35}/images/avltree_linear.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node132871625148672 [label=<
+	node126062163823168 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> left: </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD></TR>
@@ -12,7 +12,7 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">7</font></TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node132871625361264 [label=<
+	node126062164002992 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> left: </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD></TR>
@@ -24,34 +24,34 @@ digraph memory_graph {
     <TR><TD BORDER="0"><font color="#505050">7</font></TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node132871625361344 [label=<
+	node126062164003072 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="0"><font color="#505050">4</font></TD><TD BORDER="0"><font color="#505050">5</font></TD><TD BORDER="0"><font color="#505050">6</font></TD><TD BORDER="0"><font color="#505050">7</font></TD></TR>
     <TR><TD BORDER="1"> left: </TD><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> key: </TD><TD BORDER="1"> 20 </TD><TD BORDER="1"> value: </TD><TD BORDER="1"> twenty </TD><TD BORDER="1"> right: </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node132871625361344:ref0 -> node132871625361264:table [style=solid]
-	node132871630909296 [label=<
+	node126062164003072:ref0 -> node126062164002992:table [style=solid]
+	node126062169976688 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="0"><font color="#505050">4</font></TD><TD BORDER="0"><font color="#505050">5</font></TD><TD BORDER="0"><font color="#505050">6</font></TD><TD BORDER="0"><font color="#505050">7</font></TD></TR>
     <TR><TD BORDER="1"> left: </TD><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> key: </TD><TD BORDER="1"> 10 </TD><TD BORDER="1"> value: </TD><TD BORDER="1"> ten </TD><TD BORDER="1"> right: </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
 </TABLE>
 > xlabel="Node"]
-	node132871630909296:ref0 -> node132871625148672:table [style=solid]
-	node132871630909296:ref1 -> node132871625361344:table [style=solid]
-	node132871626542112 [label=<
+	node126062169976688:ref0 -> node126062163823168:table [style=solid]
+	node126062169976688:ref1 -> node126062164003072:table [style=solid]
+	node126062165609504 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
 </TABLE>
 > xlabel=AVLTree]
-	node132871626542112:ref0 -> node132871630909296:table [style=solid]
-	node132871629260608 [label=<
+	node126062165609504:ref0 -> node126062169976688:table [style=solid]
+	node126062168328064 [label=<
 <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node132871629260608:ref0 -> node132871626542112:table [style=solid]
-subgraph { rank=same; node132871625148672 -> node132871625361344[weight=10, style=invis]; }
+	node126062168328064:ref0 -> node126062165609504:table [style=solid]
+subgraph { rank=same; node126062163823168 -> node126062164003072[weight=10, style=invis]; }
 }

{memory_graph-0.3.33 → memory_graph-0.3.35}/images/avltree_table.gv

@@ -1,49 +1,49 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node132871625148672 [label=<
+	node126062163823168 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0">  </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 5 </TD><TD BORDER="1"> five </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node 2⨯2"]
-	node132871625361264 [label=<
+	node126062164002992 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0">  </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 15 </TD><TD BORDER="1"> fifteen </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node 2⨯2"]
-	node132871625361344 [label=<
+	node126062164003072 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0">  </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 20 </TD><TD BORDER="1"> twenty </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel="Node 2⨯2"]
-	node132871625361344:ref0 -> node132871625361264:table [style=solid]
-	node132871630909296 [label=<
+	node126062164003072:ref0 -> node126062164002992:table [style=solid]
+	node126062169976688 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
     <TR><TD BORDER="0">  </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
     <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 10 </TD><TD BORDER="1"> ten </TD></TR>
     <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
 </TABLE>
 > xlabel="Node 2⨯2"]
-	node132871630909296:ref0 -> node132871625148672:table [style=solid]
-	node132871630909296:ref1 -> node132871625361344:table [style=solid]
-	node132871626542112 [label=<
+	node126062169976688:ref0 -> node126062163823168:table [style=solid]
+	node126062169976688:ref1 -> node126062164003072:table [style=solid]
+	node126062165609504 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
 </TABLE>
 > xlabel=AVLTree]
-	node132871626542112:ref0 -> node132871630909296:table [style=solid]
-	node132871629260608 [label=<
+	node126062165609504:ref0 -> node126062169976688:table [style=solid]
+	node126062168328064 [label=<
 <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node132871629260608:ref0 -> node132871626542112:table [style=solid]
-subgraph { rank=same; node132871625148672 -> node132871625361344[weight=10, style=invis]; }
+	node126062168328064:ref0 -> node126062165609504:table [style=solid]
+subgraph { rank=same; node126062163823168 -> node126062164003072[weight=10, style=invis]; }
 }

memory_graph-0.3.35/images/bin_search.py

@@ -0,0 +1,31 @@
+import memory_graph as mg
+
+class 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()
+    mid_value = view[mid]
+    if value < mid_value:
+        return bin_search(View(view.lst, view.begin, mid), value)
+    elif value > mid_value:
+        return bin_search(View(view.lst, mid, view.end), value)
+    else:
+        return mid
+
+
+n = 15
+data = [i for i in range(n)]
+value = n//3
+index = bin_search(View(data, 0, len(data)), value)
+print(f'{index=}')