This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: Performance of the default Node Allocator.
- From: Loren James Rittle <rittle at latour dot rsch dot comm dot mot dot com>
- To: libstdc++ at gcc dot gnu dot org
- Date: Tue, 13 Jan 2004 22:57:08 -0600 (CST)
- Subject: Re: Performance of the default Node Allocator.
- Reply-to: rittle at labs dot mot dot com
> Time Taken to Insert: 0.27 Seconds.
> Size is: 550000
> Time Taken to Sort: 2.19 Seconds.
> Size is: 266020
[...]
> 2). The Bitmapped Allocator.
[...]
> Time Taken to Insert: 0.11 Seconds.
> Size is: 550000
> Time Taken to Sort: 1.14 Seconds.
> Size is: 266020
OK, I see the win. I remember the issue well from last discussion.
[Discussion on how to contribute, started off-list.]
> BTW, is anyone else facing CVS problems, am I the only person?
Sorry, don't know about this.
> And one more thing. What is the equivalent of the bsf instruction on
> other architectures.
BSF, bit-set-first? BSF, branch-on-set-flag?
Regards,
Loren