[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-devel
Subject:    Re: Question about QVector and QArray
From:       Dirk Mueller <mueller () kde ! org>
Date:       2001-07-24 8:47:35
[Download RAW message or body]

On Die, 24 Jul 2001, Guillaume Laurent wrote:

> In which case you get slightly slower access but much larger memory 
> consumption. Containers can be summed up like this :

Well, binary tree nodes shouldn't be significantly bigger than a node of a 
double-linked list (you can implement it 2*sizeof(void*)+2*1Bit). however 
thats just a worst case (performance wise) implementation. 


Dirk
 
>> Visit http://master.kde.org/mailman/listinfo/kde-devel#unsub to unsubscribe <<

[prev in list] [next in list] [prev in thread] [next in thread]