memory-graph 0.3.25__tar.gz → 0.3.26__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 (224) hide show
  1. {memory_graph-0.3.25/memory_graph.egg-info → memory_graph-0.3.26}/PKG-INFO +7 -7
  2. {memory_graph-0.3.25 → memory_graph-0.3.26}/README.md +5 -5
  3. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/add_one.gv +18 -18
  4. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_dir.gv +5 -5
  5. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_key_value.gv +12 -12
  6. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_leaf.gv +5 -5
  7. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_linear.gv +12 -12
  8. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_table.gv +12 -12
  9. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/bin_tree.gv +35 -35
  10. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/copies.gv +20 -20
  11. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/copy_method.gv +16 -16
  12. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging01.gv +8 -8
  13. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging01.png +0 -0
  14. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging02.gv +11 -11
  15. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging02.png +0 -0
  16. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging03.gv +13 -13
  17. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging03.png +0 -0
  18. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging04.gv +15 -15
  19. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging04.png +0 -0
  20. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging05.gv +17 -17
  21. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging05.png +0 -0
  22. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging06.gv +17 -17
  23. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging06.png +0 -0
  24. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/extension_numpy.gv +8 -8
  25. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/extension_pandas.gv +8 -8
  26. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial0.gv +3 -3
  27. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial0.png +0 -0
  28. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial1.gv +6 -6
  29. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial1.png +0 -0
  30. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial2.gv +8 -8
  31. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial2.png +0 -0
  32. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial3.gv +10 -10
  33. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial3.png +0 -0
  34. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial4.gv +10 -10
  35. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial4.png +0 -0
  36. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial5.gv +8 -8
  37. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial5.png +0 -0
  38. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial6.gv +6 -6
  39. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial6.png +0 -0
  40. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/hash_set.gv +29 -29
  41. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/highlight.gv +16 -16
  42. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/immutable1.gv +4 -4
  43. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/immutable2.gv +6 -6
  44. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/introspect_depth.gv +56 -56
  45. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/linked_list.gv +18 -18
  46. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/many_types.gv +12 -12
  47. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/mutable1.gv +4 -4
  48. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/mutable2.gv +4 -4
  49. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/not_node_types1.gv +6 -6
  50. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/not_node_types2.gv +14 -14
  51. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set0.gv +11 -11
  52. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set0.png +0 -0
  53. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set1.gv +17 -17
  54. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set1.png +0 -0
  55. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set10.gv +36 -36
  56. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set10.png +0 -0
  57. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set11.gv +31 -31
  58. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set11.png +0 -0
  59. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set12.gv +31 -31
  60. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set12.png +0 -0
  61. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set13.gv +36 -36
  62. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set13.png +0 -0
  63. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set14.gv +41 -41
  64. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set14.png +0 -0
  65. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set15.gv +43 -43
  66. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set15.png +0 -0
  67. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set16.gv +40 -40
  68. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set16.png +0 -0
  69. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set17.gv +40 -40
  70. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set17.png +0 -0
  71. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set18.gv +45 -45
  72. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set18.png +0 -0
  73. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set19.gv +47 -47
  74. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set19.png +0 -0
  75. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set2.gv +22 -22
  76. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set2.png +0 -0
  77. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set20.gv +44 -44
  78. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set20.png +0 -0
  79. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set21.gv +39 -39
  80. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set21.png +0 -0
  81. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set22.gv +34 -34
  82. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set22.png +0 -0
  83. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set23.gv +28 -28
  84. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set23.png +0 -0
  85. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set3.gv +27 -27
  86. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set3.png +0 -0
  87. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set4.gv +32 -32
  88. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set4.png +0 -0
  89. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set5.gv +34 -34
  90. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set5.png +0 -0
  91. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set6.gv +32 -32
  92. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set6.png +0 -0
  93. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set7.gv +32 -32
  94. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set7.png +0 -0
  95. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set8.gv +37 -37
  96. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set8.png +0 -0
  97. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set9.gv +39 -39
  98. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set9.png +0 -0
  99. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/rebinding1.gv +4 -4
  100. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/rebinding2.gv +6 -6
  101. memory_graph-0.3.26/images/vscode_copying.gif +0 -0
  102. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/__init__.py +1 -1
  103. {memory_graph-0.3.25 → memory_graph-0.3.26/memory_graph.egg-info}/PKG-INFO +7 -7
  104. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph.egg-info/SOURCES.txt +1 -0
  105. {memory_graph-0.3.25 → memory_graph-0.3.26}/setup.py +2 -2
  106. {memory_graph-0.3.25 → memory_graph-0.3.26}/LICENSE.txt +0 -0
  107. {memory_graph-0.3.25 → memory_graph-0.3.26}/MANIFEST.in +0 -0
  108. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/.ipynb_checkpoints/jupyter_example-checkpoint.ipynb +0 -0
  109. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/add_one.png +0 -0
  110. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/add_one.py +0 -0
  111. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree.py +0 -0
  112. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree.py~ +0 -0
  113. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_dir.png +0 -0
  114. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_fail.gv +0 -0
  115. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_fail.png +0 -0
  116. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_key_value.png +0 -0
  117. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_leaf.png +0 -0
  118. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_linear.png +0 -0
  119. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/avltree_table.png +0 -0
  120. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/bin_tree.png +0 -0
  121. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/bin_tree.py +0 -0
  122. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/bin_tree2.py +0 -0
  123. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/bin_tree2.py~ +0 -0
  124. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/copies.png +0 -0
  125. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/copies.py +0 -0
  126. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/copy_method.png +0 -0
  127. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/copy_method.py +0 -0
  128. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/create_gif.sh +0 -0
  129. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/create_images.sh +0 -0
  130. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debug_vscode.png +0 -0
  131. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging.gif +0 -0
  132. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/debugging.py +0 -0
  133. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/depth.gv +0 -0
  134. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/depth.png +0 -0
  135. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/extension_numpy.png +0 -0
  136. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/extension_numpy.py +0 -0
  137. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/extension_pandas.png +0 -0
  138. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/extension_pandas.py +0 -0
  139. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial.gif +0 -0
  140. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial.py +0 -0
  141. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial01.gv +0 -0
  142. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial02.gv +0 -0
  143. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial03.gv +0 -0
  144. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial04.gv +0 -0
  145. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial05.gv +0 -0
  146. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial06.gv +0 -0
  147. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/factorial07.gv +0 -0
  148. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/hash_set.png +0 -0
  149. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/hash_set.py +0 -0
  150. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/hidden_edges.gv +0 -0
  151. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/hidden_edges.png +0 -0
  152. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/hidden_edges.py +0 -0
  153. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/hidden_edges.py~ +0 -0
  154. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/highlight.png +0 -0
  155. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/highlight.py +0 -0
  156. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/immutable.py +0 -0
  157. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/immutable1.png +0 -0
  158. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/immutable2.png +0 -0
  159. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/introspect_depth.png +0 -0
  160. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/introspect_depth.py +0 -0
  161. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/introspect_depth.py~ +0 -0
  162. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/ipython.png +0 -0
  163. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/jupyter_example.png +0 -0
  164. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/linked_list.png +0 -0
  165. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/linked_list.py +0 -0
  166. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/log.txt +0 -0
  167. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/many_types.png +0 -0
  168. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/many_types.py +0 -0
  169. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/memory_graph.gv +0 -0
  170. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/memory_graph.gv.pdf +0 -0
  171. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/memory_graph.pdf +0 -0
  172. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/mutable.py +0 -0
  173. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/mutable1.png +0 -0
  174. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/mutable2.png +0 -0
  175. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/my_graph.gv +0 -0
  176. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/my_graph.pdf +0 -0
  177. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/name_rebinding.py +0 -0
  178. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/not_node_types.py +0 -0
  179. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/not_node_types.py~ +0 -0
  180. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/not_node_types1.png +0 -0
  181. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/not_node_types2.png +0 -0
  182. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set.gif +0 -0
  183. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/power_set.py +0 -0
  184. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/pyodide.png +0 -0
  185. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/rebinding1.png +0 -0
  186. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/rebinding2.png +0 -0
  187. {memory_graph-0.3.25 → memory_graph-0.3.26}/images/uva.png +0 -0
  188. {memory_graph-0.3.25 → memory_graph-0.3.26}/install.txt +0 -0
  189. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/call_stack.py +0 -0
  190. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/config.py +0 -0
  191. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/config_default.py +0 -0
  192. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/config_helpers.py +0 -0
  193. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/extension_numpy.py +0 -0
  194. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/extension_pandas.py +0 -0
  195. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/html_table.py +0 -0
  196. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/list_view.py +0 -0
  197. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/memory_to_nodes.py +0 -0
  198. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/node_base.py +0 -0
  199. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/node_key_value.py +0 -0
  200. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/node_leaf.py +0 -0
  201. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/node_linear.py +0 -0
  202. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/node_table.py +0 -0
  203. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/sequence.py +0 -0
  204. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/slicer.py +0 -0
  205. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/slices.py +0 -0
  206. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/slices_iterator.py +0 -0
  207. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/slices_table_iterator.py +0 -0
  208. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/test.py +0 -0
  209. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/test_max_graph_depth.py +0 -0
  210. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/test_memory_graph.py +0 -0
  211. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/test_memory_to_nodes.py +0 -0
  212. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/test_sequence.py +0 -0
  213. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/test_slicer.py +0 -0
  214. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/test_slices.py +0 -0
  215. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/test_slices_iterator.py +0 -0
  216. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph/utils.py +0 -0
  217. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph.egg-info/dependency_links.txt +0 -0
  218. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph.egg-info/requires.txt +0 -0
  219. {memory_graph-0.3.25 → memory_graph-0.3.26}/memory_graph.egg-info/top_level.txt +0 -0
  220. {memory_graph-0.3.25 → memory_graph-0.3.26}/setup.cfg +0 -0
  221. {memory_graph-0.3.25 → memory_graph-0.3.26}/src/auto_memory_graph.py +0 -0
  222. {memory_graph-0.3.25 → memory_graph-0.3.26}/src/jupyter_example.ipynb +0 -0
  223. {memory_graph-0.3.25 → memory_graph-0.3.26}/src/pyodide.html +0 -0
  224. {memory_graph-0.3.25 → memory_graph-0.3.26}/uml/memory_graph.uxf +0 -0
