Additional method in wtf/Bitmap.h that locates (the start index of) a run of N zeros in the bitmap. This will help me complete Bug 51128 without rolling my own bit map implementation.
Created attachment 82089 [details] Patch for view Almost brute force search through the bit array to find a run of zero bit. (The return type of int64_t is a bit awkward, but I wanted to return a -1 in case of "not found" while also be able to represent 2^32)
Comment on attachment 82089 [details] Patch for view We don’t normally take patches that add in functions that aren’t used. For one ting, such functions can’t be tested.
OK, I will make it part of Bug 51128. Thanks.