isContiguousBitset()

bool fl::can_match_detail::isContiguousBitset ( const PinBitset & b )

inline

Definition at line 121 of file can_match.cpp.hpp.

                                                                {
    fl::u32 lo = 0u;
    fl::u32 hi = 0u;
    bool found_lo = false;
    for (fl::u32 i = 0; i < kPinSetCapacity; ++i) {
        if (b.test(i)) {
            if (!found_lo) {
                lo = i;
                found_lo = true;
            }
            hi = i;
        }
    }
    if (!found_lo) {
        return true;
    }
    return b.count() == (hi - lo + 1u);
}

References fl::FL_NO_EXCEPT, and fl::kPinSetCapacity.

Referenced by checkOneGroup().

Here is the caller graph for this function: