memory-graph 0.3.35__tar.gz → 0.3.36__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 (236) hide show
  1. {memory_graph-0.3.35/memory_graph.egg-info → memory_graph-0.3.36}/PKG-INFO +14 -1
  2. {memory_graph-0.3.35 → memory_graph-0.3.36}/README.md +13 -0
  3. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/add_one.gv +18 -18
  4. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_key_value.gv +12 -12
  5. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_leaf.gv +5 -5
  6. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_linear.gv +12 -12
  7. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_table.gv +12 -12
  8. memory_graph-0.3.36/images/bin_tree.gif +0 -0
  9. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/bin_tree.gv +35 -35
  10. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/copies.gv +20 -20
  11. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/copy_method.gv +16 -16
  12. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging01.gv +8 -8
  13. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging01.png +0 -0
  14. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging02.gv +11 -11
  15. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging02.png +0 -0
  16. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging03.gv +13 -13
  17. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging03.png +0 -0
  18. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging04.gv +15 -15
  19. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging04.png +0 -0
  20. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging05.gv +17 -17
  21. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging05.png +0 -0
  22. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging06.gv +17 -17
  23. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging06.png +0 -0
  24. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/extension_numpy.gv +8 -8
  25. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/extension_pandas.gv +8 -8
  26. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial0.gv +3 -3
  27. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial0.png +0 -0
  28. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial1.gv +6 -6
  29. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial1.png +0 -0
  30. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial2.gv +8 -8
  31. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial2.png +0 -0
  32. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial3.gv +10 -10
  33. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial3.png +0 -0
  34. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial4.gv +10 -10
  35. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial4.png +0 -0
  36. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial5.gv +8 -8
  37. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial5.png +0 -0
  38. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial6.gv +6 -6
  39. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial6.png +0 -0
  40. memory_graph-0.3.36/images/hash_set.gif +0 -0
  41. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/hash_set.gv +29 -29
  42. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/highlight.gv +16 -16
  43. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/immutable1.gv +4 -4
  44. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/immutable2.gv +6 -6
  45. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/introspect_depth.gv +56 -56
  46. memory_graph-0.3.36/images/linked_list.gif +0 -0
  47. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/linked_list.gv +20 -20
  48. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/many_types.gv +12 -12
  49. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/mutable1.gv +4 -4
  50. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/mutable2.gv +4 -4
  51. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/not_node_types1.gv +6 -6
  52. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/not_node_types2.gv +14 -14
  53. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set0.gv +11 -11
  54. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set0.png +0 -0
  55. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set1.gv +17 -17
  56. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set1.png +0 -0
  57. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set10.gv +36 -36
  58. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set10.png +0 -0
  59. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set11.gv +31 -31
  60. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set11.png +0 -0
  61. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set12.gv +31 -31
  62. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set12.png +0 -0
  63. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set13.gv +36 -36
  64. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set13.png +0 -0
  65. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set14.gv +41 -41
  66. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set14.png +0 -0
  67. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set15.gv +43 -43
  68. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set15.png +0 -0
  69. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set16.gv +40 -40
  70. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set16.png +0 -0
  71. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set17.gv +40 -40
  72. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set17.png +0 -0
  73. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set18.gv +45 -45
  74. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set18.png +0 -0
  75. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set19.gv +47 -47
  76. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set19.png +0 -0
  77. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set2.gv +22 -22
  78. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set2.png +0 -0
  79. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set20.gv +44 -44
  80. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set20.png +0 -0
  81. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set21.gv +39 -39
  82. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set21.png +0 -0
  83. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set22.gv +34 -34
  84. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set22.png +0 -0
  85. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set23.gv +28 -28
  86. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set23.png +0 -0
  87. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set3.gv +27 -27
  88. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set3.png +0 -0
  89. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set4.gv +32 -32
  90. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set4.png +0 -0
  91. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set5.gv +34 -34
  92. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set5.png +0 -0
  93. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set6.gv +32 -32
  94. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set6.png +0 -0
  95. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set7.gv +32 -32
  96. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set7.png +0 -0
  97. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set8.gv +37 -37
  98. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set8.png +0 -0
  99. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set9.gv +39 -39
  100. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set9.png +0 -0
  101. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/rebinding1.gv +4 -4
  102. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/rebinding2.gv +6 -6
  103. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/__init__.py +3 -11
  104. {memory_graph-0.3.35 → memory_graph-0.3.36/memory_graph.egg-info}/PKG-INFO +14 -1
  105. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph.egg-info/SOURCES.txt +3 -0
  106. {memory_graph-0.3.35 → memory_graph-0.3.36}/pyproject.toml +1 -1
  107. {memory_graph-0.3.35 → memory_graph-0.3.36}/LICENSE.txt +0 -0
  108. {memory_graph-0.3.35 → memory_graph-0.3.36}/MANIFEST.in +0 -0
  109. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/-0 +0 -0
  110. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/.gif +0 -0
  111. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/add_one.png +0 -0
  112. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/add_one.py +0 -0
  113. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree.py +0 -0
  114. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree.py~ +0 -0
  115. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_dir.gv +0 -0
  116. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_dir.png +0 -0
  117. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_fail.gv +0 -0
  118. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_fail.png +0 -0
  119. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_key_value.png +0 -0
  120. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_leaf.png +0 -0
  121. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_linear.png +0 -0
  122. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_table.png +0 -0
  123. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/bin_search.py +0 -0
  124. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/bin_tree.png +0 -0
  125. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/bin_tree.py +0 -0
  126. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/bin_tree2.py +0 -0
  127. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/bin_tree2.py~ +0 -0
  128. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/call_stack.txt +0 -0
  129. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/colab_example.png +0 -0
  130. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/copies.png +0 -0
  131. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/copies.py +0 -0
  132. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/copy_method.png +0 -0
  133. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/copy_method.py +0 -0
  134. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/create_gif.sh +0 -0
  135. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/create_images.sh +0 -0
  136. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debug.gv +0 -0
  137. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debug.pdf +0 -0
  138. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debug_vscode.png +0 -0
  139. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging.gif +0 -0
  140. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/debugging.py +0 -0
  141. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/depth.gv +0 -0
  142. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/depth.png +0 -0
  143. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/extension_numpy.png +0 -0
  144. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/extension_numpy.py +0 -0
  145. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/extension_pandas.png +0 -0
  146. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/extension_pandas.py +0 -0
  147. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial.gif +0 -0
  148. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial.py +0 -0
  149. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial01.gv +0 -0
  150. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial02.gv +0 -0
  151. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial03.gv +0 -0
  152. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial04.gv +0 -0
  153. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial05.gv +0 -0
  154. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial06.gv +0 -0
  155. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/factorial07.gv +0 -0
  156. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/hash_set.png +0 -0
  157. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/hash_set.py +0 -0
  158. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/hidden_edges.gv +0 -0
  159. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/hidden_edges.png +0 -0
  160. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/hidden_edges.py +0 -0
  161. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/hidden_edges.py~ +0 -0
  162. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/highlight.png +0 -0
  163. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/highlight.py +0 -0
  164. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/immutable.py +0 -0
  165. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/immutable1.png +0 -0
  166. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/immutable2.png +0 -0
  167. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/introspect_depth.png +0 -0
  168. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/introspect_depth.py +0 -0
  169. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/introspect_depth.py~ +0 -0
  170. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/ipython.png +0 -0
  171. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/jupyter_example.png +0 -0
  172. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/linked_list.png +0 -0
  173. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/linked_list.py +0 -0
  174. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/log.txt +0 -0
  175. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/many_types.png +0 -0
  176. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/many_types.py +0 -0
  177. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/memory_graph.gv +0 -0
  178. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/memory_graph.gv.pdf +0 -0
  179. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/memory_graph.pdf +0 -0
  180. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/mutable.py +0 -0
  181. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/mutable1.png +0 -0
  182. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/mutable2.png +0 -0
  183. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/my_graph.gv +0 -0
  184. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/my_graph.pdf +0 -0
  185. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/name_rebinding.py +0 -0
  186. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/not_node_types.py +0 -0
  187. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/not_node_types.py~ +0 -0
  188. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/not_node_types1.png +0 -0
  189. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/not_node_types2.png +0 -0
  190. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set.gif +0 -0
  191. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set.py +0 -0
  192. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set19.png~ +0 -0
  193. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/power_set8.png~ +0 -0
  194. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/pyodide.png +0 -0
  195. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/rebinding1.png +0 -0
  196. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/rebinding2.png +0 -0
  197. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/stack.txt +0 -0
  198. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/test.py +0 -0
  199. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/test.py~ +0 -0
  200. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/uva.png +0 -0
  201. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/vsc.py +0 -0
  202. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/vsc.py~ +0 -0
  203. {memory_graph-0.3.35 → memory_graph-0.3.36}/images/vscode_copying.gif +0 -0
  204. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/call_stack.py +0 -0
  205. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/config.py +0 -0
  206. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/config_default.py +0 -0
  207. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/config_helpers.py +0 -0
  208. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/extension_numpy.py +0 -0
  209. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/extension_pandas.py +0 -0
  210. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/html_table.py +0 -0
  211. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/list_view.py +0 -0
  212. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/memory_to_nodes.py +0 -0
  213. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/node_base.py +0 -0
  214. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/node_key_value.py +0 -0
  215. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/node_leaf.py +0 -0
  216. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/node_linear.py +0 -0
  217. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/node_table.py +0 -0
  218. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/sequence.py +0 -0
  219. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/slicer.py +0 -0
  220. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/slices.py +0 -0
  221. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/slices_iterator.py +0 -0
  222. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/slices_table_iterator.py +0 -0
  223. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/test.py +0 -0
  224. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/test_max_graph_depth.py +0 -0
  225. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/test_memory_graph.py +0 -0
  226. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/test_memory_to_nodes.py +0 -0
  227. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/test_sequence.py +0 -0
  228. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/test_slicer.py +0 -0
  229. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/test_slices.py +0 -0
  230. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/test_slices_iterator.py +0 -0
  231. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph/utils.py +0 -0
  232. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph.egg-info/dependency_links.txt +0 -0
  233. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph.egg-info/requires.txt +0 -0
  234. {memory_graph-0.3.35 → memory_graph-0.3.36}/memory_graph.egg-info/top_level.txt +0 -0
  235. {memory_graph-0.3.35 → memory_graph-0.3.36}/setup.cfg +0 -0
  236. {memory_graph-0.3.35 → memory_graph-0.3.36}/setup.py +0 -0
{memory_graph-0.3.35/memory_graph.egg-info → memory_graph-0.3.36}/PKG-INFO RENAMED
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: memory_graph
3
- Version: 0.3.35
3
+ Version: 0.3.36
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
@@ -462,6 +462,10 @@ for i in range(n):
462
462
  ```
463
463
  ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
464
464
 
465
+ ### Linked List in Cursor AI ###
466
+ 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.
467
+ ![linked_list.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.gif)
468
+
465
469
  ## Binary Tree ##
466
470
  ```python
