On 19/04/13 21:35, Tommaso Cucinotta wrote:
> Improving the situation may go along the lines of:
> A) either creating within LyX a kind of visitor interface able to recursively
> match insets against other insets, so that we make a sort of graph matching
> between the LyX text (I mean, the internal LyX C++ data structures -- insets)
> as available in the text to search, versus as available within the main
> document being edited. Such a change seems to be quite invasive, and risks to
> touch each and every inset...
Anyway, I think in a proposal for going this way, we should really get
clarified how many classes would need to be touched by the functionality. For
example, is there a need for a new *::match() method in each and every inset ?
Can we take some short-cut, and, for example, compare by default insets based
on their text/latex export, then later refine the comparison with more
sophisticated means ? (e.g., to handle correctly the regexp part ?)
That would be helpful for getting an idea of the effort.
For example, in a sense, it might resemble or be comparable to the effort
needed for the Compare Document feature realized some time ago ? Vincent, any
"feeling" about this ?
Thanks,
T.
