Why does there has no complexities for bitset?

[ksyx]

A question.

[JLBorges]

It is a fixed size collection of bits (size is known at compile time); the library/compiler can (and is expected to) optimise it heavily. Therefore, the time complexity as a function of the logical number of bits in the bitset depends on the available processor instructions and the register size of the hardware platform (the standard can't really provide a complexity specification/guarantee based on the number of bits in the bitset; it's too implementation dependant)

For instance, x86_64, g++ 7.3, -O3 -march=native :

#include <bitset>

///////////////  same complexity for all of these : ///////////////
/////////////// one xor + one popcnt ///////////////////////////
std::size_t foo24( std::bitset<24> bs ) { return bs.count() ; }

std::size_t foo32( std::bitset<32> bs ) { return bs.count() ; }

std::size_t foo48( std::bitset<48> bs ) { return bs.count() ; }

std::size_t foo64( std::bitset<64> bs ) { return bs.count() ; }


///////////////  same complexity for these : ///////////////
/////////////// one xor + two popcnt + one add ///////////////////////////
std::size_t foo96( std::bitset<96> bs ) { return bs.count() ; }

std::size_t foo128( std::bitset<128> bs ) { return bs.count() ; }


///////////////  same complexity for these : ///////////////
/////////////// three xor + three popcnt + two add ///////////////////////////
std::size_t foo160( std::bitset<160> bs ) { return bs.count() ; }

std::size_t foo192( std::bitset<192> bs ) { return bs.count() ; }


// etc 

https://godbolt.org/g/XTekau

[ksyx]

Thanks for replying. I've learnt a lot from it.