467
471
  import memory_graph as mg
@@ -498,6 +502,11 @@ for i in range(n):
498
502
  ```
499
503
  ![bin_tree.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.png)
500
504
 
505
+ ### Binary Tree in Visual Studio Code ###
506
+ 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.
507
+ ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
508
+
509
+
501
510
  ## Hash Set ##
502
511
  ```python
503
512
  import memory_graph as mg
@@ -536,6 +545,10 @@ for i in range(n):
536
545
  ```
537
546
  ![hash_set.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.png)
538
547
 
548
+ ### Hash Set in PyCharm ###
549
+ 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.
550
+ ![images/hash_set.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.gif)
551
+
539
552
 
540
553
  # Configuration #
541
554
  Different aspects of memory_graph can be configured. The default configuration is reset by importing 'memory_graph.config_default'.
{memory_graph-0.3.35 → memory_graph-0.3.36}/README.md RENAMED
@@ -442,6 +442,10 @@ for i in range(n):
442
442
  ```
443
443
  ![linked_list.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.png)
444
444
 
445
+ ### Linked List in Cursor AI ###
446
+ 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.
447
+ ![linked_list.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/linked_list.gif)
448
+
445
449
  ## Binary Tree ##
446
450
  ```python
447
451
  import memory_graph as mg
@@ -478,6 +482,11 @@ for i in range(n):
478
482
  ```
