[prev in list] [next in list] [prev in thread] [next in thread]
List: kde-core-devel
Subject: Re: KConfig sucks :-)
From: Dirk Mueller <mueller () kde ! org>
Date: 2001-08-30 7:02:40
[Download RAW message or body]
On Mit, 29 Aug 2001, Waldo Bastian wrote:
> well, which means that effectively our QMap becomes a linked list and we get
> O(N) behaviour instead of O(log N).
>
euhm, I cannot follow you. reading N entries in a tree is O(N*log N),
independent in either which way they were sorted initially. Reading them in
a linked list is O(N) (plus if you need the sorting O(N*log N)). So a QMap
is actually the optimal choice (which is no surprise, because balanced
binary tree's are optimized for fast insertion/lookup).
> There must be room for improvement there.
How did you notice that its slow ?
Dirk
[prev in list] [next in list] [prev in thread] [next in thread]
Configure |
About |
News |
Add a list |
Sponsored by KoreLogic