Open matthewhammer opened 7 years ago
This is not going to be a simple variation on the tree_of_list
algorithm, unfortunately. The tree starts in the center and is build out, while taking into account the levels of both forests.
Ah, I see what you mean. I guess we need a tree_of_2lists
algorithm?
Currently, unfocus assumes it runs in the Editor role, as it reallocates the same named cell multiple times. To make unfocus work in the Archivist role, we should integrate
tree_of_list
algorithm, which avoids multiple writes to the cells that comprise the final level tree.