@@ -1,7 +1,7 @@
1
1
  Metadata-Version: 2.1
2
2
  Name: memory_graph
3
- Version: 0.3.25
4
- Summary: Generate intuitive graphs of your Python data, great for debugging and understanding complex relationships.
3
+ Version: 0.3.26
4
+ Summary: Teaching tool and debugging aid in context of references, mutable data types, and shallow and deep copy.
5
5
  Home-page: https://github.com/bterwijn/memory_graph
6
6
  Author: Bas Terwijn
7
7
  Author-email: bterwijn@gmail.com
@@ -25,9 +25,9 @@ pip install --upgrade memory_graph
25
25
  Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
26
26
 
27
27
  # Videos #
28
- | [![Quick Intro](https://img.youtube.com/vi/8csmPga6Upw/0.jpg)](https://www.youtube.com/watch?v=8csmPga6Upw) | [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
28
+ | [![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) |
29
29
  |:--:|:--:|
30
- | [Quick Intro](https://www.youtube.com/watch?v=8csmPga6Upw) | [Mutability](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
30
+ | [Quick Intro](https://www.youtube.com/watch?v=23_bHcr7hqo) | [Mutability](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
31
31
 
32
32
  # Memory Graph #
33
33
  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:
@@ -46,7 +46,7 @@ mg.show(data)
46
46
  ```
47
47
  ![many_types.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/many_types.png)
48
48
 
49
- Instead of showing the graph on screen you can also render it to an output file of your choosing (see [Graphviz Output Formats](https://graphviz.org/docs/outputs/)) using for example:
49
+ Instead of showing the graph on screen you can also render it to an output file (see [Graphviz Output Formats](https://graphviz.org/docs/outputs/)) using for example:
50
50
 
51
51
  ```python
52
52
  mg.render(data, "my_graph.pdf")
@@ -362,7 +362,7 @@ The ```mg.stack()``` doesn't work well in *watch* context in most debuggers beca
362
362
  | **Visual Studio Code** | `mg.stack_vscode()` |
363
363
  | **Pycharm** | `mg.stack_pycharm()` |
364
364
 
365
- ![debug_vscode.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debug_vscode.png)
365
+ ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
366
366
 
367
367
  ## Other Debuggers ##
368
368
  For other debuggers, invoke this function within the *watch* context. Then, in the "call_stack.txt" file, identify the slice of functions you wish to include in the call stack.
@@ -575,7 +575,7 @@ mg.render(locals(), 'not_node_types2.png')
575
575
  |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
576
576
  | not_node_types1.png — simplified | not_node_types2.png — technically correct |
577
577
 
578
- Additionally, the simplification hides away the [reuse of small int values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
578
+ Additionally, the simplification hides away the [reuse of small int values \[-5, 256\]](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
579
579
 
580
580
  ## Temporary Configuration ##
581
581
  In addition to the global configuration, a temporary configuration can be set for a single `show()` or `render()` call to change the colors, orientation, and slicer. This example highlights a particular list element in red, gives it a horizontal orientation, and overwrites the default slicer for lists:
@@ -6,9 +6,9 @@ pip install --upgrade memory_graph
6
6
  Additionally [Graphviz](https://graphviz.org/download/) needs to be installed.
7
7
 
8
8
  # Videos #
9
- | [![Quick Intro](https://img.youtube.com/vi/8csmPga6Upw/0.jpg)](https://www.youtube.com/watch?v=8csmPga6Upw) | [![Mutability](https://img.youtube.com/vi/pvIJgHCaXhU/0.jpg)](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
9
+ | [![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) |
10
10
  |:--:|:--:|
11
- | [Quick Intro](https://www.youtube.com/watch?v=8csmPga6Upw) | [Mutability](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
11
+ | [Quick Intro](https://www.youtube.com/watch?v=23_bHcr7hqo) | [Mutability](https://www.youtube.com/watch?v=pvIJgHCaXhU) |
12
12
 
13
13
  # Memory Graph #
14
14
  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:
@@ -27,7 +27,7 @@ mg.show(data)
27
27
  ```
28
28
  ![many_types.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/many_types.png)
29
29
 
30
- Instead of showing the graph on screen you can also render it to an output file of your choosing (see [Graphviz Output Formats](https://graphviz.org/docs/outputs/)) using for example:
30
+ Instead of showing the graph on screen you can also render it to an output file (see [Graphviz Output Formats](https://graphviz.org/docs/outputs/)) using for example:
31
31
 
32
32
  ```python
33
33
  mg.render(data, "my_graph.pdf")
@@ -343,7 +343,7 @@ The ```mg.stack()``` doesn't work well in *watch* context in most debuggers beca
343
343
  | **Visual Studio Code** | `mg.stack_vscode()` |
344
344
  | **Pycharm** | `mg.stack_pycharm()` |
345
345
 
346
- ![debug_vscode.png](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/debug_vscode.png)
346
+ ![vscode_copying.gif](https://raw.githubusercontent.com/bterwijn/memory_graph/main/images/vscode_copying.gif)
347
347
 
348
348
  ## Other Debuggers ##
349
349
  For other debuggers, invoke this function within the *watch* context. Then, in the "call_stack.txt" file, identify the slice of functions you wish to include in the call stack.
@@ -556,7 +556,7 @@ mg.render(locals(), 'not_node_types2.png')
556
556
  |:-----------------------------------------------------------:|:-------------------------------------------------------------:|
557
557
  | not_node_types1.png — simplified | not_node_types2.png — technically correct |
558
558
 
559
- Additionally, the simplification hides away the [reuse of small int values](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
559
+ Additionally, the simplification hides away the [reuse of small int values \[-5, 256\]](https://docs.python.org/3/c-api/long.html#c.PyLong_FromLong) in the current CPython implementation, an optimization that might otherwise confuse beginner Python programmers. For instance, after executing `a[1]+=1; b[1]+=1` the `201` value is, maybe surprisingly, still shared between `a` and `b`, whereas executing `a[2]+=1; b[2]+=1` does not result in sharing the `301` value.
560
560
 
561
561
  ## Temporary Configuration ##
562
562
  In addition to the global configuration, a temporary configuration can be set for a single `show()` or `render()` call to change the colors, orientation, and slicer. This example highlights a particular list element in red, gives it a horizontal orientation, and overwrites the default slicer for lists:
@@ -1,6 +1,6 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node135403173368384 [label=<
3
+ node124722886398528 [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
- node135403163249088 [label=<
11
+ node124722875623872 [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
- node135403173366592 [label=<
18
+ node124722886396736 [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
- node135403163250688 [label=<
25
+ node124722875625472 [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
- node135403163250688:ref0 -> node135403173368384:table [style=solid]
32
- node135403163250688:ref1 -> node135403163249088:table [style=solid]
33
- node135403163250688:ref2 -> node135403173366592:table [style=solid]
34
- node135403163147760 [label=<
31
+ node124722875625472:ref0 -> node124722886398528:table [style=solid]
32
+ node124722875625472:ref1 -> node124722875623872:table [style=solid]
33
+ node124722875625472:ref2 -> node124722886396736:table [style=solid]
34
+ node124722875522544 [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
- node135403163139456 [label=<
42
+ node124722875514240 [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
- node135403163134144 [label=<
50
+ node124722875508928 [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
- node135403163134144:ref0 -> node135403173368384:table [style=solid]
57
- node135403163134144:ref1 -> node135403163147760:table [style=solid]
58
- node135403163134144:ref2 -> node135403163139456:table [style=solid]
59
- node135403160596752 [label=<
56
+ node124722875508928:ref0 -> node124722886398528:table [style=solid]
57
+ node124722875508928:ref1 -> node124722875522544:table [style=solid]
58
+ node124722875508928:ref2 -> node124722875514240:table [style=solid]
59
+ node124722873168144 [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
- node135403160596752:ref0 -> node135403163250688:table [style=solid]
66
- node135403160596752:ref1 -> node135403163134144:table [style=solid]
67
- subgraph { rank=same; node135403163250688 -> node135403163134144[weight=10, style=invis]; }
68
- subgraph { rank=same; node135403173368384 -> node135403163249088 -> node135403173366592 -> node135403163147760 -> node135403163139456[weight=10, style=invis]; }
65
+ node124722873168144:ref0 -> node124722875625472:table [style=solid]
66
+ node124722873168144:ref1 -> node124722875508928:table [style=solid]
67
+ subgraph { rank=same; node124722875625472 -> node124722875508928[weight=10, style=invis]; }
68
+ subgraph { rank=same; node124722886398528 -> node124722875623872 -> node124722886396736 -> node124722875522544 -> node124722875514240[weight=10, style=invis]; }
69
69
  }
@@ -1,6 +1,6 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node139903332572656 [label=<
3
+ node124372962549232 [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"> __class__ </TD></TR>
6
6
  <TR><TD BORDER="0"><font color="#505050">1</font></TD><TD BORDER="1"> __delattr__ </TD></TR>
@@ -38,18 +38,18 @@ digraph memory_graph {
38
38
  <TR><TD BORDER="0"><font color="#505050">33</font></TD><TD BORDER="1"> value </TD></TR>
39
39
  </TABLE>
40
40
  > xlabel="Node"]
41
- node139903342670192 [label=<
41
+ node124372962727920 [label=<
42
42
  <TABLE BORDER="1" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="seagreen1" PORT="table">
43
43
  <TR><TD BORDER="1" STYLE="ROUNDED"> _root </TD><TD BORDER="1" STYLE="ROUNDED"> _count </TD></TR>
44
44
  <TR><TD BORDER="1" PORT="ref0"> </TD><TD BORDER="1"> 4 </TD></TR>
45
45
  </TABLE>
46
46
  > xlabel=AVLTree]
47
- node139903342670192:ref0 -> node139903332572656:table [style=solid]
48
- node139903343058624 [label=<
47
+ node124372962727920:ref0 -> node124372962549232:table [style=solid]
48
+ node124372964581056 [label=<
49
49
  <TABLE BORDER="3" CELLBORDER="1" CELLSPACING="5" CELLPADDING="0" BGCOLOR="#60a5ff" PORT="table">
50
50
  <TR><TD BORDER="1" STYLE="ROUNDED"> tree </TD></TR>
51
51
  <TR><TD BORDER="1" PORT="ref0"> </TD></TR>
52
52
  </TABLE>
53
53
  > xlabel=dict]
54
- node139903343058624:ref0 -> node139903342670192:table [style=solid]
54
+ node124372964581056:ref0 -> node124372962727920:table [style=solid]
55
55
  }
@@ -1,6 +1,6 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node139903330012512 [label=<
3
+ node124372960185536 [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
- node139903330010752 [label=<
11
+ node124372960183776 [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
- node139903330010912 [label=<
19
+ node124372960183936 [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
- node139903330010912:ref0 -> node139903330010752:table [style=solid]
26
- node139903332572656 [label=<
25
+ node124372960183936:ref0 -> node124372960183776:table [style=solid]
26
+ node124372962549232 [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
- node139903332572656:ref0 -> node139903330012512:table [style=solid]
33
- node139903332572656:ref1 -> node139903330010912:table [style=solid]
34
- node139903342670192 [label=<
32
+ node124372962549232:ref0 -> node124372960185536:table [style=solid]
33
+ node124372962549232:ref1 -> node124372960183936:table [style=solid]
34
+ node124372962727920 [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
- node139903342670192:ref0 -> node139903332572656:table [style=solid]
41
- node139903343058624 [label=<
40
+ node124372962727920:ref0 -> node124372962549232:table [style=solid]
41
+ node124372964581056 [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
- node139903343058624:ref0 -> node139903342670192:table [style=solid]
48
- subgraph { rank=same; node139903330012512 -> node139903330010912[weight=10, style=invis]; }
47
+ node124372964581056:ref0 -> node124372962727920:table [style=solid]
48
+ subgraph { rank=same; node124372960185536 -> node124372960183936[weight=10, style=invis]; }
49
49
  }
@@ -1,22 +1,22 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node139903332572656 [label=<
3
+ node124372962549232 [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
- node139903342670192 [label=<
8
+ node124372962727920 [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
- node139903342670192:ref0 -> node139903332572656:table [style=solid]
15
- node139903343058624 [label=<
14
+ node124372962727920:ref0 -> node124372962549232:table [style=solid]
15
+ node124372964581056 [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
- node139903343058624:ref0 -> node139903342670192:table [style=solid]
21
+ node124372964581056:ref0 -> node124372962727920:table [style=solid]
22
22
  }
@@ -1,6 +1,6 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node139903330012512 [label=<
3
+ node124372960185536 [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
- node139903330010752 [label=<
15
+ node124372960183776 [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
- node139903330010912 [label=<
27
+ node124372960183936 [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
- node139903330010912:ref0 -> node139903330010752:table [style=solid]
34
- node139903332572656 [label=<
33
+ node124372960183936:ref0 -> node124372960183776:table [style=solid]
34
+ node124372962549232 [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
- node139903332572656:ref0 -> node139903330012512:table [style=solid]
41
- node139903332572656:ref1 -> node139903330010912:table [style=solid]
42
- node139903342670192 [label=<
40
+ node124372962549232:ref0 -> node124372960185536:table [style=solid]
41
+ node124372962549232:ref1 -> node124372960183936:table [style=solid]
42
+ node124372962727920 [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
- node139903342670192:ref0 -> node139903332572656:table [style=solid]
49
- node139903343058624 [label=<
48
+ node124372962727920:ref0 -> node124372962549232:table [style=solid]
49
+ node124372964581056 [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
- node139903343058624:ref0 -> node139903342670192:table [style=solid]
56
- subgraph { rank=same; node139903330012512 -> node139903330010912[weight=10, style=invis]; }
55
+ node124372964581056:ref0 -> node124372962727920:table [style=solid]
56
+ subgraph { rank=same; node124372960185536 -> node124372960183936[weight=10, style=invis]; }
57
57
  }
@@ -1,49 +1,49 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node139903330012512 [label=<
3
+ node124372960185536 [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
- node139903330010752 [label=<
10
+ node124372960183776 [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
- node139903330010912 [label=<
17
+ node124372960183936 [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
- node139903330010912:ref0 -> node139903330010752:table [style=solid]
25
- node139903332572656 [label=<
24
+ node124372960183936:ref0 -> node124372960183776:table [style=solid]
25
+ node124372962549232 [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
- node139903332572656:ref0 -> node139903330012512:table [style=solid]
33
- node139903332572656:ref1 -> node139903330010912:table [style=solid]
34
- node139903342670192 [label=<
32
+ node124372962549232:ref0 -> node124372960185536:table [style=solid]
33
+ node124372962549232:ref1 -> node124372960183936:table [style=solid]
34
+ node124372962727920 [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
- node139903342670192:ref0 -> node139903332572656:table [style=solid]
41
- node139903343058624 [label=<
40
+ node124372962727920:ref0 -> node124372962549232:table [style=solid]
41
+ node124372964581056 [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
- node139903343058624:ref0 -> node139903342670192:table [style=solid]
48
- subgraph { rank=same; node139903330012512 -> node139903330010912[weight=10, style=invis]; }
47
+ node124372964581056:ref0 -> node124372962727920:table [style=solid]
48
+ subgraph { rank=same; node124372960185536 -> node124372960183936[weight=10, style=invis]; }
49
49
  }
@@ -1,110 +1,110 @@
1
1
  digraph memory_graph {
2
2
  node [shape=plaintext]
3
- node646265440 [label=<
3
+ node881478240 [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
- node137542005279872 [label=<
8
+ node134374720654560 [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
- node137542005279824 [label=<
15
+ node134374720654512 [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
- node137542005279824:ref0 -> node137542005279872:table [style=solid]
22
- node137542005280016 [label=<
21
+ node134374720654512:ref0 -> node134374720654560:table [style=solid]
22
+ node134374720654704 [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
- node137542005279968 [label=<
29
+ node134374720654656 [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
- node137542005279920 [label=<
36
+ node134374720654608 [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
- node137542005279920:ref0 -> node137542005279968:table [style=solid]
43
- node137542005276944 [label=<
42
+ node134374720654608:ref0 -> node134374720654656:table [style=solid]
43
+ node134374720654464 [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
- node137542005276944:ref0 -> node137542005280016:table [style=solid]
50
- node137542005276944:ref1 -> node137542005279920:table [style=solid]
51
- node137542007736656 [label=<
49
+ node134374720654464:ref0 -> node134374720654704:table [style=solid]
50
+ node134374720654464:ref1 -> node134374720654608:table [style=solid]
51
+ node134374723111248 [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
- node137542007736656:ref0 -> node137542005276944:table [style=solid]
58
- node137542007736608 [label=<
57
+ node134374723111248:ref0 -> node134374720654464:table [style=solid]
58
+ node134374723111200 [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
- node137542007736608:ref0 -> node137542005279824:table [style=solid]
65
- node137542007736608:ref1 -> node137542007736656:table [style=solid]
66
- node137542005254208 [label=<
64
+ node134374723111200:ref0 -> node134374720654512:table [style=solid]
65
+ node134374723111200:ref1 -> node134374723111248:table [style=solid]
66
+ node134374720628288 [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
- node137542005254208:ref0 -> node646265440:table [style=solid]
73
- node137542005254208:ref1 -> node137542007736608:table [style=solid]
74
- node137542005257216 [label=<
72
+ node134374720628288:ref0 -> node881478240:table [style=solid]
73
+ node134374720628288:ref1 -> node134374723111200:table [style=solid]
74
+ node134374720631296 [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
- node137542005257216:ref0 -> node137542007736608:table [style=solid]
81
- node137542005361728 [label=<
80
+ node134374720631296:ref0 -> node134374723111200:table [style=solid]
81
+ node134374720735808 [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
- node137542005361728:ref0 -> node137542007736656:table [style=solid]
88
- node137542005361920 [label=<
87
+ node134374720735808:ref0 -> node134374723111248:table [style=solid]
88
+ node134374720736000 [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
- node137542005361920:ref0 -> node137542005276944:table [style=solid]
95
- node137542005209312 [label=<
94
+ node134374720736000:ref0 -> node134374720654464:table [style=solid]
95
+ node134374720583904 [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
- node137542005209312:ref0 -> node137542005254208:table [style=solid]
102
- node137542005209312:ref1 -> node137542005257216:table [style=solid]
103
- node137542005209312:ref2 -> node137542005361728:table [style=solid]
104
- node137542005209312:ref3 -> node137542005361920:table [style=solid]
105
- subgraph { rank=same; node137542005254208 -> node137542005257216 -> node137542005361728 -> node137542005361920[weight=10, style=invis]; }
106
- subgraph { rank=same; node646265440 -> node137542007736608[weight=10, style=invis]; }
107
- subgraph { rank=same; node137542005279824 -> node137542007736656[weight=10, style=invis]; }
108
- subgraph { rank=same; node137542005279872 -> node137542005276944[weight=10, style=invis]; }
109
- subgraph { rank=same; node137542005280016 -> node137542005279920[weight=10, style=invis]; }
101
+ node134374720583904:ref0 -> node134374720628288:table [style=solid]
102
+ node134374720583904:ref1 -> node134374720631296:table [style=solid]
103
+ node134374720583904:ref2 -> node134374720735808:table [style=solid]
104
+ node134374720583904:ref3 -> node134374720736000:table [style=solid]
105
+ subgraph { rank=same; node134374720628288 -> node134374720631296 -> node134374720735808 -> node134374720736000[weight=10, style=invis]; }
106
+ subgraph { rank=same; node881478240 -> node134374723111200[weight=10, style=invis]; }
107
+ subgraph { rank=same; node134374720654512 -> node134374723111248[weight=10, style=invis]; }
108
+ subgraph { rank=same; node134374720654560 -> node134374720654464[weight=10, style=invis]; }
109
+ subgraph { rank=same; node134374720654704 -> node134374720654608[weight=10, style=invis]; }
110
110
  }