I also think the best option would be to implement a custom "visit" of
the insets graph,
in such a way that, at least for each inset, I can trace the portion of
text that belongs
to it. But if this would imply changing each and every insert, then it
would be impossible
to achieve.
T.
Stefan Schimanski ha scritto:
Am 21.11.2008 um 19:49 schrieb Tommaso Cucinotta:
I think I can easily modify it so as to realise a hierarchically
sequential search
(not a real binary search). Instead of advancing one position,
exporting from
the current position to the end of paragraph, then searching for a
matching segment
*at the start*, I would try to advance one paragraph each time,
exporting the
entire paragraph, searching for any match *inside*, then, if a match
is found,
proceed recursively advancing one position at a time searching for
the exact
position that has the match at beginning.
Sounds reasonable.
Just another idea: you could insert markers into the latex output
"somehow" to know which latex part belongs to which inset. Then maybe
one latex output might be enough.
Stefan
I'll see if I can play a little bit tonight with the idea.
T.
Abdelrazak Younes ha scritto:
Yes that too ;-)
That's also why the binary search is the most practical choice...
Abdel.
