On Thu, Jun 11, 2009 at 2:11 PM, Ville M. Vainio <[email protected]> wrote:
> > On Wed, Jun 10, 2009 at 10:31 PM, Ville M. Vainio<[email protected]> > wrote: > > > You'll add that functionality to archivedPosition and > > resolveArchivedPosition ;-) > > > > I'd do it myself, but I'm probably done with coding today (it's late & > > slept only ~ 4 hours last night, that's why my mails are gibberish > > today). Or, I can add it tomorrow if you are busy w/ other defects. > > I worked on this a bit, then realized how futile this halfway measure > is. Let's do a "proper" fix after 4.6 (which breaks compatibility). That's fine with me. 4.7 is the place for big changes. > > - The problem: find position for a node, while storing gnx's. The > problem is that because of clones, same tnode can be reached from > multiple paths (and therefore there are multiple positions for it). > > Solution 3: HASHES! > > - store gnx5 + hash of (gnx1 + gnx2 + gnx3 + gnx4). > - Find all nodes with gnx5 > - check all paths leading to it, pick one where hash matches. Looks good. With our new hammer, everything is looking like a nail :-) And that's good, imo. Edward --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "leo-editor" group. To post to this group, send email to [email protected] 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 -~----------~----~----~----~------~----~------~--~---
