memory-graph 0.3.34__tar.gz → 0.3.36__tar.gz

{memory_graph-0.3.34/memory_graph.egg-info → memory_graph-0.3.36}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: memory_graph
-Version: 0.3.34
+Version: 0.3.36
 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
@@ -381,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 ##
 
@@ -458,6 +462,10 @@ for i in range(n):
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
+### Linked List in Cursor AI ###
+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)
+
 ## Binary Tree ##
 ```python
 import memory_graph as mg
@@ -494,6 +502,11 @@ for i in range(n):
 ```
 ![bin_tree.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.png)
 
+### Binary Tree in Visual Studio Code ###
+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)
+
+
 ## Hash Set ##
 ```python
 import memory_graph as mg
@@ -532,6 +545,10 @@ for i in range(n):
 ```
 ![hash_set.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.png)
 
+### Hash Set in PyCharm ###
+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)
+
 
 # Configuration #
 Different aspects of memory_graph can be configured. The default configuration is reset by importing 'memory_graph.config_default'.

{memory_graph-0.3.34 → memory_graph-0.3.36}/README.md

@@ -361,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 ##
 
@@ -438,6 +442,10 @@ for i in range(n):
 ```
 ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
 
+### Linked List in Cursor AI ###
+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)
+
 ## Binary Tree ##
 ```python
 import memory_graph as mg
@@ -474,6 +482,11 @@ for i in range(n):
 ```
 ![bin_tree.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.png)
 
+### Binary Tree in Visual Studio Code ###
+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)
+
+
 ## Hash Set ##
 ```python
 import memory_graph as mg
