PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of
Brian Makin
Sent: Friday, October 14, 2005 1:27 PM
To: gcc@gcc.gnu.org
Subject: bitmaps in gcc
In reference to this on the wiki.
Bitmaps, also called sparse bit sets, are implemented using a linked
list with a cache. This is probably not the most time-effi
On Fri, Oct 14, 2005 at 11:27:15AM -0700, Brian Makin wrote:
> Can anyone give me some background on the use of
> bitmaps in gcc?
There's pleanty of material in the list archives. This is not
the first time that this topic has come up.
r~
Brian Makin <[EMAIL PROTECTED]> writes:
> Bitmaps, also called sparse bit sets, are implemented
> using a linked list with a cache. This is probably not
> the most time-efficient representation, and it is not
> unusual for bitmap functions to show up high on the
> execution profile. Bitmaps are us
nyone give me some background on the use of
bitmaps in gcc?
Are they assumed to be sparse?
How critical is the memory consumption of bitsets?
What operations are the most speed critical?
Would it be desirable to merge bitmap and sbitmap into
one datastructure?
Anyone have good ideas for improve
