Christer Palm schrieb:
Christof Petig wrote:What I did was:- sorted insertion of 10000 lines into a TreeStore (actually it becomes a subtree whenever columns match)the sort criterion was a custom class defining operator< key and additional data were referenced by smart pointers (handles)Does sorted insertion mean that you are inserting into a sorted TreeStore? That's a killer... I use the following code to avoid the overhead (though in this case, I'm using a ListStore):
It's not a sorting TreeStore but a sorted (I need to determine the right position myself (by binary search), then insert the node).
There's no way to avoid this if you want to transform a list into a tree by looking at similar columns and grouping them into a subtree.
Christof