We could use GHashTable as a Set to contain the documents internally afterwards. It doesn't make much sense to have a particular document instantiated more than once anyway and the only order we care about for documents here is maybe the order/time they were opened, which is better solved with a "open timestamp" or something, IMO.

The current index does not depend on opening order since it recycles the document structs, so there can be no dependency on the current order that makes sense.

What would you use as the key to the hash/set, and why? A simple list or array is all thats needed to hold pointers to open documents and iterate them.


My two cents

Matthew Brush

Devel mailing list