@@ -512,6 +525,10 @@ for i in range(n):
 ```
 ![hash_set.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.png)
 
+### Hash Set in PyCharm ###
+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)
+
 
 # Configuration #
 Different aspects of memory_graph can be configured. The default configuration is reset by importing 'memory_graph.config_default'.

{memory_graph-0.3.34 → memory_graph-0.3.36}/images/add_one.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node128708527869504 [label=<
+	node139538407968320 [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]
-	node128708517705152 [label=<
+	node139538406700608 [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]
-	node128708517061760 [label=<
+	node139538406057088 [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]
-	node128708517824128 [label=<
+	node139538406615744 [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]
-	node128708517824128:ref0 -> node128708527869504:table [style=solid]
-	node128708517824128:ref1 -> node128708517705152:table [style=solid]
-	node128708517824128:ref2 -> node128708517061760:table [style=solid]
-	node128708527812464 [label=<
+	node139538406615744:ref0 -> node139538407968320:table [style=solid]
+	node139538406615744:ref1 -> node139538406700608:table [style=solid]
+	node139538406615744:ref2 -> node139538406057088:table [style=solid]
+	node139538407911280 [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]
-	node128708513131968 [label=<
+	node139538406699840 [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]
-	node128708517619328 [label=<
+	node139538407070464 [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]
-	node128708517619328:ref0 -> node128708527869504:table [style=solid]
-	node128708517619328:ref1 -> node128708527812464:table [style=solid]
-	node128708517619328:ref2 -> node128708513131968:table [style=solid]
-	node128708513164544 [label=<
+	node139538407070464:ref0 -> node139538407968320:table [style=solid]
+	node139538407070464:ref1 -> node139538407911280:table [style=solid]
+	node139538407070464:ref2 -> node139538406699840:table [style=solid]
+	node139538402161472 [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]
-	node128708513164544:ref0 -> node128708517824128:table [style=solid]
-	node128708513164544:ref1 -> node128708517619328:table [style=solid]
-subgraph { rank=same; node128708517824128 -> node128708517619328[weight=10, style=invis]; }
-subgraph { rank=same; node128708527869504 -> node128708517705152 -> node128708517061760 -> node128708527812464 -> node128708513131968[weight=10, style=invis]; }
+	node139538402161472:ref0 -> node139538406615744:table [style=solid]
+	node139538402161472:ref1 -> node139538407070464:table [style=solid]
+subgraph { rank=same; node139538406615744 -> node139538407070464[weight=10, style=invis]; }
+subgraph { rank=same; node139538407968320 -> node139538406700608 -> node139538406057088 -> node139538407911280 -> node139538406699840[weight=10, style=invis]; }
 }

{memory_graph-0.3.34 → memory_graph-0.3.36}/images/avltree_key_value.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node131165615065344 [label=<
+	node139129545607584 [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"]
-	node131165615261552 [label=<
+	node139129545787328 [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"]
-	node131165615261632 [label=<
+	node139129545787408 [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"]
-	node131165615261632:ref0 -> node131165615261552:table [style=solid]
-	node131165620825968 [label=<
+	node139129545787408:ref0 -> node139129545787328:table [style=solid]
+	node139129551351664 [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"]
-	node131165620825968:ref0 -> node131165615065344:table [style=solid]
-	node131165620825968:ref1 -> node131165615261632:table [style=solid]
-	node131165616458784 [label=<
+	node139129551351664:ref0 -> node139129545607584:table [style=solid]
+	node139129551351664:ref1 -> node139129545787408:table [style=solid]
+	node139129546984480 [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]
-	node131165616458784:ref0 -> node131165620825968:table [style=solid]
-	node131165619177344 [label=<
+	node139129546984480:ref0 -> node139129551351664:table [style=solid]
+	node139129549703040 [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]
-	node131165619177344:ref0 -> node131165616458784:table [style=solid]
-subgraph { rank=same; node131165615065344 -> node131165615261632[weight=10, style=invis]; }
+	node139129549703040:ref0 -> node139129546984480:table [style=solid]
+subgraph { rank=same; node139129545607584 -> node139129545787408[weight=10, style=invis]; }
 }

{memory_graph-0.3.34 → memory_graph-0.3.36}/images/avltree_leaf.gv

@@ -1,22 +1,22 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node131165620825968 [label=<
+	node139129551351664 [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"]
-	node131165616458784 [label=<
+	node139129546984480 [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]
-	node131165616458784:ref0 -> node131165620825968:table [style=solid]
-	node131165619177344 [label=<
+	node139129546984480:ref0 -> node139129551351664:table [style=solid]
+	node139129549703040 [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]
-	node131165619177344:ref0 -> node131165616458784:table [style=solid]
+	node139129549703040:ref0 -> node139129546984480:table [style=solid]
 }

{memory_graph-0.3.34 → memory_graph-0.3.36}/images/avltree_linear.gv

@@ -1,6 +1,6 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node131165615065344 [label=<
+	node139129545607584 [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"]
-	node131165615261552 [label=<
+	node139129545787328 [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"]
-	node131165615261632 [label=<
+	node139129545787408 [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"]
-	node131165615261632:ref0 -> node131165615261552:table [style=solid]
-	node131165620825968 [label=<
+	node139129545787408:ref0 -> node139129545787328:table [style=solid]
+	node139129551351664 [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"]
-	node131165620825968:ref0 -> node131165615065344:table [style=solid]
-	node131165620825968:ref1 -> node131165615261632:table [style=solid]
-	node131165616458784 [label=<
+	node139129551351664:ref0 -> node139129545607584:table [style=solid]
+	node139129551351664:ref1 -> node139129545787408:table [style=solid]
+	node139129546984480 [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]
-	node131165616458784:ref0 -> node131165620825968:table [style=solid]
-	node131165619177344 [label=<
+	node139129546984480:ref0 -> node139129551351664:table [style=solid]
+	node139129549703040 [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]
-	node131165619177344:ref0 -> node131165616458784:table [style=solid]
-subgraph { rank=same; node131165615065344 -> node131165615261632[weight=10, style=invis]; }
+	node139129549703040:ref0 -> node139129546984480:table [style=solid]
+subgraph { rank=same; node139129545607584 -> node139129545787408[weight=10, style=invis]; }
 }

{memory_graph-0.3.34 → memory_graph-0.3.36}/images/avltree_table.gv

@@ -1,49 +1,49 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node131165615065344 [label=<
+	node139129545607584 [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"]
-	node131165615261552 [label=<
+	node139129545787328 [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"]
-	node131165615261632 [label=<
+	node139129545787408 [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"]
-	node131165615261632:ref0 -> node131165615261552:table [style=solid]
-	node131165620825968 [label=<
+	node139129545787408:ref0 -> node139129545787328:table [style=solid]
+	node139129551351664 [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"]
-	node131165620825968:ref0 -> node131165615065344:table [style=solid]
-	node131165620825968:ref1 -> node131165615261632:table [style=solid]
-	node131165616458784 [label=<
+	node139129551351664:ref0 -> node139129545607584:table [style=solid]
+	node139129551351664:ref1 -> node139129545787408:table [style=solid]
+	node139129546984480 [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]
-	node131165616458784:ref0 -> node131165620825968:table [style=solid]
-	node131165619177344 [label=<
+	node139129546984480:ref0 -> node139129551351664:table [style=solid]
+	node139129549703040 [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]
-	node131165619177344:ref0 -> node131165616458784:table [style=solid]
-subgraph { rank=same; node131165615065344 -> node131165615261632[weight=10, style=invis]; }
+	node139129549703040:ref0 -> node139129546984480:table [style=solid]
+subgraph { rank=same; node139129545607584 -> node139129545787408[weight=10, style=invis]; }
 }

memory_graph-0.3.36/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=}')

{memory_graph-0.3.34 → memory_graph-0.3.36}/images/bin_tree.gv

@@ -1,110 +1,110 @@
 digraph memory_graph {
 	node [shape=plaintext]
-	node82431472 [label=<
+	node307374992 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="0" CELLPADDING="0" BGCOLOR="seagreen3" PORT="table">
     <TR><TD BORDER="0"> </TD></TR>
 </TABLE>
 > xlabel=type]
-	node133874545035728 [label=<
+	node137103008811472 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1"> None </TD></TR>
     <TR><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1"> 33 </TD></TR>
     <TR><TD BORDER="1" STYLE="ROUNDED"> larger </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel=BinTree]
-	node133874545035424 [label=<
+	node137103008811168 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> larger </TD></TR>
     <TR><TD BORDER="1"> None </TD><TD BORDER="1"> 5 </TD><TD BORDER="1" PORT="ref0"> </TD></TR>
 </TABLE>
 > xlabel=BinTree]
-	node133874545035424:ref0 -> node133874545035728:table [style=solid]
-	node133874546146800 [label=<
+	node137103008811168:ref0 -> node137103008811472:table [style=solid]
+	node137103009955040 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1"> None </TD></TR>
     <TR><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1"> 51 </TD></TR>
     <TR><TD BORDER="1" STYLE="ROUNDED"> larger </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel=BinTree]
-	node133874546146528 [label=<
+	node137103009954768 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1"> None </TD></TR>
     <TR><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1"> 62 </TD></TR>
     <TR><TD BORDER="1" STYLE="ROUNDED"> larger </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel=BinTree]
-	node133874544960304 [label=<
+	node137103008736048 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> larger </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 65 </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel=BinTree]
-	node133874544960304:ref0 -> node133874546146528:table [style=solid]
-	node133874546306064 [label=<
+	node137103008736048:ref0 -> node137103009954768:table [style=solid]
+	node137103010049360 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> larger </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 53 </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
 </TABLE>
 > xlabel=BinTree]
-	node133874546306064:ref0 -> node133874546146800:table [style=solid]
-	node133874546306064:ref1 -> node133874544960304:table [style=solid]
-	node133874546305744 [label=<
+	node137103010049360:ref0 -> node137103009955040:table [style=solid]
+	node137103010049360:ref1 -> node137103008736048:table [style=solid]
+	node137103010049040 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> larger </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 97 </TD><TD BORDER="1"> None </TD></TR>
 </TABLE>
 > xlabel=BinTree]
-	node133874546305744:ref0 -> node133874546306064:table [style=solid]
-	node133874546510544 [label=<
+	node137103010049040:ref0 -> node137103010049360:table [style=solid]
+	node137103010269904 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> larger </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 49 </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
 </TABLE>
 > xlabel=BinTree]
-	node133874546510544:ref0 -> node133874545035424:table [style=solid]
-	node133874546510544:ref1 -> node133874546305744:table [style=solid]
-	node133874545194368 [label=<
+	node137103010269904:ref0 -> node137103008811168:table [style=solid]
+	node137103010269904:ref1 -> node137103010049040:table [style=solid]
+	node137103008956160 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> BinTree </TD><TD BORDER="1" STYLE="ROUNDED"> tree </TD><TD BORDER="1" STYLE="ROUNDED"> n </TD><TD BORDER="1" STYLE="ROUNDED"> i </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD><TD BORDER="1"> 100 </TD><TD BORDER="1"> 7 </TD><TD BORDER="1"> 51 </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node133874545194368:ref0 -> node82431472:table [style=solid]
-	node133874545194368:ref1 -> node133874546510544:table [style=solid]
-	node133874545194240 [label=<
+	node137103008956160:ref0 -> node307374992:table [style=solid]
+	node137103008956160:ref1 -> node137103010269904:table [style=solid]
+	node137103009055040 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> self </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 51 </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node133874545194240:ref0 -> node133874546510544:table [style=solid]
-	node133874545194688 [label=<
+	node137103009055040:ref0 -> node137103010269904:table [style=solid]
+	node137103009055104 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> self </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 51 </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node133874545194688:ref0 -> node133874546305744:table [style=solid]
-	node133874545194816 [label=<
+	node137103009055104:ref0 -> node137103010049040:table [style=solid]
+	node137103009055232 [label=<
 <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
     <TR><TD BORDER="1" STYLE="ROUNDED"> self </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 51 </TD></TR>
 </TABLE>
 > xlabel=dict]
-	node133874545194816:ref0 -> node133874546306064:table [style=solid]
-	node133874545247328 [label=<
+	node137103009055232:ref0 -> node137103010049360:table [style=solid]
+	node137103009025552 [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: BinTree.add </TD><TD BORDER="1" STYLE="ROUNDED"> 2: BinTree.add </TD><TD BORDER="1" STYLE="ROUNDED"> 3: BinTree.add </TD></TR>
     <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD><TD BORDER="1" PORT="ref2"> </TD><TD BORDER="1" PORT="ref3"> </TD></TR>
 </TABLE>
 > xlabel=call_stack]
-	node133874545247328:ref0 -> node133874545194368:table [style=solid]
-	node133874545247328:ref1 -> node133874545194240:table [style=solid]
-	node133874545247328:ref2 -> node133874545194688:table [style=solid]
-	node133874545247328:ref3 -> node133874545194816:table [style=solid]
-subgraph { rank=same; node133874545194368 -> node133874545194240 -> node133874545194688 -> node133874545194816[weight=10, style=invis]; }
-subgraph { rank=same; node82431472 -> node133874546510544[weight=10, style=invis]; }
-subgraph { rank=same; node133874545035424 -> node133874546305744[weight=10, style=invis]; }
-subgraph { rank=same; node133874545035728 -> node133874546306064[weight=10, style=invis]; }
-subgraph { rank=same; node133874546146800 -> node133874544960304[weight=10, style=invis]; }
+	node137103009025552:ref0 -> node137103008956160:table [style=solid]
+	node137103009025552:ref1 -> node137103009055040:table [style=solid]
+	node137103009025552:ref2 -> node137103009055104:table [style=solid]
+	node137103009025552:ref3 -> node137103009055232:table [style=solid]
+subgraph { rank=same; node137103008956160 -> node137103009055040 -> node137103009055104 -> node137103009055232[weight=10, style=invis]; }
+subgraph { rank=same; node307374992 -> node137103010269904[weight=10, style=invis]; }
+subgraph { rank=same; node137103008811168 -> node137103010049040[weight=10, style=invis]; }
+subgraph { rank=same; node137103008811472 -> node137103010049360[weight=10, style=invis]; }
+subgraph { rank=same; node137103009955040 -> node137103008736048[weight=10, style=invis]; }
 }