Zeitpunkt Nutzer Delta Tröts TNR Titel Version maxTL Di 09.07.2024 00:00:00 191.521 -19 9.133.920 47,7 Mastodon 4.3.0... 500 Mo 08.07.2024 00:00:04 191.540 +1 9.125.263 47,6 Mastodon 4.3.0... 500 So 07.07.2024 00:00:02 191.539 -34 9.116.590 47,6 Mastodon 4.3.0... 500 Sa 06.07.2024 00:00:02 191.573 -2 9.109.015 47,5 Mastodon 4.3.0... 500 Fr 05.07.2024 00:00:04 191.575 -2 9.101.575 47,5 Mastodon 4.3.0... 500 Do 04.07.2024 00:00:00 191.577 -2 9.092.066 47,5 Mastodon 4.3.0... 500 Mi 03.07.2024 00:00:00 191.579 -2 9.082.513 47,4 Mastodon 4.3.0... 500 Di 02.07.2024 00:00:03 191.581 -290 9.073.920 47,4 Mastodon 4.3.0... 500 Mo 01.07.2024 00:00:01 191.871 -2 9.065.005 47,2 Mastodon 4.3.0... 500 So 30.06.2024 00:00:04 191.873 0 9.057.767 47,2 Mastodon 4.3.0... 500
Arav K. (@bal4e) · 06/2023 · Tröts: 98 · Folger: 7
Di 09.07.2024 15:41
I just realized that you can use the BLSI algorithm in more convoluted situations. In my case, I have two bit-masks A and B, where B is a subset of A (A & B = B). 'A' contains sequences of bits, and I want to find the least-significant bit set in B _within every sequence in A_. Apparently, all I needed was ((A & ~(A << 1)) - B) & B. (A & ~(A << 1)) is the _ends_ of A (the bits immediately past each sequence of set bits), a replacement for 2^N.
[Öffentlich] Antw.: 0 Wtrl.: 0 Fav.: 0