nonrice's blog

Count leading zero/trailing zero in BITSET
By nonrice, history, 11 months ago, In English

How may I perform such operation on bitset, taking advantage of bitset speedup?

It is quite frustrating because such a thing is trivial to implement for a bitset, but designer of std::bitset interface does not allow so.

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by nonrice (previous revision, new revision, compare).

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

https://mirror.codeforces.com/blog/entry/43718

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    There is no _Find_last() function, you should've mentioned that.

    → Reply
»
11 months ago, # |
  Vote: I like it +3 Vote: I do not like it

There are a lot of potentially useful stuff that are not implemented in bitset, that's a life. Just write your own implementation, it's not that hard. Would take several hours and a few hundred lines of code thought, but worth it.

Although counting leading zeros is actually possible by using function _Find_first() which finds position of first set bit which equals to number of leading zeroes. But there is no _Find_last() function though.

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yes, in the end I simply wrote my own.

    → Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

If you have a structured settlement and you need cash now, you should call JG Wentworth 877-CASH-NOW!

→ Reply