In my opinion (Leo-Ignorant one) it should be easy to just refer all the
nodes to their absolute position on the tree.
So several functions can be made to copy paste and move several nodes
according to their absolute position, counting all the nodes within the
tree.
For instance:
A (1)
B (2)
C (3)
D (4)
E (5)
F (6)
G (7)
H (8)
I (9)
Given that we can dynamically get the number of parents any node has
(therefore, its indent), then we have all the references we need to do
those processes. I know it will require maybe too much iterations, and it
wont be as efficient as it probably is now, but it will allow any iteration
or moving through nodes...
And for loops through nodes it will be more intuitive... If im looping
thourgh node E and childs, and I delete G, I will both intuitively and
easily know that refference 7 is now H, or if I insert a child into G, I
will also easily know that H is my refference 9 (new child being 8), and I
will be able to go on with any loop without having to restart it, because
my Loop initiator will allways be E.
On Wednesday, May 15, 2013 6:25:48 PM UTC+2, Edward K. Ream wrote:
>
> On Tue, May 14, 2013 at 11:19 AM, Fidel Pérez <[email protected]<javascript:>
> > wrote:
>
>> What references do we have as constants now?
>
>
> Good question. At present, I don't know and don't remember. I'm going to
> study all off this asap. Maybe later today.
>
> Edward
>
--
You received this message because you are subscribed to the Google Groups
"leo-editor" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/leo-editor?hl=en-US.
For more options, visit https://groups.google.com/groups/opt_out.
