On Mon, Apr 14, 2008 at 3:17 AM, derwisch <
[EMAIL PROTECTED]> wrote:

>
> On Apr 13, 3:31 pm, "Edward K. Ream" <[EMAIL PROTECTED]> wrote:
> > That is for any node n, n.v == n, n.t == n, n.v.t == n.  In other
> > words, if there is only one kind of node, the problem of
> > distinguishing between vnodes and tnodes becomes pretty easy :-)
>
> What about unknownAttributes of vnodes and tnodes? What will the
> distinction in future be?


Nodes will have an .unknownAttributes ivar.  But since there is only one
kind of node, there can only be one kind of .unknownAttributes ivar.

This is a good place to restate the fundamental difference between the old
and new (unified nodes) world.  In the new world, **exactly the same node
can appear in multiple places on the screen.**  In particular, **clones are
exactly the same node** (as are joined nodes, i.e., nodes in shared subtrees
of cloned nodes).

One "trigger" to the eureka was the realization that joined nodes **already
are** exactly the same node in the present world.  The eureka merely extends
this fact to cloned nodes.

So there **can be no distinction in the node** in the new world based on
where a node appears in the outline.  The node **doesn't know** where in the
outline it is.  Only positions "place" a node in the outline.

If you must make distinctions based on positions, you can do that with
secondary data structures.  You could even put those data structure in
v.unknownAttributes.  But Leo can't do that work for you: a node is the same
wherever it appears in the outline.

Edward

--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"leo-editor" group.
To post to this group, send email to leo-editor@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at 
http://groups.google.com/group/leo-editor?hl=en
-~----------~----~----~----~------~----~------~--~---

Reply via email to