[PATCH 6/6] bitset: exercise the stats too

* tests/test-bitset.c: Display the stats at the end of the test. * lib/bitset/stats.c (bitset_log_histogram_print): When diplaying the last bin, display "256-..." rather that "256-511", since the last bin does count item greater than or equal to 256. --- lib/bitset/stats.c | 8 +++- tests/tes

[PATCH 6/6] bitset: tests: exercise the stats too

* tests/test-bitset.c: Display the stats at the end of the test. * lib/bitset/stats.c (bitset_log_histogram_print): When diplaying the last bin, display "256-..." rather that "256-511", since the last bin does count item greater than or equal to 256. --- ChangeLog | 9 + lib/bits

[PATCH 5/6] bitset: tests: try harder to break it

bitset_list (used in bitset_first, bitset_next, bitset_count, BITSET_FOR_EACH, etc.) uses a cache of size BITSET_LIST_SIZE (1024). None of our tests current try bitsets bigger than this. * tests/test-bitset.c (compare): Be ready to use bitsets larger than BITSET_LIST_SIZE. (main): Likewise. While

[PATCH 4/6] bitset: use ffs where possible in the vector implementation

* lib/bitset/vector.c (vbitset_list): Use BITSET_FOR_EACH_BIT. --- ChangeLog | 5 lib/bitset/vector.c | 57 + 2 files changed, 27 insertions(+), 35 deletions(-) diff --git a/ChangeLog b/ChangeLog index 951b82b04..2bc68b9dc 100644 --- a/C

[PATCH 2/6] bitset: check empty and full bitsets

* tests/test-bitset.c (check_zero, check_ones): New. (check_attributes): Use them. --- ChangeLog | 6 + tests/test-bitset.c | 56 + 2 files changed, 62 insertions(+) diff --git a/ChangeLog b/ChangeLog index 88ae15003..5badf0c41 100644 ---

[PATCH 3/6] bitset: use ffs where possible in the table implementation

* lib/bitset/table.c (tbitset_list): Use BITSET_FOR_EACH_BIT. --- ChangeLog | 5 +++ lib/bitset/table.c | 104 - 2 files changed, 31 insertions(+), 78 deletions(-) diff --git a/ChangeLog b/ChangeLog index 5badf0c41..951b82b04 100644 --- a/Cha

[PATCH 0/6] bitset: more conversions to ffs

With this, I believe I have used ffs everywhere possible. When gnulib have fls* support, we will be able do the same for bitset_list_reverse, but I'm not sure it's a frequent need. FWIW, I have run successfully the test suite of Bison on every single bitset implementation. Cheers! Akim Demaille

[PATCH 1/6] bitset: be sure to always return a value

* lib/bitset/array.c (abitset_small_list): Always update *next and return a value. --- ChangeLog | 6 ++ lib/bitset/array.c | 10 -- 2 files changed, 10 insertions(+), 6 deletions(-) diff --git a/ChangeLog b/ChangeLog index d50f4d1a2..88ae15003 100644 --- a/ChangeLog +++ b/C

Re: [PATCH] vcs-to-changelog: Expect spaces in file names

On 11/18/20 8:21 AM, Siddhesh Poyarekar wrote: Reported by Thierry Bothorel in , * build-aux/vcstocl/vcs_git.py (exec_git_cmd): Do not transform tabs to spaces. (list_changes): Use tabs to identify file

[PATCH] bootstrap: add hooks for user-defined command-line options

This patch adds a couple of hooks to the `bootstrap' script that allows the users to handle their own command line options in their bootstrap.conf files. Usage example: bootstrap_option_hook () { case $1 in --jitter-srcdir) JITTER_SRCDIR=${$1#--jitter-srcdir=}; return 0;; esac return

Re: bitpack search in bitsets

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.