This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: [patch[ Add explanations to sbitmap, bitmap, and sparseset


On Mon, Jul 30, 2012 at 5:14 PM, Richard Guenther
<richard.guenther@gmail.com> wrote:
> On Mon, Jul 30, 2012 at 5:05 PM, Steven Bosscher <stevenb.gcc@gmail.com> wrote:
>> On Mon, Jul 30, 2012 at 4:53 PM, Richard Guenther
>> <richard.guenther@gmail.com> wrote:
>>> No, but less space efficient and of comparable speed as sbitmap which
>>> is also O(1).
>>
>> But iterating an sbitmap has worse complexity than sparseset.
>
> Which is why I mentioned the common idiom of only random set and query
> operations.  The docs seem to suggest sparseset is appropriate there.

And even if we add iterating a combination of an sbitmap plus a VEC of elements
is cheaper if you don't remove elements from the set.

Richard.

> Richard.
>
>> Ciao!
>> Steven


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]