479
483
  ![bin_tree.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.png)
480
484
 
485
+ ### Binary Tree in Visual Studio Code ###
486
+ 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.
487
+ ![images/bin_tree.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/bin_tree.gif)
488
+
489
+
481
490
  ## Hash Set ##
482
491
  ```python
483
492
  import memory_graph as mg
@@ -516,6 +525,10 @@ for i in range(n):
516
525
  ```
517
526
  ![hash_set.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.png)
518
527
 
528
+ ### Hash Set in PyCharm ###
529
+ 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.
530
+ ![images/hash_set.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/hash_set.gif)
531
+
519
532
 
520
533
  # Configuration #
521
534
  Different aspects of memory_graph can be configured. The default configuration is reset by importing 'memory_graph.config_default'.
{memory_graph-0.3.35 → memory_graph-0.3.36}/images/add_one.gv RENAMED
@@ -1,6 +1,6 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node126282060615232 [label=<
3
+ node139538407968320 [label=<
4
4
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="lightcoral" PORT="table">
5
5
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
6
6
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
@@ -8,30 +8,30 @@ digraph memory_graph {
8
8
  <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
9
9
  </TABLE>
10
10
  > xlabel=list]
11
- node126282059347520 [label=<
11
+ node139538406700608 [label=<
12
12
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="orange" PORT="table">
13
13
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
14
14
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
15
15
  <TR><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="1"> 2 </TD></TR>
16
16
  </TABLE>
17
17
  > xlabel=tuple]
18
- node126282058704000 [label=<
18
+ node139538406057088 [label=<
19
19
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="lightcoral" PORT="table">
20
20
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
21
21
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
22
22
  <TR><TD BORDER="0"><font color="#505050">2</font></TD><TD BORDER="1"> 2 </TD></TR>
23
23
  </TABLE>
24
24
  > xlabel=list]
25
- node126282059262656 [label=<
25
+ node139538406615744 [label=<
26
26
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
27
27
  <TR><TD BORDER="1" STYLE="ROUNDED"> a </TD><TD BORDER="1" STYLE="ROUNDED"> b </TD><TD BORDER="1" STYLE="ROUNDED"> c </TD></TR>
28
28
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD><TD BORDER="1" PORT="ref2"> </TD></TR>
29
29
  </TABLE>
30
30
  > xlabel=dict]
31
- node126282059262656:ref0 -> node126282060615232:table [style=solid]
32
- node126282059262656:ref1 -> node126282059347520:table [style=solid]
33
- node126282059262656:ref2 -> node126282058704000:table [style=solid]
34
- node126282054174976 [label=<
31
+ node139538406615744:ref0 -> node139538407968320:table [style=solid]
32
+ node139538406615744:ref1 -> node139538406700608:table [style=solid]
33
+ node139538406615744:ref2 -> node139538406057088:table [style=solid]
34
+ node139538407911280 [label=<
35
35
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="orange" PORT="table">
36
36
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
37
37
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
@@ -39,7 +39,7 @@ digraph memory_graph {
39
39
  <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
40
40
  </TABLE>
41
41
  > xlabel=tuple]
42
- node126282059346752 [label=<
42
+ node139538406699840 [label=<
43
43
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="lightcoral" PORT="table">
44
44
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 4 </TD></TR>
45
45
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> 3 </TD></TR>
@@ -47,23 +47,23 @@ digraph memory_graph {
47
47
  <TR><TD BORDER="0"><font color="#505050">3</font></TD><TD BORDER="1"> 1 </TD></TR>
48
48
  </TABLE>
49
49
  > xlabel=list]
50
- node126282059717312 [label=<
50
+ node139538407070464 [label=<
51
51
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
52
52
  <TR><TD BORDER="1" STYLE="ROUNDED"> a </TD><TD BORDER="1" STYLE="ROUNDED"> b </TD><TD BORDER="1" STYLE="ROUNDED"> c </TD></TR>
53
53
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD><TD BORDER="1" PORT="ref2"> </TD></TR>
54
54
  </TABLE>
55
55
  > xlabel=dict]
56
- node126282059717312:ref0 -> node126282060615232:table [style=solid]
57
- node126282059717312:ref1 -> node126282054174976:table [style=solid]
58
- node126282059717312:ref2 -> node126282059346752:table [style=solid]
59
- node126282054399184 [label=<
56
+ node139538407070464:ref0 -> node139538407968320:table [style=solid]
57
+ node139538407070464:ref1 -> node139538407911280:table [style=solid]
58
+ node139538407070464:ref2 -> node139538406699840:table [style=solid]
59
+ node139538402161472 [label=<
60
60
  <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="khaki" PORT="table">
61
61
  <TR><TD BORDER="1" STYLE="ROUNDED"> 0: &lt;module&gt; </TD><TD BORDER="1" STYLE="ROUNDED"> 1: add_one </TD></TR>
62
62
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
63
63
  </TABLE>
64
64
  > xlabel=call_stack]
65
- node126282054399184:ref0 -> node126282059262656:table [style=solid]
66
- node126282054399184:ref1 -> node126282059717312:table [style=solid]
67
- subgraph { rank=same; node126282059262656 -> node126282059717312[weight=10, style=invis]; }
68
- subgraph { rank=same; node126282060615232 -> node126282059347520 -> node126282058704000 -> node126282054174976 -> node126282059346752[weight=10, style=invis]; }
65
+ node139538402161472:ref0 -> node139538406615744:table [style=solid]
66
+ node139538402161472:ref1 -> node139538407070464:table [style=solid]
67
+ subgraph { rank=same; node139538406615744 -> node139538407070464[weight=10, style=invis]; }
68
+ subgraph { rank=same; node139538407968320 -> node139538406700608 -> node139538406057088 -> node139538407911280 -> node139538406699840[weight=10, style=invis]; }
69
69
  }
{memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_key_value.gv RENAMED
@@ -1,6 +1,6 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node126062163823168 [label=<
3
+ node139129545607584 [label=<
4
4
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
5
5
  <TR><TD BORDER="1" STYLE="ROUNDED"> left </TD><TD BORDER="1"> None </TD></TR>
6
6
  <TR><TD BORDER="1" STYLE="ROUNDED"> key </TD><TD BORDER="1"> 5 </TD></TR>
@@ -8,7 +8,7 @@ digraph memory_graph {
8
8
  <TR><TD BORDER="1" STYLE="ROUNDED"> right </TD><TD BORDER="1"> None </TD></TR>
9
9
  </TABLE>
10
10
  > xlabel="Node"]
11
- node126062164002992 [label=<
11
+ node139129545787328 [label=<
12
12
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
13
13
  <TR><TD BORDER="1" STYLE="ROUNDED"> left </TD><TD BORDER="1"> None </TD></TR>
14
14
  <TR><TD BORDER="1" STYLE="ROUNDED"> key </TD><TD BORDER="1"> 15 </TD></TR>
@@ -16,34 +16,34 @@ digraph memory_graph {
16
16
  <TR><TD BORDER="1" STYLE="ROUNDED"> right </TD><TD BORDER="1"> None </TD></TR>
17
17
  </TABLE>
18
18
  > xlabel="Node"]
19
- node126062164003072 [label=<
19
+ node139129545787408 [label=<
20
20
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
21
21
  <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>
22
22
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 20 </TD><TD BORDER="1"> twenty </TD><TD BORDER="1"> None </TD></TR>
23
23
  </TABLE>
24
24
  > xlabel="Node"]
25
- node126062164003072:ref0 -> node126062164002992:table [style=solid]
26
- node126062169976688 [label=<
25
+ node139129545787408:ref0 -> node139129545787328:table [style=solid]
26
+ node139129551351664 [label=<
27
27
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
28
28
  <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>
29
29
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 10 </TD><TD BORDER="1"> ten </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
30
30
  </TABLE>
31
31
  > xlabel="Node"]
32
- node126062169976688:ref0 -> node126062163823168:table [style=solid]
33
- node126062169976688:ref1 -> node126062164003072:table [style=solid]
34
- node126062165609504 [label=<
32
+ node139129551351664:ref0 -> node139129545607584:table [style=solid]
33
+ node139129551351664:ref1 -> node139129545787408:table [style=solid]
34
+ node139129546984480 [label=<
35
35
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
36
36
  <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
37
37
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
38
38
  </TABLE>
39
39
  > xlabel=AVLTree]
40
- node126062165609504:ref0 -> node126062169976688:table [style=solid]
41
- node126062168328064 [label=<
40
+ node139129546984480:ref0 -> node139129551351664:table [style=solid]
41
+ node139129549703040 [label=<
42
42
  <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
43
43
  <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
44
44
  <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
45
45
  </TABLE>
46
46
  > xlabel=dict]
47
- node126062168328064:ref0 -> node126062165609504:table [style=solid]
48
- subgraph { rank=same; node126062163823168 -> node126062164003072[weight=10, style=invis]; }
47
+ node139129549703040:ref0 -> node139129546984480:table [style=solid]
48
+ subgraph { rank=same; node139129545607584 -> node139129545787408[weight=10, style=invis]; }
49
49
  }
{memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_leaf.gv RENAMED
@@ -1,22 +1,22 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node126062169976688 [label=<
3
+ node139129551351664 [label=<
4
4
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
5
5
  <TR><TD BORDER="1"> key:10 value:ten </TD></TR>
6
6
  </TABLE>
7
7
  > xlabel="Node"]
8
- node126062165609504 [label=<
8
+ node139129546984480 [label=<
9
9
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
10
10
  <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
11
11
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
12
12
  </TABLE>
13
13
  > xlabel=AVLTree]
14
- node126062165609504:ref0 -> node126062169976688:table [style=solid]
15
- node126062168328064 [label=<
14
+ node139129546984480:ref0 -> node139129551351664:table [style=solid]
15
+ node139129549703040 [label=<
16
16
  <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
17
17
  <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
18
18
  <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
19
19
  </TABLE>
20
20
  > xlabel=dict]
21
- node126062168328064:ref0 -> node126062165609504:table [style=solid]
21
+ node139129549703040:ref0 -> node139129546984480:table [style=solid]
22
22
  }
{memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_linear.gv RENAMED
@@ -1,6 +1,6 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node126062163823168 [label=<
3
+ node139129545607584 [label=<
4
4
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
5
5
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> left: </TD></TR>
6
6
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD></TR>
@@ -12,7 +12,7 @@ digraph memory_graph {
12
12
  <TR><TD BORDER="0"><font color="#505050">7</font></TD><TD BORDER="1"> None </TD></TR>
13
13
  </TABLE>
14
14
  > xlabel="Node"]
15
- node126062164002992 [label=<
15
+ node139129545787328 [label=<
16
16
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
17
17
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> left: </TD></TR>
18
18
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD></TR>
@@ -24,34 +24,34 @@ digraph memory_graph {
24
24
  <TR><TD BORDER="0"><font color="#505050">7</font></TD><TD BORDER="1"> None </TD></TR>
25
25
  </TABLE>
26
26
  > xlabel="Node"]
27
- node126062164003072 [label=<
27
+ node139129545787408 [label=<
28
28
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
29
29
  <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>
30
30
  <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>
31
31
  </TABLE>
32
32
  > xlabel="Node"]
33
- node126062164003072:ref0 -> node126062164002992:table [style=solid]
34
- node126062169976688 [label=<
33
+ node139129545787408:ref0 -> node139129545787328:table [style=solid]
34
+ node139129551351664 [label=<
35
35
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
36
36
  <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>
37
37
  <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>
38
38
  </TABLE>
39
39
  > xlabel="Node"]
40
- node126062169976688:ref0 -> node126062163823168:table [style=solid]
41
- node126062169976688:ref1 -> node126062164003072:table [style=solid]
42
- node126062165609504 [label=<
40
+ node139129551351664:ref0 -> node139129545607584:table [style=solid]
41
+ node139129551351664:ref1 -> node139129545787408:table [style=solid]
42
+ node139129546984480 [label=<
43
43
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
44
44
  <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
45
45
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
46
46
  </TABLE>
47
47
  > xlabel=AVLTree]
48
- node126062165609504:ref0 -> node126062169976688:table [style=solid]
49
- node126062168328064 [label=<
48
+ node139129546984480:ref0 -> node139129551351664:table [style=solid]
49
+ node139129549703040 [label=<
50
50
  <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
51
51
  <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
52
52
  <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
53
53
  </TABLE>
54
54
  > xlabel=dict]
55
- node126062168328064:ref0 -> node126062165609504:table [style=solid]
56
- subgraph { rank=same; node126062163823168 -> node126062164003072[weight=10, style=invis]; }
55
+ node139129549703040:ref0 -> node139129546984480:table [style=solid]
56
+ subgraph { rank=same; node139129545607584 -> node139129545787408[weight=10, style=invis]; }
57
57
  }
{memory_graph-0.3.35 → memory_graph-0.3.36}/images/avltree_table.gv RENAMED
@@ -1,49 +1,49 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node126062163823168 [label=<
3
+ node139129545607584 [label=<
4
4
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
5
5
  <TR><TD BORDER="0"> </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
6
6
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 5 </TD><TD BORDER="1"> five </TD></TR>
7
7
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD><TD BORDER="1"> None </TD></TR>
8
8
  </TABLE>
9
9
  > xlabel="Node 2⨯2"]
10
- node126062164002992 [label=<
10
+ node139129545787328 [label=<
11
11
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
12
12
  <TR><TD BORDER="0"> </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
13
13
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 15 </TD><TD BORDER="1"> fifteen </TD></TR>
14
14
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> None </TD><TD BORDER="1"> None </TD></TR>
15
15
  </TABLE>
16
16
  > xlabel="Node 2⨯2"]
17
- node126062164003072 [label=<
17
+ node139129545787408 [label=<
18
18
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
19
19
  <TR><TD BORDER="0"> </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
20
20
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 20 </TD><TD BORDER="1"> twenty </TD></TR>
21
21
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> None </TD></TR>
22
22
  </TABLE>
23
23
  > xlabel="Node 2⨯2"]
24
- node126062164003072:ref0 -> node126062164002992:table [style=solid]
25
- node126062169976688 [label=<
24
+ node139129545787408:ref0 -> node139129545787328:table [style=solid]
25
+ node139129551351664 [label=<
26
26
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="sandybrown" PORT="table">
27
27
  <TR><TD BORDER="0"> </TD><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="0"><font color="#505050">1</font></TD></TR>
28
28
  <TR><TD BORDER="0"><font color="#505050">0</font></TD><TD BORDER="1"> 10 </TD><TD BORDER="1"> ten </TD></TR>
29
29
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
30
30
  </TABLE>
31
31
  > xlabel="Node 2⨯2"]
32
- node126062169976688:ref0 -> node126062163823168:table [style=solid]
33
- node126062169976688:ref1 -> node126062164003072:table [style=solid]
34
- node126062165609504 [label=<
32
+ node139129551351664:ref0 -> node139129545607584:table [style=solid]
33
+ node139129551351664:ref1 -> node139129545787408:table [style=solid]
34
+ node139129546984480 [label=<
35
35
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
36
36
  <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
37
37
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
38
38
  </TABLE>
39
39
  > xlabel=AVLTree]
40
- node126062165609504:ref0 -> node126062169976688:table [style=solid]
41
- node126062168328064 [label=<
40
+ node139129546984480:ref0 -> node139129551351664:table [style=solid]
41
+ node139129549703040 [label=<
42
42
  <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
43
43
  <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
44
44
  <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
45
45
  </TABLE>
46
46
  > xlabel=dict]
47
- node126062168328064:ref0 -> node126062165609504:table [style=solid]
48
- subgraph { rank=same; node126062163823168 -> node126062164003072[weight=10, style=invis]; }
47
+ node139129549703040:ref0 -> node139129546984480:table [style=solid]
48
+ subgraph { rank=same; node139129545607584 -> node139129545787408[weight=10, style=invis]; }
49
49
  }
memory_graph-0.3.36/images/bin_tree.gif ADDED
Binary file
{memory_graph-0.3.35 → memory_graph-0.3.36}/images/bin_tree.gv RENAMED
@@ -1,110 +1,110 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node749939776 [label=<
3
+ node307374992 [label=<
4
4
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="0" CELLPADDING="0" BGCOLOR="seagreen3" PORT="table">
5
5
  <TR><TD BORDER="0"> </TD></TR>
6
6
  </TABLE>
7
7
  > xlabel=type]
8
- node133419866327504 [label=<
8
+ node137103008811472 [label=<
9
9
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
10
10
  <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1"> None </TD></TR>
11
11
  <TR><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1"> 33 </TD></TR>
12
12
  <TR><TD BORDER="1" STYLE="ROUNDED"> larger </TD><TD BORDER="1"> None </TD></TR>
13
13
  </TABLE>
14
14
  > xlabel=BinTree]
15
- node133419866327200 [label=<
15
+ node137103008811168 [label=<
16
16
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
17
17
  <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> larger </TD></TR>
18
18
  <TR><TD BORDER="1"> None </TD><TD BORDER="1"> 5 </TD><TD BORDER="1" PORT="ref0"> </TD></TR>
19
19
  </TABLE>
20
20
  > xlabel=BinTree]
21
- node133419866327200:ref0 -> node133419866327504:table [style=solid]
22
- node133419867880672 [label=<
21
+ node137103008811168:ref0 -> node137103008811472:table [style=solid]
22
+ node137103009955040 [label=<
23
23
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
24
24
  <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1"> None </TD></TR>
25
25
  <TR><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1"> 51 </TD></TR>
26
26
  <TR><TD BORDER="1" STYLE="ROUNDED"> larger </TD><TD BORDER="1"> None </TD></TR>
27
27
  </TABLE>
28
28
  > xlabel=BinTree]
29
- node133419867880400 [label=<
29
+ node137103009954768 [label=<
30
30
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
31
31
  <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1"> None </TD></TR>
32
32
  <TR><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1"> 62 </TD></TR>
33
33
  <TR><TD BORDER="1" STYLE="ROUNDED"> larger </TD><TD BORDER="1"> None </TD></TR>
34
34
  </TABLE>
35
35
  > xlabel=BinTree]
36
- node133419866235696 [label=<
36
+ node137103008736048 [label=<
37
37
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
38
38
  <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> larger </TD></TR>
39
39
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 65 </TD><TD BORDER="1"> None </TD></TR>
40
40
  </TABLE>
41
41
  > xlabel=BinTree]
42
- node133419866235696:ref0 -> node133419867880400:table [style=solid]
43
- node133419868007760 [label=<
42
+ node137103008736048:ref0 -> node137103009954768:table [style=solid]
43
+ node137103010049360 [label=<
44
44
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
45
45
  <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> larger </TD></TR>
46
46
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 53 </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
47
47
  </TABLE>
48
48
  > xlabel=BinTree]
49
- node133419868007760:ref0 -> node133419867880672:table [style=solid]
50
- node133419868007760:ref1 -> node133419866235696:table [style=solid]
51
- node133419868007440 [label=<
49
+ node137103010049360:ref0 -> node137103009955040:table [style=solid]
50
+ node137103010049360:ref1 -> node137103008736048:table [style=solid]
51
+ node137103010049040 [label=<
52
52
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
53
53
  <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> larger </TD></TR>
54
54
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 97 </TD><TD BORDER="1"> None </TD></TR>
55
55
  </TABLE>
56
56
  > xlabel=BinTree]
57
- node133419868007440:ref0 -> node133419868007760:table [style=solid]
58
- node133419868195536 [label=<
57
+ node137103010049040:ref0 -> node137103010049360:table [style=solid]
58
+ node137103010269904 [label=<
59
59
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
60
60
  <TR><TD BORDER="1" STYLE="ROUNDED"> smaller </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD><TD BORDER="1" STYLE="ROUNDED"> larger </TD></TR>
61
61
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 49 </TD><TD BORDER="1" PORT="ref1"> </TD></TR>
62
62
  </TABLE>
63
63
  > xlabel=BinTree]
64
- node133419868195536:ref0 -> node133419866327200:table [style=solid]
65
- node133419868195536:ref1 -> node133419868007440:table [style=solid]
66
- node133419866472256 [label=<
64
+ node137103010269904:ref0 -> node137103008811168:table [style=solid]
65
+ node137103010269904:ref1 -> node137103010049040:table [style=solid]
66
+ node137103008956160 [label=<
67
67
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
68
68
  <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>
69
69
  <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>
70
70
  </TABLE>
71
71
  > xlabel=dict]
72
- node133419866472256:ref0 -> node749939776:table [style=solid]
73
- node133419866472256:ref1 -> node133419868195536:table [style=solid]
74
- node133419866571072 [label=<
72
+ node137103008956160:ref0 -> node307374992:table [style=solid]
73
+ node137103008956160:ref1 -> node137103010269904:table [style=solid]
74
+ node137103009055040 [label=<
75
75
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
76
76
  <TR><TD BORDER="1" STYLE="ROUNDED"> self </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD></TR>
77
77
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 51 </TD></TR>
78
78
  </TABLE>
79
79
  > xlabel=dict]
80
- node133419866571072:ref0 -> node133419868195536:table [style=solid]
81
- node133419866571136 [label=<
80
+ node137103009055040:ref0 -> node137103010269904:table [style=solid]
81
+ node137103009055104 [label=<
82
82
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
83
83
  <TR><TD BORDER="1" STYLE="ROUNDED"> self </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD></TR>
84
84
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 51 </TD></TR>
85
85
  </TABLE>
86
86
  > xlabel=dict]
87
- node133419866571136:ref0 -> node133419868007440:table [style=solid]
88
- node133419866571264 [label=<
87
+ node137103009055104:ref0 -> node137103010049040:table [style=solid]
88
+ node137103009055232 [label=<
89
89
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
90
90
  <TR><TD BORDER="1" STYLE="ROUNDED"> self </TD><TD BORDER="1" STYLE="ROUNDED"> value </TD></TR>
91
91
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 51 </TD></TR>
92
92
  </TABLE>
93
93
  > xlabel=dict]
94
- node133419866571264:ref0 -> node133419868007760:table [style=solid]
95
- node133419866542144 [label=<
94
+ node137103009055232:ref0 -> node137103010049360:table [style=solid]
95
+ node137103009025552 [label=<
96
96
  <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="khaki" PORT="table">
97
97
  <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>
98
98
  <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>
99
99
  </TABLE>
100
100
  > xlabel=call_stack]
101
- node133419866542144:ref0 -> node133419866472256:table [style=solid]
102
- node133419866542144:ref1 -> node133419866571072:table [style=solid]
103
- node133419866542144:ref2 -> node133419866571136:table [style=solid]
104
- node133419866542144:ref3 -> node133419866571264:table [style=solid]
105
- subgraph { rank=same; node133419866472256 -> node133419866571072 -> node133419866571136 -> node133419866571264[weight=10, style=invis]; }
106
- subgraph { rank=same; node749939776 -> node133419868195536[weight=10, style=invis]; }
107
- subgraph { rank=same; node133419866327200 -> node133419868007440[weight=10, style=invis]; }
108
- subgraph { rank=same; node133419866327504 -> node133419868007760[weight=10, style=invis]; }
109
- subgraph { rank=same; node133419867880672 -> node133419866235696[weight=10, style=invis]; }
101
+ node137103009025552:ref0 -> node137103008956160:table [style=solid]
102
+ node137103009025552:ref1 -> node137103009055040:table [style=solid]
103
+ node137103009025552:ref2 -> node137103009055104:table [style=solid]
104
+ node137103009025552:ref3 -> node137103009055232:table [style=solid]
105
+ subgraph { rank=same; node137103008956160 -> node137103009055040 -> node137103009055104 -> node137103009055232[weight=10, style=invis]; }
106
+ subgraph { rank=same; node307374992 -> node137103010269904[weight=10, style=invis]; }
107
+ subgraph { rank=same; node137103008811168 -> node137103010049040[weight=10, style=invis]; }
108
+ subgraph { rank=same; node137103008811472 -> node137103010049360[weight=10, style=invis]; }
109
+ subgraph { rank=same; node137103009955040 -> node137103008736048[weight=10, style=invis]; }
110
110
  }