Alfredo Braunstein wrote:

> Angus Leeming wrote:
> 
>> It's pseudo-rubbish in that the lyx data structure is a tree
>> in-concept only. It's actually a std::list<Paragraph> where each
>> Paragraph contains a std::vector<char> and an InsetList. Insets are
>> identified in the std::vector<char> by chars with value
>> 'META_INSET' and a Buffer::inset_iterator class enables one to go
>> from a (ParagraphList::iterator, lyx::pos_type) pair to the inset
>> of interest.
> 
> The inset lists are actually located in each paragraph (not that it
> matters, but...).

I know. I even described it as such ;-)

>> At least that is my understanding of things.
>> 
>> Nonetheless, your basic idea is a good one.
> 
> But some insets recursively contain a std::list<Paragraph> etc. So
> it *is* a tree.

Doh! I'll get back under my stone.

-- 
Angus

Reply via email to