Re: bitpack search in bitsets

2020-11-19 Thread Akim Demaille
Hi Bruno, > Le 18 nov. 2020 à 10:53, Bruno Haible a écrit : > >> Conversely: couldn't ssfmalloc sit on top of bitset? > > Well, in ssfmalloc it is important to use the available space well. When > I use a bitset of 256 bits in order to describe which of the 16-byte blocks > of a 4096-bytes page

Re: bitpack search in bitsets

2020-11-18 Thread Bruno Haible
Hi Akim, > That doesn't ring any bell. I don't remember I saw any feature in bitset > that depends on consecutive set bits, and a quick search did not find > anything. OK. > Conversely: couldn't ssfmalloc sit on top of bitset? Well, in ssfmalloc it is important to use the available space well.

Re: bitpack search in bitsets

2020-11-17 Thread Akim Demaille
Bruno, > Le 17 nov. 2020 à 22:50, Bruno Haible a écrit : > > Hi Akim, > > In gnulib/lib/ssfmalloc-bitmap.h there is a function > > /* Returns the smallest index k >= 0 for which the bit packet of c consecutive > bits (1 <= c <= 32) is all set in the bitmap consisting of num_words words. >