Re: New list/tree model questions

[Havoc Pennington <hp redhat com>]

Maxim Koshelev <mdem chat ru> writes:
> data. And due internal hash of GtkCList these routines works fast.

There is no internal hash in the CList; the CList functions work in
O(n) time. They are not especially fast.

> I need to know "how fast new data model?"

It's a linked list just like CList, so still O(n), though the constant
multiplier is higher.

You can write your own custom model, too. It's not that hard.

Havoc